Results 21 to 30 of about 45,216 (263)
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e., lattices of Dyck paths) and give a recursive construction for them.
FERRARI, LUCA, PINZANI, RENZO
openaire +5 more sources
On a new congruence in the Catalan triangle [PDF]
For 0≤k≤n, the number C(n,k) represents the number of all lattice paths in the plane from the point (0,0) to the point (n,k), using steps (1,0) and (0,1), that never rise above the main diagonal y = x.
Jovan Mikić
doaj +1 more source
Anyon is collective excitation of two dimensional electron gas subjected to strong magnetic field, carrying fractional charges and exotic statistical character beyond fermion and boson.
Tieyan Si
doaj +1 more source
An extension of Tamari lattices [PDF]
For any finite path $v$ on the square lattice consisting of north and east unit steps, we construct a poset Tam$(v)$ that consists of all the paths lying weakly above $v$ with the same endpoints as $v$.
Louis-François Préville-Ratelle +1 more
doaj +1 more source
AbstractA weighted lattice path from (1, 1) to (n, m) is a path consisting of unit vertical, horizontal, and diagonal steps of weight w. Let f(0), f(1), f(2), … be a nondecreasing sequence of positive integers; the path connecting the points of the set {(n, m) ¦ f(n − 1) ⩽ m ⩽ f(n), n = 1, 2, …} will be called the roof determined by f. We determine the
R. D. Fray, D. P. Roselle
openaire +2 more sources
The Degree of Symmetry of Lattice Paths [PDF]
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We study the behavior of this statistic on Dyck paths and grand Dyck paths, with symmetry described by reflection along ...
openaire +2 more sources
Lattice Paths for Persistent Diagrams
Persistent homology has undergone significant development in recent years. However, one outstanding challenge is to build a coherent statistical inference procedure on persistent diagrams. In this paper, we first present a new lattice path representation for persistent diagrams.
Moo K. Chung, Hernando C. Ombao
openaire +5 more sources
Jagged Partitions and Lattice Paths [PDF]
A lattice-path description of $K$-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even $x$ coordinate and the maximal value of the height cannot be larger than $K-1$. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions.
Jacob, P., Mathieu, P.
openaire +2 more sources
Shortage of information on association of traits is one of the problems in fenugreek productivity. Field experiment was implemented at Jamma district of South Wollo Administrative Zone of Amhara National Regional State, in 2018/19 main rainy season to ...
Yimam ALI ABTEW, Alemu ABATE
doaj +1 more source
From generalized Tamari intervals to non-separable planar maps [PDF]
Let v be a grid path made of north and east steps. The lattice TAM(v), based on all grid paths weakly above the grid path v sharing the same endpoints as v, was introduced by Pre ́ville-Ratelle and Viennot (2014) and corresponds to the usual Tamari ...
Wenjie Fang +1 more
doaj +1 more source

