Combinatorial reciprocity for non-intersecting paths
DOI10.54550/ECA2023V3S2R13MaRDI QIDQ6659950FDOQ6659950
Authors: Sam Hopkins, Gjergji Zaimi
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Recommendations
plane partitionsDyck pathssymmetric functionsSchur functionsnon-intersecting pathscombinatorial reciprocityLindström-Gessel-Viennot lemma
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Differentiably finite power series
- Advanced determinant calculus
- A Formula for Plucker Coordinates Associated with a Planar Network
- Title not available (Why is that?)
- On the Vector Representations of Induced Matroids
- Symmetries of plane partitions
- Loop-erased walks and total positivity
- Kasteleyn cokernels
- Polynomials Associated with Finite Gell-Complexes
- Combinatorial reciprocity theorems
- Title not available (Why is that?)
- Odd symplectic groups
- A combinatorial proof of the Cayley-Hamilton theorem
- A reciprocity theorem for domino tilings
- Algebraic and geometric methods in enumerative combinatorics
- Combinatorial Reciprocity Theorems
Cited In (1)
This page was built for publication: Combinatorial reciprocity for non-intersecting paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659950)