Abstract
Let N*q(m) be the minimal positive integer N, for which there exists a splitting of the set [0, N - 1] into q subsets, S 0, S1, ..., Sq-1, whose first m moments are equal. Similarly, let m*q(N) be the maximal positive integer m, such that there exists a splitting of [0, N - 1] into q subsets whose first m moments are equal. For q = 2, these functions were investigated by several authors, and the values of N*2(m) and m*3(N) have been found for m ≤ 8 and N ≤ 167, respectively. In this paper, we deal with the problem for any prime q. We demonstrate our methods by finding m*3(N) for any N < 90 and N*3 (m) for m ≤ 6.
| Original language | English |
|---|---|
| Pages (from-to) | 1695-1712 |
| Number of pages | 18 |
| Journal | Mathematics of Computation |
| Volume | 77 |
| Issue number | 263 |
| DOIs | |
| State | Published - 1 Jul 2008 |
Keywords
- Antenna array
- Littlewood polynomials
- Spectral-null code
ASJC Scopus subject areas
- Algebra and Number Theory
- Computational Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Equal moments division of a set'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver