scholarly journals Generalized Pattern-Matching Conditions for

2013 ◽  
Vol 2013 ◽  
pp. 1-20 ◽  
Author(s):  
Sergey Kitaev ◽  
Andrew Niedermaier ◽  
Jeffrey Remmel ◽  
Manda Riehl
Keyword(s):  
Symmetric Group ◽  
Pattern Matching ◽  
Infinite Number ◽  
Generating Functions ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Matching Condition ◽  
Natural Analogues ◽  
Generalized Pattern Matching ◽  
Product Order

We derive several multivariable generating functions for a generalized pattern-matching condition on the wreath product of the cyclic group and the symmetric group . In particular, we derive the generating functions for the number of matches that occur in elements of for any pattern of length 2 by applying appropriate homomorphisms from the ring of symmetric functions over an infinite number of variables to simple symmetric function identities. This allows us to derive several natural analogues of the distribution of rises relative to the product order on elements of . Our research leads to connections to many known objects/structures yet to be explained combinatorially.

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 Generating Functions for Permutations which Contain a Given Descent Set

10.37236/299 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Jeffrey Remmel ◽  
Manda Riehl
Keyword(s):  
Symmetric Group ◽  
Generating Functions ◽  
Symmetric Function ◽  
Schur Functions ◽  
Permutation Statistics ◽  
Finite Set ◽  
Set Of Permutations ◽  
Descent Set ◽  
Positive Integers

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation $\sigma$, $des(\sigma)$, arise in this way. For any given finite set $S$ of positive integers, we develop a method to produce similar generating functions for the set of permutations of the symmetric group $S_n$ whose descent set contains $S$. Our method will be to apply certain homomorphisms to symmetric function identities involving ribbon Schur functions.

scholarly journals A Macdonald Vertex Operator and Standard Tableaux Statistics

10.37236/1383 ◽  
1998 ◽  
Vol 5 (1) ◽  
Author(s):  
Mike Zabrocki
Keyword(s):  
Vertex Operator ◽  
Generating Functions ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Schur Function ◽  
Inductive Proof ◽  
Integer Coefficients ◽  
The Family ◽  
The Relationship ◽  
Two Parameter

The two parameter family of coefficients $K_{\lambda \mu}(q,t)$ introduced by Macdonald are conjectured to $(q,t)$ count the standard tableaux of shape $\lambda $. If this conjecture is correct, then there exist statistics $a_\mu(T)$ and $b_\mu(T)$ such that the family of symmetric functions $H_\mu[X;q,t] = \sum_\lambda K_{\lambda \mu}(q,t) s_\lambda [X]$ are generating functions for the standard tableaux of size $|\mu|$ in the sense that $H_\mu[X;q,t] = \sum_{T} q^{a_\mu(T)} t^{b_\mu(T)} s_{\lambda (T)}[X]$ where the sum is over standard tableau of of size $|\mu|$. We give a formula for a symmetric function operator $H_2^{qt}$ with the property that $H_2^{qt} H_{(2^a1^b)}[X;q,t]= H_{(2^{a+1}1^b)}[X;q,t]$. This operator has a combinatorial action on the Schur function basis. We use this Schur function action to show by induction that $H_{(2^a1^b)}[X;q,t]$ is the generating function for standard tableaux of size $2a+b$ (and hence that $K_{\lambda (2^a1^b)}(q,t)$ is a polynomial with non-negative integer coefficients). The inductive proof gives an algorithm for 'building' the standard tableaux of size $n+2$ from the standard tableaux of size $n$ and divides the standard tableaux into classes that are generalizations of the catabolism type. We show that reversing this construction gives the statistics $a_\mu(T)$ and $b_\mu(T)$ when $\mu$ is of the form $(2^a1^b)$ and that these statistics prove conjectures about the relationship between adjacent rows of the $(q,t)$-Kostka matrix that were suggested by Lynne Butler.

scholarly journals Schur $P$-positivity and Involution Stanley Symmetric Functions

2017 ◽  
Vol 2019 (17) ◽  
pp. 5389-5440 ◽  
Author(s):  
Zachary Hamaker ◽  
Eric Marberg ◽  
Brendan Pawlowski
Keyword(s):  
Power Series ◽  
Generating Functions ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Schur Functions ◽  
Pattern Avoidance ◽  
Dominance Order ◽  
Schubert Polynomials ◽  
Stanley Symmetric Functions ◽  
Skew Schur Functions

Abstract The involution Stanley symmetric functions$\hat{F}_y$ are the stable limits of the analogs of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for involution words and are indexed by the involutions in the symmetric group. By construction, each $\hat{F}_y$ is a sum of Stanley symmetric functions and therefore Schur positive. We prove the stronger fact that these power series are Schur $P$-positive. We give an algorithm to efficiently compute the decomposition of $\hat{F}_y$ into Schur $P$-summands and prove that this decomposition is triangular with respect to the dominance order on partitions. As an application, we derive pattern avoidance conditions which characterize the involution Stanley symmetric functions which are equal to Schur $P$-functions. We deduce as a corollary that the involution Stanley symmetric function of the reverse permutation is a Schur $P$-function indexed by a shifted staircase shape. These results lead to alternate proofs of theorems of Ardila–Serrano and DeWitt on skew Schur functions which are Schur $P$-functions. We also prove new Pfaffian formulas for certain related involution Schubert polynomials.

scholarly journals On bipartitional functions

1938 ◽  
Vol 237 (780) ◽  
pp. 375-409 ◽  
Keyword(s):  
Generating Functions ◽  
Analytical Methods ◽  
Symmetric Function ◽  
Symmetric Functions ◽  
Differential Operators ◽  
Latin Squares ◽  
Algebraic Methods ◽  
Algebraic Solution ◽  
Arithmetical Functions ◽  
Practical Evaluation

Bipartitional functions are arithmetical functions of two partitions of the same number, and arise primarily in the theory of the symmetric function generating functions. Analytical methods of evaluating the partitional functions and of studying them in relation to the theory of distributions are largely due to Macmahon (1915). The use of partitional notation has rendered his methods distinctly simpler than those of his predecessors, but, simplified as they are, his methods do not make the practical evaluation of these functions particularly expeditious. If his methods are actually put into practice, it is found that they become increasingly laborious and impracticable with high-order symmetric functions. An excellent example of the difficulties encountered in the use of algebraic methods, especially those involving the action of differential operators, is to be found in the enumeration of the 5 x 5 and 6 x 6 Latin Squares (Fisher and Yates 1934). In this connexion it is shown by Fisher and Yates that the direct enumeration by trial is a much simpler approach than the development of the differential operators of Macmahon’s algebraic solution.

SYMMETRIC FUNCTIONS OF BINARY PRODUCTS OF TRIBONACCI LUCAS NUMBERS AND ORTHOGONAL POLYNOMIALS

2021 ◽  
Vol 21 (2) ◽  
pp. 461-478
Author(s):  
HIND MERZOUK ◽  
ALI BOUSSAYOUD ◽  
MOURAD CHELGHAM
Keyword(s):  
Orthogonal Polynomials ◽  
Generating Functions ◽  
Symmetric Functions ◽  
Lucas Numbers

In this paper, we will recover the new generating functions of some products of Tribonacci Lucas numbers and orthogonal polynomials. The technic used her is based on the theory of the so called symmetric functions.

scholarly journals Combinatorial Expansions in $K$-Theoretic Bases

10.37236/2320 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Jason Bandlow ◽  
Jennifer Morse
Keyword(s):  
Generating Functions ◽  
Symmetric Functions ◽  
Schur Functions ◽  
Geometric Information ◽  
Combinatorial Description ◽  
Littlewood Polynomials ◽  
Stanley Symmetric Functions ◽  
K Theory ◽  
Combinatorial Representation

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape.  Included in this class are the Hall-Littlewood polynomials, $k$-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur functions represent the cohomology of the Grassmannian variety of $GL_n$, Grothendieck functions $\{G_\lambda\}$ represent the $K$-theory of the same space.  In this paper, we give a combinatorial description of the coefficients when any element of $\mathcal C$ is expanded in the $G$-basis or the basis dual to $\{G_\lambda\}$.

scholarly journals How to get the weak order out of a digraph ?

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Francois Viard
Keyword(s):  
Wreath Product ◽  
Symmetric Function ◽  
Coxeter Groups ◽  
Symmetric Functions ◽  
Weak Order ◽  
Möbius Function ◽  
Mobius Function ◽  
Acyclic Digraph ◽  
International Audience

International audience We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, and the flag weak order on the wreath product &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduced by Adin, Brenti and Roichman (2012), are special instances of our construction. We conclude by briefly explaining how to use our work to define quasi-symmetric functions, with a special emphasis on the $A$<sub>$n-1$</sub> case, in which case we obtain the classical Stanley symmetric function. On construit une famille d’ensembles ordonnés à partir d’un graphe orienté, simple et acyclique munit d’une valuation sur ses sommets, puis on calcule les valeurs de leur fonction de Möbius respective. On montre que l’ordre faible sur les groupes de Coxeter $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, ainsi qu’une variante de l’ordre faible sur les produits en couronne &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduit par Adin, Brenti et Roichman (2012), sont des cas particuliers de cette construction. On conclura en expliquant brièvement comment ce travail peut-être utilisé pour définir des fonction quasi-symétriques, en insistant sur l’exemple de l’ordre faible sur $A$<sub>$n-1$</sub> où l’on obtient les séries de Stanley classiques.

Sign in / Sign up

Export Citation Format

Share Document