Cylindrical lattice walks and the Loehr-Warrington 10ⁿ conjecture

DOI10.1016/J.EJC.2005.12.004MaRDI QIDQ872033zbMATHOpenAlexWikidataFDO

Authors Jonas Sjöstrand

Publication date 27 March 2007

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

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)

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.

Recommendations

• scientific article; zbMATH DE number 5844324
• Towards a human proof of Gessel's conjecture
• Proof of a conjecture on the slit plane problem
• A human proof of Gessel's lattice path conjecture
• Proof of Ira Gessel's lattice path conjecture

Cites work

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

Cited in

(2)

• The corners of core partitions
• A continuous family of partition statistics equidistributed with length

Describes a project that uses

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)