Related papers: A constraint on extensible quadrature rules
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 study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…
We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…
Feature importance methods using unrestricted permutations are flawed due to extrapolation errors; such errors appear in all non-trivial variable importance approaches. We propose three new approaches: conditional model reliance and…
We consider a self-similar fragmentation process in which the generic particle of size $x$ is replaced at probability rate $x^\alpha$, by its offspring made of smaller particles, where $\alpha$ is some positive parameter. The total of…
Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
This paper concerns the asymptotic behaviour of solutions of a linear convolution Volterra summation equation with an unbounded forcing term. In particular, we suppose the kernel is summable and ascribe growth bounds to the exogenous…
We posit that $d_n^2 < 2p_{n+1}$ holds for all $n\geq 1$, where $p_n$ represents the $n$th prime and $d_n$ stands for the $n$th prime gap i.e. $d_n := p_{n+1} - p_n$. Then, the presence of a prime between successive perfect squares, as well…
Consider $q_n$ a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with $n$ faces. In this paper we show that, when $n$ goes to $+\infty$, $q_n$ suitably normalized converges weakly in a certain sense…
The (two) core of a hypergraph is the maximal collection of hyperedges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over GF[2], or iterative decoding of low-density…
Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…
Randomized quadratures for integrating functions in Sobolev spaces of order $\alpha \ge 1$, where the integrability condition is with respect to the Gaussian measure, are considered. In this function space, the optimal rate for the…
We examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\sum_{x<n \leqslant x+y} f(n)$, exhibits the phenomenon of \textit{better than square-root cancellation}. We establish that the…
We provide sufficient density condition for a set of nonuniform samples to give rise to a set of sampling for multivariate bandlimited functions when the measurements consist of pointwise evaluations of a function and its first $k$…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
For a model with many-to-one connectivity it is widely expected that mean-field theory captures the exact many-particle $N\to\infty$ limit, and that higher-order cumulant expansions of the Heisenberg equations converge to this same limit…
We study the scaling of classification error rates with respect to the size of the training dataset. In contrast to classical results where rates are minimax optimal for a problem class, this work starts with the empirical observation that,…
It is well known that estimating the expectation of any given bounded random variable with values in $[-B, B]$ has a sample complexity of $\mathrm{O}(B^2/\epsilon^2)$ that is independent of the underlying probability measure. We show that…
We show that there exists a sequence $\{n_k, k\ge 1\}$ growing at least geometrically such that for any finite non-negative measure $\nu$ such that $\hat \nu\ge 0$, any $T>0$, $$ \int_{-2^{n_k} T}^{2^{n_k} T} \hat \nu(x) \dd x \ll_\e…