Linear Recurrences for Cylindrical Networks
From MaRDI portal
Publication:5855152
DOI10.1093/imrn/rnx241zbMath1459.05104arXiv1704.05160MaRDI QIDQ5855152
Pavlo Pylyavskyy, Pavel Galashin
Publication date: 15 March 2021
Published in: International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05160
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomials defined by tableaux and linear recurrences
- A bijection proving the Aztec diamond theorem by combing lattice paths
- On the weighted enumeration of alternating sign matrices and descending plane partitions
- Perfect matchings and the octahedron recurrence
- Quantum Knizhnik-Zamolodchikov equation, totally symmetric self-complementary plane partitions, and alternating sign matrices
- Binomial determinants, paths, and hook length formulae
- The shape of a typical boxed plane partition
- The cube recurrence
- Determinants of super-Schur functions, lattice paths, and dotted plane partitions
- Nonintersecting paths, pfaffians, and plane partitions
- Vicious walkers, friendly walkers, and Young tableaux. III: Between two walls
- Crystals and total positivity on orientable surfaces
- Quivers with subadditive labelings: classification and integrability
- Stretched skew Schur polynomials are recurrent
- Vicious walkers, friendly walkers and Young tableaux: II. With a wall
- Conway's Tiling Groups
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Vicious walkers and Young tableaux I: without walls
- q-Abel polynomials
- The classification of Zamolodchikov periodic quivers
- On the Vector Representations of Induced Matroids