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

DOI10.1051/ITA/1986200404731zbMATH Open0613.05008OpenAlexW30997518MaRDI QIDQ3754011FDOQ3754011

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)

Cites Work

• Shuffle of parenthesis systems and Baxter permutations
• A Census of Hamiltonian Polygons
• Standard Young tableaux of height 4 and 5
• Title not available (Why is that?)

Cited In (6)

• Hypergeometric expressions for generating functions of walks with small steps in the quarter plane
• Title not available (Why is that?)
• Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
• Title not available (Why is that?)
• Probabilistic analysis of some distributed algorithms
• A human proof of Gessel's lattice path conjecture

   Recommendations

• Note on André's reflection principle 👍 👎
• Counting lattice paths in restricted planes 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A solution to the tennis ball problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Counting pairs of lattice paths by intersections 👍 👎
• Title not available (Why is that?) 👍 👎
• Lattice Path Enumeration 👍 👎

This page was built for publication: Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754011)