The enumeration of sequences with restrictions on their partial sums.
Suen, Stephen, Wagner, Kevin P. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On a new Wiener-Hopf factorization by Alili and Doney”
The enumeration of sequences with restrictions on their partial sums.
Path counting and random matrix theory.
Dumitriu, Ioana, Rassart, Etienne (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:
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:
Dyck paths with no peaks at height .
Peart, Paul, Woan, Wen-Jin (2001)
Journal of Integer Sequences [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:
Counting upper interactions in Dyck paths.
Le Borgne, Yvan (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The generating function of ternary trees and continued fractions.
Gessel, Ira M., Xin, Guoce (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Circular digraph walks, -balanced strings, lattice paths and Chebychev polynomials.
Georgiadis, Evangelos, Callan, David, Hou, Qing-Hu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A natural extension of Catalan numbers.
Solomon, Noam, Solomon, Shay (2008)
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:
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...