English
Related papers

Related papers: Explicit bounds for composite lacunary polynomials

200 papers

We give sufficient conditions on planar domains for polynomials to be dense in the algebras A and A-infinity of the product of these domains, endowed with their natural topologies. We also characterize the uniform limits, with respect to…

Complex Variables · Mathematics 2014-03-06 P. M. Gauthier , V. Nestoridis

The periods of polynomials can be used to characterize discrete structures such as algebraic error control codes and feedback shift registers. We study trinomial $x^h+x+1$ over GF(2), which has the maximum number of consecutive zero…

Information Theory · Computer Science 2024-08-28 Gam D. Nguyen

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

Binary Decision Diagrams (BDDs) are widely used for the representation of Boolean functions. Context-Free-Language Ordered Decision Diagrams (CFLOBDDs) are a plug-compatible replacement for BDDs -- roughly, they are BDDs augmented with a…

Symbolic Computation · Computer Science 2024-11-25 Xusheng Zhi , Thomas Reps

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

In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…

Logic · Mathematics 2009-10-19 Ahuva C. Shkop

Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…

Number Theory · Mathematics 2025-12-04 Wouter van Doorn , Vjekoslav Kovač

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Number Theory · Mathematics 2015-02-11 Alexandra Shlapentokh

A boundary value problem for a stationary nonlinear dispersive equation of order $2l+1\;\; l\in \mathbb{N}$ with a convective term in the form $u^ku_x\;\; k\in \mathbb{N}$ was considered on an interval $(0,L)$. The existence, uniqueness and…

Analysis of PDEs · Mathematics 2018-06-26 Jackson Luchesi , Nikolai A. Larkin

Consider the Wronskians of the classical Hermite polynomials $$H_{\lambda, l}(x):=\mathrm{Wr}(H_l(x),H_{k_1}(x),\ldots, H_{k_n}(x)), \quad l \in \mathbb Z_{\geq 0},$$ where $k_i=\lambda_i+n-i, \,\, i=1,\dots, n$ and $\lambda=(\lambda_1,…

Mathematical Physics · Physics 2016-04-20 William A. Haese-Hill , Martin A. Hallnäs , Alexander P. Veselov

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

Let D be a strictly convex domain of C^n, f_1 and f_2 be two holomorphic functions defined on a neighborhood of closure of D and set X_l={z, f_l(z)=0}, l=1,2. Suppose that X_l\cap bD is transverse for l=1 and l=2, and that X_1\cap X_2 is a…

Complex Variables · Mathematics 2012-07-09 William Alexandre , Emmanuel Mazzilli

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Number Theory · Mathematics 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

This paper presents some new propositions related to the fractional order $h$-difference operators, for the case of general quadratic forms and for the polynomial type, which allow proving the stability of fractional order $h$-difference…

Classical Analysis and ODEs · Mathematics 2020-06-16 Xiang Liu , Baoguo Jia , Lynn Erbe , Allan Peterson

Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…

Number Theory · Mathematics 2007-05-23 Hui June Zhu

For $1< p <2$ we obtain sharp inequalities for the supremum of products of homogeneous polynomials on $L_p(\mu)$, whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in the…

Functional Analysis · Mathematics 2013-04-22 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

Let $p$ be an idempotent ultrafilter over $\mathbb{N}$. For a positive integer $N$, let ${\cal P}_{\leq N}$ denote the additive group of polynomials $P\in\mathbb{Z}[x]$ with ${\rm deg}\, P\leq N$ and $P(0)=0$. Given a unitary operator $U$…

Dynamical Systems · Mathematics 2014-01-31 Vitaly Bergelson , Stanisław Kasjan , Mariusz Lemańczyk