Related papers: Linear dimension of group actions
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…
An extension of the Lorentz group to include generators $\Gamma^\mu$ carrying a space-time index is demonstrated to explicitly construct the Minkowski metric within the internal group space as a consequence of the non-vanishing commutation…
An exponential interaction is constructed so that one-dimensional atoms and chains of atoms mimic the general behavior of their three-dimensional counterparts. Relative to the more commonly used soft-Coulomb interaction, the exponential…
Diaconis and Graham studied a measure of distance from the identity in the symmetric group called total displacement and showed that it is bounded below by the sum of length and reflection length. They asked for a characterization of the…
This is a survey of methods developed in the last few years to prove results on growth in non-commutative groups. These techniques have their roots in both additive combinatorics and group theory, as well as other fields. We discuss linear…
We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…
Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the…
Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be…
The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…
We study the complex irreducible representations of special linear, symplectic, orthogonal and unitary groups over principal ideal local rings of length two. We construct a canonical correspondence between the irreducible representations of…
We investigate the relationship between various isomorphism invariants for finite groups. Specifically, we use the Weisfeiler-Leman dimension (WL) to characterize, compare and quantify the effectiveness and complexity of invariants for…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
The representation theory of the symmetric group has been intensively studied for over 100 years and is one of the gems of modern mathematics. The full transformation monoid $\mathfrak T_n$ (the monoid of all self-maps of an $n$-element…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…
For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant…
Generalizing classical extension theory, we solve a Schreier-type extension problem for polygroups by groups. As a consequence, we obtain a method for computing a presentation for a group from its action on a set. The usefulness of this…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
The birational $R$-matrix is a transformation that appears in the theory of geometric crystals, the study of total positivity in loop groups, and discrete dynamical systems. This $R$-matrix gives rise to an action of the symmetric group…