Related papers: Computing the period of an Ehrhart quasi-polynomia…

For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

The Ehrhart polynomial $L_P$ of an integral polytope $P$ counts the number of integer points in integral dilates of $P$. Ehrhart polynomials of polytopes are often described in terms of their Ehrhart $h^*$-vector (aka Ehrhart…

A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the…

Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.

A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…

We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…

For an integral convex polytope $\mathcal{P} \subset \mathbb{R}^d$, we recall $L_\mathcal{P}(n)=|n\mathcal{P} \cap \mathbb{Z}^d|$ the Ehrhart polynomial of $\mathcal{P}$. Let $g_r(\mathcal{P})$ be the $r$th coefficients of…

We consider the problem of computing the minimum of a polynomial function g on a basic closed semialgebraic set E in R^n. We present a probabilistic symbolic algorithm to find a finite set of sample points of the subset E^{min} of E where…

We prove that the problem of minimizing the number of integer points inparallel translations of a rational convex polytope in $\mathbb{R}^6$ is NP-hard. We apply this result to show that given a rational convex polytope $P \subset…

Let a polyhedron $P$ be defined by one of the following ways: (i) $P = \{x \in R^n \colon A x \leq b\}$, where $A \in Z^{(n+k) \times n}$, $b \in Z^{(n+k)}$ and $rank\, A = n$; (ii) $P = \{x \in R_+^n \colon A x = b\}$, where $A \in Z^{k…

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the…

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…

As shown by Robertson and Seymour, deciding whether the complete graph $K_t$ is a minor of an input graph $G$ is a fixed parameter tractable problem when parameterized by $t$. From the approximation viewpoint, the gap to fill is quite…

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…