相关论文: Classification of flag-transitive Steiner quadrupl…

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…

We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner $T(k-1,k,v)$ bitrades, extended $1$-perfect bitrades. For a distance-regular graph, we show a one-to-one…

This is not standard in the sense that we understand a Springer map to be a collapsing of homogeneous bundles. Apart from that we use mostly techniques from Chriss and Ginzbergs book but we work in the equivariant derived category of…

Among all equivelar vertex-transitive maps on a given closed surface S, the automorphism groups of maps with Schl\"afli types {3, 7} and {7, 3} allow the highest possible order. We describe a procedure to transform all such maps into 1- or…

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)…

In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…

Using a blend of combinatorics and geometry, we give an algorithm for algebraically finding all flags in any zero-dimensional intersection of Schubert varieties with respect to three transverse flags, and more generally, any number of…

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

In this paper new $1$-rotational 2-Steiner systems for different admissible $v,k$ pairs are introduced. In particular, $1$-rotational unitals of order $4$ are enumerated.

Techniques of producing new combinatorial structures from old ones are commonly called trades. The switching principle applies for a broad class of designs: it is a local transformation that modifies two columns of the incidence matrix. In…

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…

Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…

In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed $r\ge 3$ and $n\equiv 1,3 \pmod{6}$, any $r$-colouring of the triples on $[n]$ admits a Steiner triple…

It was proved in 2009 that any partial Steiner triple system of order $u$ has an embedding of order $v$ for each admissible integer $v\geq 2u+1$. This result is best-possible in the sense that, for each $u\geq 9$, there exists a partial…

A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We…

In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by $Pr_{n}(b,c,d)$. We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such…

We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree v and does not occur…

We determine the graded composition multiplicity in the symmetric algebra S(V) of the natural GL_n(q)-module V, or equivalently in the coinvariant algebra of V, for a large class of irreducible modules around the Steinberg module. This was…

The smallest set of admissible parameters of a $q$-analog of a Steiner system is $S_2[2,3,7]$. The existence of such a Steiner system -- known as a binary $q$-analog of the Fano plane -- is still open. In this article, the automorphism…

In this note, we give a precise construction of one of the families of $2$-designs arose from studying flag-transitive $2$-designs with parameters $(v,k,\lambda)$ whose replication numbers $r$ are coprime to $\lambda$. We show that for a…