Results 111 to 120 of about 1,383 (202)
On a generalisation of k-Dyck paths [PDF]
, 2019 Thesis (MSc)--Stellenbosch University, 2019.ENGLISH ABSTRACT: (Refer to full text abstract for symbols that did not transfer correctly). We consider a family of non-negative lattice paths consisting of the step set f(1; 1); (1;k)g called k-Dyck paths ...
Selkirk, Sarah Jane
core
Enumerations and bijections of Dyck paths
A research report submitted in fulfilment of the requirements for the degree of Master of Science to the Faculty of Science, School of Mathematics, University of the Witwatersrand, Johannesburg, 2023A Dyck path is a non-negative lattice path with the ...
Mohlala, Derrick
core
Row-Column Combination of Dyck Words
We lift the notion of Dyck language from words to 2-dimensional arrays of symbols, i.e., pictures. We define the Dyck crossword language as the row-column combination of Dyck word languages, which prescribes that each column and row is a Dyck word ...
Crespi Reghizzi, Stefano +2 more
core +1 more source
Symmetric statistics on rational Dyck paths
Advances in Applied Mathematics17 pages, 5 ...
Lilan Dai, Shishuo Fu, Dun Qiu
openaire +2 more sources
Dyck paths and a bijection for multisets of hook numbers
, 2002 We give a bijective proof of a result of Regev and Vershik (Electron J. Combin. 4 (1997) R22) on the equality of two multisets of hook numbers of certain skew–Young diagrams.
Yong, Alexander, Goulden, Ian
core +1 more source
Uniform bounds for exponential moment of maximum of a Dyck paths
, 2009 7 pages; accepted by Electronic Communications in Probability. Version préliminaire (20/07/2009) d'un travail publié sous forme définitive (12/08/2009)International audienceLet D be a Dyck path chosen uniformly from the set of Dyck paths with 2n steps ...
Khorunzhiy, Oleksiy +1 more
core +1 more source
, 2012 We propose an original approach to the problem of rankunimodality for Dyck lattices. It is based on a well known recursive construction of Dyck paths originally developed in the context of the ECO methodology, which provides a partition of Dyck lattices into saturated chains.
openaire +4 more sources
Counting of subwords on restricted Dyck words
ilustraciones, diagramasEste trabajo se centra en el conteo de caminos de Dyck mediante el análisis de sus subpalabras. Para ello, se exploran conceptos como las funciones generatrices y sucesiones como la de Fibonacci, Lucas y Catalan.
Montoya Conde, Luisa María
core
We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary necklaces as well as anchored Dyck paths.
openaire +2 more sources
Counting Ascents in Generalized Dyck Paths.
, 2018 Non-negative Lukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are well-known and -studied combinatorial objects, in particular due to their bijective relation to trees with given node degrees.
Hackl, Benjamin +2 more
openaire +3 more sources