Poset homology of Rees products, and \(q\)-Eulerian polynomials (Q2380322)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Poset homology of Rees products, and \(q\)-Eulerian polynomials
scientific article

    Statements

    Poset homology of Rees products, and \(q\)-Eulerian polynomials (English)
    0 references
    0 references
    0 references
    26 March 2010
    0 references
    Summary: The notion of Rees product of posets was introduced by \textit{A. Björner} and \textit{V. Welker} in [J. Pure Appl. Algebra 198, No.~1--3, 43--55 (2005; Zbl 1062.05147)], where they study connections between poset topology and commutative algebra. Björner and Welker conjectured and \textit{J. Jonsson} [``The Rees product of a Boolean algebra and a chain'' (preprint)] proved that the dimension of the top homology of the Rees product of the truncated Boolean algebra \(B_n\setminus\{0\}\) and the \(n\)-chain \(C_n\) is equal to the number of derangements in the symmetric group \({\mathfrak S}_n\). Here we prove a refinement of this result, which involves the Eulerian numbers, and a \(q\)-analog of both the refinement and the original conjecture, which comes from replacing the Boolean algebra by the lattice of subspaces of the \(n\)-dimensional vector space over the \(q\) element field, and involves the (maj,exc)-\(q\)-Eulerian polynomials studied in previous papers of the authors [Electron. Res. Announc. Am. Math. Soc. 13, 33--45, electronic only (2007; Zbl 1113.05015)); ``Eulerian quasisymmetric functions'', preprint (2008)]. Equivariant versions of the refinement and the original conjecture are also proved, as are type BC versions (in the sense of Coxeter groups) of the original conjecture and its \(q\)-analog.
    0 references
    Rees product
    0 references
    poset topology
    0 references
    commutative algebra
    0 references
    Eulerian numbers
    0 references
    Eulerian polynomials
    0 references
    Coxeter groups
    0 references

    Identifiers

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