English
Related papers

Related papers: New fewnomial upper bounds from Gale dual polynomi…

200 papers

We prove that for any Borel probability measure $\mu$ on $\mathbb R^n$ there exists a set $X\subset \mathbb R^n$ of $n+1$ points such that any $n$-variate quadratic polynomial $P$ that is nonnegative on $X$ (i.e. $P(x)\geq 0$, for every $x…

Metric Geometry · Mathematics 2023-08-29 Pablo González-Mazón , Alfredo Hubard , Roman Karasev

We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to…

Number Theory · Mathematics 2014-05-12 Pete L. Clark , Aden Forrow , John R. Schmitt

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

Let $O(2n+\ell)$ be the group of orthogonal matrices of size $\left(2n+\ell\right)\times \left(2n+\ell\right)$ equipped with the probability distribution given by normalized Haar measure. We study the probability \begin{equation*}…

Probability · Mathematics 2019-05-09 Martin Gebert , Mihail Poplavskyi

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…

Computational Complexity · Computer Science 2007-10-16 Dima Grigoriev

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Number Theory · Mathematics 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Number Theory · Mathematics 2023-01-10 Hong Liu , Péter Pál Pach , Csaba Sándor

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

Number Theory · Mathematics 2017-01-24 Edward Dobrowolski , Chris Smyth

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

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…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We investigate the space complexity of refuting $3$-CNFs in Resolution and algebraic systems. No lower bound for refuting any family of $3$-CNFs was previously known for the total space in resolution or for the monomial space in algebraic…

Computational Complexity · Computer Science 2014-11-07 Ilario Bonacina , Nicola Galesi , Tony Huynh , Paul Wollan

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

Mathematical Physics · Physics 2015-06-26 Saugata Ghosh

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…

Combinatorics · Mathematics 2024-12-02 Girtrude Hamm , Johannes Hofscheier , Alexander Kasprzyk

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Complex Variables · Mathematics 2016-12-05 D. V. Bogdanov , T. M. Sadykov

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…

Combinatorics · Mathematics 2019-02-26 Jukka Kohonen

This paper introduces a novel class of prime-generating quadratic polynomials defined by $f_{Z,k,H}(n) = n^2 - (2Zk - 1)n + \frac{(2Zk - 1)^2 + H}{4}$, where $Zk \in \mathbb{Z}_{\geq 0}$ and $H$ belongs to the set of Heegner numbers. This…

Number Theory · Mathematics 2025-08-06 Sudarshan Kumaresan , Shipra Kumari , Neha Mishra

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

Complex Variables · Mathematics 2013-01-24 Bernard Shiffman , Steve Zelditch

We perform a nonrelativistic contraction of N-extended Poincare superalgebra with internal symmetry U(N) and general set of N(N-1) real central charges. We show that for even N=2k and particular choice of the dependence of Z_{ij} on light…

High Energy Physics - Theory · Physics 2011-06-21 Jerzy Lukierski

This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…

Discrete Mathematics · Computer Science 2022-08-31 Marilena Jianu , Leonard Daus , Vlad-Florin Dragoi , Valeriu Beiu