Related papers: Cyclic Permutations: Degrees and Combinatorial Typ…

A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

We explore relations between cyclic sequences determined by a quadratic difference relation, cyclotomic polynomials, Eulerian digraphs and walks in the plane. These walks correspond to closed paths for which at each step one must turn…

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

We propose the study of $S_n$-ensembles: $n \times n$ arrays of permutations of $[n]$ that encode the boundary data of $n\Delta_{n-1}$. We characterize precisely when an $S_4$-ensemble contains a permutation appearing exactly four times,…

We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the…

In this paper, we study quandles of cyclic type, which form a particular subclass of finite quandles. The main result of this paper describes the set of isomorphism classes of quandles of cyclic type in terms of certain cyclic permutations.…

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…

The descent algebra of the symmetric group, over a field of non-zero characteristic p, is studied. A homomorphism into the algebra of generalised p-modular characters of the symmetric group is defined. This is then used to determine the…

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

The goal of this monograph is to study the indicator function for a set of permutations mapping one finite sequence of positive integers to another from a representation theoretic, combinatorial and probabilistic perspective. The degree of…

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\langle i,j \rangle$ matches the $\mu$ pattern if $i <…

We express the set of representations from a cyclic $p$-group to a connected $p$-compact group in terms of the associated reflection group and compute its cardinality for each exotic $p$-compact group.

We study closures of conjugacy classes in the symmetric matrices of the orthogonal group and we determine which one are normal varieties. In contrast to the result for the symplectic group where all classes have normal closure, there is…

In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

We present a survey of exact and asymptotic formulas on the number of cyclic subgroups and total number of subgroups of the groups ${\Bbb Z}_{n_1} \times \cdots \times {\Bbb Z}_{n_k}$, where $k\ge 2$ and $n_1,\ldots,n_k$ are arbitrary…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…