dyck paths
Recently Published Documents


TOTAL DOCUMENTS

173
(FIVE YEARS 32)

H-INDEX

12
(FIVE YEARS 2)

2022 ◽  
Vol 101 ◽  
pp. 103478
Author(s):  
Hsu-Lin Chien ◽  
Sen-Peng Eu ◽  
Tung-Shan Fu

2022 ◽  
pp. 1-20
Author(s):  
Gianmarco Bet ◽  
Jori Selen ◽  
Alessandro Zocca

Author(s):  
A. CELA ◽  
R. PANDHARIPANDE ◽  
J. SCHMITT

Abstract We interpret the degrees which arise in Tevelev’s study of scattering amplitudes in terms of moduli spaces of Hurwitz covers. Via excess intersection theory, the boundary geometry of the Hurwitz moduli space yields a simple recursion for the Tevelev degrees (together with their natural two parameter generalisation). We find exact solutions which specialise to Tevelev’s formula in his cases and connect to the projective geometry of lines and Castelnuovo’s classical count of $g^1_d$ ’s in other cases. For almost all values, the calculation of the two parameter generalisation of the Tevelev degree is new. A related count of refined Dyck paths is solved along the way.


Author(s):  
Rigoberto Flórez ◽  
José L. Ramírez ◽  
Fabio A. Velandia ◽  
Diego Villamizar

Local maxima and minima of a Dyck path are called peaks and valleys, respectively. A Dyck path is called restricted[Formula: see text]-Dyck if the difference between any two consecutive valleys is at least [Formula: see text] (right-hand side minus left-hand side) or if it has at most one valley. In this paper, we use several techniques to enumerate some statistics over this new family of lattice paths. For instance, we use the symbolic method, the Chomsky–Schűtzenberger methodology, Zeilberger’s creative telescoping method, recurrence relations, and bijective relations. We count, for example, the number of paths of length [Formula: see text], the number of peaks, the number of valleys, the number of peaks of a fixed height, and the area under the paths. We also give a bijection between the restricted [Formula: see text]-Dyck paths and a family of binary words.


Order ◽  
2021 ◽  
Author(s):  
Myrto Kallipoliti ◽  
Robin Sulzgruber ◽  
Eleni Tzanaki
Keyword(s):  

Author(s):  
Wilson Arley Martinez ◽  
Enrique G. Reyes ◽  
Maria Ronco

We review the notion of a [Formula: see text], an algebraic structure introduced recently by López, Préville-Ratelle and Ronco during their work on the splitting of associativity via [Formula: see text]-Dyck paths, and we also introduce Rota[Formula: see text]-algebras: both structures can be considered as generalizations of dendriform structures. We obtain examples of Dyck[Formula: see text]-algebras in terms of planar rooted binary trees equipped with a particular type of Rota–Baxter operator, and we present examples of Rotam-algebras using left averaging morphisms. As an application, we observe that the structures presented here allow us to introduce quite naturally a “non-associative version” of the Kadomtsev–Petviashvili hierarchy.


2021 ◽  
Vol 344 (6) ◽  
pp. 112364
Author(s):  
Sergi Elizalde
Keyword(s):  

Author(s):  
Agustín Moreno Cañadas ◽  
Isaías David Marín Gaviria ◽  
Gabriel Bravo Rios ◽  
Pedro Fernando Fernández Espinosa
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document