English
Related papers

Related papers: A Canonical Transform for Strengthening the Local …

200 papers

Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…

Computational Complexity · Computer Science 2019-02-22 Friederike Anna Dziemba

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

Numerical Analysis · Mathematics 2026-01-01 Kingsley Yeon , Steven B. Damelin , Michael Werman

We study Calder\'on-type commutators $[M_b,T_i\mathcal R_j]$ in the rational Dunkl setting with a finite reflection group $G$. If $b$ belongs to the orbit Lipschitz class $\operatorname{Lip}_d$, then for every $1<p<\infty$ we prove…

Classical Analysis and ODEs · Mathematics 2026-05-26 Yongsheng Han , Ming-Yi Lee , Ji Li , Eric Sawyer , Liangchuan Wu

This review paper highlights the main aspects of the development of research related to the solution of extreme problems in the theory of approximation in the spaces ${\mathcal S}^p$ and $B{\mathcal S}^p$ of periodic and almost periodic…

Classical Analysis and ODEs · Mathematics 2025-09-30 Anatolii Serdyuk , Andrii Shidlich

In a locally $\lambda$-presentable category, with $\lambda$ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are $\lambda$-presentable, are known to be characterized…

Category Theory · Mathematics 2020-12-04 Jiri Rosicky , Walter Tholen

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl

This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…

Functional Analysis · Mathematics 2007-05-23 R. Balan , P. G. Casazza , C. Heil , Z. Landau

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…

Numerical Analysis · Mathematics 2017-03-01 Dinh Dũng , Charles A. Micchelli , Vu Nhat Huy

In this paper we study direct and inverse approximation inequalities in $L^{p}(\mathbb{R}^{d})$, $1<p<\infty$, with the Dunkl weight. We obtain these estimates in their sharp form substantially improving previous results. We also establish…

Classical Analysis and ODEs · Mathematics 2020-03-31 D. V. Gorbachev , V. I. Ivanov , S. Yu. Tikhonov

Large language models are capable of in-context learning, the ability to perform new tasks at test time using a handful of input-output examples, without parameter updates. We develop a universal approximation theory to elucidate how…

Machine Learning · Computer Science 2025-08-29 Gen Li , Yuchen Jiao , Yu Huang , Yuting Wei , Yuxin Chen

Incorporating prior knowledge into a data-driven modeling problem can drastically improve performance, reliability, and generalization outside of the training sample. The stronger the structural properties, the more effective these…

Robotics · Computer Science 2023-11-20 Wooyoung Chung , Daniel Polani , Stas Tiomkin

For a measure space $(\Omega, \Sigma, \mu)$ with a positive finite measure $\mu$, and a positive real number $p$, we define the space $L_p^{+}(\mu)=L_p^{+}$ of all (equivalence classes of) $\Sigma$-measurable complex functions $f$ defined…

Functional Analysis · Mathematics 2018-04-17 Romeo Meštrović , Žarko Pavićević , Novo Labudović

A previous study analyzed the convergence of probability densities for forward and inverse problems when a sequence of approximate maps between model inputs and outputs converges in $L^\infty$. This work generalizes the analysis to cases…

Probability · Mathematics 2020-01-14 Troy Butler , Tim Wildey , Wenjuan Zhang

Let $F$ be a complete discrete valuation field whose residue field $k$ is a global field of positive characteristic $p$. Let $D$ be a central division $F$-algebra of $p$-power degree. We prove that the subgroup of $F^*$ consisting of…

Number Theory · Mathematics 2022-01-27 Yong Hu

Dexterous manipulation policies today largely assume fixed hand designs, severely restricting their generalization to new embodiments with varied kinematic and structural layouts. To overcome this limitation, we introduce a parameterized…

Robotics · Computer Science 2026-05-19 Zhenyu Wei , Yunchao Yao , Mingyu Ding

Kirkwood-Buff (KB) integrals are notoriously difficult to converge from a canonical simulation because they require estimating the grand-canonical radial distribution. The same essential difficulty is encountered when attempting to estimate…

Statistical Mechanics · Physics 2018-07-17 David M. Rogers

We present a general approach to sparse domination based on single-scale $L^p$-improving as a key property. The results are formulated in the setting of metric spaces of homogeneous type and avoid completely the use of dyadic-probabilistic…

Classical Analysis and ODEs · Mathematics 2024-09-23 José M. Conde Alonso , Francesco Di Plinio , Ioannis Parissis , Manasa N. Vempati

In this article we study the $L^p$-improving mapping properties of the totally-geodesic $k$-plane transform on simply connected spaces of constant curvature, namely, $\mathbb{R}^n$, $\mathbb{H}^n$ and $\mathbb{S}^n$. We begin our study by…

Functional Analysis · Mathematics 2025-02-11 Aniruddha Deshmukh , Ashisha Kumar

The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…

Information Theory · Computer Science 2015-03-18 Quan Geng , Huan Wang , John Wright

Universal approximation theorems provide a mathematical explanation for the expressive power of neural networks. They assert that, under mild conditions on the activation function, feedforward neural networks are dense in broad function…

Machine Learning · Computer Science 2026-05-21 Soumendu Sundar Mukherjee , Himasish Talukdar