DeepAI AI Chat
Log In Sign Up

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

10/06/2021
by   Jean-Luc Baril, et al.
Université de Bourgogne
0

We consider the system of equations A_k(x)=p(x)A_k-1(x)(q(x)+∑_i=0^k A_i(x)) for k≥ r+1 where A_i(x), 0≤ i ≤ r, are some given functions and show how to obtain a close form for A(x)=∑_k≥ 0A_k(x). We apply this general result to the enumeration of certain subsets of Dyck, Motzkin, skew Dyck, and skew Motzkin paths, defined recursively according to the first return decomposition with a monotonically non-increasing condition relative to the maximal ordinate reached by an occurrence of a given pattern π.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/09/2022

Grand Dyck paths with air pockets

Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck pa...
02/23/2022

Dyck paths with catastrophes modulo the positions of a given pattern

For any pattern p of length at most two, we provide generating functions...
06/04/2021

Maximal antichains of subsets II: Constructions

This is the second in a sequence of three papers investigating the quest...
05/22/2021

Tensor products of coherent configurations

A Cartesian decomposition of a coherent configuration X is defined as a ...
02/14/2023

Sizes of flat maximal antichains of subsets

This is the second of two papers investigating for which positive intege...
10/01/2019

Initial Steps in the Classification of Maximal Mediated Sets

Maximal mediated sets (MMS), introduced by Reznick, are distinguished su...
01/26/2022

Understanding and Compressing Music with Maximal Transformable Patterns

We present a polynomial-time algorithm that discovers all maximal patter...