Loading [MathJax]/jax/output/CommonHTML/fonts/TeX/fontdata.js
Chebyshevskii Sbornik
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Chebyshevskii Sb.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Chebyshevskii Sbornik, 2014, Volume 15, Issue 1, Pages 65–76 (Mi cheb326)  

On Jack’s connection coefficients and their computation

E. A. Vassilieva

CNRS LIX - Ecole Polytechnique 91128 Palaiseau Cedex France
References:
Abstract: The class algebra and the double coset algebra are two commutative subalgebras of the group algebra of the symmetric group. The connection coefficients of these two algebraic structures received significant attention in combinatorics as they provide the number of factorizations of a given permutation into an ordered product of permutations satisfying given cyclic structures. While they are usually studied separately, these two families of connection coefficients share strong similarities. They are both equal to some sums of characters, respectively the irreducible characters of the symmetric group and the zonal spherical functions, two specific cases of a more general family of characters named Jack's characters.
Jack's characters are defined as the coefficients in the power sum expansion of the Jack's symmetric functions, a family of symmetric polynomials indexed by a parameter α. Connection coefficients of the class algebra corresponds to the case α=1 (Jack's symmetric functions are proportional to Schur polynomials in this case) and the connection coefficients of the double coset algebra corresponds to the case α=2 (Jack's symmetric functions are equal to zonal polynomials). We define Jack's connection coefficients to provide a unified approach for general parameter α. This paper introduces these generalized coefficients and focus on their computations. More specifically we focus on the generalization of the formula giving the number of factorizations of a permutation of a given cyclic structure into the product of r transpositions. We use the action of the Laplace–Beltrami operator on Jack's symmetric functions to provide a general formula and make this formula explicit for some given values of r.
Keywords: Jack symmetric functions, connection coefficients, factorizations.
Received: 28.02.2014
Document Type: Article
UDC: 519.114
Language: Russian
Citation: E. A. Vassilieva, “On Jack’s connection coefficients and their computation”, Chebyshevskii Sb., 15:1 (2014), 65–76
Citation in format AMSBIB
\Bibitem{Vas14}
\by E.~A.~Vassilieva
\paper On Jack’s connection coefficients and their computation
\jour Chebyshevskii Sb.
\yr 2014
\vol 15
\issue 1
\pages 65--76
\mathnet{http://mi.mathnet.ru/cheb326}
Linking options:
  • https://www.mathnet.ru/eng/cheb326
  • https://www.mathnet.ru/eng/cheb/v15/i1/p65
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:215
    Full-text PDF :108
    References:54
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025