中文
相关论文

相关论文: Counting Zeros of Cosine Polynomials: On a Problem…

200 篇论文

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

数论 · 数学 2025-09-03 Benjamin Baily , Amichai Lampert

In a recent paper (Cucker, Krick, Malajovich and Wschebor, A Numerical Algorithm for Zero Counting. I: Complexity and accuracy, J. Compl.,24:582-605, 2008) we analyzed a numerical algorithm for computing the number of real zeros of a…

数值分析 · 数学 2012-05-31 Felipe Cucker , Teresa Krick , Gregorio Malajovich , Mario Wschebor

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

符号计算 · 计算机科学 2023-02-14 Rémi Imbach , Guillaume Moroz

Given a nonempty set $A \subset \mathbb{N}\cup\{0\}$, define the mask polynomial $A(X)=\sum_{a\in A} X^a$. Suppose that there are $s_1,\dots,s_k\in\nn\setminus\{1\}$ such that the cyclotomic polynomials $\Phi_{s_1},\dots,\Phi_{s_k}$ divide…

数论 · 数学 2026-03-24 Gergely Kiss , Izabella Łaba , Caleb Marshall , Gábor Somlai

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

经典分析与常微分方程 · 数学 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

We use Hodge theory to relate poles of the Archimedean zeta function $Z_f$ of a holomorphic function $f$ with several invariants of singularities. First, we prove that the largest nontrivial pole of $Z_f$ is the negative of the minimal…

代数几何 · 数学 2026-05-27 Dougal Davis , András C. Lőrincz , Ruijie Yang

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…

经典分析与常微分方程 · 数学 2013-07-23 Igor E. Pritsker

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

最优化与控制 · 数学 2012-10-26 Tomáš Kepka , Miroslav Korbelář

We present a new procedure to count the number of real zeros of a class of univariate Pfaffian functions of order $1$. The procedure is based on the construction of Sturm sequences for these functions and relies on an oracle for sign…

代数几何 · 数学 2016-01-13 María Laura Barbagallo , Gabriela Jeronimo , Juan Sabia

Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…

数论 · 数学 2024-11-22 Lenny Fukshansky , Sehun Jeong

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

数论 · 数学 2022-01-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

组合数学 · 数学 2019-03-05 Amichai Lampert

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

数论 · 数学 2013-01-17 Marina Nincevic , Sinisa Slijepcevic

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

复变函数 · 数学 2016-03-27 Addisalem Abathun , Rikard Bøgvad

A celebrated theorem of Shoda states that over any field K (of characteristic 0), every matrix with trace 0 can be expressed as a commutator AB-BA, or, equivalently, that the set of values of the polynomial f(x,y)=xy-yx on the nxn-matrix…

环与代数 · 数学 2013-11-26 Zachary Mesyan

Recent work of Borwein, Choi, and the second author examined a collection of polynomials closely related to the Goldbach conjecture: the polynomial $F_N$ is divisible by the $N$th cyclotomic polynomial if and only if there is no…

数论 · 数学 2010-08-12 Greg Martin , Charles L. Samuels

Given $H\subseteq \mathbb{C}$ two natural objects to study are the set of zeros of polynomials with coefficients in $H$, $$\{z\in \mathbb{C}: \exists k>0,\, \exists (a_n)\in H^{k+1}, \sum_{n=0}^{k}a_{n}z^n=0\},$$ and the set of zeros of…

数论 · 数学 2017-03-09 Simon Baker , Han Yu

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

数论 · 数学 2019-01-30 Patrick Letendre

We completely characterize sections of the cones of nonnegative polynomials, convex polynomials and sums of squares with polynomials supported on circuits, a genuine class of sparse polynomials. In particular, nonnegativity is characterized…

代数几何 · 数学 2015-10-27 Sadik Iliman , Timo de Wolff

Let \begin{equation*} A_{q}^{(\alpha)}(a;z) = \sum_{k=0}^{\infty} \frac{(a;q)_{k} q^{\alpha k^2} z^k} {(q;q)_{k}}, \end{equation*} where $\alpha >0,~0<q<1.$ In a paper of Ruiming Zhang, he asked under what conditions the zeros of the entire…

经典分析与常微分方程 · 数学 2016-04-19 Bing He