Ascending runs in permutations and valued Dyck paths

DOI10.26493/1855-3974.1679.ad3zbMath1416.05006OpenAlexW2914731791MaRDI QIDQ5225051

Niccolò Castronuovo, Matteo Silimbani, Flavio Bonetti, Marilena Barnabei

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1679.ad3

zbMATH Keywords

Hankel transformpermutationDyck pathpattern avoidance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dyck tableaux
• Patterns in permutations and words.
• The descent statistic on 123-avoiding permutations
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2
• Indecomposable permutations, hypermaps and labeled Dyck paths
• A correspondence between ordered trees and noncrossing partitions
• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• Advanced determinant calculus
• Combinatorial statistics on non-crossing partitions
• Parking functions and noncrossing partitions
• Consecutive patterns in permutations
• A simple and unusual bijection for Dyck paths and its consequences
• Correspondences between the different types of bijections between the symmetric group and the valued Motzkin paths
• The On-Line Encyclopedia of Integer Sequences
• More bijective Catalan combinatorics on permutations and on signed permutations
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Advanced determinant calculus: a complement
• Closed-form expression for Hankel determinants of the Narayana polynomials
• Eulerian polynomials as moments, via exponential Riordan arrays
• A Course in Enumeration