Related papers: Cyclic Permutations: Degrees and Combinatorial Typ…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…

Symmetry is conventionally described in a contrariety manner that the system is either completely symmetric or completely asymmetric. Using group theoretical approach to overcome this dichotomous problem, we introduce the degree of symmetry…

We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with…

We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating…

Given a finite group $G$, we introduce the \textit{permutability degree} of $G$, as $$pd(G)=\frac{1}{|G| \ |\mathcal{L}(G)|} {\underset{X \in \mathcal{L}(G)}\sum}|P_G(X)|,$$ where $\mathcal{L}(G)$ is the subgroup lattice of $G$ and $P_G(X)$…

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…

We compute the group of $K_1$-zero-cycles on the second generalized involution variety for an algebra of degree 4 with symplectic involution. This description is given in terms of the group of multipliers of similitudes associated to the…

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…

In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…

In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We first show that any fixed moment coincides on all conjugacy classes where…

We study the geometry, topology and Lebesgue measure of the set of monic conjugate reciprocal polynomials of fixed degree with all roots on the unit circle. The set of such polynomials of degree N is naturally associated to a subset of…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

We introduce circulance, a scalar measure for classifying time series of dynamical systems. Circulance captures the extent of temporal regularity or irregularity that is encoded in the topology of a directed ordinal pattern transition…

We study the numerical range of an $n\times n$ cyclic shift matrix, which can be viewed as the adjacency matrix of a directed cycle with $n$ weighted arcs. In particular, we consider the change in the numerical range if the weights are…