Related papers: Stochastic monotonicity in Young graph and Thoma t…
We study asymptotics of characters of the symmetric groups on a fixed conjugacy class. It was proved by Kerov that such a character can be expressed as a polynomial in free cumulants of the Young diagram (certain functionals describing the…
In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…
We study the Young graph with edge multiplicities arising in a Pieri-type formula for Jack symmetric polynomials $P_\mu(x;a)$ with a parameter $a$. Starting with the empty diagram, we define recurrently the `dimensions' $\dim_a$ in the same…
Consider the lattice of all Young diagrams ordered by inclusion, and denote by Y its Hasse graph. Using the Pieri formula for Jack symmetric polynomials, we endow the edges of the graph Y with formal multiplicities depending on a real…
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…
Asymptotic representation theory of general linear groups GL(n,q) over a finite field leads to studying probability measures \rho on the group U of all infinite uni-uppertriangular matrices over F_q, with the condition that \rho is…
The asymptotics of the first rows and columns of random Young diagrams corresponding to extremal characters of the infinite symmetric group is studied. We consider rows and columns with linear growth in $n$, the number of boxes of random…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
Consider random Young diagrams with a fixed number n of boxes, where the probability distribution on diagrams is determined by the Plancherel measure. That is, the weight of a diagram is proportional to the squared dimension of the…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…
In this paper we prove that the monotonicity of kneading sequences and topological entropy, a fundamental structural property of the quadratic family, extends to the class of power-law unimodal maps $f_a(x)=a-|x|^r$ for arbitrary critical…
Noticing that the space of the solutions of a first order Hamiltonian field theory has a pre-symplectic structure, we describe a class of conserved charges on it associated to the momentum map determined by any symmetry group of…
We prove stochastic stability of chaotic maps for a general class of Markov random perturbations (including singular ones) satisfying some kind of mixing conditions. One of the consequences of this statement is the proof of Ulam's…
In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…