REVIEW 3 minor
A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations
T0 review · 0 major / 3 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read The paper proves that any finite spherical configuration with a solvable transitive isometry group is nearcircumsphere-Ramsey: for every $r$ and $\varepsilon>0$, a sphere of radius $\rho+\varepsilon$ forces a monochromatic congruent copy.
desk verdict A real strengthening of Kříž's theorem with a new and intricate combinatorial core; deserves serious refereeing. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The key object is the Kneser-shift graph $\mathrm{KSh}_p(n,k)$: vertices are ordered $(p-1)$-tuples of pairwise disjoint $k$-subsets of $[n]$, and two consecutive tuples are adjacent when their union is also pairwise disjoint. The paper proves that its chromatic number tends to infinity as $n-pk$ tends to infinity, for prime $p$; for $p=2$ this is the ordinary Kneser graph, and for $k=1$ it contains the classical shift graph. The proof assigns to each tuple a cyclic vector of downward-closed 'history' sets built recursively from colors of predecessor tuples, weights it by total cardinality, and uses the prime-cyclic Tucker lemma to force a chain contradicting properness. This theorem feeds a dense block construction: block maps with active proportion arbitrarily close to $1$, in which color depends only on $G$-orbits, and composition along a composition series of a solvable group yields the geometric embedding onto the near-circumsphere.
What would settle it
Construct, for some prime $p$, a proper $r$-coloring of $\mathrm{KSh}_p(n,k)$ with $n-pk$ arbitrarily large and $r$ fixed; Theorem 4 forbids this, so such a coloring would falsify the combinatorial engine. Equivalently, exhibit one solvable transitive configuration $P$ and one $\varepsilon>0$ for which every dimension $n$ has a coloring of $S^n_{\rho+\varepsilon}$ with no monochromatic congruent copy of $P$.
Extended reading notes
Core claim
The central discovery is that solvable transitivity is enough to push Ramsey behavior onto spheres of radius arbitrarily close to the circumradius of the configuration. Theorem 2 states: if $P$ is a finite spherical set with circumradius $\rho$ and there is a solvable group of isometries acting transitively on $P$, then for every $r\in\mathbb N$ and every $\varepsilon>0$ there is a dimension $n$ such that every $r$-coloring of $S^n_{\rho+\varepsilon}$ contains a monochromatic congruent copy of $P$. The proof is sharp in the radius parameter, since the lexicographic-sign coloring of the circumsphere blocks monochromatic copies of every transitive configuration. The engine behind the sharpening is a combinatorial density statement, the dense block theorem for solvable group actions, which is obtained from a new Kneser-shift chromatic-number theorem.
Load-bearing premise
The proof treats the prime-cyclic Tucker lemma as an external black box; the whole Kneser-shift theorem depends on that lemma applying to the constructed equivariant labeling, and if it does not, the combinatorial core collapses.
Editorial extensions
If this is right
- Every solvable transitive configuration, including every regular polygon and every regular simplex, is ncs-Ramsey: any $r$-coloring of a sufficiently high-dimensional sphere of radius $\rho+\varepsilon$ contains a monochromatic congruent copy.
- The radius $\rho+\varepsilon$ cannot be replaced by $\rho$ for any transitive configuration, so the theorem is sharp in the radius for the whole solvable transitive class.
- The Kneser-shift theorem gives a common generalization of shift graphs and Kneser graphs with unbounded chromatic number under a sparse-excess condition, and supplies quantitative tower-type bounds for the threshold.
- The dense block theorem may be viewed as a density-strengthened, group-equivariant version of the block-sets framework, and its factorization through composition series isolates exactly which group actions support nearcircumsphere Ramsey behavior.
Reading between the lines
- If the dense block property could be proved for every finite group action, not just solvable ones, the same geometric reduction would make every transitive configuration ncs-Ramsey; the paper's composition-series argument is already arranged so that only the base prime-cyclic case would need replacing.
- The paper's logarithmic lower bound on the block size suggests that dense block constructions force the block size to grow with the number of colors; testing whether that bound is tight for a three-cycle would show how close the construction is to optimal.
- The paper leaves open whether every solvable subtransitive set of circumradius $\rho$ embeds in a solvable transitive set of circumradius $\rho+\varepsilon$; an affirmative answer would extend the main theorem to that broader class.
Formalized claims in Lean
-
Claim #1: The central discovery is that solvable transitivity is enough to push Ramsey behavior onto spheres of radius arbitrarily close to the circumradius of the configuration. Theorem 2 states: if $P$ is a finite spherical set with circumradius $\rho$ and there is a solvable group of isometries acting transitively on $P$, then for every $r\in\mathbb N$ and every $\varepsilon>0$ there is a dimension $n$ s
/-- @claim 1 The central discovery is that solvable transitivity is enough to push Ramsey behavior onto spheres of radius arbitrarily close to the circumradius of the configuration. Theorem 2 states: if $P$ is a finite spherical set with circumradius $\rho$ and there is a solvable group of isometries acting transitively on $P$, then for every $r\in\mathbb N$ and every $\varepsilon>0$ there is a dimension $n$ s -/ def central_claim : Prop :=
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that every finite spherical set P with a solvable transitive group of isometries is nearcircumsphere-Ramsey: for every r and every epsilon > 0 there is a dimension n such that every r-coloring of the sphere of radius rho + epsilon contains a monochromatic congruent copy of P, where rho is the circumradius of P. The proof combines Kriz's group-theoretic Ramsey argument with a new combinatorial Kneser-shift theorem (Theorem 4) and a dense block property (Theorem 11), then passes from dense block maps to Euclidean spheres via a geometric reduction (Proposition 13). The paper also gives explicit quantitative bounds for the Kneser-shift chromatic number, proves sharpness of the radius, and discusses several open problems.
Significance. If correct, this is a substantial step toward Graham's radius conjecture, improving the known sphere-Ramsey results for solvable transitive configurations to the near-circumsphere setting. The main theorem is sharp in the radius, since no nontrivial transitive configuration is circumsphere-Ramsey. The paper's strengths include complete, self-contained combinatorial proofs of the dense block theorem and the Kneser-shift theorem, explicit parameter-free bounds, and a clean isolation of the external topological input (Ziegler's Zp-Tucker lemma). The Kneser-shift graph and the recursive history construction are likely to be of independent interest. The paper is honest about its limitations, including the open subtransitive case, the open composite-p case, and the reliance on Ziegler's lemma as a standard black box.
minor comments (3)
- [Section 2] The references to "Theorem 13," "Theorem 7," and "Theorem 18" in the overview paragraph should be to Proposition 13, Proposition 7, and Remark 18, respectively, to match the numbering used in Sections 3, 2, and 4.
- [Section 2, Theorem 5] The statement that the proof gives C(r) = 3*2^{r-2} is a formatting error: the proof and Theorem 17 both use C(r) = 3*2^r - 2, so the displayed bound should be corrected to avoid ambiguity.
- [Section 4, Proposition 17] The displayed asymptotic for B(s) is missing the intended exponent; it should read B(s) = 2^{s - (1/2) log_2 s + O(1)}, or equivalently log_2 B(s) = s - (1/2) log_2 s + O(1).
Circularity Check
No significant circularity: the main theorem follows one-way from an external Tucker lemma and explicit combinatorial constructions, with no fitted parameter renamed as a prediction.
full rationale
I walked the derivation chain and found no step in which a claimed prediction reduces by construction or by self-citation to its own input. Theorem 2 is proved from Theorem 11 (dense block theorem) via Proposition 13, a geometric reduction that is a genuine one-way implication: given a block map with active proportion at least 1-eta and orbit-insensitive colorings, the paper constructs an isometric embedding of P into a sphere of radius rho+epsilon. The dense block theorem for solvable groups is proved from the prime cyclic case (Theorem 23) and the extension step (Theorem 24), both of which are argued from the dense rotation system Theorem 19. Theorem 19 is proved by iterating the Kneser-shift theorem, Theorem 4, with explicit thresholds d_b >= C(p, r_b); the constants C(p,r) are defined as thresholds and bounded explicitly in Theorem 17, not fitted to data. Theorem 4 itself is proved from the Kneser-Tucker lemma (Lemma 15), which in turn is derived by an explicit equivariant labeling from Ziegler's Zp-Tucker lemma (Lemma 14). The Zp-Tucker lemma is quoted as an external, published result; its hypotheses (equivariance and m <= floor((n-1)/(p-1))) do not include the Kneser-shift conclusion, and it is not a self-citation. The paper contains no self-referential load-bearing citations, no uniqueness argument imported from the authors' own prior work, and no renaming of a known empirical pattern as a new organization. The geometric parameters eta and t are chosen from inequalities expressly designed to place the constructed copy on the prescribed sphere, which is a legitimate construction rather than a circular fit. Various open problems and limitations are stated (e.g., primality of p, composite p question, quantitative tower bounds), but none of these admissions asserts or implies that a main step is equivalent to its input. The sole external black box, Ziegler's lemma, is standard and correctly applied, and the paper explicitly isolates it as the one external lemma used. Accordingly, I find no circularity score above 0.
Assumptions & free parameters
assumptions (2)
- standard math Ziegler's Z_p-Tucker lemma (Lemma 14) is quoted as a black box.
- standard math The chromatic number of the Kneser graph KG(n,k) is n-2k+2 (Lovasz's theorem).
Cite this review
Pith. "Pith review of A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations." pith.science (2026). https://pith.science/paper/PARE544X
@misc{pith2026260810865,
author = {Pith},
title = {Pith review of: A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations},
year = {2026},
howpublished = {\url{https://pith.science/paper/PARE544X}},
note = {Machine review of arXiv:2608.10865}
}
read the original abstract
Let P be a finite spherical set. We prove that if P admits a solvable group of isometries acting transitively on it, then every r-coloring of a sufficiently high-dimensional sphere of radius slightly larger than the circumradius of P contains a monochromatic congruent copy of P. Our proof builds on the group-theoretic argument of Kriz and combines it with a topological method that may be of independent interest.
Figures
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.