English
Related papers

Related papers: Infinite families of 2-designs from GA_1(q) action…

200 papers

The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs…

Combinatorics · Mathematics 2013-08-05 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

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

The pairs $(\mathcal{D},G)$, where $\mathcal{D}$ is a non-trivial $2$-$(k^{2},k,\lambda )$ design, with $\lambda \mid k$, and $G$ is a flag-transitive automorphism group of $\mathcal{D}$ of affine type such that $G \nleq A \Gamma…

Combinatorics · Mathematics 2022-06-15 Alessandro Montinaro

Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…

Group Theory · Mathematics 2021-04-29 Bruno Duchesne , Nicolas Monod , Phillip Wesolek

Let F* be the finite field of q elements and let P(n,q) be the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) over a coefficient field F field of…

Combinatorics · Mathematics 2012-02-22 Johannes Siemons , Daniel Smith

Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, \lambda)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be…

Group Theory · Mathematics 2025-09-29 Xiaoqin Zhan

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

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

Classical designs and their (projective) q-analogs can both be viewed as designs in matroids, using the matroid of all subsets of a set and the matroid of linearly independent subsets of a vector space, respectively. Another natural matroid…

Combinatorics · Mathematics 2016-05-24 Jens Zumbrägel

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

Group Theory · Mathematics 2010-07-02 Ievgen Bondarenko

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 article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle $X$ is a finite simple exceptional group of Lie type. We prove a reduction theorem, severely…

Group Theory · Mathematics 2020-08-27 Seyed Hassan Alavi , Mohsen Bayat , Ashraf Daneshkhah

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

A design is called $t$-pyramidal when it has an automorphism group which fixes $t$ points and acts sharply transitively on the remaining points. We determine all symmetric $(2^k-1,2^{k-1},2^{k-2})$-designs which are $(2^{k-1}-1)$-pyramidal…

Combinatorics · Mathematics 2025-08-26 Mark Pankov

We present a recursive construction of a (2t + 1)-wise uniform set of permutations on 2n objects using a (2t + 1) - (2n, n, \cdot) combinatorial design, a t-wise uniform set of permutations on n objects and a (2t+1)-wise uniform set of…

Combinatorics · Mathematics 2017-03-14 Hilary Finucane , Ron Peled , Yariv Yaari

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…

The projective special linear group $\PSL_2(n)$ is $2$-transitive for all primes $n$ and $3$-homogeneous for $n \equiv 3 \pmod{4}$ on the set $\{0,1, \cdots, n-1, \infty\}$. It is known that the extended odd-like quadratic residue codes are…

Information Theory · Computer Science 2017-04-06 Cunsheng Ding , Hao Liu , Vladimir D. Tonchev

The purpose of this paper is to construct new families of irreducible Gelfand-Tsetlin modules for U_q(gl_n). These modules have arbitrary singularity and Gelfand-Tsetlin multiplicities bounded by 2. Most previously known irreducible modules…

Representation Theory · Mathematics 2017-07-11 Vyacheslav Futorny , Luis Enrique Ramirez , Jian Zhang

A group G is sharply 2-transitive if it admits a faithful permutation representation that is transitive and free on pairs of distinct points. Conjecturally, for all such groups there exists a near-field N (i.e. a skew field that is…

Group Theory · Mathematics 2013-02-21 Yair Glasner , Dennis D. Gulko

We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…

Combinatorics · Mathematics 2018-09-05 Fenjin Liu , Johannes Siemons , Wei Wang