English
Related papers

Related papers: A tau-conjecture for Newton polygons

200 papers

The $p$-adic Newton polygon is a visual tool that encodes information about the roots and factorization of a polynomial relative to a prime $p$. In this article, we investigate how the Newton polygon changes under polynomial composition. If…

Number Theory · Mathematics 2025-01-29 Rylan Gajek-Leonard , Uri Tomer

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

Computational Complexity · Computer Science 2018-06-11 Joshua A. Grochow

We compare the $T$-polynomial convexity of Guedj with holomorphic convexity away from the support of $T$. In particular we show an Oka--Weil theorem for $T$-polynomial convexity, as well as present a situation when the notions of…

Complex Variables · Mathematics 2024-03-01 Blake J. Boudreaux

The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the…

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

Let v be a real polynomial of even degree, and let \rho be the equilibrium probability measure for v with support S; so that v(x)\geq 2\int \log |x-y| \rho (dy)+C_v for some constant C_v with support S. Then S is the union of finitely many…

Classical Analysis and ODEs · Mathematics 2024-09-24 Gordon Blower

We study meromorphic jacobian pairs, i.e., pairs of polynomials in one variable, with coefficients meromorphic series in a second variable, whose jacobian relative to the two variables depends only on the second variable. We pose two…

Commutative Algebra · Mathematics 2007-05-23 S. S. Abhyankar , A. Assi

A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…

Functional Analysis · Mathematics 2015-11-02 Nathan S. Feldman , Paul J. McGuire

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is…

Computational Complexity · Computer Science 2014-06-23 José Miguel Díaz-Báñez , Matias Korman , Pablo Pérez-Lantero , Alexander Pilz , Carlos Seara , Rodrigo I. Silveira

Let $P_1,\dots, P_n$ and $Q_1,\dots, Q_n$ be convex polytopes in $\mathbb{R}^n$ such that $P_i\subset Q_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,\dots,P_n)\leq V(Q_1,\dots,Q_n)$. We give two criteria…

Metric Geometry · Mathematics 2020-12-22 Frédéric Bihan , Ivan Soprunov

We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…

Number Theory · Mathematics 2007-06-18 Regis Blache , Eric Ferard

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich

Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…

Algebraic Geometry · Mathematics 2025-07-01 Aaron Abrams , James Pommersheim

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

Probability · Mathematics 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

Algebraic Geometry · Mathematics 2018-03-20 Kiumars Kaveh , A. G. Khovanskii

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

Complex Variables · Mathematics 2017-11-08 Sorin G. Gal , J. Oscar González-Cervantes , Irene Sabadini

The generalized volume conjecture relates asymptotic behavior of the colored Jones polynomials to objects naturally defined on an algebraic curve, the zero locus of the A-polynomial $A(x,y)$. Another "family version" of the volume…

High Energy Physics - Theory · Physics 2017-05-23 Hiroyuki Fuji , Sergei Gukov , Piotr Sułkowski

We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…

Computational Complexity · Computer Science 2016-10-18 Javier A. Arroyo-Figueroa

Let $p$ be a prime number. Every two-variable polynomial $f(x_1, x_2)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of surfaces whose Galois group is isomorphic to $\mathbb Z_p$. Our goal of this paper is…

Number Theory · Mathematics 2017-01-09 Rufei Ren

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Combinatorics · Mathematics 2023-11-10 Leah Leiner , Steven Simon

We show that there are polynomials $p_N$ of arbitrarily large degree $N$, with coefficients equal to 0 or 1 (Newman polynomials), such that $$ \liminf_{N \to \infty} N \Linf{p_N^2} \bigl / p_N^2(1) < 1, $$ where $\Linf{q}$ denotes the…

Number Theory · Mathematics 2008-12-07 Mihail N. Kolountzakis