On separability of Tatra association schemes
Combinatorics
2026-05-11 v1
Abstract
A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero -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 -separable, i.e. it is determined up to isomorphism by the tensor of its -dimensional intersection numbers.
Cite
@article{arxiv.2605.07672,
title = {On separability of Tatra association schemes},
author = {Grigory Ryabov},
journal= {arXiv preprint arXiv:2605.07672},
year = {2026}
}
Comments
10 pages