Related papers: Powered numbers in short intervals II
Power law or generalized polynomial regressions with unknown real-valued exponents and coefficients, and weakly dependent errors, are considered for observations over time, space or space--time. Consistency and asymptotic normality of…
We focus on the problem estimating a monotone trend function under additive and dependent noise. New point-wise confidence interval estimators under both short- and long-range dependent errors are introduced and studied. These intervals are…
We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…
We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…
Let $X$ be large and let $\mathcal{P}$ denote the set of primes. Fix positive real parameters $r_1,\dots,r_s$ and a parameter $\lambda\geqslant 1$ determined by a balancing relation, and let $\mathcal{A}_{\lambda}(X)\subset[1,2X]$ be the…
We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $\lambda^{s_n}$. In particular, we obtain a result which is…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
We decrease the length of the shortest interval for which almost all even integers in it are the sum of two primes. This is achieved by applying a version of the Circle Method that uses two minorants together with a nonnegative model for…
Condition numbers of random polynomial systems have been widely studied in the literature under certain coefficient ensembles of invariant type. In this note we introduce a method that allows us to study these numbers for a broad family of…
We present an algorithm for computing a spectral decomposition of an interval matrix as an enclosure of spectral decompositions of particular realizations of interval matrices. The algorithm relies on tight outer estimations of eigenvalues…
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
It is generally believed that more observations provide more information. However, we observe that in the independence test for rare events, the power of the test is, surprisingly, determined by the number of rare events rather than the…
Nonlinear polynomial selection algorithms for the number field sieve address the problem of constructing polynomials with small coefficients by reducing to instances of the well-studied problem of finding short vectors in lattices. The…
Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approach relies upon creating a sequence of covers on the…
Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…
We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…
Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers $x^n$ for binary encoded numbers $n$. It is shown that polynomial identity testing for…