Abstract. We study statistics on ordered set partitions whose generating functions are related to p, q-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of Steingŕımsson(Arxiv:math.CO/0605670). Our basic idea is to encode ordered partitions by a kind of path diagrams and explore the rich combinatorial properties of the latter structure. We also give a partition version of MacMahon’s theorem on the equidistribution of the statistics inversion number an
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
An ordered partition of [n]: = {1, 2,..., n} is a sequence of disjoint and nonempty subsets, called ...
27 pages,8 figuresWe study statistics on ordered set partitions whose generating functions are relat...
27 pages,8 figuresWe study statistics on ordered set partitions whose generating functions are relat...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
An ordered partition of [n]: = {1, 2,..., n} is a sequence of disjoint and nonempty subsets, called ...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
AbstractWe give bijections on restricted growth functions and rook placements on stairstep Ferrers b...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
An ordered partition of [n]: = {1, 2,..., n} is a sequence of disjoint and nonempty subsets, called ...
27 pages,8 figuresWe study statistics on ordered set partitions whose generating functions are relat...
27 pages,8 figuresWe study statistics on ordered set partitions whose generating functions are relat...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
International audienceWe study statistics on ordered set partitions whose generating functions are r...
Abstract. An ordered partition with k blocks of [n]: = {1, 2,..., n} is a sequence of k disjoint and...
An ordered partition of [n]: = {1, 2,..., n} is a sequence of disjoint and nonempty subsets, called ...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
Abstract[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introdu...
AbstractWe give bijections on restricted growth functions and rook placements on stairstep Ferrers b...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blo...
An ordered partition of [n]: = {1, 2,..., n} is a sequence of disjoint and nonempty subsets, called ...