Equivalence classes of ballot paths modulo strings of length 2 and 3

DOI10.1016/J.DISC.2016.05.001MaRDI QIDQ294567zbMATH OpenOpenAlexFDO

Authors K. Manes, A. Sapounakis, I. Tasoulas, P. Tsikouras

Publication date 16 June 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.01952

zbMATH Keywords

Dyck pathstringballot path

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: Two paths are equivalent modulo a given string $au$, whenever they have the same length and the positions of the occurrences of $au$ are the same in both paths. This equivalence relation was introduced for Dyck paths in cite{BP}, where the number of equivalence classes was evaluated for any string of length 2. In this paper, we evaluate the number of equivalence classes in the set of ballot paths for any string of length 2 and 3, as well as in the set of Dyck paths for any string of length 3.

Recommendations

• Equivalence classes of Motzkin paths modulo a pattern of length at most two
• Equivalence classes of Dyck paths modulo some statistics
• Enumeration of Łukasiewicz paths modulo some patterns
• Equivalence classes of skew Dyck paths modulo some patterns
• Dyck paths with catastrophes modulo the positions of a given pattern

Cites work

• scientific article; zbMATH DE number 1919514 (Why is no real title available?)
• Counting strings at height \(j\) in Dyck paths
• Counting strings in Dyck paths
• Dyck path enumeration
• Equivalence classes of Dyck paths modulo some statistics
• Equivalence classes of Motzkin paths modulo a pattern of length at most two
• General results on the enumeration of strings in Dyck paths
• Some statistics on Dyck paths
• Statistics on Dyck paths
• The On-Line Encyclopedia of Integer Sequences
• The statistic ``number of udu's in Dyck paths

Cited in

(8)

• Equivalence classes of skew Dyck paths modulo some patterns
• Dyck paths with catastrophes modulo the positions of a given pattern
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Equivalence classes of Dyck paths modulo some statistics
• Equivalence classes of Motzkin paths modulo a pattern of length at most two
• Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
• Enumeration of Łukasiewicz paths modulo some patterns
• Counting depth zero patterns in ballot paths

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Equivalence classes of ballot paths modulo strings of length 2 and 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294567)