English
Related papers

Related papers: The Flag-Transitive and Point-Imprimitive Symmetri…

200 papers

It is clear that the full automorphism group of the $(15,8,4)$-design of points and hyperplane complements of ${\rm PG}(3,2)$ is ${\rm GL}(4,2)$. Using methods of point-line geometries, we determine the full automorphism groups of the…

Combinatorics · Mathematics 2025-07-15 Mark Pankov , Krzysztof Petelczyc , Mariusz Żynel

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…

Representation Theory · Mathematics 2017-03-22 Arvind Ayyer , Amritanshu Prasad , Steven Spallone

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

Quantum Algebra · Mathematics 2025-11-12 Josse van Dobben de Bruyn , David E. Roberson , Simon Schmidt

We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree v and does not occur…

Combinatorics · Mathematics 2013-08-05 Max Neunhoeffer , Cheryl E Praeger

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Discrete Mathematics · Computer Science 2015-06-17 Pavel Klavík , Peter Zeman

A code $C$ in the Hamming graph $\varGamma=H(m,q)$ is $2\it{\text{-neighbour-transitive}}$ if ${\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\varGamma$ with respect…

Combinatorics · Mathematics 2018-06-28 Neil I. Gillespie , Daniel R. Hawtin , Cheryl E. Praeger

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

Combinatorics · Mathematics 2019-06-26 Gareth A. Jones

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

Combinatorics · Mathematics 2017-07-18 Da-Wei Yang , Yan-Quan Feng , Jin Ho Kwak , Jaeun Lee

A classification of homogeneous compact Tits geometries of irreducible spherical type, with connected panels and admitting a compact flag-transitive automorphism group acting continuously on the geometry, has been obtained by Kramer and…

Geometric Topology · Mathematics 2019-10-09 Antonio Pasini

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

Group Theory · Mathematics 2014-12-15 Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

Dynamical Systems · Mathematics 2024-03-26 Bruce P. Kitchens

A cap in PG(r,q) is a set of points, no three of which are collinear. A cap is said to be transitive if its automorphism group in PGammaL(r+1,q) acts transtively on the cap, and co-transitive if the automorphism group acts transtively on…

Combinatorics · Mathematics 2007-05-23 A. Cossidente , O. H. King

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

Group Theory · Mathematics 2024-12-05 Yunsong Gan , Weijun Liu , Binzhou Xia

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

We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…

Group Theory · Mathematics 2015-01-19 Michael Giudici , Luke Morgan

A $2$-distance-transitive graph is a vertex-transitive graph whose vertex stabilizer is transitive on both the first step and the second step neighborhoods. In this paper, we first answer a question of A. Devillers, M. Giudici, C. H. Li and…

Combinatorics · Mathematics 2025-08-05 Wei Jin , Jack H. Koolen , Chenhui Lv

Let $\bar{\Gamma}$ be the point-hyperplane geometry of a projective space $\mathrm{PG(V)},$ where $V$ is a $(n+1)$-dimensional vector space over a finite field $\mathbb{F}_q$ of order $q.$ Suppose that $\sigma$ is an automorphism of…

Combinatorics · Mathematics 2026-04-17 Ilaria Cardinali , Luca Giuzzi

In this manuscript, for $q:=2^n$ with $n\geq2$, we study two primitive maximal subgroups of the alternating group ${\sf A}_{q-1}$. These subgroups are the full automorphism groups of $2$-designs which are constructed from algebraic curves…

Group Theory · Mathematics 2025-05-23 Tung Le , B. G. Rodrigues

Let $\mathcal{D}=(\mathcal{P},\mathcal{B})$ be a non-trivial block-transitive $t$-$(k^2,k,\lambda)$ design with $G\leq \Aut(\mathcal{D})$ and $X\unlhd G\leq \Aut(X)$, where $X=PSL(n,q)(n\geq3).$ We prove that $t=2$ and the parameters…

Group Theory · Mathematics 2025-11-14 Guoqiang Xiong , Haiyan Guan
‹ Prev 1 4 5 6 7 8 10 Next ›