arXiv:2606.12947v1

Trace spectra of simplices in large sets

Michael Björklund, Alexander Fish, Shrey Sanadhya

math.DSmath.COmath.NT05D1037A44

Abstract

Given an ordered tuple v=(v0,,vd)\mathbf v=(v_0,\ldots,v_d) of vectors in Rd\mathbb{R}^d, let Av=[v1v0  vdv0]A_{\mathbf v}=[\,v_1-v_0\ \cdots\ v_d-v_0\,] be its edge matrix. We prove that, in every finite colouring of Rd\mathbb{R}^d, one colour class realizes every prescribed value of the higher characteristic coefficients (c2(Av),,cd(Av)). (c_2(A_{\mathbf v}),\ldots,c_d(A_{\mathbf v})). This extends Graham's theorem on volumes, which corresponds to the last coefficient cd(Av)=det(Av)c_d(A_{\mathbf v})=\det(A_{\mathbf v}). We also prove a discrete analogue: if EZdE\subseteq\mathbb{Z}^d has positive upper Banach density, then, for some q1q\geq 1, the set of coefficient tuples realized by ordered tuples in EE contains q2Z×q3Z××qdZ. q^2\mathbb{Z}\times q^3\mathbb{Z}\times\cdots\times q^d\mathbb{Z}. Finally, we show that the ordinary trace c1(Av)c_1(A_{\mathbf v}) cannot be added to these conclusions. The proof combines a quantitative directional expansion result for ergodic actions of free abelian groups with a trace calculation for a family of model edge matrices.

AI-generated audit

Audit summary

Audited against arXiv v1

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 18, 2026
01Statements2 reported findingsCorrect

The Euclidean coloring theorem, the positive-density lattice theorem, and the obstructions to including the ordinary trace are correct.

Theorems A and BCorrect

All higher characteristic coefficients are realized in one color or a finite-index product lattice

Pages 2–4 and 20–22 · Theorems A and B · arXiv:2606.12947v1

The model edge matrix has a triangular dependence that makes c2,,cdc_2,\ldots,c_d independently range over the announced product subgroup. The dynamical multiple-recurrence theorem realizes every such matrix as a positive-measure intersection. The correspondence principle converts this to a lattice simplex, and Graham's product theorem makes the color class independent of the prescribed coefficient tuple in the Euclidean result.

Obstructions A and BCorrect

The ordinary trace cannot be added to either conclusion

Pages 4–5 and Section 7 · arXiv:2606.12947v1

The periodic small-square coloring confines the linear trace to a proper union of intervals in each color, while the lattice construction confines it to a set avoiding every finite-index subgroup. Both arguments concern affinely independent tuples where required, so the obstruction is not produced solely by degenerate simplices.

02Proofs2 reported findingsCorrect

The quantitative directional expansion, recurrence construction, matrix trace calculation, correspondence step, and Ramsey product argument form a complete proof chain.

Theorems 4.1 and 5.1Correct and complete

Directional expansion supplies trace tuples uniformly in the density

Sections 4 and 5 · arXiv:2606.12947v1

The ergodic-component selection gives a bounded-index subgroup and a direction whose translates cover all but the prescribed error. Repeated recurrence supplies the bounded nonzero transverse coefficients. The explicit principal-minor calculation then shows that varying the free parameters fills a product subgroup, and taking a common multiple makes the subgroup uniform over all finitely many parameter choices.

Proof of Theorem ACorrect and complete

Graham's product theorem legitimately selects a single color for all coefficient tuples

Pages 21–22 · arXiv:2606.12947v1

For each prescribed tuple, the density argument proves that the family of supports of realizing configurations is Ramsey. Graham's product theorem applies to the full collection of those Ramsey families, even though it is uncountable, and yields one color meeting every family. Translation leaves the edge matrix unchanged, completing the simultaneous realization.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2606.12947v1
Authors listed
Michael Björklund, Alexander Fish, Shrey Sanadhya
Audit date
August 18, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.