相关论文: Polynomial-size vectors are enough for the unimodu…

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

Let $P$ be a simplicial smooth Fano polytope. We provide a concrete unimodular triangulation of $P$. We prove that the delta-vector of a simplicial smooth Fano polytope is unimodal and we give upper and lower bound for the volume of…

Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes of polytopes that do have unimodular…

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

Given polynomials $f_1,\ldots,f_n$ in $m$ variables with integral coefficients, we give upper bounds for the number of integral $m$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_n$ of bounded height such that $f_1(\mathbf{u}_1), \ldots,…

Triangulated surfaces are compact Riemann surfaces equipped with a conformal triangulation by equilateral triangles. In 2004, Brooks and Makover asked how triangulated surfaces are distributed in the moduli space of Riemann surfaces as the…

In this article we bound the number of remarkable values of a polynomial vector field. The proof is short and based on Jouanolou's theorem about rational first integrals of planar polynomial derivations. Our bound is given in term of the…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

We introduce a sequence P_d of monic reciprocal polynomials with integer coefficients having the central coefficients fixed as well as the peripheral coefficients. We prove that the ratio between number of nonunimodular roots of P_d and its…

We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…