scientific article; zbMATH DE number 1405493
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Proof of Chapoton's conjecture on Newton polygons of \(q\)-Ehrhart polynomials
- La valeur optimale des programmes entiers. (The optimal value of integer programs)
- Sparse Solutions of Linear Diophantine Equations
- Computing weight \(q\)-multiplicities for the representations of the simple Lie algebras
- Difference dimension quasi-polynomials
- Exact Euler-Maclaurin formulas for simple lattice polytopes
- Polynomial values of surface point counting polynomials
- Ehrhart polynomials of matroid polytopes and polymatroids
- Computing with an algebraic-perturbation variant of Barvinok's algorithm
- Ehrhart series and lattice triangulations
- Concrete polytopes may not tile the space
- The \(q\)-analog of Kostant's partition function and the highest root of the simple Lie algebras
- Linear recurrence relations in \(q\)-systems via lattice points in polyhedra
- Bivariate dimension quasi-polynomials of difference-differential field extensions with weighted basic operators
- Sharp polynomial estimate of integral points in right-angled simplices
- On a valuation of rational subsets of \(Z^{k}\)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Enumeration and unimodular equivalence of empty delta-modular simplices
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Computing the Ehrhart quasi-polynomial of a rational simplex
- On the enumeration of certain weighted graphs
- Berline-Vergne valuation and generalized permutohedra
- Computing points of bounded height in projective space over a number field
- The unreasonable ubiquitousness of quasi-polynomials
- Effective lattice point counting in rational convex polytopes
- The meaning of Ramanujan now and for the future
- Sparsity in sums of squares of polynomials
- MacMahon’s Dream
- Solving the knapsack problem via \(\mathbb Z\)-transform
- Computing algebraic numbers of bounded height
- Sparse representation of vectors in lattices and semigroups
- scientific article; zbMATH DE number 1504656 (Why is no real title available?)
- On the number of integer points in translated and expanded polyhedra
- Computing Optimized Path Integrals for Knapsack Feasibility
- A quantitative Doignon-Bell-Scarf theorem
- The unexpected behavior of plurality rule
- The computational complexity of integer programming with alternations
- Faster geometric algorithms via dynamic determinant computation
- The complexity of generating functions for integer points in polyhedra and beyond
- Construction of some computational algorithms on finite sets of points in the plane
- The Jones slopes of a knot
- Steinhaus' lattice point problem for polyhedra
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- Implicitization of curves and (hyper)surfaces using predicted support
- A discrete Farkas lemma
- Linear extension sums as valuations on cones
- Sum-integral interpolators and the Euler-Maclaurin formula for polytopes
- On the complexity of computing Kronecker coefficients
- Generalized permutohedra in the kinematic space
- A plethora of polynomials: a toolbox for counting problems
- Computing local zeta functions of groups, algebras, and modules
- A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures
- Enumeration of integer points in projections of unbounded polyhedra
- Nearest lattice point algorithms on semi k-reduced basis
- Values of zeta functions at negative integers, Dedekind sums and toric geometry
- On the Todd class of the permutohedral variety
- Correlation, partitioning and the probability of casting a decisive vote under the majority rule
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Enumerating a subset of the integer points inside a Minkowski sum
- Computing the integer programming gap
- Distances to lattice points in knapsack polyhedra
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- Enumerating projections of integer points in unbounded polyhedra
- Goldie rank of primitive quotients via lattice point enumeration.
- An example of probability computations under the IAC assumption: the stability of scoring rules
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices
- Cycles representing the Todd class of a toric variety
- Eigenvalue distributions of reduced density matrices
- Asymptotic Euler-Maclaurin formula over lattice polytopes
- An algebraic-perturbation variant of Barvinok's algorithm
- Generating functions and duality for integer programs
- Hopf monoids, permutohedral cones, and generalized retarded functions
- Integer points in polyhedra
- An algorithm reconstructing convex lattice sets.
- The corner poset with an application to an \(n\)-dimensional hypercube stacking puzzle
- On lattice point counting in \(\varDelta\)-modular polyhedra
- Euler-Maclaurin with remainder for a simple integral polytope
- Graded local cohomology of modules over semigroup rings
- The many aspects of counting lattice points in polytopes
- Ramanujan type congruences for quotients of Klein forms
- A computational study of integer programming algorithms based on Barvinok's rational functions
- On Ehrhart polynomials and probability calculations in voting theory
- Eisenstein cocycles in motivic cohomology
- Counting with rational generating functions
- Continuum surface energy from a lattice model
- Majority properties of positional social preference correspondences
- Counting chemical compositions using Ehrhart quasi-polynomials
- Higher integrality conditions, volumes and Ehrhart polynomials
- Model checking the evolution of gene regulatory networks
- A rainbow Ramsey analogue of Rado's theorem
- Complexity of short generating functions
- Short rational generating functions for solving some families of fuzzy integer programming problems
- Computing the Continuous Discretely
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- A method of deducing \(L\)-polyhedra for \(n\)-lattices
- On approximation algorithms for concave mixed-integer quadratic programming
- Spectral invariants, analysis of the Floer moduli space, and geometry of the Hamiltonian diffeomorphism group
- A generalization of the integer linear infeasibility problem
- Bias expansion of spatial statistics and approximation of differenced lattice point counts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938470)