中文
相关论文

相关论文: Degree bound of P\'olya Positivstellenstaz

200 篇论文

We consider computing the Riemann zeta function $\zeta(s)$ and Dirichlet $L$-functions $L(s,\chi)$ to $p$-bit accuracy for large $p$. Using the approximate functional equation together with asymptotically fast computation of the incomplete…

数值分析 · 数学 2021-10-22 Fredrik Johansson

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

数论 · 数学 2020-03-20 Changhao Chen , Igor E. Shparlinski

After defining a notion of $\epsilon$-density, we provide for any real algebraic number $\alpha$ an estimate of the smallest $\epsilon$ such that for each $m>1$ the set of vectors of the form $(t,t\alpha,...,t\alpha^{m-1})$ for $t\in\R$ is…

数论 · 数学 2011-10-18 Nevio Dubbini , Maurizio Monge

Let $\mathbb{N}$ and $\mathcal{P}$ be the sets of natural numbers and primes, respectively. Motived by an old problem of Erd\H os and Kalm\'ar, we prove that for almost all $y>1$ the lower asymptotic density of integers of the form…

数论 · 数学 2025-09-09 Yuchen Ding

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

数论 · 数学 2019-01-01 Daniele Mastrostefano

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

组合数学 · 数学 2023-12-14 Sarah Peluse

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…

表示论 · 数学 2024-06-12 Hao Liang

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

数论 · 数学 2025-12-19 Petr Kucheriaviy

If n points B_1,---,B_n$ in the standard simplex \Delta_n are affinely independent, then they can span an (n-1)-simplex denoted by \Lambda=Con(B_1,---,B_n). Here \Lambda corresponds to an n*n matrix [\Lambda] whose columns are B_1,---,B_n.…

代数几何 · 数学 2012-09-19 Yong Yao , Jia Xu , Jingzhong Zhang

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

经典分析与常微分方程 · 数学 2009-04-20 M. A. M. Alwash

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

数论 · 数学 2023-10-06 Florian Breuer , Fabien Pazuki

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

数论 · 数学 2024-05-22 James Leng

An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum of its…

计算复杂性 · 计算机科学 2015-07-01 Vladimir V. Podolskii

In this paper we find a positive weak solution for a semipositone $p(\cdot )$- Laplacian problem. More precisely, we find a solution for the problem \[ \left\{ \begin{array}{cc} -\Delta _{p(\cdot )}u=f(u)-\lambda & \text{in }\Omega \\ u>0 &…

偏微分方程分析 · 数学 2024-10-10 Lucas A. Vallejos , Raúl E. Vidal

The paper focuses on the $L^{p}$-Positivity Preservation property ($L^{p}$-PP for short) on a Riemannian manifold $(M,g)$. It states that any $L^p$ function $u$ with $1<p<+\infty$, which solves $(-\Delta + 1)u\ge 0$ on $M$ in the sense of…

偏微分方程分析 · 数学 2023-02-07 Stefano Pigola , Daniele Valtorta , Giona Veronelli

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

谱理论 · 数学 2019-02-19 Công-Trình Lê , Thi-Hoa-Binh Du , Tran-Duc Nguyen

Let $P(\partial_0,\partial_1,...,\partial_n)$ be a PDO on $\symR^{1+n}$ with constant coefficients. It is proved that (i) the real parts of the $\lambda$-roots of the polynomial $P(\lambda,i\xi_1,...,i\xi_n)$ are bounded from above when…

泛函分析 · 数学 2011-05-05 Jan Kisyński

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

组合数学 · 数学 2025-08-13 Ghadir Ghadimi , Mohammad Akbari Tootkaboni

We obtain asymptotic bounds on the number of natural numbers less than $X$ satisfying $\gcd{\left(n,\lfloor P(n) \rfloor\right)}=1$, under some diophantine conditions on the coefficient of $x$ in $P$, and show that the density of such…

数论 · 数学 2024-11-25 Aahan Chatterjee

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

组合数学 · 数学 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy