Averaging method in combinatorics of symmetric polynomials

Abstract

We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial factors like $d_R$ in the sums over Young diagrams instead of just factorials in ordinary sums over numbers. It provides a universal view on a number of previously known, but seemingly random identities.

arXiv comment15 pages

References in corpus (14)

• Lectures on non-perturbative effects in large N gauge theories, matrix models and strings
• A Primer on Resurgent Transseries and Their Asymptotics
• Complete Set of Cut-and-Join Operators in Hurwitz-Kontsevich Theory
• From Useful Algorithms for Slowly Convergent Series to Physical Predictions Based on Divergent Perturbative Expansions
• $2d$ gravity and matrix models. I. $2d$ gravity
• Algebra of differential operators associated with Young diagrams
• Integrability of Hurwitz Partition Functions. I. Summary
• Orthogonal polynomials associated with root systems
• Superintegrability summary
• New Insights into Superintegrability from Unitary Matrix Models
• Cut-and-join structure and integrability for spin Hurwitz numbers
• The resurgent structure of quantum knot invariants
• Superintegrability as the hidden origin of Nekrasov calculus
• Bilinear character correlators in superintegrable theory

Cited by in corpus (2)

• Summing up perturbation series around superintegrable point
• Deformation of superintegrability in the Miwa-deformed Gaussian matrix model