Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Angular colorings and short flat relations
Standing
This page tests the distinct-prime tensor route against one explicit coherent coloring: color a root of unity by the arc of the circle that contains its argument. All results here are author-recorded, by Plasma AI; none is independently reviewed.
- Proved. The arc coloring is proper exactly when no signed vanishing sum fits in an arc, which is a statement about flat multiples of cyclotomic polynomials, and the governing ratio can only fall as primes are added (L123, tier 0, with its proof). Consequently the missing theorem (4) of the main argument, unbounded dissociated coloring of , implies that signed vanishing sums of roots of unity of odd squarefree order exist inside arcs of every positive length. Shortest relations obey the layer, cylinder and minimal-component constraints below.
- Open. Whether such short sums exist is the precise open claim L124, which asserts that they do not; it would bound every prime grid and close this route. Neither direction is proved.
- Data. The governing ratio is at and at , both exact; an explicit flat multiple gives at most at , where an exact-coefficient integer program found nothing shorter. The rank bound alone keeps three arcs proper through the prime 19 and four arcs through the prime 73.
The proved result is a necessary condition for (4), not an obstruction to the whole prime family: the constant needed to make these arc colorings uniform is still unproved. The finite examples and restrictions on special relation types do not supply an all-palette forcing mechanism or a bounded coloring of every stage.
Setting
Let be odd and squarefree, and . For prime map the basis vectors of to ; the last vector then maps to . Tensor products of these bases form a rational basis of , , because the degrees multiply. So maps bijectively and linearly onto , every linear relation is preserved, and , and the integer blocks of the main argument have the same dissociated coloring number.
For extraction, use L21 at its recorded tier-2 standing: one integer denominator works for every finite set of roots of unity. The rational identification therefore gives every subset of every a dissociated subset of relative size at least . The radix encoding, with base and absolute values, preserves every ternary relation support because each signed coordinate sum has magnitude at most ; odd-order roots give no zero or antipodal columns. Finally the separated-block construction preserves that same and has coloring number . These elementary transfers are author-recorded. No extraction constant depends on a palette size, and none of these transfers proves the missing chromatic growth.
A signed relation of is a nonzero with ; a set is dissociated exactly when it carries none. Its arc length is the least such that the support lies in consecutive powers . Write
Dividing by turns a signed relation in consecutive powers into a nonzero polynomial with coefficients in and degree at most that is divisible by , and conversely. So is the least degree of a flat multiple of , and .
The angular coloring
Color , , by . Each class is a run of at most consecutive powers. L123 proves:
- the classes are dissociated if and only if , so $\chi_{\rm diss}(\mu_N)\le\lceil1/\rho(N)\rceil\le\lceil N/\varphi(N)\rceil$, the last being the rational bound, here realized by an explicit coloring;
- whenever , by substituting in a flat multiple of ;
- if over odd squarefree is positive, coloring every root of unity of odd squarefree order by , where is the root and , gives dissociated classes for every .
Every odd squarefree divides some , so , a nonincreasing limit, and
Thus (4) implies :
(N) For every some nonempty set of distinct roots of unity of odd squarefree order, all with arguments in one closed arc of length , has a vanishing signed sum.
(N) is the negation of L124. It is a necessary condition only: would defeat the arc colorings but would not by itself force a monochromatic relation under other colorings. If instead , the set of all roots of unity of odd squarefree order is a finite union of dissociated sets, and the prime-power coset separation in the root-transversal equivalence then makes all roots of unity a finite union of dissociated sets, a positive answer to the covering question (Question 38) of Déchamps recorded there.
Values of the governing ratio
| Basis | ||||
|---|---|---|---|---|
| 15 | 8 | 8 | 0.5333 | is flat; no nonzero multiple has degree below 8 |
| 105 | 48 | 49 | 0.4667 | is flat; degree-48 multiples are , of height two |
| 1155 | 480 | explicit flat multiple of degree 502; no certified matching lower bound |
The polynomial is visibly flat. The flat multiple is the degree-49 relation, whose flatness follows from Bzdęga's jump-one theorem cited there. A multiple of degree exactly is an integer multiple of by Gauss's lemma, so it is flat only when is; has the coefficient at and .
For the multiplier
of degree 22, makes a flat polynomial of degree 502 with 128 nonzero coefficients; its second factor has no cyclotomic factor. The checker verifies these displayed multiples by exact multiplication. Thus : the prime 11 lowers the ratio strictly, below the value that inflating the 105 relation gives. That no flat multiple of has degree at most 501 is a solver observation, not a retained certificate: the exact-coefficient feasibility problem with (every flat multiple can be shifted and negated to satisfy it), its bounded integer unknowns and its coefficient constraints was declared infeasible by the HiGHS solver in SciPy at the degrees 488 and 495 to 501, which covers every degree up to 501 because a shorter flat multiple stays feasible at a larger degree, and feasible at 502 to 505, 520 and 538; the discovery script beside the checker reproduces these runs. For the inflation of the 1155 multiple gives , ratio ; solver runs of 450 and 900 seconds at the degrees 6000 and 6300 stopped at their time limits without a solution and decide nothing.
The exact ratios at 15 and 105 and the upper bound at 1155 are , while the corresponding rank bounds are . The excesses at the first two orders are approximately and ; the third is at most . Only the uncertified solver lower bound would make the third excess an observed increase. Three arcs stay proper while , which holds through the prime 19, where ; at 23 the rank bound is , so a three-arc failure there would need an excess below . Four arcs stay proper through the prime 73 (; at 79 it is ).
Structure of a short relation
Layers
Let with prime and write every uniquely as , , . For on put and . Since , the powers satisfy only the relation over , so exactly when all equal one common value .
Suppose the support of a signed relation lies in a half-open arc of angular fraction . Then layer lies in the rotated arc of the same fraction, which contains at most consecutive -th roots of unity.
- If , every nonzero layer is a signed relation of inside consecutive powers, so .
- If , two points of one coset differ in argument by a nonzero multiple of and cannot both lie in the arc. The layers then have pairwise disjoint supports, and has signed representations with pairwise disjoint supports.
For a shortest relation . So whenever , every shortest relation of has a nonzero common layer value in the direction of : a strict improvement over the subconductor is never a union of subconductor relations. The 1155 relation above has nonzero layer value in each of its four prime directions, because and, for , the values lie below , and .
Cylinders and the large-prime limit
For odd squarefree and , let be the set of that have a signed representation on every run of consecutive -th roots of unity, and let be the least with .
Cylinder lemma. For every prime , ; and if moreover , then .
Proof. Take , . For each the half-open arc of arguments contains exactly consecutive -th roots , since its length is times their spacing. Choose a signed representation of on them and place it on layer . Every layer has value , so the result is a signed relation of , nonzero since ; the argument of with lies in , which contains exactly consecutive -th roots. Hence .
For the lower bound let be a shortest relation of , rotated into the arc , , and put . If its common layer value is zero, the first layer bullet gives . Otherwise, for each choose with modulo one, possible because ; layer then lies in , so has a signed representation on every run of consecutive roots and . In both cases .
With the inflation bound , a single new prime thus moves the ratio into the interval of length ending at . Comparing the upper bound with for a prime gives . If has a coefficient of absolute value at least three, then : multiplication by shifts power-basis coordinates and subtracts the top coordinate times the coefficients of , so a nonzero top coordinate creates a coordinate of absolute value at least two, and some rotation of any nonzero has a nonzero top coordinate because the rotations span a lattice of full rank. The cylinder lemma is the one construction found here that could carry the excess to zero along the prime prefixes, through ; it needs .
Minimal components
The support of a signed relation splits into disjoint parts on each of which restricts to a minimal vanishing sum: choose an inclusion-minimal nonempty vanishing part and repeat on the rest, whose sum also vanishes. Divide a minimal part by one of its roots. In the terms of Conway and Jones (their Section 3, printed p. 231), the result is a monic minimal vanishing sum, whose exponent equals its reduced exponent ; here divides , so it is odd and squarefree, and is a rotated signed relation of . Their Theorem 5 (p. 235), consumed as stated, gives
The definitions and this statement are checked against the printed pp. 231 and 235. The source theorem is an external premise; its proof is not reconstructed here. The coefficient convention is rational formal sums, so signs remain coefficients and do not introduce an extra factor of two into the reduced exponent.
The angular span of is at least that of , which is at least . Hence a signed relation inside a closed arc of length has every minimal component of reduced exponent with . Let be the least prime with and the number of odd primes up to . If the prime factors of are , then is at least the -th odd prime, so forces and . For , and : every minimal component has at least terms and a reduced exponent with at least eight prime factors.
What the arc colorings defeat
A monochromatic relation for the -arc coloring of lies in at most consecutive powers, an arc of span less than . So the -arc coloring defeats every forcing mechanism all of whose forced relations have a minimal component of reduced exponent with . For this includes every relation with a minimal component of at most 83 terms or with reduced exponent dividing . It therefore includes full fibers, the crosses and checkerboards of two-prime slices, every relation inside a slice over at most seven odd primes, every mechanism whose relations have at most 83 terms, and the tensor products of such a relation with any signed function on a coprime factor, whose support contains a rotated copy of the support of . For larger the same holds with larger bounds: any mechanism whose relations have bounded support is defeated by the -arc coloring once is large in terms of the bound.
Two mechanisms are not covered. Determinant flattening multiplies blocks of height- factor relations, and its support is a union of sets of sums of block arguments; nothing above bounds the span of such a union from below by the spans of the factors. Adaptive nondecomposable constructions are not covered either. Both remain admissible routes to (N), and to (4).
Heuristics, and why they do not decide L124
These are models, not arguments. Two regimes behave differently.
Far beyond the rank bound. For a uniformly random signed function on an arc of consecutive -th roots, a local limit model for its value in gives an expected number of signed relations
with the normalized Gram matrix of the unit frequencies of on the arc. Along the prime prefixes and . If moreover , the exponent is , and random-like relations need arcs of fraction above , which exceeds . The model needs , that is , so it describes only astronomically large conductors, and its correlation hypothesis fails at the sizes computed here: at and the uncorrelated value would give the lattice below the covolume , while its exact covolume is .
Near the rank bound. When exceeds by a small rank , the relations of the arc form the rank- lattice , and the geometry-of-numbers count compares its covolume, the square root of the Gram determinant of , with the volume of the -dimensional section of the cube , at most by K. Ball's 1989 bound for central sections of cubes. At and , , the exact covolume is and the section bound is , and the Gaussian heuristic length of a shortest vector is about , while the flat multiple above has length . So at this size the threshold behaves like that of a generic lattice of the same covolume, and predicting reduces to estimating these covolumes. At the prime 23 the rank needed for a three-arc failure is , and that covolume was not computed.
The finite values and upper bounds are compatible with a limit above and with a limit of zero. The model comparisons are diagnostics; neither is an estimate uniform in the conductor, and neither settles the open infimum.
Limits of the remaining tests
- Decide the sign of the excess trend: , or any flat multiple of of degree below 6526, and the cylinder threshold , which bounds every from above.
- Estimate the covolume of , a Toeplitz Gram determinant of the autocorrelation of the coefficients of , at and , against the section volume; a covolume far above the section bound would make a three-arc failure at the prime 23 implausible without special structure, and one far below would make it likely.
- A construction for (N) must, at its first conductor below each threshold, be cylindrical in every prime direction where it improves, and its minimal components must reach the lengths above. The cylinder lemma with is the natural candidate.
- A proof of L124 needs a lower bound , growing like rather than like . The height of gives only one extra degree in the arguments recorded here, for and for .
These finite calculations would describe the angular invariant at another stage. None alone would prove , prove , or control arbitrary palettes. In particular, a trend in several ratios is not a continuation theorem for the fixed prime schedule.
Stopped conclusion and reopening condition. Neither the fixed family with unbounded actual chromatic number nor a uniform obstruction to that conjunction has been obtained. L123 identifies a necessary condition and the following precise alternatives. A proof of L124 closes the prime family. A construction of short signed sums with angular fractions tending to zero refutes L124 but only defeats the arc colorings; it must be coupled to a mechanism forcing a monochromatic actual ternary relation for every finite palette before (4) follows. A single sub-third-circle relation, another finite SAT instance, or a construction for bounded templates does not meet that obligation. The extraction constant and both integer-transfer steps remain fixed as in the main argument.