Related papers: Averages of arithmetic functions over polynomials …
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
We study mean convergence of multiple ergodic averages, where the iterates arise from smooth functions of polynomial growth that belong to a Hardy field. Our results include all logarithmico-exponential functions of polynomial growth, such…
In this paper we study the average $\NL_{2\alpha}$-norm over $T$-polynomials, where $\alpha$ is a positive integer. More precisely, we present an explicit formula for the average $\NL_{2\alpha}$-norm over all the polynomials of degree…
We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for…
Consider a nonparametric regression model with one-sided errors and regression function in a general H\"older class. We estimate the regression function via minimization of the local integral of a polynomial approximation. We show uniform…
In this paper, we propose a model averaging approach for addressing model uncertainty in the context of partial linear functional additive models. These models are designed to describe the relation between a response and mixed-types of…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
For any $r \in \mathbb{N}$ and almost all $k \in \mathbb{N}$ smaller than $x^r$, we show that the polynomial $f(n) = n^r + k$ takes the expected number of prime values as $n$ ranges from 1 to $x$. As a consequence, we deduce statements…
We investigate from a statistical perspective the arithmetic properties of the dynamics of polynomials of fixed degree and defined over the field of rational numbers. To start with, ordering their affine conjugacy classes by height, we show…
By means of the Hardy-Littlewood method, we apply a new mean value theorem for exponential sums to confirm the truth, over the rational numbers, of the Hasse principle for pairs of diagonal cubic forms in thirteen or more variables.
We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\circ u$. Our solution is based on model selection and leads to a very…
Various optimal gradient-based algorithms have been developed for smooth nonconvex optimization. However, many nonconvex machine learning problems do not belong to the class of smooth functions and therefore the existing algorithms are…
Ordinary differential equations (ODEs) are commonly used to model dynamic behavior of a system. Because many parameters are unknown and have to be estimated from the observed data, there is growing interest in statistics to develop…
The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…
The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential worst-case running time. In order to close the gap between…
An asymptotic formula for the variance of squarefree numbers in arithmetic progressions of given modulus was obtained by Nunes (see reference [3]). We improve one of the error terms.
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…
We study smoothed character sums involving $\sum_{m,n} ( \frac{m}{n} )_2$, where $( \frac{m}{n} )_2$ denotes the quadratic symbol in the Gaussian field. We extend previously known results to obtain asymptotic formulas for the sums…
Averaging is an important method to extract effective macroscopic dynamics from complex systems with slow modes and fast modes. This article derives an averaged equation for a class of stochastic partial differential equations without any…