English
Related papers

Related papers: Almost amorphic association schemes

200 papers

An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…

Combinatorics · Mathematics 2025-03-07 Edwin R. van Dam , Jack H. Koolen , Yanzhen Xiong

Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a…

Combinatorics · Mathematics 2007-05-23 James A. Davis , Qing Xiang

Let $\mathcal{R}$ be an association scheme with nontrivial relations $A_1,\ldots,A_d$. We call $\mathcal{R}$ amorphic if every possible fusion of its nontrivial relations gives rise to a fusion scheme. We define the fusing-relations…

Combinatorics · Mathematics 2026-05-01 Yanzhen Xiong

An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…

Combinatorics · Mathematics 2010-12-06 Jianmin Ma

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

Group Theory · Mathematics 2020-09-25 Peter J. Cameron , Sean Eberhard

An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…

Combinatorics · Mathematics 2007-05-23 Ilia Ponomarenko , A. Rahnamai Barghi

Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence…

Combinatorics · Mathematics 2017-10-20 Akihiro Munemasa , Takuya Ikuta

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we study 4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of skew-symmetric…

Combinatorics · Mathematics 2011-07-05 Jianmin Ma , Kaishun Wang

An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity…

Combinatorics · Mathematics 2017-01-13 Edwin R. van Dam , Jack H. Koolen , Jongyook Park

A (di)graph $\Gamma$ generates a commutative association scheme $\mathfrak{X}$ if and only if the adjacency matrix of $\Gamma$ generates the Bose-Mesner algebra of $\mathfrak{X}$. In [17, Theorem 1.1], Monzillo and Penji\'{c} proved that,…

Combinatorics · Mathematics 2025-02-24 Yuefeng Yang

An irreducible character $\chi$ of an association scheme is called nonlinear if the multiplicity of $\chi$ is greater than $1$. The main result of this paper gives a characterization of commutative association schemes with at most two…

Combinatorics · Mathematics 2016-08-30 Javad Bagherian

In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…

Combinatorics · Mathematics 2024-06-07 Francesco Colangelo , Giusy Monzillo , Alessandro Siciliano

For any positive integer $m$, the complete graph on $2^{2m}(2^m+2)$ vertices is decomposed into $2^m+1$ commuting strongly regular graphs, which give rise to a symmetric association scheme of class $2^{m+2}-2$. Furthermore, the…

Combinatorics · Mathematics 2017-01-23 Hadi Kharaghani , Sara Sasani , Sho Suda

One may think of a $d$-class association scheme as a $(d+1)$-dimensional matrix algebra over $\mathbb{R}$ closed under Schur products. In this context, an imprimitive scheme is one which admits a subalgebra of block matrices, also closed…

Combinatorics · Mathematics 2019-05-20 Brian G. Kodalen

In this paper we determine all fusions of the association scheme $\mathcal{A} \otimes \mathcal{A}$, where $\mathcal{A}$ is the symmetric rank $3$ association scheme corresponding to a strongly regular graph. This includes both guaranteed…

Combinatorics · Mathematics 2023-06-02 Allen Herman , Neha Joshi

We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov's…

Combinatorics · Mathematics 2011-10-07 Tao Feng , Fan Wu , Qing Xiang

Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…

Combinatorics · Mathematics 2019-04-23 Caroline Grant Melles , David Joyner

In this paper we show that for any fusion $\mathcal{B}$ of an association scheme $\mathcal{A}$, the generalized Hamming scheme $H(n,\mathcal{B})$ is a nontrivial fusion of $H(n,\mathcal{A})$. We analyze the case where $\mathcal{A}$ is the…

Combinatorics · Mathematics 2022-08-08 Allen Herman , Neha Joshi , Karen Meagher

The action of $PGL(2,2^m)$ on the set of exterior lines to a nonsingular conic in $PG(2,2^m)$ affords an association scheme, which was shown to be pseudocyclic in Hollmann's thesis in 1982. It was further conjectured in Hollmann's thesis…

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

A Latin square has six conjugate Latin squares obtained by uniformly permuting its (row, column, symbol) triples. We say that a Latin square has conjugate symmetry if at least two of its six conjugates are equal. We enumerate Latin squares…

Combinatorics · Mathematics 2021-12-09 Brendan D. McKay , Ian M. Wanless
‹ Prev 1 2 3 10 Next ›