English
Related papers

Related papers: Association schemes for diagonal groups

200 papers

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Group Theory · Mathematics 2024-11-27 Timo Velten

For $n \geq 2$ let $\Delta$ be a Dynkin diagram of rank $n$ and let $I = {1, >..., n}$ be the set of labels of $\Delta$. A group $G$ admits a weak Phan system of type $\Delta$ over $\mathbb{C}$ if $G$ is generated by subgroups $U_i$, $i \in…

Group Theory · Mathematics 2011-08-18 Ralf Köhl

An autotopism of a Latin square is a triple $(\alpha,\beta,\gamma)$ of permutations such that the Latin square is mapped to itself by permuting its rows by $\alpha$, columns by $\beta$, and symbols by $\gamma$. Let $\mathrm{Atp}(n)$ be the…

Combinatorics · Mathematics 2015-09-21 Douglas S. Stones , Petr Vojtěchovský , Ian M. Wanless

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Combinatorics · Mathematics 2024-03-05 Teng Fang , Sanming Zhou , Shenglin Zhou

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

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

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

Combinatorics · Mathematics 2022-10-27 Ada Chan , William J. Martin

In this paper, we investigate hypergroups which arise from association schemes in a canonical way; this class of hypergroups is called realizable. We first study basic algebraic properties of realizable hypergroups. Then we prove that two…

Combinatorics · Mathematics 2017-04-24 Jaiung Jun

Let $S_n$ and $A_n$ denote the symmetric group and alternating group of degree $n$ with $n\geq 3$, respectively. Let $S$ be the set of all $3$-cycles in $S_n$. The \emph{complete alternating group graph}, denoted by $CAG_n$, is defined as…

Combinatorics · Mathematics 2017-08-29 Xueyi Huang , Qiongxiang Huang

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Group Theory · Mathematics 2019-08-07 Anthony Genevois , Alexandre Martin

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

Group Theory · Mathematics 2016-06-06 R. Rajkumar , P. Devi , Andrei Gagarin

In this paper, we obtain classification results for higher-dimensional analogues of classical association schemes called association schemes on triples (ASTs). We present an algorithm that enumerates all ASTs on a fixed number of vertices…

Combinatorics · Mathematics 2022-02-21 Jose Maria P. Balmaceda , Dom Vito A. Briones

For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…

General Mathematics · Mathematics 2026-04-02 Fedor B. Lyudogovskiy

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

An $H$-decomposition of a graph $\Gamma$ is a partition of its edge set into subgraphs isomorphic to $H$. A transitive decomposition is a special kind of $H$-decomposition that is highly symmetrical in the sense that the subgraphs (copies…

Combinatorics · Mathematics 2026-05-26 Ajani De Vas Gunasekara , Alice Devillers

For a finite group G of Lie type and a prime p, we compare the automorphism groups of the fusion and linking systems of G at p with the automorphism group of G itself. When p is the defining characteristic of G, they are all isomorphic,…

Group Theory · Mathematics 2016-01-19 Carles Broto , Jesper M. Møller , Bob Oliver

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

Group Theory · Mathematics 2025-11-07 Angsuman Das , Arnab Mandal , Labani Sarkar

B. Xu characterized rank $4$ self-dual association schemes inducing three partial geometric designs by their character tables. We construct such association schemes as Schur rings over abelian $2$-groups.

Combinatorics · Mathematics 2024-06-13 Akihide Hanaki

Let V be a compact Kahler manifold. Let G' be a commutative subgroup of Aut(V) and U the set of elements of zero entropy of G'. Then U is a group and G' is isomorphic to the direct product of groups U and G where G is a subgroup of G' such…

Dynamical Systems · Mathematics 2007-05-23 T. C. Dinh , N. Sibony

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