LattE

swMATH4654MaRDI QIDQ16824FDOQ16824

Author name not available (Why is that?)

Described by source

• Software for exact integration of polynomials over polyhedra
• Effective lattice point counting in rational convex polytopes

Cited In (only showing first 100 items - show all)

• MacMahon partition analysis and the Poincaré series of the algebras of invariants of ternary and quaternary forms
• FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
• Computing the Ehrhart quasi-polynomial of a rational simplex
• The combinatorics of interval vector polytopes
• Exact sampling and counting for fixed-margin matrices
• A generating function for all semi-magic squares and the volume of the Birkhoff polytope
• A Primal Barvinok Algorithm Based on Irrational Decompositions
• Armchair or Zigzag? A tool for characterizing graphene edge
• Exploiting polyhedral symmetries in social choice
• On the enumeration of certain weighted graphs
• Ehrhart tensor polynomials
• On counterexamples to a conjecture of Wills and Ehrhart polynomials whose roots have equal real parts
• Computing algebraic numbers of bounded height
• Sparsity in sums of squares of polynomials
• Column basis reduction and decomposable knapsack problems
• Compactifications of rational maps, and the implicit equations of their images
• Roots of Ehrhart polynomials arising from graphs
• Algebraic combinatorics of diametric magic circles
• Topics in hyperplane arrangements, polytopes and box-splines
• Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones.
• Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
• Polymake and Lattice Polytopes
• Implicitization of curves and (hyper)surfaces using predicted support
• On the complexity of computing Kronecker coefficients
• Integer Programming and Algorithmic Geometry of Numbers
• Random sampling of contingency tables via probabilistic divide-and-conquer
• Integer Polynomial Optimization in Fixed Dimension
• Enumeration of Totally Real Number Fields of Bounded Root Discriminant
• Volume computation for polytopes and partition functions for classical root systems
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Computing the integer programming gap
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• The partial-fractions method for counting solutions to integral linear systems
• Rational generating functions and integer programming games
• An example of probability computations under the IAC assumption: the stability of scoring rules
• Finitely many smooth \(d\)-polytopes with \(n\) lattice points
• Computing the integer hull of convex polyhedral sets
• Computing convex hulls and counting integer points with \texttt{polymake}
• An efficient method to integrate polynomials over polytopes and curved solids
• Markov bases for noncommutative Fourier analysis of ranked data
• Linear and Integer Programming vs Linear Integration and Counting
• The many aspects of counting lattice points in polytopes
• Sequential importance sampling for multiway tables
• A computational study of integer programming algorithms based on Barvinok's rational functions
• On Ehrhart polynomials and probability calculations in voting theory
• A class of statistical models to weaken independence in two-way contingency tables
• Synthetic two-way contingency tables that preserve conditional frequencies
• Probability calculations under the IAC hypothesis
• Exact algorithms and software in optimization and polyhedral computation
• Counting with rational generating functions
• Parametric integer programming algorithm for bilevel mixed integer programs
• Counting integer points in parametric polytopes using Barvinok's rational functions
• The computation of generalized Ehrhart series in normaliz
• Computing the Continuous Discretely
• Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
• A Euclid style algorithm for MacMahon's partition analysis
• On spaces of modular forms spanned by eta-quotients
• Short rational functions for toric algebra and applications
• A generalization of the integer linear infeasibility problem
• Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
• An exact general remeshing scheme applied to physically conservative voxelization
• Short rational generating functions for lattice point problems
• Computing parametric rational generating functions with a primal Barvinok algorithm
• An approximation algorithm for counting contingency tables
• Polyhedral omega: a new algorithm for solving linear Diophantine systems
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric and topological combinatorics. Abstracts from the workshop held January 28 -- February 3, 2007.
• Symmetrically constrained compositions
• Estimating the number of zero-one multi-way tables via sequential importance sampling
• Title not available (Why is that?)
• Ehrhart polynomials of matroid polytopes and polymatroids
• Software for exact integration of polynomials over polyhedra
• Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
• An implicitization challenge for binary factor analysis
• On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
• Counting subsets of contingency tables
• Ehrhart series and lattice triangulations
• Fibers of multi-way contingency tables given conditionals: relation to marginals, cell bounds and Markov bases
• On Dedekind's problem for complete simple games
• Title not available (Why is that?)
• Computations of volumes and Ehrhart series in four candidates elections
• Computing rational powers of monomial ideals
• Pattern-avoiding polytopes
• Petri Net Reductions for Counting Markings
• Reachability analysis of low-order discrete state reaction networks obeying conservation laws
• On the pseudo-periodicity of the integer hull of parametric convex polygons
• Quantifying software reliability via model-counting
• Computing points of bounded height in projective space over a number field
• Polyhedral star-shaped distributions
• Sparse representation of vectors in lattices and semigroups
• Volume Computation for Boolean Combination of Linear Arithmetic Constraints
• Quantitative static analysis of communication protocols using abstract Markov chains
• Coefficients of Sylvester's Denumerant
• A Framework for Computing Zeta Functions of Groups, Algebras, and Modules
• Representation-compatible power indices
• An approximation algorithm for box abstraction of transition systems on real state spaces
• Estimating the volume of the solution space of SMT(LIA) constraints by a flat histogram method
• Probabilities of electoral outcomes: from three-candidate to four-candidate elections

This page was built for software: LattE