Related papers: A classification of flag-transitive block designs

Belolipetsky and Jones classified those compact Riemann surfaces of genus $g$ admitting a large group of automorphisms of order $\lambda (g-1)$, for each $\lambda >6,$ under the assumption that $g-1$ is a prime number. In this article we…

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

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…

Let \alpha be an automorphism of the totally disconnected group G. The compact open subgroup, V, if G is tidy for \alpha if [\alpha(V') : \alpha(V')\cap V'] is minimised at V, where V' ranges over all compact open subgroups of G.…

In this paper we completely classify spreads of 2-dimensional subspaces of a 6-dimensional vector space over a finite field of characteristic not two or three upon which a cyclic group acts transitively. This addresses one of the remaining…

Let $G=GL_n(K)$ be the general linear group defined over an infinite field $K$ of positive characteristic $p$ and let $\Delta(\lambda)$ be the Weyl module of $G$ which corresponds to a partition $\lambda$. In this paper we classify all…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…

Let $k$ be a field, and $G$ be a $k$-group scheme of finite type. Let $G_{\mathrm{ad}}$ be the $k$-scheme $G$ with the adjoint action of $G$. We call $\lambda_{G,G}=H^0(\mathop{\mathrm{Spec}} k,e^*(\omega_{G_{\mathrm{ad}}}))$ the Knop…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

A digraph is $s$-arc-transitive if its automorphism group is transitive on directed paths with $s$ edges, that is, on $s$-arcs. Although infinite families of finite $s$-arc transitive digraphs of arbitrary valency were constructed by the…

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…

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…

In this paper, we classify additive closed symmetric monoidal structures on the category of left R-modules by using Watts' theorem. An additive closed symmetric monoidal structure is equivalent to an R-module Lambda_{A,B} equipped with two…

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

A $2-(n,4,\lambda)$ design $(\Omega, \mathcal{B})$ is said to be supersimple if distinct lines intersect in at most two points. From such a design, one can construct a certain subset of Sym$(\Omega)$ called a "Conway groupoid". The…

For a graph $\Gamma$, a positive integer $s$ and a subgroup $G\leq \Aut(\Gamma)$, we prove that $G$ is transitive on the set of $s$-arcs of $\Gamma$ if and only if $\Gamma$ has girth at least $2(s-1)$ and $G$ is transitive on the set of…

Assume $k$ is a positive integer, $\lambda=\{k_1, k_2, \ldots, k_q\}$ is a partition of $k$ and $G$ is a graph. A $\lambda$-list assignment of $G$ is a $k$-list assignment $L$ of $G$ such that the colour set $\cup_{v\in V(G)}L(v)$ can be…