Dyck paths with catastrophes modulo the positions of a given pattern

02/23/2022
by   Jean-Luc Baril, et al.
0

For any pattern p of length at most two, we provide generating functions and asymptotic approximations for the number of p-equivalence classes of Dyck paths with catastrophes, where two paths of the same length are p-equivalent whenever the positions of the occurrences of the pattern p are the same.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/12/2019

Popularity of patterns over d-equivalence classes of words and permutations

Two same length words are d-equivalent if they have same descent set and...
research
04/02/2023

Algorithms for Construction, Classification and Enumeration of Closed Knight's Paths

Two algorithms for construction of all closed knight's paths of lengths ...
research
04/02/2021

Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths

In this note, we present constructive bijections from Dyck and Motzkin m...
research
10/06/2021

Lattice paths with a first return decomposition constrained by the maximal height of a pattern

We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i...
research
04/11/2019

Prolific Compositions

Under what circumstances might every extension of a combinatorial struct...
research
06/14/1999

Ocular dominance patterns in mammalian visual cortex: A wire length minimization approach

We propose a theory for ocular dominance (OD) patterns in mammalian prim...
research
02/14/2022

Enumeration of Dyck paths with air pockets

We introduce and study the new combinatorial class of Dyck paths with ai...

Please sign up or login with your details

Forgot password? Click here to reset