中文
相关论文

相关论文: Small scale distribution of linear patterns of pri…

200 篇论文

For a finite measure $\varLambda$ on $[0,1]$, the $\varLambda$-coalescent is a coalescent process such that, whenever there are $b$ clusters, each $k$-tuple of clusters merges into one at rate…

概率论 · 数学 2009-09-29 Julien Berestycki , Nathanaël Berestycki , Jason Schweinsberg

We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows…

计算复杂性 · 计算机科学 2017-11-02 Amir Abboud , Aviad Rubinstein , Ryan Williams

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

数论 · 数学 2025-12-23 Anup B. Dixit , Nikhil S Kumar

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time, either the class of languages reducible to A (the lower…

计算复杂性 · 计算机科学 2007-05-23 John M. Hitchcock

In this paper, we prove the following result: {quote} Let $\A$ be an infinite set of positive integers. For all positive integer $n$, let $\tau_n$ denote the smallest element of $\A$ which does not divide $n$. Then we have $$\lim_{N \to +…

数论 · 数学 2009-12-15 Bakir Farhi

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…

数论 · 数学 2018-01-22 Paul Cubre , Jeremy Rouse

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

数论 · 数学 2019-06-14 Thai Hoang Le , Julia Wolf

We study the asymptotic behaviour of the posterior distribution in a broad class of statistical models where the "true" solution occurs on the boundary of the parameter space. We show that in this case Bayesian inference is consistent, and…

统计理论 · 数学 2014-10-02 Natalia A. Bochkina , Peter J. Green

We deal with the distribution of the fractional parts of $p^{\lambda}$, $p$ running over the prime numbers and $\lambda$ being a fixed real number lying in the interval $(0,1)$. Roughly speaking, we study the following question: Given a…

数论 · 数学 2007-05-23 Stephan Baier

The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have been discovered since the original paper.

数论 · 数学 2018-03-06 David Conlon , Jacob Fox , Yufei Zhao

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

经典分析与常微分方程 · 数学 2025-11-19 András Máthé , William O'Regan

This paper generalizes the result of Sarnak and Ubis \cite{sarnak-ubis} about non-concentration of primes in horocycle orbits on $PSL_2(\mathbb{Z}) \backslash PSL_2(\mathbb{R})$ to any lattice in $PSL_2(\mathbb{R})$. The proof combines the…

数论 · 数学 2023-03-15 Lauritz Streck

In this work, we establish a nontrivial level of distribution for densities on $\{1,\ldots, N\}$ obtained by a biased coin convolution. As a consequence of sieving theory, one then derives the expected lower bound for the weight of such…

数论 · 数学 2015-06-03 Mei-Chu Chang

The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes $a_1,..., a_n$ in $(0,1]$. Using uniform sampling, which selects a random element from the input list each time, we develop a…

计算复杂性 · 计算机科学 2011-02-25 Richard Beigel , Bin Fu

Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…

概率论 · 数学 2015-12-07 N. J. Simm

In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating…

信息论 · 计算机科学 2019-02-13 Hayato Takahashi

Let $f(z)=\sum_{n=1}^\infty a(n)q^n\in S^{\text{new}}_ k (\Gamma_0(N))$ be a newform with squarefree level $N$ that does not have complex multiplication. For a prime $p$, define $\theta_p\in[0,\pi]$ to be the angle for which $a(p)=2p^{( k…

数论 · 数学 2020-04-13 Jeremy Rouse , Jesse Thorner

We show that every set S in [N]^d occupying less than p^t residue classes for some real number t < d and every prime p, must essentially lie in the solution set of a polynomial equation of degree at most (log N)^C, for some constant C…

数论 · 数学 2013-09-10 Miguel N. Walsh

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

组合数学 · 数学 2016-10-10 Gábor Hegedüs
‹ 上一页 1 8 9 10 下一页 ›