Dyck paths with no peaks at height .
Peart, Paul, Woan, Wen-Jin (2001)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Helly-type theorems for infinite and for finite intersections of sets starshaped via staircase paths.”
Dyck paths with no peaks at height .
Bicoloured Dyck paths and the contact polynomial for non-intersecting paths in a half-plane lattice.
Brak, R., Essam, J.W. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
From -Motzkin paths to Schröder paths.
Yan, Sherry H.F. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Counting paths between points on a circle
Ivaylo Kortezov (2023)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The paper deals with counting sets of given magnitude whose elements are self-avoiding paths with nodes from a fixed set of points on a circle. Some of the obtained formulae provide new properties of entries in ``The On-line Encyclopaedia of Integer Sequences", while others generate new entries therein.
The enumeration of sequences with restrictions on their partial sums.
Suen, Stephen, Wagner, Kevin P. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bijection between 3-Motzkin paths and Schröder paths with no peak at odd.
Shapiro, Louis W., Wang, Carol J. (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On the edge set of graphs of lattice paths.
Klee, Steven, Pudwell, Lara, Gillman, Rick (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Counting upper interactions in Dyck paths.
Le Borgne, Yvan (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Path counting and random matrix theory.
Dumitriu, Ioana, Rassart, Etienne (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Piecewise Linear Paths Among Convex Obstacles.
J. Matousek, O. Schwarzkopf, M. de Berg (1995)
Discrete & computational geometry
Similarity:
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)
RAIRO - Operations Research
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
Objects counted by the central Delannoy numbers.
Sulanke, Robert A. (2003)
Journal of Integer Sequences [electronic only]
Similarity: