Related papers: Permutation Designs and Sequencing Highly Transiti…

We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…

Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…

We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of…

We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such…

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…

A mutation operation for $\tau$-exceptional sequences of modules over any finite-dimensional algebra was recently introduced, generalising the mutation for exceptional sequences of modules over hereditary algebras. We interpret this…

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

In this article, we investigate symmetric designs admitting a flag-transitive and point-primitive affine automorphism group. We prove that if an automorphism group $G$ of a symmetric $(v,k,\lambda)$ design with $\lambda$ prime is…

Let $\Omega$ be a set equipped with an equivalence relation $\sim$; we refer to the equivalence classes as blocks of $\Omega$. A permutation group $G \le \mathrm{Sym}(\Omega)$ is $k$-by-block-transitive if $\sim$ is $G$-invariant, with at…

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of ${\rm GL}(n,\mathbb{C})$ with restricted composition…

A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…

Gaussian process (GP) models have become a well-established frameworkfor the adaptive design of costly experiments, and notably of computerexperiments. GP-based sequential designs have been found practicallyefficient for various objectives,…

We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…

We study sorting by queues that can rearrange their content by applying permutations from a predefined set. These new sorting devices are called shuffle queues and we investigate those of them corresponding to sets of permutations defining…

We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass…

An infinite linearly ordered set (S,<=) is called doubly homogeneous if its automorphism group A(S) acts 2-transitively on it. We show that any group G arises as outer automorphism group G cong Out(A(S)) of the automorphism group A(S), for…

We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…