Related papers: Cyclic Permutations: Degrees and Combinatorial Typ…

Let G be a finite group and H a normal subgroup such that G/H is cyclic. Given a conjugacy class g^G of G we define its centralizing subgroup to be HC_G(g). Let K be such that H\le K\le G. We show that the G-conjugacy classes contained in K…

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…

A special type of conjugacy classes in symmetric groups is studied and used to answer a question about odd-degree irreducible characters

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect…

In this article, we study random graphs with a given degree sequence $d_1, d_2, \cdots, d_n$ from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian…

The number of peaks of a random permutation is known to be asymptotically normal. We give a new proof of this and prove a central limit theorem for the distribution of peaks in a fixed conjugacy class of the symmetric group. Our technique…

We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…

We determine the range of the des statistic on every conjugacy class in the symmetric group $S_n$, prove that the minimum is $1$ (except for the identity class), and show that every intermediate value from $1$ to the maximum value is…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…

We classify the conjugacy classes of p-cycles of type D in alternating groups. This finishes the open cases in arXiv:0812.4628. We also determine all the subracks of those conjugacy classes which are not of type D.

Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…

In this paper, we study rotation numbers of random dynamical systems on the circle. We prove the existence of rotation numbers and the continuous dependence of rotation numbers on the systems. As an application, we prove a theorem on…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…