WorksMathematics
Nonnegative weak tilings and the Coven-Meyerowitz condition (T2)
Abstract
We develop a general method, in finite cyclic groups, for constructing nonnegative rational functions , normalized by , that satisfy the Coven-Meyerowitz condition but fail , such that is a weak complement for a set tile . Motivated by the unsupported-divisor questions in arXiv:2507.11672, we show that if a set tile admits an unsupported divisor, then a suitable dilation of admits such a rational weak complement . Using this method, we construct an explicit example in the group . The weak complements in our explicit perturbative constructions are not positive definite because of restrictions on the Fourier support of the perturbations. Thus these constructions do not resolve the proposed extension of the Coven-Meyerowitz conditions to positive-definite weak tilings (arXiv:2411.03854, Problem 1.2).
Introduction
By D. Newman’s periodicity theorem [15], tilings of the integers by a finite set can be studied through factorizations , in which each residue has a unique representation as . For , choose representatives in and write for its mask polynomial. The tiling identity becomes
E. Coven and A. Meyerowitz [1] introduced two conditions on the cyclotomic divisors of mask polynomials. Condition determines the value at from the prime-power divisors; requires products of prime-power orders associated with distinct primes to occur as well. Together they imply tiling. Every integer tile satisfies , and is also necessary when its cardinality has at most two distinct prime divisors (see [1 Theorems A, B1, and B2]). Precise definitions of these properties are given in § 2 of this work.
Remark 1.1. Recent preprints by J. Prajapati [16] and C. Li et al. [13] claim the unrestricted necessity of for integer tiles, which, if correct, would resolve the Coven–Meyerowitz conjecture for integer tilings. Our work does not use these proposed solutions or their methods.
Our starting point is the study of unsupported cyclotomic divisors in G. Kiss, I. Łaba, C. Marshall, and G. Somlai [5 Section 1.3]. They construct tiles satisfying and with unsupported divisors [5 Theorem 1.11]. We use such mixed zeros to construct rational weak complements failing .
Date: October 20, 2026.
2020 Mathematics Subject Classification. Primary 05B45, 20K01, 11C08; Secondary 11B75, 42A99.
Key words and phrases. integer tilings, weak tilings, functional tilings, cyclotomic polynomials, Coven–Meyerowitz conditions.
Following [9, 12], a normalized nonnegative weak complement of , with , is a function satisfying
Equivalently, , so weakly tiles its complement. We keep the set factor equal to a tile and allow rational weights in its complement, leading to the following question.
Question 1.2. Suppose that is a tile satisfying and . Must every normalized nonnegative rational weak complement of that satisfies also satisfy ?
The answer is negative, as we shall see in the sequel. However, the explicit weak complements in our construction are not positive definite; the distinction from positive-definite (PD) weak tilings is discussed in § 7.
An explicit counterexample
We begin with an example of period 180. The polynomial appearing below is given explicitly in § 5.
Theorem 1.3. The set
tiles and satisfies ordinary and . There is an ordinary polynomial with nonnegative coefficients and such that
while satisfies ordinary but fails . Its cyclic coefficient function , which satisfies
is not positive definite.
The set represents each residue class modulo five exactly once, so that the subgroup is a tiling complement of cardinality 36. To obtain , we use a different complement, formed from translated layers, and verify the required cyclotomic divisibility properties directly in § 5. We do not claim that 180 is the least possible period.
The example comes from the five-point set , since and . This is an instance of the recombination construction in [5 Example 8.1], with primes 2, 3, 5. H. Tan and Y. Zhang [17] also use this set in their unsupported-divisor constructions.
A construction without new primes
A mixed order is an integer with at least two distinct prime divisors. If , its constituent prime-power orders are the . The following theorem gives a general construction from a mixed cyclotomic divisor whose constituent prime-power divisors are absent.
Theorem 1.4. Suppose that and that is a mixed order. Assume that , but that for every constituent prime-power order of . Then there exist an integer and a polynomial with nonnegative coefficients and such that
and satisfies ordinary but fails . The dilation can be chosen to be or a power of a prime dividing .
A more thorough description of the polynomial and the dilated set tile with mask polynomial is given in Theorem 4.2.
The tiles constructed by G. Kiss, I. Łaba, C. Marshall, and G. Somlai [5 Theorem 10.1] satisfy the hypotheses of Theorem 1.4, so their dilations admit the weak complements constructed here. The set is again a set tile. Furthermore, satisfies ordinary if and only if does, as shown in Theorem 4.2; see also [1 Lemma 1.4]. Thus dilation preserves the cardinality, tiling property, and Coven–Meyerowitz conditions of the set factor.
For the main step of the construction, we choose and form a set complement of by placing translated copies of in the residue classes modulo . Its normalized autocorrelation, , is a weak complement of . We then add a signed function whose Fourier support consists of a single mixed order. This function, which we call a pure-order cuboid filter, is defined in Section 3. The translations are chosen so that the autocorrelation has enough positive weight to absorb the negative coefficients of the filter, while the perturbation does not change the value at the origin. The proof is given in Section 4. The example in Theorem 1.3 uses the same idea with the composite dilation and fewer layers than the general bound would give.
Our use of a larger ambient group was inspired by the stacking construction of R. Greenfeld and T. Tao [3 Theorem 3.1]. As part of their disproof of the periodic tiling conjecture, they use additional layers to encode a system of tiling equations as a single equation in a larger group. Here the additional residue layers allow us to place translated complements so that their autocorrelation absorbs the signed perturbation while preserving normalization.
The weak complement construction can fail without dilations
One may ask whether the dilation in Theorem 1.4 can be avoided by allowing a larger ambient period while leaving the set tile fixed. The following result shows that this is not possible in general.
Theorem 1.5. Let
This thirty-element tile satisfies ordinary and and has unsupported divisor .
For every , suppose that has nonnegative coefficients, satisfies and ordinary , and obeys
Then satisfies ordinary .
Here unsupported divisor includes the cardinality condition in Definition 2.6; Theorem 1.4 does not require that additional condition. Theorem 1.5 is proved as Proposition 6.2.
We also consider what dilation can accomplish when the complement is required to be a set. Proposition 6.3 shows that, for every tile and every , the set has a set complement failing if and only if has one. Thus dilation cannot produce a new failure at the level of set tilings.
There is a further restriction on the ambient period. If has at most two distinct prime divisors and is a tile, then every rational polynomial weak complement of satisfying ordinary also satisfies ordinary (Proposition 6.4). In fact, this conclusion requires neither nonnegativity nor normalization of the complement.
Finally, we explain why the perturbation method does not give positive-definite examples. In the nontrivial constructions, the perturbation vanishes at the origin and its Fourier transform is supported on the Fourier zeros of the initial PD complement. Under these assumptions, Proposition 7.1 shows that every nonzero perturbation destroys positive definiteness. For the five-point set underlying Theorem 1.3, we prove a stronger statement: for every , a normalized nonnegative rational PD complement of satisfying ordinary must also satisfy ordinary (Corollary 7.2).
Organization
Section 2 gives the Fourier and cyclotomic conventions. Section 3 develops the cuboid filter, and Sections 4 and 5 prove Theorems 1.4 and 1.3. Section 6 proves Theorem 1.5 and the additional boundary results. Section 7 explains the PD obstruction. Appendix A presents an alternative construction using an auxiliary prime coprime to the original period.
Mask polynomials, Fourier transforms, and tiling conditions
Cyclic coefficient functions and convolution
We will use both polynomials and their coefficient functions on finite cyclic groups, extending the multiset notation of [5 Section 2.1] to rational weights. To fix the correspondence, write for the coefficient of in a polynomial . For and , define its cyclic coefficient function by
Thus coefficients whose exponents agree modulo the period are added together, and the canonical representative of modulo is . We call such a weight function a rational multiset on , and denote the collection by , using when all weights are nonnegative. Sets correspond to weights in .
Conversely, for a function , its canonical mask polynomial is given by the formula
Thus and ; polynomial evaluation at one is distinct from the value of the coefficient function.
For functions , write
Here the overline denotes complex conjugation. With these conventions, multiplication of mask polynomials corresponds to convolution over the corresponding cyclic group, while reduction modulo preserves mass: .
Lemma 2.1. If is nonempty and satisfies , then is the indicator function of a set.
Proof. Fix . Then, for every , one must have
Hence, for every , as claimed. □
The lemma explains why passing from sets to nonnegative integer weights does not enlarge the class of complements at tiling level one. For a rational weak complement, however, clearing a denominator produces a multiple tiling: if is integer-valued, then .
Fourier and cyclotomic criteria
The tiling congruence can be tested at roots of unity, or equivalently on the Fourier side. We use the unnormalized Fourier transform:
The character indexed by has order , with the trivial character having order one. Character orthogonality gives the inversion formula and the identity . To express Fourier vanishing in terms of polynomial divisibility, recall that for the cyclotomic polynomial is
It is monic and irreducible over , and .
Proposition 2.2 (cf. E. Coven and A. Meyerowitz, [1 Lemma 1.3]). For and a rational-valued function with canonical mask polynomial , the following are equivalent:
(i) ;
(ii) ;
(iii) and, for every with , at least one of and is divisible by .
Proof. Comparing cyclic coefficients gives the equivalence of (i) and (ii). On the Fourier side, the constant function has value at the trivial character and zero elsewhere. The convolution identity is therefore equivalent to the mass identity together with at every nontrivial character. Since the mask polynomials have rational coefficients, vanishing at one primitive th root is equivalent to divisibility by . This proves (iii). □
The two conventions for (T1) and (T2)
For rational mask polynomials it is useful to distinguish the conditions on an ordinary polynomial from the conditions seen at a fixed cyclic period. The latter involve only orders dividing that period.
Definition 2.3 (E. Coven and A. Meyerowitz [1]). For a nonzero polynomial , let
The ordinary Coven–Meyerowitz conditions are:
(T1) ;
(T2) whenever and are powers of distinct primes, .
For a function on , we call the versions restricted to the ambient period the period-relative conditions. They use in the same formulas instead of . These depend only on the cyclic coefficient function, not on its ordinary polynomial representative.
Recall that . We write when and . For a prime and a positive integer , the -adic valuation is the unique integer such that . The following explains how prime-power divisors of the tiling period are distributed among the mask polynomials of the sets.
Lemma 2.4. If , then every prime-power cyclotomic divisor of either mask polynomial has order dividing . For each prime power , , the factor divides exactly one mask polynomial. Both mask polynomials satisfy ordinary (T1).
Proof. The counting argument rests on integrality. For a nonzero with , monicity and Gauss’s lemma imply that the product of any distinct cyclotomic divisors divides in . Evaluating at one shows that the number of prime-power factors based at is at most .
Now let . Proposition 2.2 requires each of the factors to divide at least one of the two masks. On the other hand, their cardinalities allow only such factors in total. Thus every required factor occurs exactly once, and there is no room for any further -power factor. A prime not dividing cannot occur in either mask polynomial for the same reason. Evaluating the assigned factors at one gives (T1). □
Remark 2.5. The restriction to integer mask polynomials is essential to this counting argument, as a small example shows. The tile has the normalized weak complement . Its mass is 3, but it vanishes at orders 2 and 3, whose cyclotomic values at one multiply to 6. Hence fails (T1), and its nonvanishing at order 6 also gives a failure of (T2). Without the hypothesis (T1) on , Question 1.2 would therefore have a trivial negative answer. The constructions below will retain this hypothesis.
We use the definition of an unsupported divisor from [5 Definition 1.5].
Definition 2.6. Let be a finite nonempty set and let , with and distinct primes . Then is an unsupported divisor of if , every divides , and for every . The cardinality condition is part of this definition. For the construction below, it will be enough to have the mixed zero and the absence of its constituent prime-power zeros.
Normalized autocorrelations and positive definiteness
The construction will start from the normalized autocorrelation of a set complement. We recall why this gives a weak complement and how its Fourier transform relates to that of the set.
Definition 2.7. A real-valued function is positive definite (PD) if for every . A PD weak complement satisfies this additional condition as well as (1.2). This is the finite-group notion of weak PD tiling in [8 Definition 1.1].
Lemma 2.8 (G. Kiss, D. Matolcsi, M. Matolcsi, and G. Somlai, [8 Lemma 1.2]). If , the autocorrelation function
is a normalized PD weak complement of with mass . Moreover,
As the proof is direct and short, we include it for completeness.
Proof. Each coefficient is a difference count divided by the normalizing factor, so it is nonnegative. Exactly ordered pairs of points of have difference zero, giving the normalization. To check the weak-tiling identity, associativity gives . Finally, the identity proves positive definiteness, preserves all Fourier zeros, and gives the mass. □
A real PD function is even: its Fourier transform is real, so Fourier inversion and conjugation give . Later we will choose perturbations that are not invariant under negation, and this observation will show that the resulting weak complements are not PD.
A pure-order cuboid filter
We use the cuboid formalism introduced in [11 Section 5] and reviewed in [5 Section 2.3]. The construction below develops the cuboid perturbation proposed in [5 Section 10.2]: we construct a signed mask that changes the Fourier values at a chosen order while leaving every other Fourier value at the ambient period unchanged. Let and write
where the are distinct primes. Define the signed cuboid on by its canonical mask
Its vertices carry alternating signs. The pure-order cuboid filter on is the periodic extension
This polynomial has degree less than ; its coefficient function is .
Lemma 3.1. The filter has the following properties:
(1) , , and ;
(2) it has exactly positive and the same number of negative coefficients;
(3) its Fourier support consists exactly of the characters of order ;
(4) if , then .
Proof. To verify the coefficient claims, first consider the subset sums , . These are distinct modulo : reducing an equality modulo eliminates all terms except the th, and the -adic valuation of is , so the equality determines . It follows that the canonical mask polynomial has nonzero coefficients, each equal to or , with equally many of each sign and with coefficient at the origin.
Repeating the cuboid does not change these coefficients. Indeed, the shifted copies in (3) occupy the disjoint exponent intervals , so their supports do not overlap. Each coefficient therefore occurs in a separate block, proving (1) and (2).
For the Fourier support, let have order . The geometric sum vanishes unless , in which case it equals . If is proper, some satisfies , so the factor vanishes. At order , none of these factors vanishes. This proves (3), including vanishing at the trivial character. If , the Fourier transform of vanishes on the support of , so the convolution theorem gives (4). □
Corollary 3.2. Let and . Adding leaves the values of unchanged at every th root whose order differs from . If , then . When is mixed, this change preserves every prime-power Fourier zero and nonzero at the ambient period .
Proof. By Lemma 3.1(3), the filter vanishes at every th root except those of order , where it is nonzero. The two assertions follow by evaluating the perturbed polynomial at these roots. □
This gives a way to remove a mixed cyclotomic zero while retaining the data entering the period-relative condition . To use it for weak complements, we must also preserve nonnegativity and normalization. Thus the negative filter sites need enough positive weight, and the perturbation must leave the origin unchanged. We arrange these two requirements by placing translated complements in separate layers.
A cyclic construction without new primes
We now use the filter to construct a normalized nonnegative weak complement satisfying and failing , starting from a mixed zero of a set tile whose constituent prime-power zeros are absent. The construction allows a dilation by a power of a prime already dividing the mixed order, so no new prime is introduced into the period or the coefficient denominators.
The use of the residue layers of is what permits and to share prime factors. For comparison, the construction in Appendix A uses a direct product , with a new prime coprime to .
Removing off-period factors using an old prime
Before constructing the weak complement, we show how to remove off-period cyclotomic factors without changing the cyclic coefficient function. We begin with the following coefficient reweighting result over .
Lemma 4.1. Let have nonnegative coefficients and degree less than . Suppose that for a positive integer , and choose an integer with and . For any odd prime , the polynomial
has nonnegative coefficients, satisfies and , and represents the same cyclic coefficient function on . Every cyclotomic divisor of has order dividing .
Proof. The only coefficient being decreased is the one at . Since is a positive integer, we have , so subtracting preserves nonnegativity. The new coefficient at is positive, and the two exponents agree modulo . Consequently the cyclic function is unchanged. As is nonzero, the transfer also preserves the constant coefficient, and its two terms cancel at one.
To locate the cyclotomic divisors, we work modulo the chosen odd prime. The reduction identities used below also appear in T. Fallon, G. Kiss, A. Mayeli, and G. Somlai [2 Lemma 2.3] and R. Malikiosis [14 proof of Theorem 6.1]; we include the details to keep track of root multiplicities. Assume that . Since is a monic polynomial, Gauss’s lemma implies that divides the integer polynomial
in . For an integer polynomial , write for its coefficientwise reduction modulo . Reducing the divisibility gives
Since , the polynomials and are coprime, so in . Write
This separates the order of a root from its multiplicity in the chosen characteristic. Indeed, in characteristic we have , whose nonzero roots are the th roots of unity, each with multiplicity .
Since , the polynomial is separable (i.e., it has distinct roots in an algebraic closure). Its factorization into reduced cyclotomic polynomials shows that has precisely the primitive th roots, each with multiplicity one. For , the cyclotomic identity
and the Frobenius identity for give
Cancellation in therefore yields
The reduced cyclotomic polynomials also have nonzero roots. Comparing their orders with the roots allowed by the divisibility above forces . If , comparing their multiplicities gives
Because is odd, would make the left-hand side strictly larger than . Hence , so . □
The oddness of is needed only for the last multiplicity comparison.
The prime-preserving construction
We now give our main result. Given a set tile of period that admits an unsupported divisor with , one can construct a polynomial with nonnegative coefficients such that
where or for a prime and an integer . The polynomial satisfies the Coven–Meyerowitz condition but fails .
Theorem 4.2. Suppose that and that
Then there are an integer , which is either 1 or a power of a prime dividing , and a polynomial such that the following hold.
(1) The coefficients of are nonnegative, , and
(2) The polynomial satisfies the Coven–Meyerowitz condition but fails .
(3) If the coefficients are written in lowest terms as , with , then every prime divisor of divides .
(4) The dilated set is a set tile, has cardinality , and satisfies ordinary if and only if does.
Proof. Since , by Lemma 2.4, every divides . We prove (1)–(3) by considering whether the complement vanishes at the same mixed order as the tile.
Case 1: . Here the complement already has the required prime-power zeros and lacks their mixed zero. We need only arrange that its indicator is normalized. Choose and replace by the translate , so that and . For every , translation multiplies the mask polynomial value at a primitive th root by a nonzero monomial value. It therefore preserves vanishing at every such order. Both set complements have all their ordinary prime-power factors at orders dividing , by Lemma 2.4; hence their ordinary prime-power signatures agree. Every mixed order required by also divides , so translation preserves and its failure.
Set and let be the canonical mask polynomial of . Then has nonnegative integer coefficients, , and . It satisfies ordinary by allocation. All the constituent prime-power factors of divide , whereas , so fails at .
Case 2: . In this case both mask polynomials vanish at the mixed order. We will build a layered complement whose autocorrelation has enough positive weight at every negative filter site. Let be the filter of Lemma 3.1; its negative support has cardinality
List these positions as . We allow a consecutive pair of layers for each of these positions by choosing a prime and a power such that . Put and . Choose shifts in by
The layered set
has elements and complements . Indeed, its layers occupy distinct residue classes modulo . Subtracting and dividing by identifies the tiling in layer with . Equivalently,
Multiplication by gives , because is invariant under multiplication by in the quotient ring .
To keep the origin fixed, we place the filter in a nonzero residue layer of the autocorrelation. Define functions on by
The polynomial has degree less than , and its coefficient function is supported in the residue class mod . Explicitly, for . Since , substitution gives
Also and .
We now address the nonnegativity of the weight function . For each negative position and every , the two points
of have difference modulo . These are distinct ordered pairs, so
These are all the negative sites of , and consequently . Lemma 2.8 gives , , and . Since and , the same identities hold for :
We next check that the perturbation preserves the prime-power zeros while removing the mixed zero. For a root of unity of order dividing , the value is nonzero exactly when has order . If has order , then has order . Since is a power of a prime dividing , this order equals exactly when . Thus has pure Fourier order . As has at least two distinct prime factors, vanishes at every prime-power character. The prime-power Fourier zeros of are therefore exactly those of , hence of . Lemma 2.4 and prove period-relative .
At a primitive th root , the layered factorization of gives , since . The autocorrelation therefore also vanishes at this character. In contrast, , so does not vanish at order . To obtain the failure, we also need its constituent prime-power zeros. The constituent prime powers of are . Evaluating at each such order reduces to a nonzero evaluation of at order . Allocation of prime-power divisors puts all these prime-power factors in , and hence in . This then proves the failure.
It remains to pass from the cyclic function to an ordinary polynomial with the required conditions. Let be the canonical mask polynomial of . We have and , because . Since , some odd prime divides . Lemma 4.1, with and , gives the ordinary representative
By Lemma 4.1, has nonnegative coefficients, satisfies , and is congruent to modulo , proving (1). It has no off-period cyclotomic divisors. Thus period-relative becomes ordinary , while the cyclic normalization and failure remain unchanged. This proves (2) in Case 2. Every prime in the denominator divides the original period , verifying (3).
To prove (4), observe that for every , evaluation at prime-power roots gives
At order with , the value is , not zero; at larger orders, taking the th power reduces the root order by the factor . For products of powers of distinct primes, the same calculation applies to all constituent exponents simultaneously. The mixed orders required by for therefore correspond exactly to those required for , and evaluation at their primitive roots proves in both directions. The set has cardinality and is a tile: the complement is in Case 1 and in Case 2.
Remark 4.3. In any nontrivial-dilation branch where , is even whereas the cyclic coefficients of at and are respectively and , since . Thus , and is not positive definite.
The next remark explains how a set complement failing would yield a PD weak complement with the same failure. If the set factor also satisfies , this would give a counterexample to the positive-definite analogue of Question 1.2, and hence to the extension proposed in [6 Problem 1.2]. No such set complement is constructed here.
Remark 4.4. Case 1 begins with a set complement that already fails . If such a complement exists, its normalized autocorrelation is a PD weak complement with the same Fourier zeros and the same failure. Its mass is and its value at zero is 1, so it has a positive coefficient away from zero. Applying Lemma 4.1 with gives an ordinary representative without changing that cyclic PD function. Thus Case 1 yields a PD weak complement failing only if one already has a set complement failing . If also satisfies , this would answer the positive-definite analogue of Question 1.2 negatively.
A three-prime counterexample of period 180
We now prove Theorem 1.3 by giving the weak complement explicitly. We start from the five-point set , whose mask polynomial is , and follow the construction of the preceding section with mixed order . In this example, six translated layers suffice to keep the perturbed complement nonnegative. This gives the composite dilation , although Theorem 4.2 chooses a prime power and uses the larger bound . The resulting period is 180, with only three distinct prime divisors. The set realizes [5 Example 8.1] with primes 2, 3, 5, as noted in the introduction; we verify below all of its properties that we use.
For a positive integer , write . Define
Let be the canonical cyclic autocorrelation mask polynomial of :
Using , define the following ordinary polynomials:
The polynomials , , and all have degree less than 180.
Theorem 5.1. The set defined in (8) tiles and satisfies ordinary (T1) and (T2). The polynomial defined in (11) has degree 179, nonnegative rational coefficients, and , and it satisfies
Moreover,
Thus satisfies ordinary (T1) and fails (T2). Its cyclic coefficient function is not positive definite.
Proof. The base tiling and the lifted set complement. We first check that tiles. An explicit subgroup complement is
Indeed, the elements of represent the five residue classes modulo 5 exactly once, and hence . To construct the required weak complement, we use the autocorrelation of a different set complement , whose layers we choose as follows.
In take
The set represents each residue class modulo 5 exactly once, so . Direct multiplication gives
Choose the six shifts
and define, with all residues reduced modulo 180,
To see that complements , observe that its six layers lie in distinct residue classes modulo 6. In the class indexed by , subtracting and dividing by 6 reduces the required tiling identity to . Thus , with .
Modulo 30, the residues are . Consequently
Writing for , we obtain
For each ordered pair of representatives from , there are six ordered pairs from with any prescribed difference in the corresponding coset modulo 30. This proves (13) and shows that the first term of in (11) is the canonical mask polynomial of the normalized autocorrelation .
The signed perturbation and nonnegativity. On let
The cyclic coefficient function of repeats the vector five times, and its Fourier transform is supported exactly at characters of order 6. Indeed, vanishes at the 30th roots whose orders do not divide 6, while the remaining two factors vanish at orders 1, 2, and 3, but not at order 6. Since , it follows that
The polynomial (10) is exactly . Hence
The exponents occurring in lie in the residue class mod 6, and for . To check that the negative coefficients can be absorbed by the first term of , we count the corresponding differences in :
| 0 | 1 | 2 | 3 | 4 | |
| 1 | 1 | 1 | 1 | 2 |
The entries in the second row are all at least one, so every negative coefficient of is absorbed and has nonnegative coefficients. Since the constant coefficient of is zero and , we also have . Moreover, and , from which and follow. Finally, the set tiling gives , and (14) shows that the perturbation preserves this identity. This proves the required weak tiling.
The prime-power zeros and ordinary (T1). Multiplication by 6 permutes the residue classes modulo 5, so . Since , this is its only prime-power cyclotomic factor: a second such factor would force an additional prime factor in the integer value . This proves ordinary (T1) for , and (T2) has no nontrivial mixed requirement. The weak-tiling identity now forces
It remains to exclude any further prime-power divisors, including those whose orders do not divide 180. Since has integer coefficients and , a divisor must have . Furthermore, and , so that . Comparing this with the degree of leaves only the orders
The constant coefficients of the monic remainders at the nine unwanted orders are as follows:
The table can be checked by hand as follows. Put for and otherwise. For , the entry in the second row is
This follows by first reducing modulo and then using . Each sum is finite, and every entry of (15) is nonzero. Consequently , and the values of the corresponding cyclotomic polynomials at one have product . This proves ordinary (T1).
Failure of (T2) and positive definiteness. At a primitive 36th root, the geometric sum vanishes. Since
formula (10) gives
The remainder is nonzero and has degree less than , proving that . Since both and divide , this gives the failure of . Finally, , whereas . Thus the cyclic coefficient function of is not even, and hence is not positive definite. □
Remark 5.2. The weak complement belongs to the dilated set , not to itself. The next section shows that this is unavoidable in general: some tiles with an unsupported divisor have no such weak complement at any period.
What period enlargement does and does not preserve
The construction of Theorem 4.2 replaces by before constructing a weak complement. We now examine the role of this change in the set factor. First, we give a tile for which enlarging the ambient period, while keeping its mask polynomial fixed, can never produce a normalized nonnegative weak complement failing . We then show that dilation cannot create a set complement failing , and that the rational construction requires a period with at least three distinct prime divisors.
Allocation for a rational complement satisfying (T1)
We begin with the allocation of prime-power factors. For a rational complement, integrality no longer gives the counting argument used in Lemma 2.4. The condition supplies the missing constraint through the value of the complement at one.
Lemma 6.1. Let satisfy , and suppose that satisfies ordinary and
Then satisfies ordinary , and and form a disjoint partition of the prime-power orders dividing . No positivity assumption is needed.
Proof. We compare the prime-power factors forced into by the cyclic identity with those already present in . Put
The product of the distinct monic cyclotomic factors counted in has an integral quotient in . Evaluating at one gives , and in particular . On the other hand, each prime-power order dividing that is absent from must occur in . The values at one of these forced factors multiply to . Since the cyclic identity also determines , ordinary for gives
It follows that , so both inequalities must be equalities. The prime-power factors already counted in therefore exhaust its value at one, leaving no further prime-power factor. Equality for likewise excludes both a factor shared with and a factor whose order does not divide . This proves the asserted partition and for . □
An unchanged tile obstructed at every period
The fixed-tile question is motivated by the discussion in [5 Section 10.2]. To show why the set factor cannot in general be left unmodified (and, in our specific context, undilated), we use the period-180 example of H. Tan and Y. Zhang [17 Section 8].
This tile consists of six translates of the five-point set from § 5. Its nonnegative normalized complements satisfy a rigidity property that persists when the ambient period is enlarged.
Proposition 6.2. Let
The set tiles , satisfies ordinary and , and has unsupported divisor . Nevertheless, for every integer , every polynomial with nonnegative coefficients satisfying
and ordinary must also satisfy ordinary .
Proof. We first verify the tiling and cyclotomic data. The set represents each residue class modulo five exactly once, so for . Consequently . Direct multiplication gives
In particular, and . Every mixed product of prime powers in this signature divides 180 but not 30, and hence occurs among the factors in the quotient in (16). This proves and . The same factorization gives and . Since , the divisor is unsupported.
The main point of the proof is that the set has only one normalized nonnegative weak complement on . To see this, suppose that on , , and . Its mass is six. By (16), the nontrivial Fourier support of can occur only at orders five and six. We may therefore separate these two components in the CRT coordinates . Assigning the constant Fourier term to the first component, Fourier inversion gives real functions and such that
where has Fourier support only at order six. Put . Nonnegativity of gives for every , and normalization gives
The order-six support imposes the additional relation , from which . The two bounds on are compatible only if . Thus , and its zero mass implies . We then have and for , proving that the only normalized nonnegative weak complement of on is
We next transfer this rigidity to complements of . Suppose that on , , and , and fold modulo 30 by setting
The six translates in the definition of give . Moreover, , whereas the convolution equation at zero, together with and nonnegativity, gives . We may therefore apply (6.2). Since folding preserves Fourier values at characters whose orders divide 30, it follows that the Fourier transform of vanishes at order six. This conclusion required no assumption on .
It remains to show that a larger ambient period gives no additional freedom relevant to . Let satisfy the stated hypotheses at period . By Lemma 6.1,
Write . The factorization (6.1) shows that every cyclotomic factor of has order dividing 180. The cyclic identity therefore confines the Fourier support of to characters of these orders, together with the trivial character, and hence . We must also check that this 180-periodic pattern retains the normalization. Nonnegative coefficients and give . The convolution equation at zero, using , gives the reverse inequality. The 180-periodic pattern , , therefore satisfies
Applying the preceding argument to gives the required order-six vanishing, and therefore .
We can now verify using the complete list of cyclotomic factors of . Let be a product of prime-power orders of distinct primes in . By (6.3), . If , the cyclic identity forces . By (6.1), the possible orders are 5, 6, and the divisors of 180 that do not divide 30. Order five is excluded by (6.3); every order in the last class has constituent prime power four or nine, also excluded. At the remaining order six, we have already proved . This contradiction proves . □
The period reduction used in this proof reflects a general restriction on a fixed mask. For a nonzero integer mask polynomial , let be the least common multiple of the orders of its cyclotomic factors, with if there are none. At ambient period , the Fourier support of every cyclic complement of has orders dividing . The complement consequently has a period dividing this number. Thus enlarging the period cannot introduce Fourier orders beyond those already present among the cyclotomic divisors of . The allocation and normalization arguments above are additionally needed for the stated – obstruction.
Dilation and set complements
For set complements, the residue layers of a dilation give a further restriction: a failure of in a complement of must already occur in one of its layers. The following argument uses only allocation of prime-power factors and does not depend on the integer tiling characterization claimed by C. Li et al. [13].
Proposition 6.3. Let tile and let . Then has a set complement failing if and only if has such a complement.
Proof. A translation by an element of preserves each residue class modulo . Thus every set complement of decomposes uniquely into residue layers
We first show that for every layer implies for . Suppose, accordingly, that all the satisfy . Their ordinary prime-power signatures agree by Lemma 2.4. Let be a product of prime-power orders of distinct primes in , choose a primitive th root , and put . Then has order and
If , then , and the values of the layer mask polynomials in this sum are simply their cardinalities. Each is equal to , so the sum becomes .
For , we use the common prime-power signature of the layers. A constituent of comes from a constituent of with . Since , allocation places this order outside the signature of . Formula (4.4) then shows that is absent from and belongs to every . By for the layers, or by their prime-power vanishing if is a prime power, for every . Thus satisfies . Contrapositively, a complement of that fails has a layer that is already a complement of failing .
For the converse, we use identical layers. Suppose that complements and fails at order . The set with mask
complements . Put . The constituent prime powers of belong to by allocation and (4.4). At a primitive th root , the root has order , so . Also
because . Hence , giving its failure.
The rational construction avoids this set-level obstruction by adding a fractional perturbation to a normalized autocorrelation. Its weak complement need not be an indicator in any residue layer.
The two-prime boundary
Finally, we discuss what happens when the tiling period has at most two distinct prime divisors. As the following simple result shows, no such nonnegative normalized weak tiling complement satisfying but failing can exist.
Proposition 6.4. Suppose that has at most two distinct prime divisors and . If satisfies ordinary and
then satisfies ordinary . Positivity and normalization of are not required.
Proof. By Lemma 6.1, the prime-power orders dividing are partitioned between and . If has only one prime divisor, there is no mixed requirement. Otherwise, write its two prime divisors as and , and suppose that fails at . Both constituent prime powers must then be absent from , whereas the cyclic identity forces .
Since , the two-prime theorem of E. Coven and A. Meyerowitz [1] gives for . By G. Kiss, I. Łaba, C. Marshall, and G. Somlai [5 Theorem 9.4], a nonnegative integer multiset on a two-prime cyclic group satisfying , with a mixed zero but neither constituent prime-power zero, has mass strictly larger than the product of its prime-power cyclotomic values at one. Applied to , this contradicts . This version of the cited theorem does not require the additional cardinality condition in Definition 2.6. □
A period with at least three distinct prime divisors is therefore necessary for a rational complement satisfying to fail . Without the assumption this restriction disappears, as the example in following Lemma 2.4 shows.
Positive definiteness and the present constructions
Every spectral set in a finite cyclic group admits a normalized nonnegative weak complement that is positive definite [8 Lemma 1.3]. G. Kiss, I. Londner, M. Matolcsi, and G. Somlai [6 Problems 1.1 and 1.2] ask whether every set in a finite cyclic group admitting a PD weak complement is a tile, and whether the Coven–Meyerowitz conditions extend to such tilings. They answer the first question affirmatively for prime-power periods [6 Proposition 4.1]. They also construct functional PD tilings , with for primes , in which both factors satisfy and neither satisfies [6 Theorem 1.6]. Neither factor is the indicator function of a set. Related weak-tiling questions are considered in [4, 7]. Geometric consequences of weak tiling in Euclidean spaces are studied in [10].
The explicit weak complements were shown to fail positive definiteness by comparing their values at opposite points. There is also a Fourier reason why the perturbation cannot preserve this property. We start with an autocorrelation, change only Fourier values that are initially zero, and leave the value at the origin unchanged. The following proposition shows that these requirements exclude every nonzero perturbation on that Fourier support.
Proposition 7.1. Let , with positive definite, , and . Suppose that
Then is not positive definite for any real .
Proof. Suppose that were positive definite. At a Fourier zero of , this would require to be real and nonnegative. Outside that zero set, vanishes by assumption. Every Fourier value of would therefore be real and nonnegative, and inversion at the origin would give
The summands are nonnegative and have sum zero, so they must all vanish. Fourier inversion then gives , a contradiction. □
To apply the proposition to Case 2 of Theorem 4.2, recall that the perturbation has pure Fourier order , while the layered complement vanishes at that order. The Fourier transform of its normalized autocorrelation therefore vanishes on , and . The same argument applies to the perturbation of the period-180 example: its Fourier support has order 36, at which the autocorrelation term vanishes.
The appendix construction has the same feature in product coordinates. Under the identification , the support of consists of characters whose old component has order . Each translated layer of vanishes at every such old character because . Hence is zero on this entire support, and again . Proposition 7.1 applies. Changing an ordinary polynomial representative, as in the coefficient transfer lemmas, leaves these cyclic functions and their Fourier transforms unchanged.
Symmetrization does not remove this obstruction while retaining a nonzero perturbation. Indeed, let . Since is real and positive definite, it is even and its Fourier zero set is invariant under negation. Thus and its Fourier support is still contained in that zero set. If , the proposition applies; if , symmetrization returns and restores the mixed Fourier zero.
The preceding proposition concerns the form of the perturbation. For the five-point set used in the explicit example, we can make a stronger statement about the complements themselves. Restriction to the subgroup corresponding to the original period allows us to use the rigidity argument from Proposition 6.2.
Corollary 7.2. Let and . Suppose that has nonnegative coefficients, satisfies and ordinary (T1), and obeys
If its cyclic coefficient function on is positive definite, then satisfies ordinary (T2). In particular, this exclusion applies to .
Proof. We first restrict the complement to a copy of , where its values are determined by the set rigidity argument. Set and . Nonnegativity and give , whereas the convolution equation at zero gives . Define on . Restricting the convolution equation to gives
The set rigidity argument in Proposition 6.2 yields , so vanishes at order six. Restriction to the subgroup also gives the Fourier identity
Positive definiteness makes every summand nonnegative. Thus a positive Fourier value of contributes a positive Fourier value at the order of its restriction, with no possibility of cancellation.
We use this observation to exclude a failure of (T2). If failed that condition, Lemma 6.1 would give an order whose constituent prime powers all belong to but for which . Choose a character of order at which , and put . The tiling identity forces to vanish at this character, so vanishes at order . Since , we have .
If , then is a constituent prime power of and belongs to the signature of by (7). This contradicts allocation, since every constituent of belongs to . Therefore . The residue then has character order six. Equation (19) gives , contradicting the order-six vanishing of . Hence satisfies . □
The proposition explains the limitation of the signed perturbations, and the corollary gives an exclusion for the particular set . Whether other set tiles admit normalized nonnegative positive-definite complements failing remains open. Case 1 of Theorem 4.2 is separate from this perturbation argument: it starts from a set complement already failing . Such a complement would also give a positive-definite weak complement by normalized autocorrelation, as discussed in Remark 4.4.
Acknowledgements
G. K. was supported by grants NKFIH-142993, NKFIH-150576, and NKFIH-154121.
C. M. received support for postdoctoral research during the Simons Special Semester at the Rényi Center and was also supported by an Arts & Science PDF Award and an NSERC Canadian PDF Award.
M. M. was supported by grants NKFIH-146387 and NKFIH-154121.
G. S. was supported by a Discovery Project grant (DP250104965) of the Australian Research Council and grant NKFIH-150576.
Normalization by shifted layers
We give an alternative construction on , where is a prime coprime to . The product coordinates allow us to place the filter in a nonzero layer, leaving the value at the origin unchanged. As before, translations of the set complement provide enough positive weight to absorb the negative filter coefficients.
The general construction
A.1. The general construction. Assume throughout this subsection that , that satisfies , and that
In particular, the zero of at the common mixed order is one of the zeros required by . We will remove this zero while retaining the constituent prime-power zeros. The additional cardinality condition in the definition of an unsupported divisor is not needed for this construction.
Let , let , and choose a prime coprime to . Put
Here and below this is the literal residue-coordinate identification: . Choose shifts and define
Each layer is a translated copy of the base tiling, and consequently . We now take the normalized autocorrelation of this complement and place the filter in layer one:
Let be the canonical mask polynomial of . The following lower bound on will ensure nonnegativity; we arrange it in Lemma A.2.
Theorem A.1. Under (A.1), suppose that and
Then the function in (A.3) satisfies
Its mass is , and its period-relative prime-power zero set is
It satisfies period-relative (T1) and fails (T2) at order . The set satisfies ordinary (T1) and (T2), while is not positive definite.
Proof. By Lemma 2.8, has the required tiling identity, mass, and value at the origin. The perturbation preserves the tiling identity because by Lemma 3.1. Its negative sites are exactly the points with , where (A.4) ensures . Finally, and , so the normalization and mass of are also preserved.
Each translated layer of retains the prime-power zeros of , while equal layer sizes give the zero at order . Their cyclotomic values at one have product , by Lemma 2.4. Consequently these are all the prime-power factors of its integer mask, and autocorrelation preserves exactly these Fourier zeros. The perturbation cannot change them: a character in the support of has old component of mixed order , and hence cannot have prime-power order. Thus has precisely the asserted prime-power zeros, and their values at one give its mass .
At the mixed order , the situation is different. Let be any base character of order , and take the trivial character in the new coordinate. Since , each translated layer has zero Fourier value at . Hence , whereas
Since the constituent prime-power zeros in (A.1) were preserved, this nonzero value gives the asserted failure of (T2).
For the set factor, every old prime-power zero of is inherited by . These factors already account for its unchanged cardinality, so there are no additional prime-power factors. Every product required by (T2) is therefore an old order, at which vanishing is inherited from . To finish, we check that the perturbation destroys evenness. The autocorrelation is even and , while , so
Thus is not even and cannot be PD.
We can arrange the required lower bound by prescribing the differences between successive layer shifts.
Lemma A.2. For every prime coprime to with , one can choose shifts such that for every . Consequently, condition (A.4) holds whenever .
Proof. List as . We prescribe these differences as successive increments of the shifts, using the last increment to close the cycle. Define
and put , for . Then the cyclic increment equals , including at . If an increment has the prescribed value , the ordered pairs
all have difference . Counting these pairs in the normalized autocorrelation gives the stated lower bound. Since only finitely many primes divide , we may choose a prime as large as required. □
With these shifts, we may in particular take the rational value . At every negative filter site this gives , while the value at the origin remains unchanged.
An ordinary polynomial representative
To pass from period-relative to ordinary , we use Lemma 4.1 to remove cyclotomic factors whose orders do not divide , without changing the cyclic function.
Corollary A.3. The construction of Theorem A.1 admits an ordinary nonnegative rational representative with satisfying ordinary and failing , without changing its cyclic coefficient function.
Proof. Since at , this nonzero residue can be used for the coefficient transfer. Choose a positive integer clearing the denominators of and an odd prime . Lemma 4.1 gives
This polynomial has the same cyclic coefficient function and constant coefficient as , and all its cyclotomic factors have orders dividing . Hence its period-relative condition is ordinary , while its failure of at order is unchanged. □
References
Gergely Kiss
HUN-REN Alfréd Rényi Institute of Mathematics, Analysis Department, Reáltanoda u. 13-15, 1053, Budapest, Hungary,
and
Corvinus University of Budapest, Fővám tér 13-15, 1093, Budapest, Hungary
Email address: [email protected]
Caleb Marshall,
University of Toronto, Department of Mathematics, St. George Campus, Toronto, ON, Canada
Email address: [email protected]
Máté Matolcsi,
HUN-REN Alfréd Rényi Institute of Mathematics, Reáltanoda u. 13-15, 1053, Budapest, Hungary,
and
Budapest University of Technology and Economics, Department of Analysis and Operations Research, Institute of Mathematics, Műegyetem rkp. 3., H-1111 Budapest, Hungary.
Email address: [email protected]
Gábor Somlai, The University of Melbourne, School of Mathematics and Statistics, Parkville VIC 3010, Australia,
and
on unpaid leave from Eötvös Loránd University
Email address: [email protected]
References
- [1]E. M. Coven and A. D. Meyerowitz, Tiling the integers with translates of one finite set, J. Algebra 212 (1999), 161–174. doi:10.1006/jabr.1998.7628.DOI
- [2]T. Fallon, G. Kiss, A. Mayeli, and G. Somlai, Spectral Tile Direction in the Group Zₚ² × Zq₄² × Zr, arXiv:2308.16277v4 (2026).
- [3]R. Greenfeld and T. Tao, A counterexample to the periodic tiling conjecture, Ann. of Math. (2) 200 (2024), 301–363. doi:10.4007/annals.2024.200.1.5.DOI
- [4]M. Kadir and K. Fan, Tiles and weak tiles in Zₚq, preprint (2026). arXiv:2607.02149.
- [5]G. Kiss, I. Laba, C. Marshall, and G. Somlai, Lower bounds for mask polynomials with many cyclotomic divisors, Adv. Math. 494 (2026), 110932. doi:10.1016/j.aim.2026.110932. arXiv:2507.11672.DOI
- [6]G. Kiss, I. Londner, M. Matolcsi, and G. Somlai, Functional tilings and the Coven–Meyerowitz tiling conditions, Discrete Analysis 2025:18, 20 pp. arXiv:2411.03854.arxiv.org/abs/2411.03854
- [7]G. Kiss, I. Londner, M. Matolcsi, and G. Somlai, A lonely weak tile, Expo. Math. 44 (2026), no. 1, 125636, 9 pp. doi:10.1016/j.exmath.2024.125636. arXiv:2410.04948.
- [8]G. Kiss, D. Matolcsi, M. Matolcsi, and G. Somlai, Tiling and weak tiling in (Zₚ)ᵈ, Sampl. Theory Signal Process. Data Anal. 22 (2024), Paper No. 1. doi:10.1007/s43670-023-00073-7.DOI
- [9]M. N. Kolountzakis, N. Lev, and M. Matolcsi, Spectral sets and weak tiling, Sampl. Theory Signal Process. Data Anal. 21 (2023), Paper No. 31.DOI
- [10]M. N. Kolountzakis, N. Lev, and M. Matolcsi, Geometric implications of weak tiling, Anal. Math. 51 (2025), 1375–1393. doi:10.1007/s10476-025-00121-5.DOI
- [11]I. Laba and I. Londner, Combinatorial and harmonic-analytic methods for integer tilings, Forum Math. Pi 10 (2022), e8, 1–46. doi:10.1017/fmp.2022.3.DOI
- [12]N. Lev and M. Matolcsi, The Fuglede conjecture for convex domains is true in all dimensions, Acta Math. 228 (2022), 385–420.DOI
- [13]C. Li, J. Wu, W. Hu, C. Wang, E. Wang, and F. Zhu, Reduction of integer tiles via CRT and base-p digits, preprint (2026). arXiv:2609.14026v1.arxiv.org/abs/2609.14026
- [14]R. D. Maliokisis, On the structure of spectral and tiling subsets of cyclic groups, Forum Math. Sigma 10 (2022), e23, 1–42. doi:10.1017/fms.2022.14.
- [15]D. J. Newman, Tessellation of integers, J. Number Theory 9 (1977), 107–111.
- [16]J. Prajapati, Coven–Meyerowitz T2 necessity through coprime stripe collapse, preprint (2026). arXiv:2609.22280.arxiv.org/abs/2609.22280
- [17]H. Tan and Y. Zhang, Unsupported Cyclotomic Divisors in Three-Prime Integer Tilings, preprint (2026). arXiv:2609.06677v1.arxiv.org/abs/2609.06677