Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Setting
For an integer and a positive integer , . The system is
with positive moduli (the paper's (1), preprint p. 1). For let ; the covering multiplicity is (the paper's (2)), and is an -cover when . A minimal -cover is an -cover none of whose proper subsystems is one, and an exact -cover has for every (pp. 1--2). and are the integral and fractional parts of a real . For , , and is the least common multiple of the with .
The paper also records (its (3), p. 1, with a pointer to earlier work) that , with equality if and only if covers each integer exactly times for some positive integer .
Statement
Theorem 1 (preprint p. 2). Let be a system as above and .
(i) For all integers ,
(ii) Suppose for some with , and for each let be a positive integer prime to . Then there is such that for every integer with some satisfies
The paper writes (ii) as an inclusion of sets (its (5)): the set of fractional parts over with contains , where ranges over reals; those are exactly with .
Consequences stated on p. 2. The paper notes, as properties of an -cover that follow from Theorem 1 (taking every ):
- (a) for each there are at least subsets with ;
- (b) if is a minimal -cover, then for each there is such that for every some has and .
Property (b) is (ii) with (a reading of this page): since is not an -cover, some lies in exactly classes of , so and with . The paper's Corollary 4 (p. 4) applies (ii) with in the same way, for positive prime to , and states the result with differences of two subset sums. The paper also notes (p. 2) that the case of (i) for a 1-cover gives a nonempty with , which it attributes to M. Z. Zhang.
Source. Zhi-Wei Sun, On covering multiplicity, Proc. Amer. Math. Soc. 127 (1999), no. 5, 1293--1300, doi:10.1090/S0002-9939-99-04817-0, read in the author's preprint identified on the source card, whose pages are numbered 1 to 9: the theorem on p. 2, the proof of (i) on pp. 5--7 and of (ii) on pp. 7--8.
Read depth. Claims checked: the definitions, the statement and the consequences (a) and (b) were read clause by clause on the page images. The proof was read but not checked step by step; nothing here is independently reviewed.
Proof pointer
Section 2 (pp. 5--8). Both parts rest on a characterization of -covers that the paper quotes from the author's earlier work (Proposition 1, p. 5): a system of real arithmetic sequences is an -cover exactly when certain signed sums of binomial coefficients times exponentials, taken over the subsets with a given fractional part , vanish. Lemma 1 (p. 5) says is an -cover if and only if every subsystem obtained by deleting classes is an -cover. For (i) (pp. 5--7), applied to the rescaled classes , these give, case by case on whether or has at least elements and then on the classes of modulus 1, distinct subsets with the same fractional part. For (ii) (pp. 7--8), Lemma 2 (p. 7) shows that a weighted sum over the subsets with fractional part depends only on ; the hypothesis that lies in exactly classes of and the coprimality of and make the rescaled system fail to be an -cover, so Proposition 1 yields a with , and works.
Bears on
- Problem 1189: the problem counts irreducible covering sets, sets of distinct moduli that admit a covering choice of residues while no proper subset does. For such a set, any covering choice of residues is a minimal 1-cover, so consequence (b) applies to it with , where the condition is empty. The values are then fractional parts of subset sums over distinct sets , which gives for every (an observation of this page; the paper draws no conclusion about irreducible covering sets). This is a necessary condition on the moduli, not a count, and the theorem does not answer the problem.