DeepAI AI Chat
Log In Sign Up

Down-step statistics in generalized Dyck paths

07/30/2020
by   Andrei Asinowski, et al.
0

The number of down-steps between pairs of up-steps in k_t-Dyck paths, a recently introduced generalization of Dyck paths consisting of steps {(1, k), (1, -1)} such that the path stays (weakly) above the line y=-t, is studied. Results are proved bijectively and by means of generating functions, and lead to several interesting identities as well as links to other combinatorial structures. In particular, there is a connection between k_t-Dyck paths and perforation patterns for punctured convolutional codes (binary matrices) used in coding theory. Surprisingly, upon restriction to usual Dyck paths this yields a new combinatorial interpretation of Catalan numbers.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/14/2022

Enumeration of Dyck paths with air pockets

We introduce and study the new combinatorial class of Dyck paths with ai...
06/13/2019

On discrete idempotent paths

The set of discrete lattice paths from (0, 0) to (n, n) with North and E...
08/26/2022

Avoidability beyond paths

The concept of avoidable paths in graphs was introduced by Beisegel, Chu...
09/23/2019

Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices

We study the Whitney numbers of the first kind of combinatorial geometri...
11/09/2022

Grand Dyck paths with air pockets

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

LINKS: A dataset of a hundred million planar linkage mechanisms for data-driven kinematic design

In this paper, we introduce LINKS, a dataset of 100 million one degree o...
04/03/2018

On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths

One of the most interesting entities of homotopy type theory is the iden...