scholarly journals Plancherel Averages: Remarks on a Paper by Stanley

10.37236/315 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Grigori Olshanski
Keyword(s):  
Recent Result ◽  
Plancherel Measure ◽  
Young Diagrams

Let $M_n$ stand for the Plancherel measure on ${\Bbb Y}_n$, the set of Young diagrams with $n$ boxes. A recent result of R. P. Stanley (arXiv: 0807.0383) says that for certain functions $G$ defined on the set ${\Bbb Y}$ of all Young diagrams, the average of $G$ with respect to $M_n$ depends on $n$ polynomially. We propose two other proofs of this result together with a generalization to the Jack deformation of the Plancherel measure.

scholarly journals Gaussian fluctuations of Young diagrams under the Plancherel measure

2007 ◽  
Vol 463 (2080) ◽  
pp. 1069-1080 ◽  
Author(s):  
Leonid V Bogachev ◽  
Zhonggen Su
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Gaussian Process ◽  
Central Limit ◽  
Point Processes ◽  
Plancherel Measure ◽  
Young Diagrams ◽  
Finite Dimensional ◽  
The Central Limit Theorem ◽  
Local Correlations

We obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the ‘spectrum’ of partitions λ ⊢ n ∈ (under the Plancherel measure), thus settling a long-standing problem posed by Logan & Shepp. Namely, under normalization growing like , the corresponding random process in the bulk is shown to converge, in the sense of finite-dimensional distributions, to a Gaussian process with independent values, while local correlations in the vicinity of each point, measured on various power scales, possess certain self-similarity. The proofs are based on the Poissonization techniques and use Costin–Lebowitz–Soshnikov's central limit theorem for determinantal random point processes. Our results admit a striking reformulation after the rotation of Young diagrams by 45°, whereby the normalization no longer depends on the location in the spectrum. In addition, we explain heuristically the link with an earlier result by Kerov on the convergence to a generalized Gaussian process.

scholarly journals Permutations Without Long Decreasing Subsequences and Random Matrices

10.37236/929 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Piotr Šniady
Keyword(s):  
Random Matrices ◽  
Young Diagram ◽  
Random Matrix ◽  
Random Permutation ◽  
Fixed Number ◽  
Plancherel Measure ◽  
Young Diagrams ◽  
Gaussian Unitary Ensemble ◽  
Longest Increasing Subsequence ◽  
Unitary Ensemble

We study the shape of the Young diagram $\lambda$ associated via the Robinson–Schensted–Knuth algorithm to a random permutation in $S_n$ such that the length of the longest decreasing subsequence is not bigger than a fixed number $d$; in other words we study the restriction of the Plancherel measure to Young diagrams with at most $d$ rows. We prove that in the limit $n\to\infty$ the rows of $\lambda$ behave like the eigenvalues of a certain random matrix (namely the traceless Gaussian Unitary Ensemble random matrix) with $d$ rows and columns. In particular, the length of the longest increasing subsequence of such a random permutation behaves asymptotically like the largest eigenvalue of the corresponding random matrix.

scholarly journals On Kerov polynomials for Jack characters (extended abstract)

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Valentin Féray ◽  
Maciej Dołęga
Keyword(s):  
Symmetric Functions ◽  
Partial Result ◽  
Plancherel Measure ◽  
Jack Polynomials ◽  
Young Diagrams ◽  
Power Sum ◽  
International Audience ◽  
Random Young Diagrams

International audience We consider a deformation of Kerov character polynomials, linked to Jack symmetric functions. It has been introduced recently by M. Lassalle, who formulated several conjectures on these objects, suggesting some underlying combinatorics. We give a partial result in this direction, showing that some quantities are polynomials in the Jack parameter $\alpha$ with prescribed degree. Our result has several interesting consequences in various directions. Firstly, we give a new proof of the fact that the coefficients of Jack polynomials expanded in the monomial or power-sum basis depend polynomially in $\alpha$. Secondly, we describe asymptotically the shape of random Young diagrams under some deformation of Plancherel measure.

scholarly journals Additive kinematic formulas for flag area measures

2021 ◽  
Author(s):  
Judit Abardia-Evéquoz ◽  
Andreas Bernig
Keyword(s):  
Recent Result ◽  
Flag Manifold ◽  
Unit Vector ◽  
Algebraic Framework

AbstractWe show the existence of additive kinematic formulas for general flag area measures, which generalizes a recent result by Wannerer. Building on previous work by the second named author, we introduce an algebraic framework to compute these formulas explicitly. This is carried out in detail in the case of the incomplete flag manifold consisting of all $$(p+1)$$ ( p + 1 ) -planes containing a unit vector.

scholarly journals An Exponential Separation Between MA and AM Proofs of Proximity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Recent Result ◽  
Query Complexity ◽  
Random String ◽  
Natural Property ◽  
Public And Private ◽  
Alternate Proof ◽  
Interactive Proofs ◽  
Exponential Separation

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

scholarly journals LAURENT POLYNOMIAL LANDAU–GINZBURG MODELS FOR COMINUSCULE HOMOGENEOUS SPACES

2021 ◽  
Author(s):  
PETER SPACEK
Keyword(s):  
Homogeneous Space ◽  
Homogeneous Spaces ◽  
Laurent Polynomial ◽  
Complete Intersections ◽  
Laurent Polynomials ◽  
Young Diagrams ◽  
Similar Shape ◽  
Algebraic Torus ◽  
The One ◽  
Polynomial Potentials

AbstractIn this article we construct Laurent polynomial Landau–Ginzburg models for cominuscule homogeneous spaces. These Laurent polynomial potentials are defined on a particular algebraic torus inside the Lie-theoretic mirror model constructed for arbitrary homogeneous spaces in [Rie08]. The Laurent polynomial takes a similar shape to the one given in [Giv96] for projective complete intersections, i.e., it is the sum of the toric coordinates plus a quantum term. We also give a general enumeration method for the summands in the quantum term of the potential in terms of the quiver introduced in [CMP08], associated to the Langlands dual homogeneous space. This enumeration method generalizes the use of Young diagrams for Grassmannians and Lagrangian Grassmannians and can be defined type-independently. The obtained Laurent polynomials coincide with the results obtained so far in [PRW16] and [PR13] for quadrics and Lagrangian Grassmannians. We also obtain new Laurent polynomial Landau–Ginzburg models for orthogonal Grassmannians, the Cayley plane and the Freudenthal variety.

Sign in / Sign up

Export Citation Format

Share Document