Related papers: Optimal polynomial meshes exist on any multivariat…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
We provide proof that the optimal value function of a convex parametrized optimization problem in Euclidean spaces is itself a convex function onto the extended real line.
Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has…
We study here weighted polynomial multiple ergodic averages. A sequence of weights is called universally good if any polynomial multiple ergodic average with this sequence of weights converges in $L^{2}$. We find a necessary condition and…
We prove that the Cram\'er transform of the uniform measure on a convex body in $\mathbb{R}^n$ is a $(1+o(1)) n$-self-concordant barrier, improving a seminal result of Nesterov and Nemirovski. This gives the first explicit construction of a…
For two planar convex bodies, $C$ and $D$, consider a packing $S$ of $n$ positive homothets of $C$ contained in $D$. We estimate the total perimeter of the bodies in $S$, denoted ${\rm per}(S)$, in terms of ${\rm per}(D)$ and $n$. When all…
A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…
Let $M$ be a volume finite non-compact complete hyperbolic $n$-manifold with totally geodesic boundary. We show that there exists a polyhedral decomposition of $M$ such that each cell is either an ideal polyhedron or a partially truncated…
In a triangulated category, cofibre fill-ins always exist. Neeman showed that there is always at least one "good" fill-in, i.e., one whose mapping cone is exact. Verdier constructed a fill-in of a particular form in his proof of the $4…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…
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…
A conjecture of Sendov states that if a polynomial has all its roots in the unit disk and if $\beta$ is one of those roots, then within one unit of $\beta$ lies a root of the polynomial's derivative. If we define $r(\beta)$ to be the…
It is shown that Alesker's solution of McMullen's conjecture implies the following stronger version of the conjecture: Every continuous, translation invariant, $k$-homogeneous valuation on convex bodies in $\mathbb{R}^n$ can be approximated…
We show, assuming Schanuel's conjecture, that every irreducible complex polynomial in two variables where both variables appear has infinitely many algebraically independent solutions of the form (z,e^z).
In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
An elliptic curve $E$ over $\mathbb{Q}$ is said to be good if $N_{E}^{6}<\max\!\left\{ \left\vert c_{4}^{3}\right\vert ,c_{6}^{2}\right\} $ where $N_{E}$ is the conductor of $E$ and $c_{4}$ and $c_{6}$ are the invariants associated to a…
In this paper, we first consider the graph of $(F_1,F_{2},\cdots,F_{n})$ on $\overline{\mathbb{D}}^{n},$ where $F_{j}(z)=\bar{z}^{m_{j}}_{j}+R_{j}(z),j=1,2,\cdots,n,$ which has non-isolated CR-singularities if $m_{j}>1$ for some…