Related papers: Completely Transitive Designs

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex…

A transitive permutation group $G$ on a finite set $\Omega$ is said to be pre-primitive if every $G$-invariant partition of $\Omega$ is the orbit partition of a subgroup of $G$. It follows that pre-primitivity and quasiprimitivity are…

In this article we study the automorphism group ${\rm Aut}(X,\sigma)$ of subshifts $(X,\sigma)$ of low word complexity. In particular, we prove that Aut$(X,\sigma)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

In this article, we investigate symmetric 2-designs of prime order admitting a flag-transitive automorphism group G. Recently, the authors proved that the automorphism group G of this type of designs must be point-primitive, and is of…

A finite linear space is a finite set of points and lines, where any two points lie on a unique line. Well known examples include projective planes. This project focuses on linear spaces which admit certain types of symmetries. Symmetries…

Let X be a complete toric variety and Aut(X) be the automorphism group. We give an explit description of Aut(X)-orbits on X. In particular, we show that Aut(X) acts on X transitively if and only if X is a product of projective spaces.

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Let $\mathcal{D}=\left(\mathcal{P},\mathcal{B} \right)$ be a symmetric $2$-$(v,k,\lambda )$ design admitting a flag-transitive, point-imprimitive automorphism group $G$ that leaves invariant a non-trivial partition $\Sigma$ of…

Let $\mathcal{D}$ be a non-trivial quasi-symmetric $2$-design with two block intersection numbers $x=0$ and $2\leq y\leq10$, and suppose that $G$ is an automorphism group of $\mathcal{D}$. If $G$ is flag-transitive and point-primitive, then…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

We consider an experimental design problem for permutations: given a fixed set $X$, and an integer $t$, construct a list $L$ of permutations of $X$ such that every ordered $t$-tuple of distinct elements of $X$ occurs as a consecutive…

A group G acts infinitely transitively on a set Y if for every positive integer m, its action is m-transitive on Y. Given a real affine algebraic variety Y of dimension greater than or equal to two, we show that, under a mild restriction,…

An action of a group $G$ is highly transitive if $G$ acts transitively on $k$-tuples of distinct points for all $k \geq 1$. Many examples of groups with a rich geometric or dynamical action admit highly transitive actions. We prove that if…

A code $C$ in the Hamming metric, that is, is a subset of the vertex set $V\varGamma$ of the Hamming graph $\varGamma=H(m,q)$, gives rise to a natural distance partition $\{C,C_1,\ldots,C_\rho\}$, where $\rho$ is the covering radius of $C$.…

A partition of a group is a dioid partition if the following three conditions are met: The setwise product of any two parts is a union of parts, there is a part that multiplies as an identity element, and the inverse of a part is a part.…

Let $\mathcal{D}$ be a non-trivial $G$-block-transitive $3$-$(v,k,1)$ design, where $T\leq G \leq \mathrm{Aut}(T)$ for some finite non-abelian simple group $T$. It is proved that if $T$ is a simple exceptional group of Lie type, then $T$ is…

In a digraph $D$, an arc $e=(x,y) $ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D- e$. A digraph is transitive-free if it does not contain any transitive arc. In the Transitive-free Vertex Deletion (TVD) problem,…

In this paper, we present a classification of $2$-designs with $\gcd(r,\lambda)=1$ admitting flag-transitive automorphism groups. If $G$ is a flag-transitive automorphism group of a non-trivial $2$-design $\mathcal{D}$ with…

A few facts concerning the phrase "the automorphism groups become larger at special points of the moduli of K3 surfaces" are presented. It is also shown that the automorphism groups are of infinite order over a dense subset in any…