English
Related papers

Related papers: Block-transitive $3$-$(v,k,1)$ designs associated …

200 papers

In this paper, we provide a complete classification of the $2$-$(v,3,\lambda )$ designs with $v\equiv 1,3\pmod{6}$ and $% v \equiv 6 \pmod{\lambda}$ admitting a flag-transitive automorphism group non-isomorphic to a subgroup of $A\Gamma…

Combinatorics · Mathematics 2024-04-04 Eliana Francot , Alessandro Montinaro

Let $q$ be a prime power and $V\cong{\mathbb F}_q^n$. A $t$-$(n,k,\lambda)_q$ design, or simply a subspace design, is a pair ${\mathcal D}=(V,{\mathcal B})$, where ${\mathcal B}$ is a subset of the set of all $k$-dimensional subspaces of…

Combinatorics · Mathematics 2022-01-12 Daniel R. Hawtin , Jesse Lansdown

We consider $2$-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on $2$-designs which are block-transitive but not necessarily…

Combinatorics · Mathematics 2024-01-26 Carmen Amarra , Alice Devillers , Cheryl E. Praeger

The classification of the $2$-designs with $\lambda=2$ admitting a flag-transitive automorphism groups with socle $PSL(2,q)$ is completed by settling the two open cases in \cite{ABDT}. The result is achieved by using conics and hyperovals…

Combinatorics · Mathematics 2024-05-01 Alessandro Montinaro , Yanwei Zhao , Zhilin Zhang , Shenglin Zhou

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently…

Combinatorics · Mathematics 2018-07-03 Michael Huber

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber

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 $\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

In this article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is a projective special unitary group of dimension at most five. We, in particular, determine…

Group Theory · Mathematics 2019-12-04 Ashraf Daneshkhah

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

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

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

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

We view a design $\mathcal{D}$ as a set of $k$-subsets of a fixed set $X$ of $v$ points. A $k$-subset of $X$ is at distance $i$ from $\mathcal{D}$ if it intersects some $k$-set in $\mathcal{D}$ in $k-i$ points, and no subset in more than…

Combinatorics · Mathematics 2014-05-12 Chris D. Godsil , Cheryl E. Praeger

A complete classification of the flag-transitive point-imprimitive symmetric $2$-$(v,k,\lambda )$ designs with $v<100$ is provided. Apart from the known examples with $\lambda \leq 10$, the complementary design of $PG_{5}(2)$, and the…

Group Theory · Mathematics 2025-10-30 Mario Galici , Alessandro Montinaro

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

In this article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is $PSU_{4}(q)$. We prove that there exist eight non-isomorphic such designs for which…

Combinatorics · Mathematics 2019-01-23 Seyed Hassan Alavi , Mohsen Bayat , Asharf Daneshkhah , Sheyda Zang Zarin

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

A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its point set is contained in $G$ and the elements of each block sum up to zero. The only known Steiner 2-designs that are $G$-additive for some…

Combinatorics · Mathematics 2022-09-21 Marco Buratti , Anamari Nakić

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