Three osculating walkers
Mireille Bousquet-Mélou
Abstract
We consider three directed walkers on the square lattice, which move simultaneously at each tick of a clock and never cross. Their trajectories form a non-crossing configuration of walks. This configuration is said to be osculating if the walkers never share an edge, and vicious (or: non-intersecting) if they never meet. We give a closed form expression for the generating function of osculating configurations starting from prescribed points. This generating function turns out to be algebraic. We also relate the enumeration of osculating configurations with prescribed starting and ending points to the (better understood) enumeration of non-intersecting configurations. Our method is based on a step by step decomposition of osculating configurations, and on the solution of the functional equation provided by this decomposition.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.