English
Related papers

Related papers: Some new designs with prescribed automorphism grou…

200 papers

It is shown that, apart from the smallest Ree group, a flag-transitive automorphism group $G$ of a $2$-$(k^{2}, k, \lambda)$ design D, with $\lambda \mid k$, is either an affine group or an almost simple classical group. Moreover, when $G$…

Combinatorics · Mathematics 2022-03-18 Alessandro Montinaro , Eliana Francot

In 1987, Huw Davies proved that, for a flag-transitive point-imprimitive $2$-$(v,k,\lambda)$ design, both the block-size $k$ and the number $v$ of points are bounded by functions of $\lambda$, but he did not make these bounds explicit. In…

Combinatorics · Mathematics 2020-12-08 Alice Devillers , Cheryl E. Praeger

In this paper we analyze possible actions of an automorphism of order six on a $2$-$(70, 24, 8)$ design, and give a complete classification for the action of the cyclic automorphism group of order six $G= \langle \rho \rangle \cong Z_6…

Combinatorics · Mathematics 2024-03-07 Sanja Rukavina , Vladimir D. Tonchev

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…

Group Theory · Mathematics 2011-06-21 Richard Lyons

We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…

Combinatorics · Mathematics 2023-05-24 Bernd Schröder

A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…

Combinatorics · Mathematics 2016-12-02 Justin H. C. Chan , Jonathan Jedwab

The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…

Let $\mathcal{D}=\left(\mathcal{P},\mathcal{B} \right)$ be a symmetric $2$-$(v,k,\lambda )$ design admitting a flag-transitive, point-imprimitive automorphism group $G$ that leaves invariant a non-trivial partition $\Sigma$ of…

Combinatorics · Mathematics 2022-06-15 Alessandro Montinaro

In this article, we study $2$-designs with $\gcd(r, \lambda)=1$ admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine all pairs…

Group Theory · Mathematics 2019-09-19 Seyed Hassan Alavi , Mohsen Bayat , Ashraf Daneshkhah

Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes $\mathcal{C}_{(q,q+1,4,1)}$ and their dual codes with $q=2^m$ and established that the codewords of the minimum (or the second minimum) weight in these…

Information Theory · Computer Science 2021-07-02 Qianqian Yan , Junling Zhou

For any positive integers $n, s, t, l$ such that $n \geq 10$, $s, t \geq 2$, $l \geq 1$ and $n \geq s+t+l$, a new infinite family of regular 3-hypertopes with type $(2^s, 2^t, 2^l)$ and automorphism group of order $2^n$ is constructed.

Combinatorics · Mathematics 2019-01-28 Dong-Dong Hou , Yan-Quan Feng , Dimitri Leemans

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

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

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 $t\text{-}(n,K,\lambda;q)$ design, also called the $q$-analog of a $t$-wise balanced design, is a set ${\mathcal B}$ of subspaces with dimensions contained in $K$ of the $n$-dimensional vector space ${\mathbb F}_q^n$ over the finite field…

Combinatorics · Mathematics 2013-08-09 Michael Braun

In this paper we determine the classical simple groups of dimension r=3,5 which are (2,3)-generated (the cases r = 2, 4 are known). If r = 3, they are PSL_3(q), q <> 4, and PSU_3(q^2), q^2 <> 9, 25. If r = 5 they are PSL_5(q), for all q,…

Group Theory · Mathematics 2015-01-07 M. A. Pellegrini , M. C. Tamburini Bellani

A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks. The number of blocks is the covering's {\em size},…

Combinatorics · Mathematics 2008-02-03 Daniel Gordon , Greg Kuperberg , Oren Patashnik

In this paper, we present a classification of $2$-designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups. If $G$ is a flag-transitive automorphism group of a non-trivial $2$-design $\mathcal{D}$ with…

We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…

Combinatorics · Mathematics 2025-04-10 Vedran Krčadinac , Lucija Relić

The groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…

Group Theory · Mathematics 2013-10-02 Walter Becker , Elaine W. Becker