Related papers: Permutation Designs and Sequencing Highly Transiti…
We view a design $\mathcal{D}$ as a set of $k$-subsets of a fixed set $X$ of $v$ points. A $k$-subset of $X$ is at distance $i$ from $\mathcal{D}$ if it intersects some $k$-set in $\mathcal{D}$ in $k-i$ points, and no subset in more than…
A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…
We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…
Given an action of a group $G$ by automorphisms on an infinite relational structure $\mathcal{M}$, we say that the action is structurally sharply $k$-transitive if, for any two $k$-tuples $\bar{a}, \bar{b} \in M^k$ of distinct elements such…
We present a new algorithm for iterating over all permutations of a sequence. The algorithm leverages elementary~$O(1)$ operations on recursive lists. As a result, no new nodes are allocated during the computation. Instead, all elements are…
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…
In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.
We introduce an algorithm for designing Neural Group Actions, collections of deep neural network architectures which model symmetric transformations satisfying the laws of a given finite group. This generalizes involutive neural networks…
We introduce a new product for permutation groups. It takes as input two permutation groups, M and N, and produces an infinite group M [X] N which carries many of the permutational properties of M. Under mild conditions on M and N the group…
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…
Autoregressive models, such as the GPT family, use a fixed order, usually left-to-right, to generate sequences. However, this is not a necessity. In this paper, we challenge this assumption and show that by simply adding a positional…
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 upper bounds on the covering radius of these designs, as a…
A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments, nor representation theory.
The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…
As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently…
The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…
A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…
We investigate the configuration where a group of finite Morley rank acts definably and generically $m$-transitively on an elementary abelian $p$-group of Morley rank $n$, where $p$ is an odd prime, and $m\geqslant n$. We conclude that…
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…