<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2014-15-1-65-76</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-186</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Article</subject></subj-group></article-categories><title-group><article-title>О СТРУКТУРНЫХ КОНСТАНТАХ ДЖЕКА И ИХ ВЫЧИСЛЕНИИ</article-title><trans-title-group xml:lang="en"><trans-title>ON JACK’S CONNECTION COEFFICIENTS AND THEIR COMPUTATION</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Васильева</surname><given-names>Е. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Vassilieva</surname><given-names>E. A.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="en" id="aff-1"><institution>CNRS LIX – Ecole Polytechnique 91128 Palaiseau Cedex France</institution><country>France</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>05</day><month>07</month><year>2016</year></pub-date><volume>15</volume><issue>1</issue><fpage>65</fpage><lpage>76</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Васильева Е.А., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Васильева Е.А.</copyright-holder><copyright-holder xml:lang="en">Vassilieva E.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.chebsbornik.ru/jour/article/view/186">https://www.chebsbornik.ru/jour/article/view/186</self-uri><abstract><p>Алгебра классов сопряжённости и алгебра двойных смежных классов – классические коммутативные подалгебры групповой алгебры симметри- ческой группы. Структурные константы этих алгебр вызвали значительный интерес у комбинаториков в связи с тем, что они представляют собой число разложений данной перестановки в упорядоченное произведение перестановок с заданной структурой циклов. Несмотря на сходство свойств эти константы обычно изучались отдельно. Для обеих семей структурных констант они равны суммам характеров – неприводимых характеров симметрической группы и зональных сферических функций, двух частных случаев более общей семьи характеров, называемых характерами Джека. Характеры Джека являются коэффициентами в разложении по базису степенных симметрических многочленов симметрических функций Джека, семьи симметрических функций, индексируемых параметром α. Структутные константы алгебры классов соответствуют случаю α = 1 (в этом случае симметрические функции Джека пропорциональны полино- мам Шура). Структурные константы алгебры двойных смежных классов относятся к случаю α = 2 (в этом случае симметрические функции Джека являются зональными полиномами). Структурные константы Джека позволяют рассматривать их с единой точки зрения для произвольного параметра α. Настоящая работа посвящена этим обобщённым коэффициентам и их вычислению. Точнее, мы концентрируем наше внимание на обобщении формулы для числа разложений перестановки с заданной цик- ловой структурой в произведение r транспозиций. Мы пользуемся дей- ствием оператора Лапласа-Белтрами на симметрические функции Джека для доказательства общей формулы и даём более простые её эквиваленты для некоторых значений r.</p><p> </p></abstract><trans-abstract xml:lang="en"><p>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.</p><p> </p></trans-abstract><kwd-group xml:lang="ru"><kwd>симметрические функции Джека</kwd><kwd>структурные константы</kwd><kwd>факторизации</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Jack symmetric functions</kwd><kwd>connection coefficients</kwd><kwd>factorizations</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">F. B´edard and A. Goupil The poset of conjugacy classes and decomposition of products in the symmetric group, Can. Math. Bull, 35(2):152–160, 1992.</mixed-citation><mixed-citation xml:lang="en">F. B´edard and A. Goupil The poset of conjugacy classes and decomposition of products in the symmetric group, Can. Math. Bull, 35(2):152–160, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">J. D´enes, The representation of a permutation as the product of a minimal number of transpositions and its connection with the theory of graphs. Publ. Math. Inst. Hungar. Acad. Sci., 4:63–70,1959.</mixed-citation><mixed-citation xml:lang="en">J. D´enes, The representation of a permutation as the product of a minimal number of transpositions and its connection with the theory of graphs. Publ. Math. Inst. Hungar. Acad. Sci., 4:63–70,1959.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">M. Do le˛ga and V. F´eray On Kerov polynomials for Jack characters. DMTCS Proceedings (FPSAC 2013) AS:539–550, 2013.</mixed-citation><mixed-citation xml:lang="en">M. Do le˛ga and V. F´eray On Kerov polynomials for Jack characters. DMTCS Proceedings (FPSAC 2013) AS:539–550, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">A. Goupil A. and G. Schaeffer. Factoring n-cycles and counting maps of given genus, European Journal of Combinatorics, 19:819–834(16), 1998.</mixed-citation><mixed-citation xml:lang="en">A. Goupil A. and G. Schaeffer. Factoring n-cycles and counting maps of given genus, European Journal of Combinatorics, 19:819–834(16), 1998.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">J. Irving. On the number of factorizations of a full cycle, J. Comb. Theory Ser. A, 113(7):1549–1554, 2006.</mixed-citation><mixed-citation xml:lang="en">J. Irving. On the number of factorizations of a full cycle, J. Comb. Theory Ser. A, 113(7):1549–1554, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">D. M. Jackson. Some combinatorial problems associated with products of conjugacy classes of the symmetric group, J. Comb. Theory Ser. A, 49(2):363– 369, 1988.</mixed-citation><mixed-citation xml:lang="en">D. M. Jackson. Some combinatorial problems associated with products of conjugacy classes of the symmetric group, J. Comb. Theory Ser. A, 49(2):363– 369, 1988.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">I. Macdonald Symmetric functions and Hall polynomials, Oxford University Press, Second Edition, 1999.</mixed-citation><mixed-citation xml:lang="en">I. Macdonald Symmetric functions and Hall polynomials, Oxford University Press, Second Edition, 1999.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">A. H. Morales and E. Vassilieva, Bijective enumeration of bicolored maps of given vertex degree distribution, DMTCS Proceedings (FPSAC 2009), AK:661–672, 2009.</mixed-citation><mixed-citation xml:lang="en">A. H. Morales and E. Vassilieva, Bijective enumeration of bicolored maps of given vertex degree distribution, DMTCS Proceedings (FPSAC 2009), AK:661–672, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">A. H. Morales and E. Vassilieva, Bijective evaluation of the connection coefficients of the double coset algebra, DMTCS Proceedings (FPSAC 2011), AO:681–692, 2011.</mixed-citation><mixed-citation xml:lang="en">A. H. Morales and E. Vassilieva, Bijective evaluation of the connection coefficients of the double coset algebra, DMTCS Proceedings (FPSAC 2011), AO:681–692, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">G. Schaeffer and E. Vassilieva. A bijective proof of Jackson’s formula for the number of factorizations of a cycle, J. Comb. Theory Ser. A, 115(6):903–924, 2008.</mixed-citation><mixed-citation xml:lang="en">G. Schaeffer and E. Vassilieva. A bijective proof of Jackson’s formula for the number of factorizations of a cycle, J. Comb. Theory Ser. A, 115(6):903–924, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">A. B. Shukla A short proof of Cayley’s tree formula, arXiv:0908.2324v2, 2009.</mixed-citation><mixed-citation xml:lang="en">A. B. Shukla A short proof of Cayley’s tree formula, arXiv:0908.2324v2, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">R. P. Stanley Some combinatorial properties of Jack symmetric functions, Advances in Mathematics, 77:76–115, 1989.</mixed-citation><mixed-citation xml:lang="en">R. P. Stanley Some combinatorial properties of Jack symmetric functions, Advances in Mathematics, 77:76–115, 1989.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">E.A. Vassilieva Explicit generating series for connection coefficients, DMTCS Proceedings (FPSAC 2012) AR:123–134, 2012.</mixed-citation><mixed-citation xml:lang="en">E.A. Vassilieva Explicit generating series for connection coefficients, DMTCS Proceedings (FPSAC 2012) AR:123–134, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">E.A. Vassilieva Long cycle factorizations : bijective computation in the general case, DMTCS Proceedings (FPSAC 2013) AS:1077–1088, 2013.</mixed-citation><mixed-citation xml:lang="en">E.A. Vassilieva Long cycle factorizations : bijective computation in the general case, DMTCS Proceedings (FPSAC 2013) AS:1077–1088, 2013.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
