English
Related papers

Related papers: On transitive designs and strongly regular graphs …

200 papers

We develop the basic topological properties of compact polygons, i.e. of compact topological Tits buildings of rank two. It is proved that the Coxeter diagram of such a building is always crystallographic, that is, compact connected n-gons…

Differential Geometry · Mathematics 2007-05-23 Linus Kramer

In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…

Combinatorics · Mathematics 2024-09-17 Amin Saeidi

It is known that there are precisely three transitive permutation groups of degree $6$ that admit an invariant partition with three parts of size $2$ such that the kernel of the action on the parts has order $4$; these groups are called…

Combinatorics · Mathematics 2020-07-10 Ademir Hujdurović , Primož Potočnik , Gabriel Verret

A $2-(n,4,\lambda)$ design $(\Omega, \mathcal{B})$ is said to be supersimple if distinct lines intersect in at most two points. From such a design, one can construct a certain subset of Sym$(\Omega)$ called a "Conway groupoid". The…

Group Theory · Mathematics 2015-10-23 Nick Gill , Neil I. Gillespie , Cheryl E. Praeger , Jason Semeraro

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

In this article, we study $2$-$(v,k,\lambda)$ designs $\mathcal{D}$ with $\lambda$ prime admitting flag-transitive and point-primitive almost simple automorphism groups $G$ with socle $T$ a finite exceptional simple group or a sporadic…

Group Theory · Mathematics 2025-05-09 Seyed Hassan Alavi , Ashraf Daneshkhah , Alessandro Montinaro

We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters \[(l(q-1)q^l,\ l(q-1)q^{l-1},\ (lq-l+1)q^{l-2},\ (l-1)(q-1)q^{l-2},\ (lq-l+1)q^{l-2})\] for integers $q$ and $l$ ($q,…

Combinatorics · Mathematics 2011-02-09 O. Olmez , S. Y. Song

We establish the existence of simple designs with parameters $2$-$(55,10,4)$, $3$-$(20,5,4)$, $3$-$(21,7,30)$, $4$-$(15,5,2)$, $4$-$(16,8,45)$, $5$-$(16,7,10)$, and $5$-$(17,8,40)$, which have previously been unknown. For the corresponding…

Combinatorics · Mathematics 2021-06-24 Vedran Krčadinac

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

Let E be a finite set. Given permutations x and y of E that together generate a transitive subgroup, for which s is it true that x and the conjugate of y by s also generate a transitive subgroup? Such transitive permutation pairs encode…

Combinatorics · Mathematics 2017-04-10 Sean Rostami

We classify binary completely regular codes of length $m$ with minimum distance $\delta$ for $(m,\delta)=(12,6)$ and $(11,5)$. We prove that such codes are unique up to equivalence, and in particular, are equivalent to certain Hadamard…

Combinatorics · Mathematics 2014-04-08 Neil I. Gillespie , Cheryl E. Praeger

The symmetric $2$-$(v,k,\lambda )$ designs, with $k>\lambda \left(\lambda-3 \right)/2$, admitting a flag-transitive, point-imprimitive automorphism group are completely classified: they are the known $2$-designs with parameters…

Combinatorics · Mathematics 2022-12-20 Alessandro Montinaro

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é

This paper investigates block-transitive automorphism groups of t-(k^2,k,\lambda) designs. Let D be a non-trivial t-(k^2,k,\lambda) design, G \leq \Aut(D) be block-transitive with X\unlhd G\leq \Aut(X), where X = PSL(2,q)(q\geq4). Then q =…

Group Theory · Mathematics 2025-08-28 Guoqiang Xiong , Haiyan Guan

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

We show that the Mathieu groups $M_{22}$ and $M_{11}$ can act on the supersingular $K3$ surface with Artin invariant 1 in characteristic 11 as symplectic automorphisms. More generally we show that all maximal subgroups of the Mathieu group…

Algebraic Geometry · Mathematics 2007-05-23 Shigeyuki Kondo

In this paper, we prove the existence of directed strongly regular graphs with parameters $(63,11,8,1,2)$. We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed…

Combinatorics · Mathematics 2024-04-19 Andries E. Brouwer , Dean Crnković , Andrea Švob

In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion,…

Group Theory · Mathematics 2025-02-17 Seyed Hassan Alavi

This paper is devoted to the study of $2$-designs with $\lambda\ge (r,\lambda)^2$ admitting a flag-transitive automorphism group $G$. The group $G$ has been shown to be point-primitive of either almost simple or affine type. In this paper,…

Combinatorics · Mathematics 2025-11-19 Junchi Zhang , Jianbing Lu , Meizi Ou

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

Group Theory · Mathematics 2022-07-20 Josiah Oh , Mark Pengitore