Roux Scheme in Association Schemes

• Roux schemes are commutative association schemes defined via a roux matrix over a finite abelian group, characterized by specific algebraic axioms and quadratic relations.
• They bridge group theory and combinatorics by encoding structures from doubly transitive lines, equiangular tight frames, and Schurian schemes through spectral methods.
• Roux schemes are constructed from local association schemes and feature eigenmatrices derived from character theory, highlighting their uniqueness and practical applications in graph coverings.

to=arxiv_search.query 天天彩票怎么 天天中彩票官网json {"query":"roux scheme association scheme Iverson Mixon Gavrilyuk Lansdown Munemasa Suda", "max_results": 5, "sort_by": "relevance"}

to=arxiv_search.query 彩神争霸高json {"query":"roux scheme association scheme", "max_results": 10, "sort_by": "relevance"} In algebraic combinatorics, a roux scheme is a commutative association scheme obtained from a special matrix over the group algebra of a finite abelian group. The notion was introduced in the study of doubly transitive lines, equiangular tight frames, and related Schurian association schemes (Iverson et al., 2018). Subsequent work showed that roux schemes can also be produced from ordinary association schemes, characterized by their eigenmatrices, and recognized from the association scheme induced on a local neighbourhood when that local scheme has as many relations as the thin radical (Gavrilyuk et al., 25 Jul 2025).

1. Definition through a roux matrix

Let $\Gamma$ be a finite abelian group, written multiplicatively, and let $B\in \mathbb{C}[\Gamma]^{n\times n}$. A roux for $\Gamma$ is an $n\times n$ matrix satisfying the four axioms

$\text{(R1)}\quad B_{ii}=0,$

$$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$

$$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$

The associated roux scheme is obtained by applying the Cayley regular representation entrywise to $B$: if $[\cdot]$ denotes the injective $B\in \mathbb{C}[\Gamma]^{n\times n}$0-algebra homomorphism from $B\in \mathbb{C}[\Gamma]^{n\times n}$1 into ordinary complex matrices, then the matrices

$B\in \mathbb{C}[\Gamma]^{n\times n}$2

are the adjacency matrices of the scheme (Iverson et al., 2018).

A central simplification is the quadratic characterization. If $B\in \mathbb{C}[\Gamma]^{n\times n}$3 satisfies (R1)–(R3), then $B\in \mathbb{C}[\Gamma]^{n\times n}$4 is a roux if and only if

$B\in \mathbb{C}[\Gamma]^{n\times n}$5

for some coefficients $B\in \mathbb{C}[\Gamma]^{n\times n}$6, called the roux parameters. In this case,

$B\in \mathbb{C}[\Gamma]^{n\times n}$7

This quadratic relation is the basic algebraic signature of the theory (Iverson et al., 2018).

2. Schurian origin and Higman pairs

Roux schemes were introduced as a bridge between doubly transitive lines and Schurian association schemes. For a finite group $B\in \mathbb{C}[\Gamma]^{n\times n}$8 and subgroup $B\in \mathbb{C}[\Gamma]^{n\times n}$9, the Schurian scheme of $\Gamma$0 is built from double cosets $\Gamma$1. The relevant group-theoretic input is a Higman pair $\Gamma$2, defined by a subgroup $\Gamma$3, its normalizer $\Gamma$4, and a key element $\Gamma$5 satisfying conditions denoted (H1)–(H5) in the original paper (Iverson et al., 2018).

The classification theorem is exact: the Schurian scheme of $\Gamma$6 is isomorphic to a roux scheme if and only if $\Gamma$7 is a Higman pair (Iverson et al., 2018). Moreover, from a Higman pair one constructs a roux matrix for the abelian group $\Gamma$8. Choosing coset representatives $\Gamma$9 for $n\times n$0 in $n\times n$1 and $n\times n$2 for $n\times n$3 in $n\times n$4, one defines $n\times n$5 and, for $n\times n$6, lets $n\times n$7 be the unique $n\times n$8 such that

$n\times n$9

The resulting matrix is a roux for $\text{(R1)}\quad B_{ii}=0,$0, and its roux scheme is isomorphic to the Schurian scheme of $\text{(R1)}\quad B_{ii}=0,$1 (Iverson et al., 2018).

This Schurian viewpoint clarifies why roux schemes were introduced in the first place. They abstract the combinatorial structure appearing in doubly transitive line systems while remaining inside the language of association schemes.

3. Internal characterization and spectral structure

Roux schemes also admit an intrinsic characterization inside association scheme theory. An association scheme is isomorphic to a roux scheme if and only if it is commutative, its thin radical acts regularly on the other adjacency matrices, and at least one of those other adjacency matrices is symmetric (Iverson et al., 2018). In this sense, a roux scheme is a commutative scheme obtained by “thickening” a thin scheme by a single regular orbit of non-thin relations.

The primitive idempotents of a roux scheme are explicitly controlled by the character theory of the underlying abelian group. If $\text{(R1)}\quad B_{ii}=0,$2 is the character group and

$\text{(R1)}\quad B_{ii}=0,$3

then one defines

$\text{(R1)}\quad B_{ii}=0,$4

The primitive idempotents are scalar multiples of

$\text{(R1)}\quad B_{ii}=0,$5

and their ranks are

$\text{(R1)}\quad B_{ii}=0,$6

Thus the idempotent structure is parameterized by $\text{(R1)}\quad B_{ii}=0,$7 (Iverson et al., 2018).

Later work gave a converse spectral characterization. If the first eigenmatrix has the block form

$\text{(R1)}\quad B_{ii}=0,$8

where $\text{(R1)}\quad B_{ii}=0,$9 is the character table of the thin radical and $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$0 are diagonal matrices, and if at least one entirely real column corresponding to a thick relation occurs, then the scheme is a roux scheme (Gavrilyuk et al., 25 Jul 2025). This makes roux schemes spectrally recognizable.

4. Relation to equiangular lines, ETFs, and DRACKNs

A decisive feature of the theory is that a roux matrix simultaneously encodes an association scheme and, after character evaluation, a system of equiangular lines. If $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$1 satisfies (R1)–(R3), then $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$2 is a roux if and only if for every $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$3, the evaluated matrix $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$4 is the signature matrix of an equiangular tight frame (Iverson et al., 2018). This is the basic mechanism behind roux lines.

The associated line systems can also be characterized intrinsically. A sequence of linearly dependent complex lines is a roux line set if and only if it is equiangular, admits unit-norm representatives whose signature matrix entries are $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$5th roots of unity for some $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$6, and the Gram matrix of all phased copies carries an association scheme; in that case the carried scheme is the corresponding roux scheme, and a scalar multiple of the Gram matrix is a primitive idempotent of that scheme (Iverson et al., 2018).

Roux schemes also interact with graph-theoretic objects. The symmetric matrix $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$7 is the adjacency matrix of the roux graph. Roux graphs generalize regular abelian DRACKNs: every regular abelian $$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$8-DRACKN is a roux graph for a roux with parameters

$$\text{(R2)}\quad B_{ij}\in \Gamma \qquad (i\neq j),$$9

and, conversely, a roux graph has diameter $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$0 if $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$1 for every $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$2, in which case it is a regular antipodal cover of the complete graph (Iverson et al., 2018). This places roux schemes at the intersection of association schemes, complex line packings, and antipodal graph coverings.

5. Construction from local association schemes

A major later development was the realization that roux matrices can be produced directly from ordinary association schemes. Let $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$3 be an abelian group of order $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$4, and let $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$5 be an $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$6-class association scheme whose non-diagonal relations are indexed by $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$7. From the adjacency matrices of $$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$8, one forms a matrix

$$\text{(R3)}\quad B_{ji}=(B_{ij})^{-1} \qquad (i\neq j),$$9

This matrix is a roux matrix if and only if the local relations satisfy

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$0

and the intersection numbers satisfy

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$1

When these conditions hold, the roux parameters are exactly the valencies $$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$2 of $$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$3 (Gavrilyuk et al., 25 Jul 2025).

This leads to a canonical construction, denoted

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$4

whose thin relations are

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$5

and whose thick relations are

$$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$6

where $$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$7 is the regular permutation matrix of $$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$8 (Gavrilyuk et al., 25 Jul 2025).

The local theory is equally rigid. If $$\text{(R4)}\quad \{gI\}_{g\in\Gamma}\ \text{and}\ \{gB\}_{g\in\Gamma}\ \text{span an algebra } \mathscr{A}(B).$$9 is a roux scheme with thin radical $B$0, and the neighbourhood of some vertex with respect to some thick relation induces a $B$1-class local association scheme $B$2, then

$B$3

More generally, if a commutative association scheme has thin radical $B$4 acting regularly on the thick relations, then it is uniquely recoverable from $B$5 and the neighbourhood structure of any thick relation about any vertex (Gavrilyuk et al., 25 Jul 2025). This is the sense in which some roux schemes “carry association schemes locally.”

6. Examples, uniqueness, and later developments

The theory includes both Schurian and non-Schurian examples. Early constructions include roux matrices arising from antisymmetric conference matrices over $B$6, symplectic examples over finite fields, and matrices related to Hoggar lines (Iverson et al., 2018). Later work used the local-construction theorem to produce new families from amorphic pseudocyclic association schemes with elementary abelian $B$7-groups, as well as cyclic-group examples (Gavrilyuk et al., 25 Jul 2025).

A distinguished case is provided by the $B$8 equiangular lines in $B$9 constructed by Hoggar. The later paper identifies the corresponding roux scheme as an important example and proves that it is unique, determined by its parameters up to isomorphism (Gavrilyuk et al., 25 Jul 2025). This is significant because Hoggar’s lines are among the most rigid and symmetric ETF configurations, and the roux-scheme formalism captures that rigidity at the level of association schemes.

In contemporary usage, a roux scheme is therefore best understood as a highly structured commutative association scheme built from an abelian thin radical and one regular orbit of thick relations, with three equivalent faces. It can be defined algebraically through a roux matrix, recognized internally through thin-radical regularity and spectral form, and interpreted geometrically through ETFs, roux lines, and abelian covers of complete graphs (Iverson et al., 2018). The later local theory shows that the concept is not merely a reformulation of Higman-pair constructions, but a framework in which global structure, eigenmatrices, and induced neighbourhood schemes can all determine one another (Gavrilyuk et al., 25 Jul 2025).