Pages that link to "Item:Q2491985"
From MaRDI portal
The following pages link to The many aspects of counting lattice points in polytopes (Q2491985):
Displaying 46 items.
- Splines, lattice points, and arithmetic matroids (Q256534) (← links)
- A Euclid style algorithm for MacMahon's partition analysis (Q482232) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- Group-theoretic dimension of stationary symmetric \(\alpha\)-stable random fields (Q742111) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (Q857417) (← links)
- Integer points in polyhedra (Q942862) (← links)
- Ehrhart series and lattice triangulations (Q958233) (← links)
- Ergodic theory, abelian groups and point processes induced by stable random fields (Q964783) (← links)
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (Q984027) (← links)
- Estimates of the Pythagoras number of \(\mathbb R_m[x_1, \ldots , x_n]\) through lattice points and polytopes (Q998459) (← links)
- Transfer-matrix methods meet Ehrhart theory (Q1644957) (← links)
- Elementary geometry on the integer lattice (Q1662428) (← links)
- Threshold functions and Poisson convergence for systems of equations in random sets (Q1706093) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001) (← links)
- Maxima of stable random fields, nonsingular actions and finitely generated abelian groups: a survey (Q1745668) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- On the occurrence probability of local binary patterns: a theoretical study (Q1932861) (← links)
- A billiards-like dynamical system for attacking chess pieces (Q2033944) (← links)
- The characterisation problem of Ehrhart polynomials of lattice polytopes (Q2106290) (← links)
- On polynomials counting essentially irreducible maps (Q2144331) (← links)
- Counting lattice points in free sums of polytopes (Q2363357) (← links)
- On Dedekind's problem for complete simple games (Q2376066) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Counting integer points in higher-dimensional polytopes (Q2406337) (← links)
- Probability calculations under the IAC hypothesis (Q2463576) (← links)
- On the parameters of \(r\)-dimensional toric codes (Q2467327) (← links)
- Stationary symmetric \(\alpha\)-stable discrete parameter random fields (Q2481393) (← links)
- Inside-out polytopes (Q2503362) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- The value function of a transportation problem (Q2670483) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- On Counting Lattice Points in Polyhedra (Q3359328) (← links)
- Existence of unimodular triangulations — positive results (Q3380553) (← links)
- Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley (Q3978769) (← links)
- (Q4432212) (← links)
- Universal counting of lattice points in polytopes (Q4505775) (← links)
- Continous analogues for the binomial coefficients and the Catalan numbers (Q5091843) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration (Q5119842) (← links)
- (Q5432043) (← links)
- Approximating the volume of tropical polytopes is difficult (Q5742783) (← links)
- Computing Galois groups of Ehrhart polynomials in OSCAR (Q6103866) (← links)
- Coprime Ehrhart Theory and Counting Free Segments (Q6115145) (← links)
- Chern-Simons theory, Ehrhart polynomials, and representation theory (Q6198381) (← links)
