Reduction of m-regular noncrossing partitions

@article{Chen2004ReductionOM,
  title={Reduction of m-regular noncrossing partitions},
  author={William Y. C. Chen and Eva Yu-Ping Deng and Rosena R. X. Du},
  journal={Eur. J. Comb.},
  year={2004},
  volume={26},
  pages={237-243}
}

Figures from this paper

On 2-regular $k$-noncrossing partitions

In this paper we prove a bijection between 2-regular, $k$-noncrossing partitions and $k$-noncrossing enhanced partitions. Via this bijection we enumerate 2-regular, 3-noncrossing partitions using an

Enumeration of (k, 2)-noncrossing partitions

Enumeration of Gap-Bounded Set Partitions

We count set partitions in which the gaps between adjacent elements in a block are bounded from above by an integer m > 0, also known as m-gap-bounded partitions. This problem is harder than known

Actions and Identities on Set Partitions

A group action of A n on the set of A-labeled partitions of an (n + 1)-set is derived and new combinatorial proofs of Coker’s identity for the Narayana polynomial and its type B analogue are derived.

Identities Derived from Noncrossing Partitions of Type B

Based on weighted noncrossing partitions of type $B$, we obtain type $B$ analogues of Coker's identities on the Narayana polynomials. A parity reversing involution is given for the alternating sum of

d-REGULAR SET PARTITIONS AND ROOK PLACEMENTS

We use a classical correspondence between set partitions and rook place- ments on the triangular board to give a quick picture understanding of the "reduction identity" |P (d) (n, k)| = |P (d j) (n −

Weighted 2-Motzkin Paths

This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch

Fubini Numbers and Polynomials of Graphs

In this paper, we introduce the Fubini number and Fubini polynomial of a graph in connection with the enumeration of ordered independent partitions of its set of vertices. We prove several properties

Matchings Avoiding Partial Patterns

In the sense of Wilf-equivalence, the method of generating trees is used to show that the patterns 12132, 12123, 12321, 12231, 12213 are all equivalent to the pattern $12312$.

References

SHOWING 1-10 OF 19 REFERENCES

Noncrossing partitions

On Trees and Noncrossing Partitions

On abab-free and abba-free Set Partitions

This work summarizes and extends known enumeriative results for the patternp=ababand to give an explicit formula for the number of p(abab, n, l, k) of partitions of such partitions.

On the structure of the lattice of noncrossing partitions

Bell numbers and k-trees

A map-theoretic approach to Davenport-Schinzel sequences.

An (n, d) Davenport-Schinzel Sequence (more briefly, a DS sequence) is a sequence of symbols selected from 1,2, , n, with the properties that (1) no two adjacent symbols are identical, (2) no

Ordered trees and non-crossing partitions

A Construction for Enumerating k-coloured Motzkin Paths

A method for enumerating k- coloured Motzkin paths according to various parameters is illustrated and a recursive description of these paths is given from which it is deduced the k- colored MotZkin paths' generating function according to their length, area and last fall length.

Combinatorics of RNA Secondary Structures