English
Related papers

Related papers: Approximating mixed H\"older functions using rando…

200 papers

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…

Functional Analysis · Mathematics 2019-08-02 Ivan Feshchenko

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

The main purpose of the paper is to study sharp estimates of approximation of periodic functions in the H\"older spaces $H_p^{r,\alpha}$ for all $0<p\le\infty$ and $0<\alpha\le r$. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2015-07-28 Yurii Kolomoitsev , Jürgen Prestin

We present the first efficient averaging sampler that achieves asymptotically optimal randomness complexity and near-optimal sample complexity. For any $\delta < \varepsilon$ and any constant $\alpha > 0$, our sampler uses $m + O(\log (1 /…

Computational Complexity · Computer Science 2025-08-18 Zhiyang Xun , David Zuckerman

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…

Number Theory · Mathematics 2021-11-15 Alexander P. Mangerel

We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…

Computational Geometry · Computer Science 2025-12-30 Hariharan Narayanan , Sourav Roy

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

Classical Analysis and ODEs · Mathematics 2016-10-27 Joel Laity , Barak Shani

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

Data Structures and Algorithms · Computer Science 2015-03-31 Vitaly Feldman , Jan Vondrak

Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…

Classical Analysis and ODEs · Mathematics 2019-07-31 Alberto Debernardi , Elijah Liflyand

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

Numerical Analysis · Mathematics 2023-03-27 Francesco Dell'Accio , Alvise Sommariva , Marco Vianello

Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…

Number Theory · Mathematics 2024-07-09 Mengdi Wang

Let $f$ be analytic on $[0,1]$ with $|f^{(k)}(1/2)|\leq A\alpha^kk!$ for some constant $A$ and $\alpha<2$. We show that the median estimate of $\mu=\int_0^1f(x)\,\mathrm{d}x$ under random linear scrambling with $n=2^m$ points converges at…

Computation · Statistics 2022-07-11 Zexin Pan , Art B. Owen

Let $A$ be a set and $V$ a real Hilbert space. Let $H$ be a real Hilbert space of functions $f:A\to V$ and assume $H$ is continuously embedded in the Banach space of bounded functions. For $i=1,\cdots,n$, let $(x_i,y_i)\in A\times V$…

Functional Analysis · Mathematics 2022-02-23 Karen Yeressian

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…

Numerical Analysis · Mathematics 2020-04-14 David Levin

Let $F^{*}$ be an approximation of a given $(a \times b)$ matrix $F$ derived by methods that are not randomized. We prove that for a given $F$ and $F^{*}$, $H$ and $T$ can be computed by randomized algorithm such that $(HT)$ is an…

Numerical Analysis · Mathematics 2021-08-31 Samriddha Sanyal

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

Number Theory · Mathematics 2024-06-07 Ofir Gorodetsky , Mo Dick Wong

In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is…

Cryptography and Security · Computer Science 2014-03-13 Razvan Barbulescu , Armand Lachand

We establish that a generalized H\"{o}lder continuous function on an $(m-2)$-Ahlfors regular compact set in $\mathbb{R}^m$ can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity…

Analysis of PDEs · Mathematics 2023-07-24 Grigori Rozenblum , Nikolai Shirokov

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Computational Complexity · Computer Science 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio