Path counting and random matrix theory.
Dumitriu, Ioana, Rassart, Etienne (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Multiplicative solution theory for three-path combinations”
Path counting and random matrix theory.
The generating function of ternary trees and continued fractions.
Gessel, Ira M., Xin, Guoce (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
The enumeration of sequences with restrictions on their partial sums.
Suen, Stephen, Wagner, Kevin P. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dyck paths with no peaks at height .
Peart, Paul, Woan, Wen-Jin (2001)
Journal of Integer Sequences [electronic only]
Similarity:
From -Motzkin paths to Schröder paths.
Yan, Sherry H.F. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Counting lattice paths by Narayana polynomials.
Sulanke, Robert A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting upper interactions in Dyck paths.
Le Borgne, Yvan (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
A geometrical property of causal invertible systems.
Olteanu, Mircea (2000)
APPS. Applied Sciences
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:
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...