English
Related papers

Related papers: The classification of flag-transitive Steiner 3-de…

200 papers

A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…

Combinatorics · Mathematics 2016-04-01 Marco Buratti , Gloria Rinaldi , Tommaso Traetta

A $k$-orbit maniplex is one that has $k$ orbits of flags under the action of its automorphism group. In this paper we extend the notion of symmetry type graphs of maps to that of maniplexes and polytopes and make use of them to study…

Combinatorics · Mathematics 2013-06-10 Gabe Cunningham , Maria del Rio Francos , Isabel Hubard , Micael Toledo

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

In this article, we prove that if $\mathcal{D}$ is a $2$-design with $k=7$ admitting flag-transitive almost simple automorphism group with socle an alternating group, then $\mathcal{D}$ is $PG_{2}(3,2)$ with parameter set $(15,7,3)$ and…

Group Theory · Mathematics 2023-12-13 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

In this paper, we study the automorphism group and geodesic transitivity of a family of vertex-transitive graphs $H(n,k)$, introduced by Fu-Tao Hu \textit{et.al.} in 2010. In the process, we address some naturally arising, unanswered…

Combinatorics · Mathematics 2024-02-07 Sucharita Biswas

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

Combinatorics · Mathematics 2020-12-07 Simona Bonvicini , Marco Buratti , Martino Garonzi , Gloria Rinaldi , Tommaso Traetta

We consider rational projective homogeneous varieties over an algebraically closed field of positive characteristic, namely quotients of a semi-simple group by a possibly non-reduced parabolic subgroup. We determine the group scheme…

Algebraic Geometry · Mathematics 2025-07-08 Matilde Maccan

A q-design with parameters t-(v,k,lambda_t)_q is a pair (V, B) of the v-dimensional vector space V over GF(q) and a collection B of k-dimensional subspaces of V, such that each t-dimensional subspace of V is contained in precisely lambda_t…

Combinatorics · Mathematics 2015-10-01 Maarten De Boeck , Anamari Nakic

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

Combinatorics · Mathematics 2012-10-23 Tuvi Etzion , Alexander Vardy

More than $30$ years ago, Delandtsheer and Doyen showed that the automorphism group of a block-transitive $2$-design, with blocks of size $k$, could leave invariant a nontrivial point-partition, but only if the number of points was bounded…

Combinatorics · Mathematics 2023-08-25 Carmen Amarra , Alice Devillers , Cheryl E. Praeger

Recent classification of $\frac{3}{2}$-transitive permutation groups leaves us with three infinite families of groups which are neither $2$-transitive, nor Frobenius, nor one-dimensional affine. The groups of the first two families…

Combinatorics · Mathematics 2020-08-11 Gang Chen , Jiawei He , Ilia Ponomarenko , Andrey Vasil'ev

We compute the automorphism groups of finite and cofinite ind-grassmannians, as well as of the ind-variety of maximal flags indexed by Z_{>0}. We pay special attention to differences with the case of ordinary flag varieties.

Algebraic Geometry · Mathematics 2018-09-25 I. Penkov

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

Combinatorics · Mathematics 2024-06-10 Jin Guo , Andrey V. Vasil'ev , Rui Wang

This is the third in a series of papers which outlines an approach to the classification of $\mathcal{N}{=}2$ superconformal field theories at rank 2 via the study of their Coulomb branch geometries. Here we use the fact that the encoding…

High Energy Physics - Theory · Physics 2022-09-23 Philip C. Argyres , Mario Martone

Recently, Leemans and Stokes constructed an infinite family of incidence geometries admitting trialities but no dualities from the groups PSL(2,q) (where $q=p^{3n}$ with $p$ a prime and $n>0$ a positive integer). Unfortunately these…

Group Theory · Mathematics 2023-11-23 Dimitri Leemans , Klara Stokes , Philippe Tranchida

The V-systems are special finite sets of covectors which appeared in the theory of the generalized Witten-Dijkgraaf-Verlinde-Verlinde (WDVV) equations. Several families of V-systems are known but their classification is an open problem. We…

Mathematical Physics · Physics 2014-11-06 V. Schreiber , A. P. Veselov

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

We say that a group G acts infinitely transitively on a set X if for every integer m the induced diagonal action of G is transitive on the cartesian mth power of X with the diagonals removed. We describe three classes of affine algebraic…

Algebraic Geometry · Mathematics 2012-10-10 I. V. Arzhantsev , K. Kuyumzhiyan , M. Zaidenberg

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

Combinatorics · Mathematics 2023-05-09 M. Epstein , D. L. Kreher , S. S. Magliveras