Coxeter-biCatalan combinatorics
We consider several counting problems related to Coxeter-Catalan combinatorics and conjecture that the problems all have the same answer, which we call the $W$ -biCatalan number. We prove the conjecture in many cases.
Main Authors: | Emily Barnard, Nathan Reading |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2519/pdf |
Similar Items
-
Generating trees for partitions and permutations with no k-nestings
by: Sophie Burrill, et al.
Published: (2012-01-01) -
The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
by: Manfred Kufleitner, et al.
Published: (2012-06-01) -
Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
by: Akos Seress, et al.
Published: (2010-03-01) -
Rational Catalan Combinatorics: The Associahedron
by: Drew Armstrong, et al.
Published: (2013-01-01) -
Poset binomials and rainbow characters
by: Daniel Bragg, et al.
Published: (2013-01-01)