Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Product capacity obstruction
A proposed extension of the bounded- argument was to exploit the tree structure of prime-power residue classes, hoping for a bound depending only on the number of distinct prime factors. The obstruction below defeats any such argument based only on all individual divisor-face capacities, even when and the moduli are distinct and primitive.
The weights constructed here are not known to be realizable as actual first-kill harmonic masses. This is not a counterexample to Problem 25, or to its bounded- version for arbitrary residues. The later squarefull-kernel theorem proves natural density for that bounded- singleton version. Its arithmetic kernel truncation and activation estimates go beyond the face capacities used here.
External finite rectangle input
We use the following finite form of Carleson's rectangle counterexample. For every integer there is a finite family of dyadic rectangles in such that
and, for every dyadic rectangle ,
The constants are absolute. This statement and its finite construction were checked on pages 1, 3, and 4 of Blasco--Pott, Carleson's counterexample and a scale of Lorentz-BMO spaces on the bitorus. The transfer to congruences and the distinct-modulus refinement below are separate arguments.
Transfer to two different prime coordinates
For each second-coordinate dyadic interval , choose a triadic interval with . To do so, choose a triadic grid length satisfying ; an interval of length at least contains a full grid interval of length .
Replace by and give it weight
Then
The modified rectangles satisfy the exact packing bound
for every dyadic and triadic .
For verification, put . If , then , meets , and . Choose a dyadic grid length with , using if this choice exceeds the ambient interval. Every such is contained in an -grid interval meeting . Since , there are at most two such intervals, with total length at most . Applying (2) to times those intervals bounds the sum of the original areas by . Modified areas are no larger, proving (4).
The digit maps identify dyadic intervals with -adic balls and triadic intervals with -adic balls, preserving measure and containment. CRT therefore identifies the modified rectangles with full cylinders , . Combine any duplicate cylinders by adding their weights. Equation (4) becomes every divisor-face bound
Faces containing other primes have no descendants. This already gives an obstruction with , but possibly repeated moduli.
Distinct primitive moduli with at most three prime factors
For each base cylinder , choose a finite pool of primes greater than , all pools disjoint, such that
Divergence of the prime reciprocal sum permits this. Replace the base cylinder by
The modulus is . Each tag prime occurs in exactly one modulus, so all moduli are distinct and no one divides another. Also
All face capacities remain true. A face without a tag receives at most the old total weight, since . A face with a tag prime has at most one descendant. Equation (5) for the base cylinder itself gives , so its descendant weight is at most for every relevant divisor . A face with two tags has no descendants.
The exact harmonic cutoffs do not fix the obstruction
Let be the largest tagged modulus, put , and halve all the weights in (6). Every relevant divisor is at most , and
The new weights consequently satisfy
yet have total mass at least and full union measure tending to zero. Thus even the precise harmonic face constraints, together with distinctness, primitivity, and , cannot imply a uniform small-footprint bound on the abstract total mass.
The previous unbounded-rank face obstruction is therefore not merely a consequence of increasing the number of prime coordinates. Large exponents already permit a fixed-rank obstruction. Additional information specific to actual first-kill masses is necessary.
Comparable two-prime base moduli cannot be repaired by refinement
There is a direct arithmetic obstruction to one attempted realization of these abstract weights. Fix . Let be any finite periodic union, allowing multiple residues, all of whose base moduli are of the form and lie in . Put . Suppose is a delayed singleton system with globally distinct moduli, each divisible by a base modulus and with each full cylinder contained in . Then, uniformly in ,
Indeed, there are distinct base moduli: for each , the allowed 's occupy an interval of bounded length. Their lcm is at most , and their reciprocal sum is . Insert these facts into the established arbitrary divisor-refinement bound, equation (5). The number of base residues does not enter that lemma. This proves (7).
In particular, if such a base family has and , no choice of singleton divisor refinements can realize a fixed positive harmonic mass, even with arbitrary composite tags or repeated use of a tag prime on different base moduli. The hypotheses include the comparable-modulus situation obtained when a two-coordinate rectangle construction has common area before the bounded-factor dyadic-to-triadic replacement. No assertion that every rectangle obstruction admits that normalization is needed here.