arxiv: 2605.07672 · v1 · submitted 2026-05-08 · 🧮 math.CO

Recognition: no theorem link

On separability of Tatra association schemes

Grigory Ryabov

Pith reviewed 2026-05-11 02:07 UTC · model grok-4.3

classification 🧮 math.CO

keywords association schemesTatra association schemes2-separabilityintersection numbersbilinear formsfinite fieldscombinatorial structures

0 comments

The pith

Every Tatra association scheme is 2-separable, fixed up to isomorphism by its 2-dimensional intersection numbers tensor.

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

The paper proves that Tatra association schemes, built from symmetric bilinear forms on equivalence classes of nonzero 2-dimensional vectors modulo subgroups of the multiplicative group of a finite field, are 2-separable. This means the full scheme structure is recovered from the tensor recording how many common neighbors three points have within each relation. A sympathetic reader would care because this shows these schemes carry enough information in their triple-wise data to pin down the isomorphism type without needing the complete set of intersection numbers.

Core claim

In the present paper, we prove that every such association scheme is 2-separable, i.e. it is determined up to isomorphism by the tensor of its 2-dimensional intersection numbers.

What carries the argument

The Tatra association scheme itself, constructed from a symmetric bilinear form on equivalence classes of nonzero 2-dimensional vectors modulo a subgroup of the multiplicative group of a finite field, together with its 2-dimensional intersection numbers tensor that encodes the separability.

If this is right

Matching 2-dimensional intersection tensors imply the schemes are isomorphic.
The full intersection array is not required to distinguish or classify these schemes.
The separability property holds uniformly for every valid choice of the subgroup and bilinear form in the construction.

Where Pith is reading between the lines

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

The same 2-separability technique might apply to other association schemes built from bilinear forms or finite geometries.
Algorithms that test isomorphism of these schemes could operate using only the 2D tensor for speed.
One could ask whether the same schemes are also 3-separable or satisfy higher separability conditions.

Load-bearing premise

The object must be exactly a Tatra association scheme arising from the symmetric bilinear form construction on the specified equivalence classes of 2-dimensional vectors over a finite field.

What would settle it

Two non-isomorphic Tatra association schemes that nevertheless share the same tensor of 2-dimensional intersection numbers would disprove the claim.

read the original abstract

A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the present paper, we prove that every such association scheme is $2$-separable, i.e. it is determined up to isomorphism by the tensor of its $2$-dimensional intersection numbers.

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.

Desk Editor's Note private letter to a colleague

The paper proves Tatra association schemes are 2-separable by showing their 2-dimensional intersection numbers recover the defining parameters uniquely.

read the letter

The core claim is that every Tatra association scheme is determined up to isomorphism by the tensor of its 2-dimensional intersection numbers. The schemes come from symmetric bilinear forms on the quotient of nonzero 2-vectors over a finite field by a subgroup of the multiplicative group, and the paper computes the intersection numbers p_ij^k explicitly as functions of q, the form parameters, and the subgroup order. Those numbers then pin down q and the orbit data, so the scheme follows uniquely. The argument stays inside the standard axioms and uses the explicit relations without case splits or extra non-degeneracy assumptions beyond what the construction already requires to be an association scheme. That is the main new piece: a clean uniqueness result for this specific family. It gives a practical classification tool for anyone enumerating or recognizing these objects in algebraic combinatorics. The soft spots are limited. The result only applies when the input is genuinely a Tatra scheme from the stated construction; if the bilinear form fails to produce a valid scheme, the separability statement does not kick in. No circularity or hidden fitting appears, and the derivation looks direct. The paper is aimed at specialists working on association schemes, coherent configurations, or their applications to designs and codes. A reader already familiar with separability questions will find the explicit formulas and the uniqueness proof useful. It deserves a serious referee because the claim is precise, the method is standard but applied without gaps, and the result is new for this class.

Referee Report

0 major / 2 minor

Summary. The paper defines Tatra association schemes as those arising from symmetric bilinear forms on the equivalence classes of nonzero 2-dimensional vectors over a finite field F_q, taken modulo a subgroup H of F_q^*. It proves that every such scheme is 2-separable: the tensor of its 2-dimensional intersection numbers p_{ij}^k determines the scheme up to isomorphism. The argument proceeds by explicitly computing these intersection numbers as functions of q, the form parameters, and |H|, then showing that the resulting values recover q and the orbit data uniquely.

Significance. If the derivation holds, the result strengthens the theory of separability for association schemes by establishing a parameter-free recovery of the defining data from the 2-dimensional intersection tensor alone. The explicit, case-free computation of the p_{ij}^k and the direct appeal to the standard axioms of association schemes (without additional non-degeneracy assumptions) constitute a clear technical contribution to the classification of schemes arising from finite geometries and bilinear forms.

minor comments (2)

[§2] The notation for the quotient space of 2-dimensional vectors modulo H in the opening definition could be accompanied by a small explicit example (e.g., q=5 or q=7) to clarify the equivalence classes for readers outside the immediate subfield.
[§1] A brief remark on the characteristic restrictions implicitly required for the bilinear form to yield a valid association scheme would help delineate the scope of the result.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance.

Circularity Check

0 steps flagged

Derivation is self-contained algebraic proof with no circular reductions

full rationale

The manuscript defines Tatra schemes explicitly via symmetric bilinear forms on the quotient of nonzero 2-vectors modulo H ≤ F_q^*, derives the 2-dimensional intersection numbers p_{ij}^k as closed-form functions of q, the form parameters, and |H|, and proves these numbers recover the original parameters injectively. This establishes 2-separability directly from the construction and the axioms of association schemes. No self-citations are load-bearing, no parameters are fitted then renamed as predictions, and no uniqueness is imported from prior author work; the argument is case-free and uses only explicit algebraic identities internal to the paper.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the standard algebraic properties of finite fields and bilinear forms together with the axioms of association schemes; no free parameters, ad-hoc axioms, or new postulated entities are introduced.

axioms (2)

standard math Finite fields possess the usual field operations, inverses, and characteristic properties.
The construction of Tatra schemes is defined using these field structures.
domain assumption Symmetric bilinear forms on vector spaces over finite fields yield well-defined equivalence classes and relations that form an association scheme.
This is the explicit definition given for Tatra association schemes.

pith-pipeline@v0.9.0 · 5340 in / 1425 out tokens · 50444 ms · 2026-05-11T02:07:26.926182+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

[1]

Brouwer, A

A. Brouwer, A. Cohen, A. Neumaier, Distance-regular graphs, Springer, Heidelberg (1989)

work page 1989
[2]

G. Chen, J. He, I. Ponomarenko, and A. Vasil'ev, A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers, Ars Math. Contemp. 21, No. 1 (2021), P1.10, 18 pp

work page 2021
[3]

G. Chen, I. Ponomarenko, Coherent configurations associated with TI-subgroups, J. Algebra, 488 (2017), 201--229

work page 2017
[4]

G. Chen, I. Ponomarenko, Coherent configurations, Central China Normal University Press, Wuhan (2019)

work page 2019
[5]

Drabkin, C

B. Drabkin, C. French, On a class of non-commutative imprimitive association schemes of rank 6 , Commun. Algebra, 43, No. 9 (2015), 4008--4041

work page 2015
[6]

Evdokimov, I

S. Evdokimov, I. Ponomarenko, Separability number and schurity number of coherent configurations, Electron. J. Combin., 7 (2000), Research Paper 31

work page 2000
[7]

Evdokimov, I

S. Evdokimov, I. Ponomarenko, Characterization of cyclotomic schemes and normal Schur rings over a cyclic group, St. Petersburg Math. J., 14, No. 2 (2003), 189--221

work page 2003
[8]

Hanaki, I

A. Hanaki, I. Miyamoto, Classification of association schemes with small number of vertices. http://math.shinshu-u.ac.jp/*hanaki/as/ (2016)

work page 2016
[9]

Hirasaka, K

M. Hirasaka, K. Kim, I. Ponomarenko, Schurity and separability of quasiregular coherent configurations, J. Algebra, 510 (2018), 180--204

work page 2018
[10]

Kharaghani, S

H. Kharaghani, S. Suda, Non-commutative association schemes and their fusion association schemes, Finite Fields Their Appl., 52 (2018), 108--125

work page 2018
[11]

Muzychuk, I

M. Muzychuk, I. Ponomarenko, On Pseudocyclic association schemes, Ars Math. Contemp. 5, No. 1 (2012), 1--25

work page 2012
[12]

Muzychuk, G

M. Muzychuk, G. Ryabov, Directed strongly regular graphs and divisible design graphs from Tatra association schemes, submitted to J. Algebr. Comb., https://arxiv.org/abs/2601.09955 [math.CO] (2026), 22 pages

work page arXiv 2026
[13]

Nevo, Polyhedrons and PBIBDs from hyperbolic manifolds, Geom

E. Nevo, Polyhedrons and PBIBDs from hyperbolic manifolds, Geom. Ded. 178 (2015), 103--110

work page 2015
[14]

Ponomarenko, G

I. Ponomarenko, G. Ryabov, On pseudofrobenius imprimitive association schemes, J. Algebr. Comb., 57, No. 2 (2023), 385--402

work page 2023
[15]

Ponomarenko, A

I. Ponomarenko, A. Vasil'ev, Cartan coherent configurations, J. Algebr. Comb., 45, No. 2 (2017), 525--552

work page 2017
[16]

Reichard, Tatra schemes and their mergings, in: Isomorphisms, symmetry and computations in algebraic graph theory, eds

S. Reichard, Tatra schemes and their mergings, in: Isomorphisms, symmetry and computations in algebraic graph theory, eds. G. A. Jones et al., Springer Proceedings in Mathematics and Statistics, 305 (2020), 219--234

work page 2020
[17]

J. B. Rosser, L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math., 6, No. 1 (1962), 64--94

work page 1962