Constant term solution for an arbitrary number of osculating lattice paths

DOI10.1007/S11005-013-0646-1MaRDI QIDQ369666zbMATH OpenOpenAlexFDO

Authors R. Brak, Wellington Galleas

Publication date 19 September 2013

Published in Letters in Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Bethe ansatzcommon verticesconstant termconstant term formulano common edgesnumber of directed lattice pathsosculating pathssimultaneous difference equations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) General theory of difference equations (39A05)

Abstract: Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths by solving a set of simultaneous difference equations.

Recommendations

• Counting lattice paths by using difference equations with non-constant coefficients
• Osculating paths and oscillating tableaux
• Counting lattice paths in restricted planes
• Counting pairs of lattice paths by intersections
• Partial difference equation method for lattice path problems

Cites work

• scientific article; zbMATH DE number 991882 (Why is no real title available?)
• scientific article; zbMATH DE number 3856167 (Why is no real title available?)
• scientific article; zbMATH DE number 3002434 (Why is no real title available?)
• scientific article; zbMATH DE number 892258 (Why is no real title available?)
• Alternating sign matrices and descending plane partitions
• Binomial determinants, paths, and hook length formulae
• Calculation of norms of Bethe wave functions
• Determinants of super-Schur functions, lattice paths, and dotted plane partitions
• Integral formulas for the asymmetric simple exclusion process
• Nonintersecting paths, pfaffians, and plane partitions
• On the fully commutative elements of Coxeter groups
• Partial difference equation method for lattice path problems
• Plane partitions. V: The TSSCPP conjecture
• Proof of the alternating sign matrix conjecture
• Quantum cohomology via vicious and osculating walkers
• The enumeration of totally symmetric plane partitions
• The number of monotone triangles with prescribed bottom row
• The story of 1,2,7,42,429,7436,..
• Three attractive osculating walkers and a polymer collapse transition
• Vicious walkers and Young tableaux I: without walls
• Vicious walkers, friendly walkers and Young tableaux. II: With a wall
• Vicious walkers, friendly walkers, and Young tableaux. III: Between two walls
• Walks, walls, wetting, and melting

Cited in

(3)

• Chebyshev type lattice path weight polynomials by a constant term method
• Three friendly walkers
• Osculating paths and oscillating tableaux

Describes a project that uses

Uses Software

• ROBBINS

This page was built for publication: Constant term solution for an arbitrary number of osculating lattice paths

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