Related papers: Distribution of the Error in Estimated Numbers of …

In this paper, using techniques developed in our earlier works on the theory of mod-Gaussian convergence, we prove precise moderate and large deviation results for the logarithm of the characteristic polynomial of a random unitary matrix.…

We consider statistical estimations of a matrix product over the integers in a distributed setting, where we have two parties Alice and Bob; Alice holds a matrix $A$ and Bob holds a matrix $B$, and they want to estimate statistics of $A…

In this paper, we study a distributed learning problem constrained by constant communication bits. Specifically, we consider the distributed hypothesis testing (DHT) problem where two distributed nodes are constrained to transmit a constant…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

In this first article of a multi-part series, we inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathbb{Z}$ and the…

We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…

We investigate the concept of Pauli pairs and a discrete counterpart to it. In particular, we make substantial progress on the question of when a discrete Pauli pair is automatically a classical Pauli pair. Effectively, if one of the…

We give an affirmative answer to a question of K. Ciesielski by showing that the composition $f\circ g$ of two derivatives $f,g:[0,1]\to[0,1]$ always has a fixed point. Using Maximoff's Theorem we obtain that the composition of two…

We study the problem of estimating the joint probability mass function (pmf) over two random variables. In particular, the estimation is based on the observation of $m$ samples containing both variables and $n$ samples missing one fixed…

Let p be a fixed prime number. Let K be a totally real number field of discriminant D\_K and let T\_K be the torsion group of the Galois group of the maximal abelian p-ramified pro-p-extension of K (under Leopoldt's conjecture). We…

Although double-precision floating-point arithmetic currently dominates high-performance computing, there is increasing interest in smaller and simpler arithmetic types. The main reasons are potential improvements in energy efficiency and…

Empirical likelihood is a very important nonparametric approach which is of wide application. However, it is hard and even infeasible to calculate the empirical log-likelihood ratio statistic with massive data. The main challenge is the…

Following McShane, we employ the stable norm on the homology of the modular torus to investigate the Markov ordering on the set of relatively prime integer pairs $(q,p)$ with $q\ge p\ge0$. Our main theorem is a characterization of slopes…

We obtain a series of estimates on the number of small integers and small order Farey fractions which belong to a given coset of a subgroup of order $t$ of the group of units of the residue ring modulo a prime $p$, in the case when $t$ is…

In the present study, an interior-exterior penalty discontinuous Galerkin finite element method (DG-FEM) is analysed for solving Elastohydrodynamic lubrication (EHL) line and point contact problems. The existence of discrete penalized…

Based on the work of Romano and Shaikh (2006) and Lehmann and Romano (2005) we give a sufficient criterion for controlling generalised error rates for arbitrarily dependent p-values. This criterion is formulated in terms of matrices…

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

We derive two probabilistic bounds for the relative forward error in the floating point summation of $n$ real numbers, by representing the roundoffs as independent, zero-mean, bounded random variables. The first probabilistic bound is based…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…