English
Related papers

Related papers: Association schemes for diagonal groups

200 papers

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

Algebraic Geometry · Mathematics 2016-05-10 Manuel Merida-Angulo , Koen Thas

We consider rational projective homogeneous varieties over an algebraically closed field of positive characteristic, namely quotients of a semi-simple group by a possibly non-reduced parabolic subgroup. We determine the group scheme…

Algebraic Geometry · Mathematics 2025-07-08 Matilde Maccan

Given the symmetric group $G = \operatorname{Sym}(n)$ and a multiplicity-free subgroup $H\leq G$, the orbitals of the action of $G$ on $G/H$ by left multiplication induce a commutative association scheme. The irreducible constituents of the…

Combinatorics · Mathematics 2023-07-07 Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

Combinatorics · Mathematics 2012-06-29 Derrick Stolee

Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…

Combinatorics · Mathematics 2018-11-30 Gang Chen , Ilia Ponomarenko

It is known that there are precisely three transitive permutation groups of degree $6$ that admit an invariant partition with three parts of size $2$ such that the kernel of the action on the parts has order $4$; these groups are called…

Combinatorics · Mathematics 2020-07-10 Ademir Hujdurović , Primož Potočnik , Gabriel Verret

If $\Gamma$ is a string C-group which is isomorphic to a transitive subgroup of the symmetric group Sym(n) (other than Sym(n) and the alternating group Alt(n)), then the rank of $\Gamma$ is at most $n/2+1$, with finitely many exceptions…

Group Theory · Mathematics 2014-10-23 Peter J. Cameron , Maria Elisa Fernandes , Dimitri Leemans , Mark Mixer

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

Combinatorics · Mathematics 2020-07-23 Hiroki Kajiura , Makoto Matsumoto , Takayuki Okuda

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

Group Theory · Mathematics 2023-05-17 Ting Lan , Weijun Liu , Fu-Gang Yin

In this article we define $G$-algebras, that is, graded algebras on which a reductive group $G$ acts as gradation preserving automorphisms. Starting from a finite dimensional $G$-module $V$ and the polynomial ring $\mathbb{C}[V]$, it is…

Rings and Algebras · Mathematics 2016-05-31 Kevin De Laet

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

Operator Algebras · Mathematics 2007-05-23 Alex Kumjian , David Pask

Let $G$ be a finite group and $G_p$ be a Sylow $p$-subgroup of $G$ for a prime $p$ in $\pi(G)$, the set of all prime divisors of the order of $G$. The automiser $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow…

Group Theory · Mathematics 2009-12-16 L. S. Kazarin , A. Martínez-Pastor , M. D. Pérez-Ramos

In this paper we characterize "large" regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that "large" association schemes become $P$-polynomial…

Combinatorics · Mathematics 2015-04-16 Hiroshi Nozaki

A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…

Combinatorics · Mathematics 2013-08-29 Nicolas Trotignon

Let $\mathbb{F}$ be an arbitrary field. In this paper, we continue studying the Terwilliger algebras of association schemes over $\mathbb{F}$ that were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. We determine…

Combinatorics · Mathematics 2023-09-06 Yu Jiang

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…

Rings and Algebras · Mathematics 2023-10-12 Adrián Rodrigo-Escudero

Let $G$ be a graph with vertex set $V(G)$, $f$ a permutation of $V(G)$. Define $\delta_f(G)=|d(x,y)-d(f(x),f(y))|$ and $\delta_f(G)=\Sigma\delta_f(x,y)$, where the sum is taken over all unordered pair $x$, $y$ of distinct vertices of $G$.…

Combinatorics · Mathematics 2023-12-01 Songnian Xu

A new infinite series of rational affine algebraic varieties is constructed whose automorphism group contains the automorphism group ${\rm Aut}(F_n)$ of the free group $F_n$ of rank $n$. The automorphism groups of such varieties are…

Algebraic Geometry · Mathematics 2023-07-14 Vladimir L. Popov

Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…

Group Theory · Mathematics 2013-09-23 Gareth A. Jones
‹ Prev 1 3 4 5 6 7 10 Next ›