Pages that link to "Item:Q2474247"
From MaRDI portal
The following pages link to Counting with rational generating functions (Q2474247):
Displaying 11 items.
- The unreasonable ubiquitousness of quasi-polynomials (Q405135) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Linear recurrence relations in \(q\)-systems via lattice points in polyhedra (Q2313506) (← links)
- COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS (Q3112587) (← links)
- INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY (Q4911021) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
- Estimating and computing Kronecker coefficients: a vector partition function approach (Q6644893) (← links)
