English
Related papers

Related papers: The automorphism groups and identification of some…

200 papers

We complete the program for determining the full automorphism groups of all parafermion vertex operator algebras associated with simple Lie algebras and positive integral levels. We show that the full automorphism group of the parafermion…

Quantum Algebra · Mathematics 2024-09-25 Ching Hung Lam , Xingjun Lin , Hiroki Shimakura

For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…

Operator Algebras · Mathematics 2010-03-16 R. D. Burstein

The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…

Group Theory · Mathematics 2025-04-22 Mingzhu Chen , Natalia V. Maslova , Marianna R. Zinov'eva

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

Combinatorics · Mathematics 2022-08-15 Primož Potočnik , Micael Toledo

In his investigation on large $K$-automorphism groups of an algebraic curve, Stichtenoth obtained an upper bound on the order of the first ramification group of an algebraic curve $\cX$ defined over an algebraically closed field of…

Algebraic Geometry · Mathematics 2007-06-18 Massimo Giulietti , Gabor Korchmaros

Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\subseteq X$ or $A\subseteq Y$. Otherwise, $A$ is nontrivial. By $\alpha(X,Y)$ we denote the size of…

Combinatorics · Mathematics 2011-01-13 Jun Wang , Huajun Zhang

For $k,s\geq2$, the $s$-stable Kneser graphs are the graphs with vertex set the $k$-subsets $S$ of $\{1,\ldots,n\}$ such that the circular distance between any two elements in $S$ is at least $s$ and two vertices are adjacent if and only if…

Combinatorics · Mathematics 2015-11-24 Pablo Torres

We derive an asymptotic formula for the number of solutions in a given subfield to certain system of equations over finite fields. As an application, we construct new families of maximal cliques in generalized Paley graphs. Given integers…

Number Theory · Mathematics 2024-12-02 Greg Martin , Chi Hoi Yip

A circulant graph is a Cayley graph of a finite cyclic group. The Weisfeiler-Leman-dimension of a circulant graph $X$ with respect to the class of all circulant graphs is the smallest positive integer~$m$ such that the $m$-dimensional…

Combinatorics · Mathematics 2024-10-01 Yulai Wu , Ilia Ponomarenko

In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic…

Combinatorics · Mathematics 2015-01-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism…

Combinatorics · Mathematics 2025-12-08 Rhys J. Evans , Primož Potočnik

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…

Combinatorics · Mathematics 2024-11-11 Mikhail Muzychuk , Grigory Ryabov

A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…

Combinatorics · Mathematics 2016-04-01 Yan-Quan Feng , Jin-Xin Zhou , Yan-Tao Li

Motivated by some known problems concerning combinatorial structures associated with finite one-dimensional affine permutation groups, we study subgroups which are closed in $\operatorname{\Gamma{L}}_1(q)$. This brings us to a description…

Group Theory · Mathematics 2026-03-26 Alexander Buturlakin , Andrey V. Vasil'ev

Bujalance, Costa and Izquierdo have recently proved that all those Riemann surfaces of genus $g \ge 2$ different from $3, 6, 12, 15$ and 30, with exactly $4g$ automorphisms form an equisymmetric one-dimensional family, denoted by…

Algebraic Geometry · Mathematics 2020-06-16 Sebastián Reyes-Carocca

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Leman algorithm correctly tests the isomorphism of any two…

Combinatorics · Mathematics 2020-05-26 Alexander L. Gavrilyuk , Roman Nedela , Ilia Ponomarenko

We compute the group of automorphisms of an arbitrary ind-variety of (possibly isotropic) generalized flags. Such an ind-variety is a homogeneous ind-space for one of the ind-groups $SL(\infty)$, $O(\infty)$ or $Sp(\infty)$. We show that…

Algebraic Geometry · Mathematics 2022-01-04 Mikhail Ignatev , Ivan Penkov

In this article, we give a new class of automorphisms of Leavitt path algebras of arbitrary graphs. Consequently, we obtain Anick type automorphisms of these Leavitt path algebras and new irreducible representations of Leavitt algebras of…

Rings and Algebras · Mathematics 2021-03-02 Shigeru Kuroda , Tran Giang Nam

There exists just one regular polytope of rank larger than 3 whose full automorphism group is a projective general linear group PGL_2(q), for some prime-power q. This polytope is the 4-simplex and the corresponding group is PGL_2(5), which…

Combinatorics · Mathematics 2009-09-11 Dimitri Leemans , Egon Schulte

Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\dots,\min\{g-1, n-g\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if…

Combinatorics · Mathematics 2025-06-03 Leyou Xu , Bo Zhou