English
Related papers

Related papers: Reduction for flag-transitive symmetric designs wi…

200 papers

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

The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…

Group Theory · Mathematics 2017-02-24 John Bamberg , Tomasz Popiel , Cheryl E. Praeger

In this article, we study $2$-designs with $\gcd(r,\lambda)=1$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type. We obtain four infinite families of such designs and…

Group Theory · Mathematics 2020-04-06 Seyed Hassan Alavi

This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…

Combinatorics · Mathematics 2024-08-28 Yunsong Gan , Weijun Liu

In this article, we prove that if $\mathcal{D}$ is a $2$-design with $k=7$ admitting flag-transitive almost simple automorphism group with socle an alternating group, then $\mathcal{D}$ is $PG_{2}(3,2)$ with parameter set $(15,7,3)$ and…

Group Theory · Mathematics 2023-12-13 Ashraf Daneshkhah

This paper considers flag-transitive $4$-$(q+1,k,\lambda)$ designs with $\lambda\geq5$ and $q+1>k>4$. Let the automorphism group of a design $\cal D$ be a simple group $G=PSL(2,q)$. Depend on the fact that the setwise stabilizer $G_B$ must…

Combinatorics · Mathematics 2019-10-24 Huili Dong

This paper is a further contribution to the classification of line-transitive finite linear spaces. We prove that if S is a non-trivial finite linear space with the Fang-Li parameter gcd(k,r) is 9 or 10, the automorphism group G of S is…

Combinatorics · Mathematics 2011-12-16 Haiyan Guan , Delu Tian , Shenglin Zhou

We show that if G is a group of automorphisms of a thick finite generalised quadrangle Q acting primitively on both the points and lines of Q, then G is almost simple. Moreover, if G is also flag-transitive then G is of Lie type.

Combinatorics · Mathematics 2012-06-26 John Bamberg , Michael Giudici , Joy Morris , Gordon F. Royle , Pablo Spiga

In this paper, we completely classify the non-trivial 2-(v,k,3) designs admitting an almost simple, flag-transitive automorphism group with socle PSL(2,q).

Combinatorics · Mathematics 2025-12-25 Hongxue Liang , Zhihui Liu , Alessandro Montinaro

In 2008, Schneider and Van Maldeghem proved that if a group acts flag-transitively, point-primitively, and line-primitively on a generalised hexagon or generalised octagon, then it is an almost simple group of Lie type. We show that…

Combinatorics · Mathematics 2014-10-14 John Bamberg , S. P. Glasby , Tomasz Popiel , Cheryl E. Praeger , Csaba Schneider

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Group Theory · Mathematics 2017-06-19 Teng Fang , Xin Gui Fang , Binzhou Xia , Sanming Zhou

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Combinatorics · Mathematics 2018-10-16 William M. Kantor

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

Combinatorics · Mathematics 2021-01-08 R. A. Bailey , Peter J. Cameron

The purpose of this paper is to classify all pairs $(\mathcal{D}, G)$, where $\mathcal{D}$ is a non-trivial $2$-$(v, k, 2)$ design, and $G\leq Aut(\mathcal{D})$ acts transitively on the set of blocks of $\mathcal{D}$ and primitively on the…

Combinatorics · Mathematics 2016-03-25 Xiaohong Zhang , Shenglin Zhou

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

Combinatorics · Mathematics 2019-10-14 Hong Ci Liao , Jing Jian Li , Zai Ping Lu

It was shown in 1989 by Delandtsheer and Doyen that, for a $2$-design with $v$ points and block size $k$, a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the point set)…

Combinatorics · Mathematics 2024-04-18 Seyed Hassan Alavi , Carmen Amarra , Ashraf Daneshkhah , Alice Devillers , Cheryl E. Praeger

Let $G:=G_2(K)$ be a simple algebraic group of type $G_2$ defined over an algebraically closed field $K$ of characteristic $p>0$. Let $\sigma$ denote a standard Frobenius automorphism of $G$ such that $G_\sigma\cong G_2(q)$ with $q\geq 4$.…

Group Theory · Mathematics 2009-03-25 David I. Stewart

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

We solve the long-standing open problem of classifying all 3-(v,k,1) designs with a flag-transitive group of automorphisms (cf. A. Delandtsheer, Geom. Dedicata 41 (1992), p. 147; and in: "Handbook of Incidence Geometry", ed. by F.…

Combinatorics · Mathematics 2018-07-04 Michael Huber