Results 21 to 30 of about 10,677,578 (207)

Terwilliger Algebras of Some Group Association Schemes [PDF]

open access: yes, 2019
The Terwilliger algebra plays an important role in the theory of association schemes. The present paper gives the explicit structures of the Terwilliger algebras of the group association schemes of the finite groups PSL(2, 7), A6, and ...
Oura, Manabu, Hamid, Nur
core   +1 more source

Commutative association schemes

open access: yesEuropean Journal of Combinatorics, 2009
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot theory and numerical integration.
William J. Martin, Hajime Tanaka 0001
openaire   +4 more sources

On p-covalenced association schemes

open access: yesJournal of Combinatorial Theory, Series A, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitsugu Hirasaka, Kyoung-Tark Kim
openaire   +2 more sources

Self‐dual association schemes, fusions of Hamming schemes, and partial geometric designs

open access: yes, 2023
Partial geometric designs can be constructed from basic relations of association schemes. An infinite family of partial geometric designs were constructed from the fusion schemes of certain Hamming schemes in work by Nowak et al. (2016). A general method
Xu, Bangteng, Bangteng Xu
core   +1 more source

On the Uniqueness of the Triangular Association Scheme [PDF]

open access: yesThe Annals of Mathematical Statistics, 1960
Connor [3] has shown that the relations among the parameters of the triangular association scheme themselves imply the scheme if $n \geqq 9$. This result was shown by Shrikhande [6] to hold also if $n \leqq 6$. (The problem has no meaning for $n < 4$.) This paper shows that the result holds if $n = 7$, but that it is false if $n = 8$.
openaire   +2 more sources

Self-dual codes from 3-class association schemes [PDF]

open access: yes, 2015
3-class association schemes are used to construct binary self-dual codes. We use the pure and bordered construction to get self-dual codes starting from the adjacency matrices of symmetric and non-symmetric 3-class association schemes.
Fernández Córdoba, Cristina   +3 more
core   +1 more source

Uniform Mixing and Association Schemes

open access: yesThe Electronic Journal of Combinatorics, 2017
We consider continuous-time quantum walks on distance-regular graphs. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit uniform mixing.First we apply a result due to Chan to show that the only strongly regular graphs that admit instantaneous uniform ...
Chris D. Godsil   +2 more
openaire   +3 more sources

Wreath products and projective system of non Schurian association schemes [PDF]

open access: yes, 2022
A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components are Schurian ...
Matsumoto, Makoto, Ogawa, Kento
core   +1 more source

On Quasi-thin Association Schemes

open access: yesJournal of Combinatorial Theory, Series A, 2002
An association scheme is called quasi-thin if each of its basic relations has valency 1 or 2. In this paper three sufficient conditions for a quasi-thin scheme \((X,R)\) to have an automorphism group acting transitively on \(X\) are obtained: (i) \(O^\theta(R)\cap O_\theta(R)=\{1\}\) (Lemma 4.1), (ii) \(n_{O^\theta(R)}=2\) (Theorem 4.4), and (iii) \(R\)
Mitsugu Hirasaka, Mikhail E. Muzychuk
openaire   +2 more sources

A Four-Class Association Scheme

open access: yesJournal of Combinatorial Theory, Series A, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gary L. Ebert   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy