Josuat-Vergès, Matthieu and Kim, Jang Soo - Generalized Dyck tilings (Extended Abstract)

dmtcs:2391 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Generalized Dyck tilings (Extended Abstract)

Authors: Josuat-Vergès, Matthieu and Kim, Jang Soo

Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The first goal of this work is to give an alternative point of view on Dyck tilings by making use of the weak order and the Bruhat order on permutations. Then we introduce two natural generalizations: $k$-Dyck tilings and symmetric Dyck tilings. We are led to consider Stirling permutations, and define an analogue of the Bruhat order on them. We show that certain families of $k$-Dyck tilings are in bijection with intervals in this order. We enumerate symmetric Dyck tilings and show that certain families of symmetric Dyck tilings are in bijection with intervals in the weak order on signed permutations.

Source : oai:HAL:hal-01058407v2
Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Submitted on: November 21, 2016
Keywords: Dyck tilings,Bruhat order,weak order,Stirling permutations,forests,matchings,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Browsing statistics

This page has been seen 21 times.