Analogs of Schur functions for rank two Weyl groups obtained from grid-like posets

Alverson, L. Wyatt; Donnelly, Robert G.; Lewis, Scott J.; Pervine, Robert

doi:10.48550/arxiv.1901.00185

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Further, one can sometimes show a given Gstructured poset R is a splitting poset for χ λ by locating an admissible system inside R as an edge-colored subgraph. This method is employed by Alverson, Donnelly, Lewis, and Pervine in [ADLP2] to give another proof that the 'semistandard' lattices of [ADLMPPW] understood that the player will continue to fire as long as there is at least one node with a positive number. In general, given a position λ, a game sequence for λ is the (possibly empty, possibly infinite) sequence (γ i 1 , γ i 2 , .…”

Section: Proposition B16mentioning

confidence: 99%

“…This yields another proof and some new analogs of the Bender-Knuth identity for enumerating a certain family of plane partitions. Corollary 8.2.B is used in [ADLP2] to more easily re-derive the main splitting result of [ADLMPPW]. It is also used in [Don10] to give another proof of the result due to Proctor and Stanley (see [Proc3]) that minuscule posets are Gaussian.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Poset models for Weyl group analogs of symmetric functions and Schur functions

Donnelly

2018

Preprint

Self Cite

View full text Add to dashboard Cite

The "Weyl symmetric functions" studied here naturally generalize classical symmetric (polynomial) functions, and "Weyl bialternants," sometimes also called Weyl characters, analogize the Schur functions. For this generalization, the underlying symmetry group is a finite Weyl group. A "splitting poset" for a Weyl bialternant is an edge-colored ranked poset possessing a certain structural property and a natural weighting of its elements so that the weighted sum of poset elements is the given Weyl bialternant. Connected such posets are of combinatorial interest in part because they are rank symmetric and rank unimodal and have nice quotientof-product expressions for their rank generating functions. Supporting graphs of weight bases for irreducible semisimple Lie algebra representations provide one large family of examples.However, many splitting posets can be obtained outside of this Lie theoretic context.This monograph provides a tutorial on Weyl bialternants / Weyl symmetric functions and splitting posets that is largely self-contained and independent of Lie algebra representation theory. New results are also obtained. In particular, a cancelling argument of Stembridge is reworked to provide sufficient combinatorial conditions for a given poset to be splitting. This new splitting theorem is used to help construct what are here named crystalline splitting posets. The Weyl bialternants with unique splitting posets are classified, and a new combinatorial characterization of splitting posets associated with the minuscule and quasi-minuscule dominant weights is given. These findings are supported by other new results of a poset-structural nature.In addition, some new conceptual approaches are presented. The notion of a "refined" splitting poset is introduced to address not only splitting-type problems but also Littlewood-Richardson-type (i.e. product decomposition) and branching-type problems. "Crystalline splitting posets" are introduced as a class of posets that behave much like crystal graphs from the crystal base theory of Kashiwara et al with regard to branching and decomposing products. A new technique called "vertex coloring" is used in conjunction with the new splitting theorem to produce crystalline splitting posets and, in particular, all crystal graphs. Via this vertexcoloring method, Stembridge's admissible systems are shown to be crystalline splitting posets.Crystal basis / crystal graph theory is used to demonstrate uniqueness of crystalline splitting posets obtained via a product construction.

show abstract

Section: Proposition B16mentioning

confidence: 99%

mentioning

confidence: 99%