Related papers: Analysing flag-transitive point-imprimitive 2-desi…
We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…
We study the problem of classifying local projective structures in dimension two having non trivial Lie symmetries. In particular we obtain a classification of flat projective structures having positive dimensional Lie algebra of projective…
In a previous paper we defined the concept of an affinized projective variety and its associated Hilbert series. We computed the Hilbert series for varieties associated to quadratic monomial ideals. In this paper we show how to apply these…
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…
A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…
We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…
We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. In doing so, we make fundamental connections with both discrete geometry and algebraic combinatorics. In…
We survey recent results on $p$-ranks and Smith normal forms of some $2-(v,k,\lambda)$ designs. In particular, we give a description of the recent work in \cite{csx} on the Smith normal forms of the 2-designs arising from projective and…
A finite transitive permutation group is said to be 3/2-transitive if all the nontrivial orbits of a point stabilizer have the same size greater than 1. Examples include the 2-transitive groups, Frobenius groups and several other less…
The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of $k$-WL to recognition of graph properties. Let $G$ be an input graph with $n$…
A finite graph $\Gamma$ is called $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$. We study a family of symmetric graphs, called the unitary…
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…
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…
We classify flips of buildings arising from non-degenerate unitary spaces of dimension at least 4 over finite fields of odd characteristic in terms of their action on the underlying vector space. We also construct certain geometries related…
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…
Given a finite dimensional algebra $A$, we consider certain sets of idempotents of $A$, called self-injective cores, to which we associate 2-subcategories of the 2-category of projective bimodules over $A$. We classify the simple transitive…
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…
A code $C$ in the Hamming graph $\varGamma=H(m,q)$ is $2\it{\text{-neighbour-transitive}}$ if ${\rm Aut}(C)$ acts transitively on each of $C=C_0$, $C_1$ and $C_2$, the first three parts of the distance partition of $V\varGamma$ with respect…
We present a method for computing the classification groups of topological insulators and superconductors in the presence of $\mathbb{Z}_2^{\times n}$ point group symmetries, for arbitrary natural numbers $n$. Each symmetry class is…
In this paper we study the operation of cutting off edges of a simple $3$-polytope $P$ along the graph $\Gamma$. We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of…