中文
相关论文

相关论文: The Elekes-Szab\'{o} Problem and the Uniformity Co…

200 篇论文

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

数论 · 数学 2022-07-25 Bryce Kerr , Jorge Mello , Igor Shparlinski

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

In this paper it is proven that for any $f\in\mathbb{R}(x_1,x_2)$ and $A_1,A_2$ nonempty finite subsets of $\mathbb{R}$ such that $|A_1|=|A_2|$ and $f$ is defined in $A_1\times A_2$, we have that \begin{equation*}…

数论 · 数学 2019-04-15 Mario Huicochea

This paper provides a complete proof of Simon-Lukic conjecture for orthogonal polynomials on the unit circle. For a probability measure $d\mu = w(\theta) \frac{d\theta}{2\pi} + d\mu_s$ with Verblunsky coefficients…

谱理论 · 数学 2026-01-27 Daxiong Piao

Our main result is a new upper bound for the size of k-uniform, L-intersecting families of sets, where L contains only positive integers. We characterize extremal families in this setting. Our proof is based on the Ray-Chaudhuri--Wilson…

组合数学 · 数学 2015-12-21 Gábor Hegedüs

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

经典分析与常微分方程 · 数学 2024-07-01 Trevor D. Wooley

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

组合数学 · 数学 2007-05-23 Leonid Gurvits

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

数论 · 数学 2019-01-15 Nicole Looper

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

计算复杂性 · 计算机科学 2017-04-07 Joel Ouaknine , James Worrell

We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may…

机器学习 · 计算机科学 2019-05-31 Akshay Balsubramani , Sanjoy Dasgupta , Yoav Freund , Shay Moran

Given $d,s \in \mathbb{N}$, a finite set $A \subseteq \mathbb{Z}$ and polynomials $\varphi_1, \dots, \varphi_{s} \in \mathbb{Z}[x]$ such that $1 \leq deg \varphi_i \leq d$ for every $1 \leq i \leq s$, we prove that \[ |A^{(s)}| +…

数论 · 数学 2023-10-31 Akshat Mudgal

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

组合数学 · 数学 2024-08-16 Bryce Alan Christopherson , Darian Colgrove

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

数值分析 · 数学 2008-10-16 Marco Caminati

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

计算几何 · 计算机科学 2022-02-11 Shir Peleg , Amir Shpilka

Let $\mathbf{v}_i$ be vectors in $\mathbb{R}^d$ and $\{\varepsilon_i\}$ be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for $\sup_{\mathbf{x} \in \mathbb{R}^d}…

组合数学 · 数学 2020-09-03 Kyle Luh , David Xiang

We consider Chebyshev polynomials, $T_n(z)$, for infinite, compact sets $\frak{e} \subset \mathbb{R}$ (that is, the monic polynomials minimizing the sup-norm, $\Vert T_n \Vert_{\frak{e}}$, on $\frak{e}$). We resolve a $45+$ year old…

经典分析与常微分方程 · 数学 2019-11-06 Jacob S. Christiansen , Barry Simon , Maxim Zinchenko

We study optimal dimensionless inequalities $$ \|f\|_{U^k} \leq \|f\|_{\ell^{p_{k,n}}} $$ that hold for all functions $f\colon\mathbb{Z}^d\to\mathbb{C}$ supported in $\{0,1,\ldots,n-1\}^d$ and estimates $$ \|1_A\|_{U^k}^{2^k}\leq…

组合数学 · 数学 2025-06-18 Adrian Beker , Tonći Crmarić , Vjekoslav Kovač

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in the…

数论 · 数学 2021-01-25 Patrick Ingram

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…

最优化与控制 · 数学 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

In this paper, within a unified framework of the condition number theory we present the explicit expression of the projected condition number of the equality constrained indefinite least squares problem. By setting specific norms and…

数值分析 · 数学 2020-07-24 Shaoxin Wang , Hanyu Li , Hu Yang