English
Related papers

Related papers: Exponential polynomials and identification of poly…

200 papers

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

Combinatorics · Mathematics 2018-07-09 Orit E. Raz , Zvi Shem Tov

We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…

Probability · Mathematics 2023-02-22 Gérard Ben Arous , Paul Bourgade , Benjamin McKenna

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

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

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

Numerical Analysis · Mathematics 2015-05-05 Vahagn Vardanyan

We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map $f : \mathbb{F}_q^r \to \mathbb{F}_q^n$ to an element sampled uniformly at random from…

Computational Complexity · Computer Science 2023-01-18 Zeyu Guo , Ben Lee Volk , Akhil Jalan , David Zuckerman

Orthogonal polynomials and the Fourier orthogonal series on a cone of revolution in $\mathbb{R}^{d+1}$ are studied. It is shown that orthogonal polynomials with respect to the weight function $(1-t)^\gamma (t^2-\|x\|^2)^{\mu-\frac12}$ on…

Classical Analysis and ODEs · Mathematics 2019-11-05 Yuan Xu

Supposing that $A(z)$ is an exponential polynomial of the form $$ A(z)=H_0(z)+H_1(z)e^{\zeta_1z^n}+\cdots +H_m(z)e^{\zeta_mz^n}, $$ where $H_j$'s are entire and of order $<n$, it is demonstrated that the function $H_0(z)$ and the geometric…

Complex Variables · Mathematics 2019-07-19 Janne Heittokangas , Katsuya Ishizaki , Ilpo Laine , Kazuya Tohge

To any combinatorial triangulation $T$ of a square, there is an associated polynomial relation $p_T$ among the areas of the triangles of $T$. With the goal of understanding this polynomial, we consider polynomials obtained from $p_T$ by…

Metric Geometry · Mathematics 2021-05-04 Aaron Abrams , James Pommersheim

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $\alpha\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability…

Classical Analysis and ODEs · Mathematics 2019-04-26 Robert Fraser , Shaoming Guo , Malabika Pramanik

Conditional on Fourier restriction estimates for elliptic hypersurfaces, we prove optimal restriction estimates for polynomial hypersurfaces of revolution for which the defining polynomial has non-negative coefficients. In particular, we…

Classical Analysis and ODEs · Mathematics 2017-10-24 Betsy Stovall

The derivation of zonal polynomials involves evaluating the integral \[ \exp\left( - \frac{1}{2} \operatorname{tr} D_{\beta} Q D_{l} Q \right) \] with respect to orthogonal matrices \(Q\), where \(D_{\beta}\) and \(D_{l}\) are diagonal…

Representation Theory · Mathematics 2024-10-18 Haoming Wang

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

Rings and Algebras · Mathematics 2022-02-21 Johanna Lercher , Daniel F. Scharler , Hans-Peter Schröcker , Johannes Siegele

Let Delta be an integral convex polytope containing the origin of dimension n in the n-dim real space and it is simplicial at all origin-less facets. Let A(Delta) be the space of all Laurent polynomials f parametered by its coefficients…

Number Theory · Mathematics 2012-11-28 Hui June Zhu

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

Number Theory · Mathematics 2018-03-13 Joel Specter

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

Algebraic Geometry · Mathematics 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang
‹ Prev 1 2 3 10 Next ›