Cylindrical lattice walks and the Loehr-Warrington 10ⁿ conjecture

DOI10.1016/J.EJC.2005.12.004zbMATH Open1112.05007arXivmath/0509521OpenAlexW2063641786WikidataQ123219479 ScholiaQ123219479MaRDI QIDQ872033FDOQ872033

Jonas Sjöstrand

Publication date: 27 March 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2. We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice paths.

Full work available at URL: https://arxiv.org/abs/math/0509521

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Cites Work

• Nonintersecting lattice paths on the cylinder
• Exact solution of the lock step model of vicious walkers

Cited In (2)

• A continuous family of partition statistics equidistributed with length
• The Corners of Core Partitions

Uses Software

• TEN

This page was built for publication: Cylindrical lattice walks and the Loehr-Warrington \(10^{n}\) conjecture

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