AbstractThe theory of reduced incidence algebras of binomial posets furnishes a unified treatment of several types of generating functions that arise in enumerative combinatorics. Using this theory as a tool, we study ‘reduced covering algebras’ of binomial lattices and show that they are isomorphic to various algebras of q-binomial generating functions for certain modular binomial lattices
AbstractAn important well-known result of Rota describes the relationship between the Möbius functio...
AbstractIt was shown in earlier work that many combinatorial problems can be treated analytically by...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
AbstractA unified method is presented for enumerating permutations of sets and multisets with variou...
AbstractWe construct three (large, reduced) incidence algebras whose semigroups of multiplicative fu...
The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
In the mid 1960\u27s, the incidence algebra was introduced in the seminal paper of Gian-Carlo Rota. ...
AbstractWe construct three (large, reduced) incidence algebras whose semigroups of multiplicative fu...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
AbstractWe give a comprehensive introduction to the algebra of set functions and its generating func...
AbstractWe introduce the notion of a reduced incidence coalgebra of a family of locally finite parti...
AbstractThe main result of this paper is a necessary and sufficient condition on an equivalence rela...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
AbstractAn important well-known result of Rota describes the relationship between the Möbius functio...
AbstractIt was shown in earlier work that many combinatorial problems can be treated analytically by...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
AbstractA unified method is presented for enumerating permutations of sets and multisets with variou...
AbstractWe construct three (large, reduced) incidence algebras whose semigroups of multiplicative fu...
The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $...
AbstractA sequence of binomial type is a basis for R[x] satisfying a binomial-like identity, e.g. po...
In the mid 1960\u27s, the incidence algebra was introduced in the seminal paper of Gian-Carlo Rota. ...
AbstractWe construct three (large, reduced) incidence algebras whose semigroups of multiplicative fu...
We obtain a three-parameter q-series identity that generalizes two results of Chan and Mao. By speci...
A sequence of binomial type is a basis for [x] satisfying a binomial-like identity, e.g. powers, ris...
AbstractWe give a comprehensive introduction to the algebra of set functions and its generating func...
AbstractWe introduce the notion of a reduced incidence coalgebra of a family of locally finite parti...
AbstractThe main result of this paper is a necessary and sufficient condition on an equivalence rela...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
AbstractAn important well-known result of Rota describes the relationship between the Möbius functio...
AbstractIt was shown in earlier work that many combinatorial problems can be treated analytically by...
We study generating functions of strict and non-strict order polynomials of series-parallel posets, ...
DOI
Add to ORKG