Results 31 to 40 of about 20,234 (200)
Dyck Words, Lattice Paths, and Abelian Borders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al.
F. Blanchet-Sadri +2 more
doaj +1 more source
Toughness enhancement of honeycomb lattice structures through heterogeneous design
Materials & Design, 2022 Inspired by the microstructures feature in the architected composites, which are consisted of a stiff phase and a soft phase, the concept of varying the struts thickness in the uniform honeycomb (UH) is proposed to enhance the toughness of UH structures ...
Xin Shu +5 more
doaj +1 more source
Journal of Statistical Planning and Inference, 2005 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
, 2022 This thesis is a survey of some of the well known results in lattice path theory. Chapter 1 looks into the history of lattice paths. That is, when it began and how it was popularized. Chapter 3 focuses on general lattices and lattice paths.
Ali, Irha
core
Journal of Combinatorial Theory, Series A, 1973 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]
Annals of Combinatorics, 2021 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
A quartet of fermionic expressions for M(k,2k±1) Virasoro characters via half-lattice paths
Nuclear Physics B, 2017 We derive new fermionic expressions for the characters of the Virasoro minimal models M(k,2k±1) by analysing the recently introduced half-lattice paths.
Olivier Blondeau-Fournier +2 more
doaj +1 more source
An extension of Tamari lattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 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
Lattice structure of Grassmann-Tamari orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.
Thomas McConville
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2007 Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches.
Mireille Bousquet-Mélou, Yann Ponty
doaj +1 more source