中文
相关论文

相关论文: An improved incidence bound over fields of prime o…

200 篇论文

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

组合数学 · 数学 2019-04-17 Mozhgan Mirzaei

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

数论 · 数学 2009-06-16 Shaofang Hong , Scott D. Kominers

Let $H_t$ be the subdivision of $K_t$. Very recently, Conlon and Lee have proved that for any integer $t\geq 3$, there exists a constant $C$ such that $\text{ex}(n,H_t)\leq Cn^{3/2-1/6^t}$. In this paper, we prove that there exists a…

组合数学 · 数学 2019-11-05 Oliver Janzer

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

数论 · 数学 2017-05-17 A. J. Irving

In this paper we improve the upper bound of the number $N_{K, n}(X)$ of degree $n$ extensions of a number field $K$ with absolute discriminant bounded by $X$. This is achieved by giving a short $\mathcal{O}_K$-basis of an order of an…

数论 · 数学 2021-06-04 Jungin Lee

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…

数论 · 数学 2011-11-01 Tristan Freiberg

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

组合数学 · 数学 2026-05-21 Andrew Suk , Su Zhou

We study incidence problems involving points and curves in $R^3$. The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the…

组合数学 · 数学 2020-07-09 Micha Sharir , Noam Solomon

In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…

组合数学 · 数学 2016-04-07 Micha Sharir , Noam Solomon

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

数论 · 数学 2022-05-16 Florian K. Richter

We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…

计算复杂性 · 计算机科学 2007-05-23 Fredrik Kuivinen

Goldston, Pintz and Y\i ld\i r\i m have shown that if the primes have `level of distribution' $\theta$ for some $\theta>1/2$ then there exists a constant $C(\theta)$, such that there are infinitely many integers $n$ for which the interval…

数论 · 数学 2014-02-26 James Maynard

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

数论 · 数学 2017-04-13 Florian Luca , Ricardo Menares , Amalia Pizarro-Madariaga

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…

组合数学 · 数学 2013-05-06 Christine Bachoc , Imre Z. Ruzsa , Mate Matolcsi

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

经典分析与常微分方程 · 数学 2017-09-26 Alex Iosevich

We provide a new lower bound on the length of the longest cycle of the binomial random graph $G(n,(1+\epsilon)/n)$ that holds w.h.p. for all $\epsilon=\epsilon(n)$ such that $\epsilon^3n\to \infty$. In the case $\epsilon\leq \epsilon_0$ for…

组合数学 · 数学 2022-08-16 Michael Anastos

First we reprove, using representation theory and the relative trace formula of Jacquet, an average value result of Duke for modular L-series at the critical center. We also establish a refinement. To be precise, the L-value which appears…

数论 · 数学 2007-05-23 Dinakar Ramakrishnan , Jonathan Rogawski

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…

组合数学 · 数学 2016-12-28 Ben Lund , Shubhangi Saraf

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points…

计算几何 · 计算机科学 2020-06-24 Micha Sharir , Noam Solomon , Oleg Zlydenko

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…