pith. sign in

arxiv: 2507.18960 · v3 · submitted 2025-07-25 · 🧮 math.CO

Roux schemes which carry association schemes locally

Alexander L. Gavrilyuk , Jesse Lansdown , Akihiro Munemasa , Sho Suda This is my paper

Pith reviewed 2026-05-19 03:03 UTC · model grok-4.3

classification 🧮 math.CO
keywords roux schemesassociation schemesroux matricesthin radicalequiangular linesHoggar configurationeigenmatrices
0
0 comments X

The pith

Roux schemes can be produced from association schemes, and those where a vertex neighborhood induces an association scheme with the same number of relations as the thin radical are characterized, including a unique example from the Hoggar 8

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

The paper shows a construction that turns any association scheme into a roux matrix, which then combines with a group representation to make a roux scheme. It characterizes the roux schemes in which the neighborhood of a vertex forms its own association scheme that has exactly as many relations as the thin radical. A reader would care because roux schemes link combinatorial objects to equiangular tight frames and doubly transitive lines, so the results give new examples and settle uniqueness for the known set of 64 lines in complex 8-space.

Core claim

A roux scheme is an association scheme formed from a special roux matrix and the regular permutation representation of an associated group. Roux matrices can be produced from association schemes, and roux schemes are characterized for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical. The 64 equiangular lines in C^8 constructed by Hoggar form a roux scheme that is unique up to isomorphism as determined by its parameters. Roux schemes are also characterized by their eigenmatrices, and new families arise from the construction.

What carries the argument

The roux matrix, a special matrix that together with the regular permutation representation of an associated group defines the association scheme and permits analysis of its local neighborhood structure.

If this is right

  • Any association scheme yields a roux matrix via the given construction.
  • Roux schemes exist in which the neighborhood of a vertex induces an association scheme with the same number of relations as the thin radical.
  • The configuration of 64 equiangular lines in C^8 is a roux scheme unique up to isomorphism by its parameters.
  • Roux schemes admit a characterization in terms of their eigenmatrices.
  • The construction produces new families of roux schemes.

Where Pith is reading between the lines

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

  • The construction could generate additional equiangular tight frames from previously studied association schemes.
  • The uniqueness result for the Hoggar example may help classify similar line configurations in other dimensions.
  • Local induction of association schemes could relate to higher symmetry or transitivity conditions in combinatorial designs.

Load-bearing premise

The roux matrix must arise from the regular permutation representation of an associated group so that the local neighborhood can be compared directly to the thin radical.

What would settle it

A concrete counterexample would be a roux scheme in which a vertex neighborhood induces an association scheme whose number of relations differs from that of the thin radical, or a second non-isomorphic scheme sharing the parameters of the Hoggar configuration.

read the original abstract

A roux scheme is an association scheme formed from a special "roux" matrix and the regular permutation representation of an associated group. They were introduced by Iverson and Mixon for their connection to equiangular tight frames and doubly transitive lines. We show how roux matrices can be produced from association schemes and characterise roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical. An important example arises from the $64$ equiangular lines in $\mathbb{C}^8$ constructed by Hoggar which we prove is unique (determined by its parameters up to isomorphism). We also characterise roux schemes by their eigenmatrices and provide new families of roux schemes using our construction.

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

0 major / 3 minor

Summary. The manuscript shows how roux matrices can be produced from association schemes, characterises roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical, proves that the 64 equiangular lines in C^8 constructed by Hoggar form a roux scheme that is unique up to isomorphism as determined by its parameters, characterises roux schemes by their eigenmatrices, and constructs new families of roux schemes via the given method.

Significance. If the central claims hold, the work advances the theory of roux schemes by supplying explicit constructions grounded in standard association-scheme properties and a parameter-based uniqueness result for the Hoggar example. This strengthens connections to equiangular tight frames without introducing circularity or hidden constraints on the scheme parameters.

minor comments (3)
  1. The abstract states that the Hoggar example is 'unique (determined by its parameters up to isomorphism)'; this phrasing should be expanded in the introduction to clarify that the intersection numbers and Krein parameters admit only one feasible fusion consistent with the roux matrix.
  2. §2: the definition and notation for the thin radical are introduced but a short comparison with the corresponding notion in the Iverson-Mixon reference would help readers who are not already familiar with roux schemes.
  3. The eigenmatrix characterisation in the later section would benefit from an explicit statement of how the roux condition translates into constraints on the eigenmatrix entries.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our manuscript on roux schemes, including the constructions from association schemes, the characterization of local neighborhoods matching the thin radical, the uniqueness proof for the Hoggar 64 equiangular lines in C^8 up to isomorphism by parameters, the eigenmatrix characterization, and the new families constructed. We appreciate the recommendation for minor revision and will prepare a revised version accordingly.

Circularity Check

0 steps flagged

No significant circularity; derivations are independent

full rationale

The paper introduces new constructions producing roux matrices from association schemes, characterizes roux schemes via neighbourhood induction matching the thin radical's relation count using explicit relation algebra and induced sub-scheme axioms, and proves parameter-based uniqueness for the Hoggar 64-line example in C^8 via intersection numbers and Krein parameters. These steps rely on standard association scheme theory and direct proofs rather than self-definitions, fitted inputs renamed as predictions, or load-bearing self-citations; the initial definition references prior non-overlapping work by Iverson and Mixon but the central claims do not reduce to it by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claims rest on standard definitions of association schemes, roux matrices, thin radicals, and eigenmatrices from prior literature, with no new free parameters, invented entities, or ad-hoc axioms introduced in the abstract.

axioms (1)
  • domain assumption Standard axioms and definitions of association schemes and roux schemes as introduced by Iverson and Mixon.
    The paper assumes these background combinatorial structures and their properties hold as previously defined.

pith-pipeline@v0.9.0 · 5658 in / 1391 out tokens · 63078 ms · 2026-05-19T03:03:38.739707+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    We show how roux matrices can be produced from association schemes and characterise roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages

  1. [1]

    Bannai, E

    E. Bannai, E. Bannai, and H. Bannai, Uniqueness of certain association schemes , European Journal of Combinatorics 25 (2004), 261–267

    work page 2004

  2. [2]

    I: Association schemes , The Ben- jamin/Cummings Publishing Co., Inc., 1984

    Eiichi Bannai and Tatsuro Ito, Algebraic combinatorics. I: Association schemes , The Ben- jamin/Cummings Publishing Co., Inc., 1984

    work page 1984

  3. [3]

    P. J. Cameron, J. M. Goethals, and J. J. Seidel, Strongly regular graphs having strongly regular subconstituents, Journal of Algebra 55 (1978), 257–280

    work page 1978

  4. [4]

    Coolsaet and A

    K. Coolsaet and A. Juriˇ si´ c,Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs, Journal of Combinatorial Theory, Series A 115 (2008), no. 6, 1086–1095

    work page 2008

  5. [5]

    A. L. Gavrilyuk, J. Vidali, and J. S. Williford, On few-class Q-polynomial association schemes: feasible parameters and nonexistence results, Ars Mathematica Contemporanea 20 (2021), 103– 127

    work page 2021

  6. [6]

    Gavrilyuk and S

    A.L. Gavrilyuk and S. Suda, Uniqueness of an association scheme related to the Witt design on 11 points, Designs, Codes and Cryptography 92 (2024), 205–209

    work page 2024

  7. [7]

    C. D. Godsil and A. D. Hensel, Distance regular covers of the complete graph , Journal of Com- binatorial Theory, Series B 56 (1992), 205–238

    work page 1992

  8. [8]

    Hanaki and I

    A. Hanaki and I. Miyamoto, Classification of association schemes with small vertices , Available at http://math.shinshu-u.ac.jp/~hanaki/as/

    work page

  9. [9]

    S. G. Hoggar, 64 lines from a quaternionic polytope , Geometriae Dedicata 69 (1998), no. 3, 287–289

    work page 1998

  10. [10]

    J. W. Iverson and D. G. Mixon, Doubly transitive lines I: Higman pairs and roux , Journal of Combinatorial Theory, Series A 185 (2022), Paper No. 105540, 47 pp

    work page 2022

  11. [11]

    1, 37–76

    , Doubly transitive lines II: Almost simple symmetries, Algebraic Combinatorics 7 (2024), no. 1, 37–76

    work page 2024

  12. [12]

    E. R. van Dam and M. Muzychuk, Some implications on amorphic association schemes , Journal of Combinatorial Theory, Series A 117 (2010), 111–127

    work page 2010