English
Related papers

Related papers: The Classification of Flag-transitive Steiner 4-De…

200 papers

We announce the classification of two related classes of flag-transitive geometries. There is an infinite family of such geometries, related to the nonsplit extensions $3^{[{n\atop 2}]_{_2}}\cdot \SP_{2n}(2)$, and twelve sporadic examples…

Group Theory · Mathematics 2009-09-25 Alexander A. Ivanov , Sergey V. Shpectorov

This paper studies flag-transitive point-primitive non-symmetric $2$-($v,k,2$) designs. We prove that if $\mathcal{D}$ is a non-trivial non-symmetric $2$-$(v,k,2)$ design admitting a flag-transitive point-primitive automorphism group $G$…

Combinatorics · Mathematics 2016-03-03 Hongxue Liang , Shenglin Zhou

This paper determined all pairs $(\mathcal{D},G)$ where $\mathcal{D}$ is a non-symmetric 2-$(v,k,\lambda)$ design with $(r,\lambda)=1$ and $G$ is the almost simple flag-transitive automorphism group of $\mathcal{D}$ with an exceptional…

Combinatorics · Mathematics 2019-07-16 Yongli Zhang , Shenglin Zhou

In this paper we completely classify spreads of 2-dimensional subspaces of a 6-dimensional vector space over a finite field of characteristic not two or three upon which a cyclic group acts transitively. This addresses one of the remaining…

Combinatorics · Mathematics 2023-09-14 Cian Jameson , John Sheekey

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

Group Theory · Mathematics 2023-09-20 Anton A. Baykalov , Alice Devillers , Cheryl E. Praeger

We study $S(t-1,t,2t)$, which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs.…

Combinatorics · Mathematics 2014-10-24 Jithin Mathews

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

A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment…

Combinatorics · Mathematics 2023-06-27 Minjia Shi , XiaoXiao Li , Patrick Solé

A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…

Group Theory · Mathematics 2011-12-14 John Bamberg , Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

In this paper, we construct new families of flag-transitive linear spaces with $q^{2n}$ points and $q^{2}$ points on each line that admit a one-dimensional affine automorphism group. We achieve this by building a natural connection with…

Combinatorics · Mathematics 2021-08-10 Tao Feng , Jianbing Lu

Let $\mathcal D$ be a nontrivial symmetric $(v,k,\lambda)$ design, and $G$ be a subgroup of the full automorphism group of $\mathcal D$. In this paper we prove that if $G$ acts flag-transitively, point-primitively on $\mathcal D$ and…

Combinatorics · Mathematics 2015-03-25 Shenglin Zhou , Delu Tian

In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.

Combinatorics · Mathematics 2025-04-22 Ivan Hetman

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

Logic · Mathematics 2019-08-16 John Clemens , Samuel Coskey , Stephanie Potter

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

Combinatorics · Mathematics 2014-05-15 Felix Goldberg , Deepak Rajendraprasad , Rogers Mathew

In this paper we show that a flag-transitive automorphism group $G$ of a non-trivial $2$-$(v,k,\lambda)$ design with $\lambda\geq (r, \lambda)^2$ is not of product action type. In conclusion, $G$ is a primitive group of affine or almost…

Group Theory · Mathematics 2023-04-19 Huiling Li , Zhilin Zhang , Shenglin Zhou

Let $G$ be a flag-transitive automorphism group of a $(v,k,\lambda)$ symmetric design $\mathcal{D}$ with $k>\lambda(\lambda-2)$. O'Reilly Regueiro proved that if $G$ is point-imprimitive, then $\mathcal{D}$ has parameters…

Combinatorics · Mathematics 2023-02-21 Jianfu Chen , Jiaxin Shen , Shenglin Zhou

The Baby Monster group B acts naturally on a geometry E(B) with diagram c.F_4(t) for t=4 and the action of B on E(B) is flag-transitive. It possesses the following properties: (a) any two elements of type 1 are incident to at most one…

Group Theory · Mathematics 2009-10-31 A. A. Ivanov , D. V. Pasechnik , S. V. Shpectorov

Ostrom and Wagner (1959) proved that if the automorphism group $G$ of a finite projective plane $\pi$ acts $2$-transitively on the points of $\pi$, then $\pi$ is isomorphic to the Desarguesian projective plane and $G$ is isomorphic to…

Group Theory · Mathematics 2020-06-30 John Bamberg , Cai Heng Li , Eric Swartz

We study point-block incidence structures $(\mathcal{P},\mathcal{B})$ for which the point set $\mathcal{P}$ is an $m\times n$ grid. Cameron and the fourth author showed that each block $B$ may be viewed as a subgraph of a complete bipartite…

Combinatorics · Mathematics 2022-01-05 Seyed Hassan Alavi , Ashraf Daneshkhah , Alice Devillers , Cheryl E. Praeger

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

Combinatorics · Mathematics 2023-05-09 M. Epstein , D. L. Kreher , S. S. Magliveras