Related papers: Powered numbers in short intervals II
We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…
This paper studies the power properties of confidence intervals (CIs) for a partially-identified parameter of interest with an interval identified set. We assume the researcher has bounds estimators to construct the CIs proposed by Stoye…
This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper…
Consider a finite sample from an unknown distribution over a countable alphabet. Unobserved events are alphabet symbols which do not appear in the sample. Estimating the probabilities of unobserved events is a basic problem in statistics…
The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…
We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are…
We prove that for every integer $d \ge 2$ there exists a dense collection of subsets of $[n]^d$ such that no two of them have a symmetric difference that may be written as the $d$th power of a union of at most $\lfloor d/2 \rfloor$…
We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.
When interpreting A/B tests, we typically focus only on the statistically significant results and take them by face value. This practice, termed post-selection inference in the statistical literature, may negatively affect both point…
In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
Quality statistical inference requires a sufficient amount of data, which can be missing or hard to obtain. To this end, prediction-powered inference has risen as a promising methodology, but existing approaches are largely limited to…
Sampling from a random discrete distribution induced by a `stick-breaking' process is considered. Under a moment condition, it is shown that the asymptotics of the sequence of occupancy numbers, and of the small-parts counts (singletons,…
Conditional power calculations are frequently used to guide the decision whether or not to stop a trial for futility or to modify planned sample size. These ignore the information in short-term endpoints and baseline covariates, and thereby…
We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…
We consider the linear combinations of elements of two sequences: the first one a priory given nonnegative sequence and the second random sequence from the unit interval. We investigate the expected value of the smallest natural number such…
Selective inference is a subfield of statistics that enables valid inference after selection of a data-dependent question. In this paper, we introduce selectively dominant p-values, a class of p-values that allow practitioners to easily…
We conduct a large scale empirical investigation of contextualized number prediction in running text. Specifically, we consider two tasks: (1)masked number prediction-predicting a missing numerical value within a sentence, and (2)numerical…
We introduce a testing-by-betting framework that leverages predictions on unlabeled data to enhance the power of sequential hypothesis testing. Given limited samples from the joint distribution of $(X,Y)$, and additional unlabeled samples…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…