Related papers: Sums of random multiplicative functions over funct…
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…
We provide new formulas for the coefficients in the partial fraction decomposition of the restricted partition generating function. These techniques allow us to partially resolve a recent conjecture of Sills and Zeilberger. We also describe…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…
It is shown that the p-summing norm of any operator with n-dimensional domain can be well-aproximated using only ``few" vectors in the definition of the p-summing norm. Except for constants independent of n and log n factors, ``few" means n…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
In [arXiv:2212.04969], the authors stated some conjectures on the variance of certain sums of the divisor function $d_k(n)$ over number fields, which were inspired by analogous results over function fields proven in [arXiv:2107.01437].…
This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…
This paper addresses the problem of approximating a function of bounded variation from its scattered data. Radial basis function(RBF) interpolation methods are known to approximate only functions in their native spaces, and to date, there…
The problem of root mean square approximation of a square integrable function by finite linear combinations of exponential functions is considered. It is subdivided into linear and nonlinear parts. The linear approximation problem is…
We construct random Morse functions on surfaces by random walk and compute related distributions. We study the space of Morse functions through these random variables. We consider subspaces characterized by the surfaces with boundary…
Let $p$ be a prime number, $C$ be any absolutely irreducible affine plane curve over $\mathbb{F}_p$, and $g,f\in\mathbb{F}_p(x,y)$ be rational functions. We continue the study of the distribution of the values of short hybrid exponential…
We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
In this paper an analytic expression is given for the bounds of the distribution function of the sum of dependent normally distributed random variables. Using the theory of copulas and the important Frechet bounds the dependence structure…
We give a simple inequality for the sum of independent bounded random variables. This inequality improves on the celebrated result of Hoeffding in a special case. It is optimal in the limit where the sum tends to a Poisson random variable.
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
One of the main applications of free probability is to show that for appropriately chosen independent copies of $d$ random matrix models, any noncommutative polynomial in these $d$ variables has a spectral distribution that converges…
Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{3}{4}+ \varepsilon}. $$