Constant term solution for an arbitrary number of osculating lattice paths

DOI10.1007/S11005-013-0646-1zbMATH Open1272.05006arXiv1207.5268OpenAlexW1987795259MaRDI QIDQ369666FDOQ369666

Authors: R. Brak, Wellington Galleas 

Publication date: 19 September 2013

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

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.

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

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

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)

Cites Work

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

Cited In (3)

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

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)