scholarly journals Symmetric group characters as symmetric functions

2021 ◽  
Vol 390 ◽  
pp. 107943
Author(s):  
Rosa Orellana ◽  
Mike Zabrocki
Keyword(s):  
Symmetric Group ◽  
Symmetric Functions ◽  
Group Characters

scholarly journals The Hopf structure of symmetric group characters as symmetric functions

2021 ◽  
Vol 4 (3) ◽  
pp. 551-574
Author(s):  
Rosa Orellana ◽  
Mike Zabrocki
Keyword(s):  
Symmetric Group ◽  
Symmetric Functions ◽  
Group Characters

scholarly journals Group characters and algebra

1934 ◽  
Vol 233 (721-730) ◽  
pp. 99-141 ◽  
Keyword(s):  
Symmetric Group ◽  
Symmetric Functions ◽  
Irreducible Representations ◽  
Close Analogy ◽  
Group Characters ◽  
And Algebra

It has been known for some time* that the elements of a matrix of degree n may be arranged in sets which correspond to cycles of the symmetric group of order n !, and that there are relations connecting permanents and determinants, e.g. , /a* p y S a |3 y 8/ ( Further, MACMAHON and BRIOSCHI have pointed out the close analogy which exists between the threefold algebra of the symmetric functions an, hn and sn, and the theory of determinants, permanents, and the cycles of substitutions of the symmetric group. Here we trace the analogy to its source by fixing attention on the characters of the irreducible representations of the symmetric group of linear substitutions, as the centre of the whole theory. By this means divers theories of combinatory analysis and algebra are seen to be merely different aspects of the same theory. For the symmetric group of order n ! the characters are all integers, and we associate with each partition of n both a character of the group and a cycle of substitutions.

Algorithms 307: Symmetric group characters

1967 ◽  
Vol 10 (7) ◽  
pp. 451-452 ◽  
Author(s):  
J. K. S. McKay
Keyword(s):  
Symmetric Group ◽  
Group Characters

Hidden structures of knot invariants

2014 ◽  
Vol 29 (29) ◽  
pp. 1430063 ◽  
Author(s):  
Alexey Sleptsov
Keyword(s):  
Symmetric Group ◽  
Torus Knots ◽  
Knot Invariants ◽  
Vassiliev Invariants ◽  
Double Affine Hecke Algebra ◽  
Loop Expansion ◽  
Group Characters ◽  
The Family ◽  
Homfly Polynomials ◽  
Genus Expansion

We discuss a connection of HOMFLY polynomials with Hurwitz covers and represent a generating function for the HOMFLY polynomial of a given knot in all representations as Hurwitz partition function, i.e. the dependence of the HOMFLY polynomials on representation R is naturally captured by symmetric group characters (cut-and-join eigenvalues). The genus expansion and the loop expansion through Vassiliev invariants explicitly demonstrate this phenomenon. We study the genus expansion and discuss its properties. We also consider the loop expansion in details. In particular, we give an algorithm to calculate Vassiliev invariants, give some examples and discuss relations among Vassiliev invariants. Then we consider superpolynomials for torus knots defined via double affine Hecke algebra. We claim that the superpolynomials are not functions of Hurwitz type: symmetric group characters do not provide an adequate linear basis for their expansions. Deformation to superpolynomials is, however, straightforward in the multiplicative basis: the Casimir operators are beta-deformed to Hamiltonians of the Calogero–Moser–Sutherland system. Applying this trick to the genus and Vassiliev expansions, we observe that the deformation is fully straightforward only for the thin knots. Beyond the family of thin knots additional algebraically independent terms appear in the Vassiliev expansions. This can suggest that the superpolynomials do in fact contain more information about knots than the colored HOMFLY and Kauffman polynomials.

scholarly journals Power Sum Expansion of Chromatic Quasisymmetric Functions

10.37236/4761 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Christos A. Athanasiadis
Keyword(s):  
Symmetric Group ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Unit Interval ◽  
Quasisymmetric Function ◽  
Interval Order ◽  
Combinatorial Formula ◽  
Natural Unit ◽  
Power Sum ◽  
Chromatic Symmetric Function

The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley's chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof uses a formula of Roichman for the irreducible characters of the symmetric group.

scholarly journals Cohomology Classes of Interval Positroid Varieties and a Conjecture of Liu

10.37236/6960 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Brendan Pawlowski
Keyword(s):  
Symmetric Group ◽  
Finite Subset ◽  
Upper Bound ◽  
Cohomology Class ◽  
Symmetric Functions ◽  
A Priori ◽  
Specht Module ◽  
Group A ◽  
Schubert Classes ◽  
Stanley Symmetric Functions

To each finite subset of $\mathbb{Z}^2$ (a diagram), one can associate a subvariety of a complex Grassmannian (a diagram variety), and a representation of a symmetric group (a Specht module). Liu has conjectured that the cohomology class of a diagram variety is represented by the Frobenius characteristic of the corresponding Specht module. We give a counterexample to this conjecture.However, we show that for the diagram variety of a permutation diagram, Liu's conjectured cohomology class $\sigma$ is at least an upper bound on the actual class $\tau$, in the sense that $\sigma - \tau$ is a nonnegative linear combination of Schubert classes. To do this, we exhibit the appropriate diagram variety as a component in a degeneration of one of Knutson's interval positroid varieties (up to Grassmann duality). A priori, the cohomology classes of these interval positroid varieties are represented by affine Stanley symmetric functions. We give a different formula for these classes as ordinary Stanley symmetric functions, one with the advantage of being Schur-positive and compatible with inclusions between Grassmannians.

scholarly journals Unitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Sho Matsumoto ◽  
Jonathan Novak
Keyword(s):  
Symmetric Group ◽  
Matrix Models ◽  
Unitary Matrix ◽  
Group Characters ◽  
Matrix Integrals ◽  
International Audience

International audience A factorization of a permutation into transpositions is called "primitive'' if its factors are weakly ordered.We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously studied factorization problems. Several formulas enumerating minimal primitive and possibly non-minimal primitive factorizations are presented, and interesting connections with Jucys-Murphy elements, symmetric group characters, and matrix models are described. Une factorisation en transpositions d'une permutation est dite "primitive'' si ses facteurs sont ordonnés. Nous discutons du problème de l'énumération des factorisations primitives de permutations, et de sa place dans la hiérarchie des problèmes de factorisation précédemment étudiés. Nous présentons plusieurs formules énumérant certaines classes de factorisations primitives,et nous soulignons des connexions intéressantes avec les éléments Jucys-Murphy, les caractères des groupes symétriques, et les modèles de matrices.

Sign in / Sign up

Export Citation Format

Share Document