scholarly journals Two-valenced association schemes and the Desargues theorem

2019 ◽  
Vol 9 (3) ◽  
pp. 481-493
Author(s):  
Mitsugu Hirasaka ◽  
Kijung Kim ◽  
Ilia Ponomarenko
Keyword(s):  
Noncommutative Geometry ◽  
Association Scheme ◽  
Technical Condition ◽  
Association Schemes ◽  
Sufficient Condition ◽  
Desargues Theorem

AbstractThe main goal of the paper is to establish a sufficient condition for a two-valenced association scheme to be schurian and separable. To this end, an analog of the Desargues theorem is introduced for a noncommutative geometry defined by the scheme in question. It turns out that if the geometry has enough many Desarguesian configurations, then under a technical condition, the scheme is schurian and separable. This result enables us to give short proofs for known statements on the schurity and separability of quasi-thin and pseudocyclic schemes. Moreover, by the same technique, we prove a new result: given a prime p, any $$\{1,p\}$$ { 1 , p } -scheme with thin residue isomorphic to an elementary abelian p-group of rank greater than two, is schurian and separable.

scholarly journals A Spectral Equivalent Condition of the $P$-Polynomial Property for Association Schemes

10.37236/4423 ◽  
2014 ◽  
Vol 21 (3) ◽  
Author(s):  
Hiroshi Nozaki ◽  
Hirotake Kurihara
Keyword(s):  
Association Scheme ◽  
Association Schemes ◽  
Equivalent Condition ◽  
Polynomial Property ◽  
Equivalent Conditions ◽  
Symmetric Association Scheme

We give two equivalent conditions of the $P$-polynomial property of a symmetric association scheme. The first equivalent condition shows that the $P$-polynomial property is determined only by the first and second eigenmatrices of the symmetric association scheme. The second equivalent condition is another expression of the first using predistance polynomials.

scholarly journals Butson-type complex Hadamard matrices and association schemes on Galois rings of characteristic 4

2018 ◽  
Vol 6 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Takuya Ikuta ◽  
Akihiro Munemasa
Keyword(s):  
Association Scheme ◽  
Hadamard Matrix ◽  
Hadamard Matrices ◽  
Association Schemes ◽  
Roots Of Unity ◽  
Galois Rings ◽  
Type Complex ◽  
Complex Hadamard Matrix

Abstract We consider nonsymmetric hermitian complex Hadamard matrices belonging to the Bose-Mesner algebra of commutative nonsymmetric association schemes. First, we give a characterization of the eigenmatrix of a commutative nonsymmetric association scheme of class 3 whose Bose-Mesner algebra contains a nonsymmetric hermitian complex Hadamard matrix, and show that such a complex Hadamard matrix is necessarily a Butson-type complex Hadamard matrix whose entries are 4-th roots of unity.We also give nonsymmetric association schemes X of class 6 on Galois rings of characteristic 4, and classify hermitian complex Hadamard matrices belonging to the Bose-Mesner algebra of X. It is shown that such a matrix is again necessarily a Butson-type complex Hadamard matrix whose entries are 4-th roots of unity.

scholarly journals On the Torsion Units of Integral Adjacency Algebras of Finite Association Schemes

Algebra ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Allen Herman ◽  
Gurmail Singh
Keyword(s):  
Association Scheme ◽  
Association Schemes ◽  
Group Rings ◽  
The 1960S ◽  
Torsion Units

Torsion units of group rings have been studied extensively since the 1960s. As association schemes are generalization of groups, it is natural to ask about torsion units of association scheme rings. In this paper we establish some results about torsion units of association scheme rings analogous to basic results for torsion units of group rings.

Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets

1999 ◽  
Vol 51 (2) ◽  
pp. 326-346 ◽  
Author(s):  
W. J. Martin ◽  
D. R. Stinson
Keyword(s):  
Linear Programming ◽  
Association Scheme ◽  
Type Theorem ◽  
Orthogonal Arrays ◽  
Association Schemes ◽  
Theoretic Approach ◽  
Linear Programming Bound ◽  
Ordered Orthogonal Arrays

AbstractIn an earlier paper [10], we studied a generalized Rao bound for ordered orthogonal arrays and (T, M, S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We include some tables which compare this bound against two previously known bounds for ordered orthogonal arrays. Finally we show that, for even strength, the LP bound is always at least as strong as the generalized Rao bound.

Class dimension of association schemes in singular linear spaces

2017 ◽  
Vol 09 (01) ◽  
pp. 1750005
Author(s):  
Haixia Guo ◽  
You Gao
Keyword(s):  
Association Scheme ◽  
Upper Bounds ◽  
Association Schemes ◽  
Resolving Set ◽  
Linear Spaces ◽  
Set Of Points ◽  
Special Case ◽  
Singular Linear Spaces

A resolving set for an association scheme [Formula: see text] is a set of points [Formula: see text] such that, for all [Formula: see text], the ordered list of relations [Formula: see text] uniquely determines [Formula: see text], where [Formula: see text] denotes the relation [Formula: see text] containing the pair [Formula: see text] in [Formula: see text]. In this paper, we determine upper bounds on class dimension for a family of association schemes in singular linear spaces, and construct their resolving sets for a special case.

On the association schemes with the thin radical series

2019 ◽  
Vol 18 (04) ◽  
pp. 1950071
Author(s):  
Javad Bagherian
Keyword(s):  
Association Scheme ◽  
Association Schemes ◽  
Wedge Product

In this paper, we first show that the wedge product of a thin association scheme and a schurian association scheme is schurian. Then as an application of this result, we investigate the schurity problem for the association schemes having the thin radical series. We show that these association schemes are schurian under some conditions on the successive quotients of their thin radical series.

scholarly journals On Relative $t$-Designs in Polynomial Association Schemes

10.37236/4889 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Eiichi Bannai ◽  
Etsuko Bannai ◽  
Sho Suda ◽  
Hajime Tanaka
Keyword(s):  
Lower Bounds ◽  
Association Scheme ◽  
Point Of View ◽  
Association Schemes ◽  
Algebraic Characterization ◽  
Terwilliger Algebra ◽  
C Algebra ◽  
Irreducible Modules

Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$- and/or $Q$-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple $\mathbb{C}$-algebra associated with each vertex of an association scheme. We compute explicitly the Fisher type lower bounds on the sizes of relative $t$-designs, assuming that certain irreducible modules behave nicely. The two versions of relative $t$-designs turn out to be equivalent in the case of the Hamming schemes. From this point of view, we establish a new algebraic characterization of the Hamming schemes.

scholarly journals On the Connectivity of Graphs in Association Schemes

10.37236/6820 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Brian G. Kodalen ◽  
William J. Martin
Keyword(s):  
Lower Bounds ◽  
Connected Graph ◽  
Association Scheme ◽  
Undirected Graph ◽  
Association Schemes ◽  
Vertex Connectivity ◽  
Edge Connectivity

Let $(X,\mathcal{R})$ be a commutative association scheme and let $\Gamma=(X,R\cup R^\top)$ be a connected undirected  graph where $R\in \mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex connectivity) of $\Gamma$ is equal to its valency. In this paper, we prove that the deletion of the neighborhood of any vertex leaves behind at most one non-singleton component. Two vertices $a,b\in X$  are called "twins" in $\Gamma$ if they have identical neighborhoods: $\Gamma(a)=\Gamma(b)$. We characterize twins in polynomial association schemes and show that, in the absence of twins, the deletion of any vertex and its neighbors in $\Gamma$ results in a connected graph. Using this and other tools, we find lower bounds on the connectivity of $\Gamma$, especially in the case where $\Gamma$ has diameter two.

A CLASS OF ASSOCIATION SCHEMES IN WHICH ALL BASIS RELATIONS HAVE VALENCY 1 OR λ > 2

2012 ◽  
Vol 12 (01) ◽  
pp. 1250124
Author(s):  
H. MOSHTAGH ◽  
A. RAHNAMAI BARGHI
Keyword(s):  
Direct Product ◽  
Association Scheme ◽  
Association Schemes ◽  
Symmetric Basis ◽  
Basis Relation ◽  
Unique Association

In this paper, we classify the commutative association schemes with both the property that each basis relation has valency either 1 or λ > 2 for some fixed λ and the property that there is a connected, symmetric basis relation R for which R2 contains exactly two basis relations. We show that up to isomorphism, the unique association scheme with these properties is the direct product of the trivial association scheme of order 2 and the trivial association scheme of order λ + 1.

scholarly journals Characterizations of Regularity for certain $Q$-Polynomial Association Schemes

10.37236/3260 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Sho Suda
Keyword(s):  
Association Scheme ◽  
Association Schemes ◽  
Mutually Unbiased Bases ◽  
Symmetric Designs

It was shown that linked systems of symmetric designs with $a_1^*=0$ and mutually unbiased bases (MUBs) are triply regular association schemes. In this paper, we characterize triple regularity of linked systems of symmetric designs by its Krein number. And we prove that a maximal set of MUBs carries a quadruply regular association scheme and characterize the quadruple regularity of MUBs by its parameter.

Sign in / Sign up

Export Citation Format

Share Document