中文
相关论文

相关论文: A polylogarithmic bound in the nonlinear Roth theo…

200 篇论文

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

数论 · 数学 2025-06-17 Daniel Altman , Mehtaab Sawhney

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out…

数论 · 数学 2025-05-14 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

数论 · 数学 2008-10-03 Christiaan van de Woestijne

This paper investigates the expected number of complex roots of nonlinear equations. Those equations are assumed to be analytic, and to belong to certain inner product spaces. Those spaces are then endowed with the Gaussian probability…

代数几何 · 数学 2013-11-11 Gregorio Malajovich

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

组合数学 · 数学 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

A sum-dominant set is a finite set $A$ of integers such that $|A+A| > |A-A|$. As a typical pair of elements contributes one sum and two differences, we expect sum-dominant sets to be rare in some sense. In 2006, however, Martin and O'Bryant…

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is…

组合数学 · 数学 2016-05-11 József Balogh , Hong Liu , Maryam Sharifzadeh

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

计算复杂性 · 计算机科学 2017-11-03 Noga Alon , Mrinal Kumar , Ben Lee Volk

We study sets of the form $A = \big\{ n \in \mathbb N \big| \lVert p(n) \rVert_{\mathbb R / \mathbb Z} \leq \varepsilon(n) \big\}$ for various real valued polynomials $p$ and decay rates $\varepsilon$. In particular, we ask when such sets…

数论 · 数学 2018-07-20 Jakub Konieczny

Lienard systems of the form $\ddot{x}+\epsilon f(x)\dot{x}+x=0$, with f(x) an even function, are studied in the strongly nonlinear regime ($\epsilon\to\infty$). A method for obtaining the number, amplitude and loci of the limit cycles of…

混沌动力学 · 物理学 2007-05-23 Jose-Luis Lopez , Ricardo Lopez-Ruiz

We present upper bounds on the bit-size of coefficients of non-radical lexicographical Groebner bases in purely triangular form (triangular sets) of dimension zero. This extends a previous work [Dahan-Schost, Issac'2004], constrained to…

符号计算 · 计算机科学 2017-10-18 Xavier Dahan

Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no…

数论 · 数学 2016-07-29 Vandita Patel , Samir Siksek

A problem of Erd\H{o}s asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossing with respect to the cyclic orders. Fern\'andez, Kim,…

组合数学 · 数学 2026-05-22 Yue Xu , Jiasheng Zeng , Xiao-Dong Zhang

We investigate various sparse sets that satisfy the prime number theorem. The sparsest of these sets, $\{\lfloor x/n^t \rfloor:n \le x\}$, has density approaching $1/x$ as $t$ approaches infinity.

数论 · 数学 2024-03-18 Olivier Bordellès , Randell Heyman , Dion Nikolic

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

数论 · 数学 2026-05-22 Amirali Fatehizadeh

We show that the pattern $\{x,x+y,xy\}$ is partition regular over the space of formal integer polynomials of degree at least one with zero constant term, with primitive recursive bounds. This provides a new proof for the partition…

组合数学 · 数学 2024-08-28 Ryan Alweiss

In this paper we study the density of polynomials in some $L^2(M)$ spaces. Two choices of the measure $M$ and polynomials are considered: 1) a $(N\times N)$ matrix non-negative Borel measure on $\mathbb{R}$ and vector-valued polynomials…

泛函分析 · 数学 2011-02-04 Sergey M. Zagorodnyuk

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

数论 · 数学 2015-02-27 Thomas Reuss

We improve an $L^2\times L^2\to L^2$ estimate for a certain bilinear operator in the finite field of size $p$, where $p$ is a prime sufficiently large. Our method carefully picks the variables to apply the Cauchy-Schwarz inequality. As a…

经典分析与常微分方程 · 数学 2024-01-17 Necef Kavrut , Shukun Wu

We prove the density hypothesis for wide families of arithmetic orbifolds arising from all division quaternion algebras over all number fields of bounded degree. Our power-saving bounds on the multiplicities of non-tempered representations…