Osculating paths and oscillating tableaux

MaRDI QIDQ1010712zbMATH OpenFDO

Authors Roger E. Behrend

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0701755, https://eudml.org/doc/117210, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r7.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

alternating sign matricesoscillating tableauxosculating lattice pathsosculationspartitionsquare latticestatistical mechanicsvacanciesYoung diagrams

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Association schemes, strongly regular graphs (05E30)

Abstract: The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths are permitted to share lattice points, but not to cross or share lattice edges. Such paths correspond to configurations of the six-vertex model of statistical mechanics with appropriate boundary conditions, and they include cases which correspond to alternating sign matrices and various subclasses thereof. Referring to points of the rectangle through which no or two paths pass as vacancies or osculations respectively, the case of primary interest is tuples of paths with a fixed number $l$ of vacancies and osculations. It is then shown that there exist natural bijections which map each such path tuple $P$ to a pair $(t,eta)$, where $eta$ is an oscillating tableau of length $l$ (i.e., a sequence of $l+1$ partitions, starting with the empty partition, in which the Young diagrams of successive partitions differ by a single square), and $t$ is a certain, compatible sequence of $l$ weakly increasing positive integers. Furthermore, each vacancy or osculation of $P$ corresponds to a partition in $eta$ whose Young diagram is obtained from that of its predecessor by respectively the addition or deletion of a square. These bijections lead to enumeration formulae for osculating paths involving sums over oscillating tableaux.

Review text

Summary: The combinatorics of certain tuples of osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. The paths being considered have fixed start and end points on respectively the lower and right boundaries of a rectangle in the square lattice, each path can take only unit steps rightwards or upwards, and two different paths within a tuple are permitted to share lattice points, but not to cross or share lattice edges. Such path tuples correspond to configurations of the six-vertex model of statistical mechanics with appropriate boundary conditions, and they include cases which correspond to alternating sign matrices. Of primary interest here are path tuples with a fixed number \(l\) of vacancies and osculations, where vacancies or osculations are points of the rectangle through which respectively no or two paths pass. It is shown that there exist natural bijections which map each such path tuple \(P\) to a pair \((t,\eta)\), where \(\eta\) is an oscillating tableau of length \(l\) (i.e., a sequence of \(l+1\) partitions, starting with the empty partition, in which the Young diagrams of successive partitions differ by a single square), and \(t\) is a certain, compatible sequence of \(l\) weakly increasing positive integers. Furthermore, each vacancy or osculation of \(P\) corresponds to a partition in \(\eta\) whose Young diagram is obtained from that of its predecessor by respectively the addition or deletion of a square. These bijections lead to enumeration formulae for tuples of osculating paths involving sums over oscillating tableaux.

Recommendations

• Oscillating tableaux and nonintersecting lattice paths
• Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
• A note on statistical averages for oscillating tableaux
• Constant term solution for an arbitrary number of osculating lattice paths
• Oscillating rim hook tableaux and colored matchings

Cited in

(17)

• Oscillating tableaux and nonintersecting lattice paths
• Bumpless pipe dreams and alternating sign matrices
• Hopf algebra structure on packed square matrices.
• Multiply-refined enumeration of alternating sign matrices
• Weight-preserving bijections between integer partitions and a class of alternating sign trapezoids
• Weight-preserving bijections between integer partitions and a family of alternating sign trapezoids
• Constant term solution for an arbitrary number of osculating lattice paths
• Oscillating rim hook tableaux and colored matchings
• scientific article; zbMATH DE number 2046072 (Why is no real title available?)
• A note on statistical averages for oscillating tableaux
• Partial permutation and alternating sign matrix polytopes
• Bumpless pipe dreams encode Gröbner geometry of Schubert polynomials
• Partial alternating sign matrix bijections and dynamics
• On the weighted enumeration of alternating sign matrices and descending plane partitions
• Grothendieck shenanigans: permutons from pipe dreams via integrable probability
• Tableau sequences, open diagrams, and Baxter families
• A history and a survey of lattice path enumeration

This page was built for publication: Osculating paths and oscillating tableaux

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