Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes

DOI10.1051/ita/1986200404731zbMath0613.05008OpenAlexW30997518MaRDI QIDQ3754011

Didier G. Arquès

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92272

zbMATH Keywords

square gridpath enumerationAndre's reflection principlecounting pathsplane regions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items

Probabilistic analysis of some distributed algorithms, Hypergeometric expressions for generating functions of walks with small steps in the quarter plane, A human proof of Gessel’s lattice path conjecture

Cites Work

• Unnamed Item
• Shuffle of parenthesis systems and Baxter permutations
• Standard Young tableaux of height 4 and 5
• A Census of Hamiltonian Polygons