English
Related papers

Related papers: Moments of Colored Permutation Statistics on Conju…

200 papers

Given a graph sequence $\{G_n\}_{n\ge1}$ and a simple connected subgraph $H$, we denote by $T(H,G_n)$ the number of monochromatic copies of $H$ in a uniformly random vertex coloring of $G_n$ with $c \ge 2$ colors. In this article, we prove…

Probability · Mathematics 2023-10-05 Sayan Das , Zoe Himwich , Nitya Mani

Standard high-dimensional factor models assume that the comovements in a large set of variables could be modeled using a small number of latent factors that affect all variables. In many relevant applications in economics and finance,…

Econometrics · Economics 2022-02-08 Antoine Djogbenou , Razvan Sufana

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…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady

In this paper, we are interested in the moments of the characteristic polynomial $Z_n(x)$ of the $n\times n$ permutation matrices with respect to the uniform measure. We use a combinatorial argument to write down the generating function of…

Probability · Mathematics 2010-07-14 Dirk Zeindler

The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…

Probability · Mathematics 2009-11-23 Paul-Olivier Dehaye , Dirk Zeindler

We establish a new connection between moments of $n \times n$ random matrices $X_n$ and hypergeometric orthogonal polynomials. Specifically, we consider moments $\mathbb{E}\mathrm{Tr} X_n^{-s}$ as a function of the complex variable $s \in…

Mathematical Physics · Physics 2019-07-23 Fabio Deelan Cunden , Francesco Mezzadri , Neil O'Connell , Nick Simm

A now-classical cyclic extension of the descent set of a permutation has been introduced by Klyachko and Cellini. Following a recent axiomatic approach to this notion, it is natural to ask which sets of permutations admit such an extension.…

Combinatorics · Mathematics 2023-02-13 Ron M. Adin , Pál Hegedüs , Yuval Roichman

Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…

Group Theory · Mathematics 2018-05-16 Yago Antolín , Andrew Sale

This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…

Dynamical Systems · Mathematics 2023-09-06 Saeed Zakeri

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

Combinatorics · Mathematics 2026-04-10 Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Group Theory · Mathematics 2014-05-05 Alice C. Niemeyer , Cheryl E. Praeger

We show that for the product of two fixed point free conjugacy classes, the average number of cycles is always very similar. Specifically, our main result is that for a randomly chosen pair of fixed point free permutations of cycle types…

Combinatorics · Mathematics 2024-10-23 Jesse Campion Loth , Amarpreet Rattan

We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…

Combinatorics · Mathematics 2013-04-10 Tatjana Bakšajeva , Eugenijus Manstavičius

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Combinatorics · Mathematics 2024-06-28 Jason Fulman

We define truncated Mellin moments of parton distributions by restricting the integration range over the Bjorken variable to the experimentally accessible subset x_0 < x < 1 of the allowed kinematic range 0 < x < 1. We derive the evolution…

High Energy Physics - Phenomenology · Physics 2014-11-17 Stefano Forte , Lorenzo Magnea , Andrea Piccione , Giovanni Ridolfi

Consider the random walk on the permutation group obtained when the step distribution is uniform on a given conjugacy class. It is shown that there is a critical time at which two phase transitions occur simultaneously. On the one hand, the…

Probability · Mathematics 2010-04-21 Nathanael Berestycki

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…

Probability · Mathematics 2021-06-17 Frank Röttger

We establish unconditional $\Omega$-results for all weighted even moments of primes in arithmetic progressions. We also study the moments of these moments and establish lower bounds under GRH. Finally, under GRH and LI we prove an…

Number Theory · Mathematics 2023-06-16 Régis de la Bretèche , Daniel Fiorilli

The transitive simultaneous conjugacy problem asks whether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1} a_j \tau$ holds for all $j = 1,2, \ldots, d$, where $a_1, a_2, \ldots, a_d$ and $b_1, b_2, \ldots, b_d$ are…

Discrete Mathematics · Computer Science 2020-12-01 Andrej Brodnik , Aleksander Malnič , Rok Požar