Pages that link to "Item:Q1767489"
From MaRDI portal
The following pages link to Counting integer flows in networks (Q1767489):
Displaying 24 items.
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope (Q735404) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Integer equal flows (Q833591) (← links)
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes (Q968236) (← links)
- Kostant partitions functions and flow polytopes (Q1024601) (← links)
- Paradan's wall crossing formula for partition functions and Khovanski-Pukhlikov differential operator (Q1041265) (← links)
- From generalized permutahedra to Grothendieck polynomials via flow polytopes (Q2004052) (← links)
- Counting integer points of flow polytopes (Q2046449) (← links)
- Low dimensional flow polytopes and their toric ideals (Q2080253) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- Root cones and the resonance arrangement (Q2223465) (← links)
- Chopped and sliced cones and representations of Kac-Moody algebras (Q2267427) (← links)
- Volumes and Ehrhart polynomials of flow polytopes (Q2332880) (← links)
- Computation of dilated Kronecker coefficients (Q2399866) (← links)
- The many aspects of counting lattice points in polytopes (Q2491985) (← links)
- Flow-oriented perturbation theory (Q2696897) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- NUMBERS OF PRIMAL AND DUAL BASES OF NETWORK FLOW AND UNIMODULAR INTEGER PROGRAMS (Q5471479) (← links)
