English
Related papers

Related papers: Strongly Exponential Separation Between Monotone V…

200 papers

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

In recent years, there has been a flurry of activity towards proving lower bounds for homogeneous depth-4 arithmetic circuits, which has brought us very close to statements that are known to imply $\textsf{VP} \neq \textsf{VNP}$. It is open…

Computational Complexity · Computer Science 2018-06-19 Mrinal Kumar , Shubhangi Saraf

We obtain sharp upper bounds for three-term segments of a bounded power series. Along the way we show that the Taylor polynomials of a certain algebraic function do not vanish in the unit disk.

Complex Variables · Mathematics 2025-07-08 Leonid V. Kovalev

Let S(n,0) be the set of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ denote by $|p|_{0}$ the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-05-23 Julius Borcea

In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1…

Number Theory · Mathematics 2018-01-18 Ala'a Al-Kateeb , Hoon Hong , Eunjeong Lee

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…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

This paper presents a proof that existence of a polynomial Lyapunov function is necessary and sufficient for exponential stability of sufficiently smooth nonlinear ordinary differential equations on bounded sets. The main result states that…

Classical Analysis and ODEs · Mathematics 2007-08-25 Matthew M. Peet

In a recent breakthrough, Chen, Hirahara and Ren prove that $\mathsf{S_2E}/_1 \not\subset \mathsf{SIZE}[2^n/n]$ by giving a single-valued $\mathsf{FS_2P}$ algorithm for the Range Avoidance Problem ($\mathsf{Avoid}$) that works for…

Computational Complexity · Computer Science 2024-04-05 Zeyong Li

Very narrow spatial bright solitons in (1+1)D and (2+1)D versions of cubic-quintic and full saturable models are studied, starting from the full system of the Maxwell's equations, rather than from the paraxial (NLS) approximation. For the…

Pattern Formation and Solitons · Physics 2009-11-07 Boris V. Gisin , Boris A. Malomed

We study the problem of robust multivariate polynomial regression: let $p\colon\mathbb{R}^n\to\mathbb{R}$ be an unknown $n$-variate polynomial of degree at most $d$ in each variable. We are given as input a set of random samples…

Data Structures and Algorithms · Computer Science 2024-03-15 Vipul Arora , Arnab Bhattacharyya , Mathews Boban , Venkatesan Guruswami , Esty Kelman

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

Let $E$ be a compact set of positive logarithmic capacity in the complex plane and let $\{P_n(z)\}_{1}^{\infty}$ be a sequence of asymptotically extremal monic polynomials for $E$ in the sense that \begin{equation*}%\label{}…

Complex Variables · Mathematics 2014-09-03 Edward B. Saff , Nikos Stylianopoulos

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is $q$-multilinear if for each its output gate $o$ and for each prime implicant $s$ of the…

Computational Complexity · Computer Science 2023-05-15 Andrzej Lingas , Mia Persson

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

Computational Complexity · Computer Science 2009-07-16 Pavel Hrubes , Amir Yehudayoff

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

Classical Analysis and ODEs · Mathematics 2022-12-26 Michael Ganzburg

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Number Theory · Mathematics 2018-02-06 Arturas Dubickas , Min Sha

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where…

Formal Languages and Automata Theory · Computer Science 2020-02-21 Michaël Cadilhac , Filip Mazowiecki , Charles Paperman , Michał Pilipczuk , Géraud Sénizergues

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…

Classical Analysis and ODEs · Mathematics 2015-02-13 Guillaume Chèze
‹ Prev 1 4 5 6 7 8 10 Next ›