q-hook length formulas for forests (Q911620): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Quotients in Coxeter Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Netto Inversion Number of a Sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Major Index and Inversion Number of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hook Graphs of the Symmetric Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation statistics and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inversion enumerator for labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of partitions with hooklengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered structures and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buildings of spherical type and finite BN-pairs / rank
 
Normal rank

Latest revision as of 15:10, 20 June 2024

scientific article
Language Label Description Also known as
English
q-hook length formulas for forests
scientific article

    Statements

    q-hook length formulas for forests (English)
    0 references
    1989
    0 references
    If P is a finite poset with a one-one labeling w, then the set of linear extensions L(P,w) of (P,w) generates a set of permutations on w(P), which is normally the set \(\{\) 1,...,n\(\}\). The structure of the poset is therefore related directly to that of the set of permutations associated with it. Given (P,w), the descent set \(D(P,w)=\{x\in P|\) \(w(x)>w(y)\), y covers \(x\}\), the major index \(maj(P,w)=\sum \{x\in D(p,w)|\) \(h_ x\}\), where \(h_ x\) is the number of elements in the order ideal generated by x, inv(P,w) is the number of ordered pairs (x,y) such that \(x<y\) and \(w(x)>w(y)\). A forest is a poset such that every element is covered by at most one element. Knuth's hook-length formula is \(| L(P,w)| =n!/\prod \{x\in P|\) \(h_ x\}\). A labeling w on a poset P is regular if \(x<z\) and \(y\in P\) with \(w(x)<w(y)<w(z)\) or \(w(x)>w(y)>w(z)\) implies \(x<y\) or \(y<z\). Regular labelings include many important special types. If \([n]=1+q+...+q^{n-1}\) and \([n]!=[n]([n- 1]!)\), then the q-formulas reduce for \(=1\) to standard ones. Among others the authors prove the following very interesting analogues of Knuth's formula which may be used as tools for structural analysis of posets as well, especially as applied to forests. I. Let P be any forest of size n and let w be any regular labeling of P, then: \[ \sum \{\sigma \in L(P,w)| \quad q^{inv(\sigma)}\}=q^{inv(P,w)}[n]!/\prod \{x\in P| \quad [h_ x]\}. \] II. If w is any labeling of P in I, then: \[ \sum \{\sigma \in L(P,w)| \quad q^{maj(\sigma)}\}=q^{maj(P,w)}[n]!/\prod \{x\in P| \quad [h_ x]\}. \] III. If W(P) is the set of all labelings in P, then: \[ \sum \{w\in W(P)| \quad q^{inv(P,w)}\}=(n!/\prod \{x\in P| \quad h_ x\})\prod x\in P| \quad [h_ x]\}=\sum \{w\in W(P)| \quad q^{maj(p,w)}\}. \] IV. (P,w) is a regularly labeled forest iff for some \(k\geq 0:\) \(\sum \{\sigma \in L(P,w)| \quad q^{inv(\sigma)}\}=q^ k([n]!/\prod \{x\in P| \quad [h_ x]\}).\)V. (P,w) is a labeled forest iff for some \(k\geq 0:\) \(\sum \{\sigma \in L(P,w)| \quad q^{maj(\sigma)}\}=q^ k([n]!/\prod \{x\in P| \quad [h_ x]\}).\)In obtaining these results the authors also reprove an important result of Stanley in a purely combinatorial manner.
    0 references
    linear extensions
    0 references
    permutations
    0 references
    forest
    0 references
    hook-length
    0 references
    structural analysis of posets
    0 references
    labelings
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references