English
Related papers

Related papers: A classification of flag-transitive block designs

200 papers

We study $t$-designs of parameters $(n,k,\lambda)$ over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph $G$ whose vertex set of size $n$ is partitioned into…

Combinatorics · Mathematics 2018-10-26 Alberto Besana , Cristina Martinez

We consider the regular subgroups of the automorphism group of the linear Hadamard code. These subgroups correspond to the regular subgroups of $GA(r,2)$, w.t.r action on the vectors of $F_2^{r}$, where $n=2^r-1 $ is the length of the…

Combinatorics · Mathematics 2018-07-13 I. Yu. Mogilnykh

We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…

Combinatorics · Mathematics 2025-05-07 Anwita Bhowmik , Bart De Bruyn , Sergey Goryainov

An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…

Combinatorics · Mathematics 2013-11-22 Anamari Nakic , Mario Osvin Pavcevic

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four…

Group Theory · Mathematics 2026-04-07 Jun-Jie Huang , Jin-Hua Xie

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

Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…

Group Theory · Mathematics 2013-04-30 Jorge André , João Araújo , Peter J. Cameron

We call a flag variety admissible if its automorphism group is the projective general linear group. (This holds in most cases.) Let $K$ be a field of characteristic $0$, containing all roots of unity. Let the $K$-variety $X$ be a form of an…

Algebraic Geometry · Mathematics 2019-12-30 Attila Guld

In this paper, we resolve a conjecture of Green and Liebeck [Disc. Math., 343 (8):117119, 2019] on codes in $PGL(2,q)$. To be specific, we show that: if $D$ is a dihedral subgroup of order $2(q+1)$ in $G=PGL(2,q)$, and $A=\{g\in G: g^{q+1}=…

Combinatorics · Mathematics 2020-09-03 Tao Feng , Weicong Li , Jingkun Zhou

We define the class of admissible linear embeddings of flag varieties. The definition is given in the general language of algebraic geometry. We then prove that an admissible linear embedding of flag varieties has a certain explicit form in…

Algebraic Geometry · Mathematics 2019-11-05 A. Tikhomirov , I. Penkov

Suppose that a group $G$ has socle $L$ a simple large-rank classical group. Suppose furthermore that $G$ acts transitively on the set of lines of a linear space $\mathcal{S}$. We prove that, provided $L$ has dimension at least 25, then $G$…

Group Theory · Mathematics 2007-05-23 Alan R. Camina , Nick Gill , A. E. Zalesski

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

Combinatorics · Mathematics 2021-01-08 R. A. Bailey , Peter J. Cameron

Let $G:=G_2(K)$ be a simple algebraic group of type $G_2$ defined over an algebraically closed field $K$ of characteristic $p>0$. Let $\sigma$ denote a standard Frobenius automorphism of $G$ such that $G_\sigma\cong G_2(q)$ with $q\geq 4$.…

Group Theory · Mathematics 2009-03-25 David I. Stewart

Let $\Gamma$ be a graph and let $G$ be a group of automorphisms of $\Gamma$. The graph $\Gamma$ is called $G$-normal if $G$ is normal in the automorphism group of $\Gamma$. Let $T$ be a finite non-abelian simple group and let $G = T^l$ with…

Combinatorics · Mathematics 2017-08-22 Jia-Li Du , Yan-Quan Feng

This paper was inspired by a paper by Blokhuis and Brouwer [Designs, Codes and Cryptography 65, 2012] in which a definition of a graph on the flags of a biplane is given, and they prove that the graph corresponding to the unique…

Combinatorics · Mathematics 2025-05-28 Eugenia O'Reilly-Regueiro , Octavio B. Zapata-Fonseca

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…

Combinatorics · Mathematics 2015-11-04 R. Julian R. Abel , Robert F. Bailey , Andrea C. Burgess , Peter Danziger , Eric Mendelsohn

A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…

Group Theory · Mathematics 2017-01-06 Jia-Li Du , Yan-Quan Feng

In this paper we introduce a switching for 2-designs. We illustrate this method by applying it to some symmetric (64,28,12) designs. In that way we obtain six new symmetric (64,28,12) designs. Further, we show that this type of switching…

Combinatorics · Mathematics 2022-05-11 Dean Crnković , Andrea Švob

We study the twisted Hochschild homology of quantum full flag manifolds, with the twist being the modular automorphism of the Haar state. We show that non-trivial 2-cycles can be constructed from appropriate invariant projections. The main…

Quantum Algebra · Mathematics 2020-03-20 Marco Matassa

An interesting fact is that most of the known connected $2$-arc-transitive nonnormal Cayley graphs of small valency on finite simple groups are $(\mathrm{A}_{n+1},2)$-arc-transitive Cayley graphs on $\mathrm{A}_n$. This motivates the study…

Combinatorics · Mathematics 2021-03-30 Jiangmin Pan , Binzhou Xia , Fugang Yin