pith. sign in

arxiv: 2605.28738 · v1 · pith:UEGPV3XLnew · submitted 2026-05-27 · 🧮 math.FA · math.MG

The Singer-Zauner gap for equiangular tight frames

Matthew Fickus , John Jasper , Dustin G. Mixon This is my paper

Pith reviewed 2026-06-29 09:35 UTC · model grok-4.3

classification 🧮 math.FA math.MG
keywords equiangular tight framescomplex framesnon-existence resultsSinger-Zauner boundstrongly regular graphsframe theory
0
0 comments X

The pith

No complex d by n equiangular tight frame exists when d squared minus d plus one is less than n less than d squared.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that complex equiangular tight frames have a forbidden size range: for any dimension d, no such frame with n vectors can sit strictly between the Singer-Zauner size d squared minus d plus one and the absolute upper limit d squared. The argument adapts the known correspondence between real equiangular tight frames and strongly regular graphs to the complex setting. A reader would care because this pins down where constructions are possible and rules out an entire interval of candidate sizes without needing to check each one individually.

Core claim

The paper shows that there does not exist a complex d by n equiangular tight frame satisfying d squared minus d plus one less than n less than d squared. The proof proceeds by directly mimicking the real-case relationship between equiangular tight frames and strongly regular graphs, thereby obtaining the same non-existence conclusion in the complex domain.

What carries the argument

The analogy between equiangular tight frames and strongly regular graphs, used to transfer the real-case non-existence argument to the complex setting.

If this is right

  • The only possible sizes for a complex equiangular tight frame of dimension d are at most d squared minus d plus one or exactly d squared.
  • Any search for new complex equiangular tight frames can be restricted to the boundary sizes d squared minus d plus one and d squared.
  • The gap result combines with existing upper bounds to give a complete interval prohibition on intermediate frame sizes.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same graph-mimicry technique might apply to other frame properties that have real-case combinatorial translations.
  • Constructions of complex equiangular tight frames should focus on achieving exactly the Singer-Zauner size or the full d squared size rather than intermediate values.

Load-bearing premise

The relationship between real equiangular tight frames and strongly regular graphs can be directly mimicked to prove non-existence for the complex case.

What would settle it

Explicit construction of any complex d by n equiangular tight frame with d squared minus d plus one strictly less than n strictly less than d squared would falsify the claim.

read the original abstract

We show that there does not exist a complex $d\times n$ equiangular tight frame with \[ d^2-d+1<n<d^2. \] The proof, which originated from an internal model at OpenAI, mimics the relationship between real equiangular tight frames and strongly regular graphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript claims to prove that no complex d×n equiangular tight frame exists whenever d²−d+1 < n < d². The argument is obtained by directly adapting the known correspondence between real ETFs and strongly regular graphs, with the abstract stating that the proof originated from an internal model at OpenAI.

Significance. If the non-existence statement holds, the result would close the Singer-Zauner gap for complex ETFs and supply a clean, parameter-free bound in frame theory. The claim is a direct non-existence result with no fitted parameters or self-referential definitions.

major comments (2)
  1. [Abstract] Abstract: the non-existence claim rests on mimicking the real ETF–SRG reduction, yet the complex case produces a Hermitian Seidel matrix whose off-diagonal entries lie on the unit circle with arbitrary phases rather than the real ±1 entries that yield an ordinary adjacency matrix with two eigenvalues; the manuscript supplies no derivation showing that the same integrality or Krein-parameter obstructions still arise.
  2. [Main argument] Main argument: the real-case proof uses the fact that the Gram matrix off-diagonals are exactly ±1 to obtain a real symmetric Seidel matrix whose spectrum forces integral multiplicities; the complex analogue does not automatically inherit these constraints, and no explicit spectral calculation or parameter check is provided to produce the required contradiction for d²−d+1 < n < d².
minor comments (1)
  1. [Abstract] The abstract refers to an “internal model at OpenAI” as the origin of the proof; a brief sentence clarifying the mathematical steps that were verified by hand would improve transparency.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for identifying the need for explicit derivations in the adaptation from the real ETF–SRG correspondence. We address each major comment below and will incorporate the requested details.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the non-existence claim rests on mimicking the real ETF–SRG reduction, yet the complex case produces a Hermitian Seidel matrix whose off-diagonal entries lie on the unit circle with arbitrary phases rather than the real ±1 entries that yield an ordinary adjacency matrix with two eigenvalues; the manuscript supplies no derivation showing that the same integrality or Krein-parameter obstructions still arise.

    Authors: We agree that the manuscript does not contain an explicit derivation of the integrality and Krein-parameter conditions for the Hermitian case. Although the off-diagonal phases are arbitrary on the unit circle, the constant modulus together with the tight-frame condition still produces a Seidel matrix whose eigenvalues must satisfy the same integrality requirements on multiplicities. We will add a self-contained derivation of these obstructions in the revised version. revision: yes

  2. Referee: [Main argument] Main argument: the real-case proof uses the fact that the Gram matrix off-diagonals are exactly ±1 to obtain a real symmetric Seidel matrix whose spectrum forces integral multiplicities; the complex analogue does not automatically inherit these constraints, and no explicit spectral calculation or parameter check is provided to produce the required contradiction for d²−d+1 < n < d².

    Authors: The referee correctly notes that the manuscript omits the explicit spectral calculation. The constant-modulus inner products yield a Hermitian Seidel matrix whose eigenvalues are determined by the frame parameters; requiring these eigenvalues to produce integer multiplicities immediately rules out the open interval d²−d+1 < n < d². We will insert the full parameter check and multiplicity formulas in the revision. revision: yes

Circularity Check

0 steps flagged

Non-existence result via external mimicry of real ETF-SRG link; no reduction to self-inputs

full rationale

The paper states a non-existence theorem for complex ETFs in the gap d²-d+1 < n < d² and notes that its proof mimics the known real ETF to strongly regular graph correspondence. No quoted equations or steps reduce a claimed prediction or uniqueness result to a fitted parameter, self-definition, or self-citation chain. The mimicry is presented as an external analogy rather than an internal re-derivation that would force the conclusion by construction. The derivation is therefore self-contained against external benchmarks and receives the default non-circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on standard linear-algebra axioms for frames and the domain assumption that the real ETF-graph correspondence extends to the complex setting without additional structure.

axioms (1)
  • domain assumption Standard properties of equiangular tight frames and their correspondence to strongly regular graphs in the real case extend to the complex case.
    Invoked to mimic the real-case argument for non-existence.

pith-pipeline@v0.9.1-grok · 5567 in / 1073 out tokens · 28656 ms · 2026-06-29T09:35:21.344377+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 2 canonical work pages · 2 internal anchors

  1. [1]

    A. S. Bandeira, M. Fickus, D. G. Mixon, P. Wong, The road to deterministic matrices with the restricted isometry property, J. Fourier Anal. Appl. 19 (2013) 1123–1149

    2013

  2. [2]

    A. Barg, A. Glazyrin, K. A. Okoudjou, W.-H. Yu, Finite two-distance tight frames, Linear Algebra Appl. 475 (2015) 163–175

    2015

  3. [3]

    A. E. Brouwer, H. Van Maldeghem, Strongly regular graphs, Cambridge U. Press, 2022

    2022

  4. [4]

    H. Cohn, A. Kumar, Universally optimal distribution of points on spheres, J. Amer. Math. Soc. 20 (2007) 99–148. 3

    2007

  5. [5]

    Tables of the existence of equiangular tight frames

    M. Fickus, D. G. Mixon, Tables of the existence of equiangular tight frames, arXiv:1504.00253 (2015)

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  6. [6]

    R. B. Holmes, V. I. Paulsen, Optimal frames for erasures, Linear Algebra Appl. 377 (2004) 31–51

    2004

  7. [7]

    P. W. H. Lemmens, J. J. Seidel, Equiangular lines, J. Algebra 24 (1973) 494–512

    1973

  8. [8]

    D. G. Mixon, Conjectures from SampTA, July 8, 2015,https://dustingmixon.wordpress. com/2015/07/08/conjectures-from-sampta/

    2015

  9. [9]

    D. G. Mixon, Game of Sloanes, August 20, 2019,https://dustingmixon.wordpress.com/ 2019/08/20/game-of-sloanes/

    2019

  10. [10]

    D. G. Mixon, C. J. Quinn, N. Kiyavash, M. Fickus, Fingerprinting with equiangular tight frames, IEEE Trans. Inform. Theory 59 (2013) 1855–1865

    2013

  11. [11]

    J. M. Renes, R. Blume-Kohout, A. J. Scott, C. M. Caves, Symmetric informationally complete quantum measurements, J. Math. Phys. 45 (2004) 2171–2180

    2004

  12. [12]

    Singer, A theorem in finite projective geometry and some applications to number theory, Trans

    J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc. 43 (1938) 377–385

    1938

  13. [13]

    Strohmer, R

    T. Strohmer, R. W. Heath, Grassmannian frames with applications to coding and communica- tion, Appl. Comput. Harmon. Anal. 14 (2003) 257–275

    2003

  14. [14]

    All complex equiangular tight frames in dimension 3

    F. Sz¨ oll˝ osi, All complex equiangular tight frames in dimension 3, arXiv:1402.6429 (2014)

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  15. [15]

    Waldron, On the construction of equiangular frames from graphs, Linear Algebra Appl

    S. Waldron, On the construction of equiangular frames from graphs, Linear Algebra Appl. 431 (2009) 2228–2242

    2009

  16. [16]

    Welch, Lower bounds on the maximum cross correlation of signals (corresp.), IEEE Trans

    L. Welch, Lower bounds on the maximum cross correlation of signals (corresp.), IEEE Trans. Inform. Theory 20 (1974) 397–399

    1974

  17. [17]

    Zauner, Quantum designs: Foundations of a noncommutative design theory, PhD thesis, U

    G. Zauner, Quantum designs: Foundations of a noncommutative design theory, PhD thesis, U. Vienna, 1999. 4

    1999