English
Related papers

Related papers: On $L^1$-approximation of groups

200 papers

We study the boundedness problem for maximal operators $\mathbb{M}$ associated to averages along families of finite type curves in the plane, defined by $$\mathbb{M}f(x) \, := \, \sup_{1 \leq t \leq 2} \left|\int_{\mathbb{C}} f(x-ty) \,…

Classical Analysis and ODEs · Mathematics 2023-06-29 Ramesh Manna

This is an informal announcement of results to be described and proved in detail in a paper to appear. We give various results on the structure of approximate subgroups in linear groups such as $\SL_n(k)$. For example, generalising a result…

Group Theory · Mathematics 2010-03-16 Emmanuel Breuillard , Ben Green , Terence Tao

This work studies optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, $H^p$ ($1 < p < \infty$). In particular, we uncover some estimates concerning the OPAs of degree zero and one. It is also shown that if…

Functional Analysis · Mathematics 2023-05-26 Raymond Centner , Raymond Cheng , Christopher Felder

We develop classes of one-parameter families (OPF) of operators on $C^\infty_c(\mathbb{C})$ which characterize the behavior of operators associated to the $\bar\partial$-problem in $L^2(\mathbb{C},e^{-2p})$ where $p$ is a subharmonic,…

Complex Variables · Mathematics 2007-05-23 Andrew Raich

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

Operator Algebras · Mathematics 2025-02-26 Huaxin Lin

We study minimisation problems in $L^\infty$ for general quasiconvex first order functionals, where the class of admissible mappings is constrained by the sublevel sets of another supremal functional and by the zero set of a nonlinear…

Analysis of PDEs · Mathematics 2022-02-25 Ed Clark , Nikos Katzourakis

In this paper, we investigate the approximation behavior of both one and multidimensional neural network type operators for functions in $L^p(I^d,\rho)$, where $1\leq p<\infty$, associated with a general measure $\rho$ defined over a…

Functional Analysis · Mathematics 2025-12-23 Nitin Bartwal , A. Sathish Kumar

We study a parametrized family of strong maximal fractional operators. We prove their $L^p$ to $L^q$ boundedness for $1<p\le q<\infty$.

Classical Analysis and ODEs · Mathematics 2026-04-28 Zipeng Wang

We show that for any separable reflexive Banach space $X$ and a large class of Banach spaces $E$, including those with a subsymmetric shrinking basis but also all spaces $L_p$ for $1\leq p \leq \infty$, every bounded linear map ${\mathcal…

Functional Analysis · Mathematics 2023-11-22 Yemon Choi , Bence Horváth , Niels Jakob Laustsen

Using a transference result, several inequalities of approximation by entire functions of exponential type in $\mathcal{C}(\mathbf{R})$, the class of bounded uniformly continuous functions defined on $\mathbf{R}:=\left( -\infty ,+\infty…

Classical Analysis and ODEs · Mathematics 2022-08-30 Ramazan Akgün

We study the problem of computing the $p\rightarrow q$ norm of a matrix $A \in R^{m \times n}$, defined as \[ \|A\|_{p\rightarrow q} ~:=~ \max_{x \,\in\, R^n \setminus \{0\}} \frac{\|Ax\|_q}{\|x\|_p} \] This problem generalizes the spectral…

Computational Complexity · Computer Science 2018-08-10 Vijay Bhattiprolu , Mrinalkanti Ghosh , Venkatesan Guruswami , Euiwoong Lee , Madhur Tulsiani

If $P(z)$ be a polynomial of degree at most $n$ which does not vanish in $|z| < 1$, it was recently formulated by Shah and Liman \cite[\textit{Integral estimates for the family of $B$-operators, Operators and Matrices,} \textbf{5}(2011), 79…

Complex Variables · Mathematics 2013-06-05 N. A. Rather , Suhail Gulzar

We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty)…

Computational Complexity · Computer Science 2010-04-26 Julien M. Hendrickx , Alex Olshevsky

Set Cover is a classic NP-hard problem; as shown by Slav\'{i}k (1997) the greedy algorithm gives an approximation ratio of $\ln n - \ln \ln n + \Theta(1)$. A series of works by Lund \& Yannakakis (1994), Feige (1998), Moshkovitz (2015) have…

Data Structures and Algorithms · Computer Science 2017-02-17 David G. Harris

We introduce the notion of proper proximality for finite von Neumann algebras, which naturally extends the notion of proper proximality for groups. Apart from the group von Neumann algebras of properly proximal groups, we provide a number…

Operator Algebras · Mathematics 2022-11-18 Changying Ding , Srivatsav Kunnawalkam Elayavalli , Jesse Peterson

We calculate the norm of the Fourier operator from $L^p(X)$ to $L^q(\hat{X})$ when $X$ is an infinite locally compact abelian group that is, furthermore, compact or discrete. This subsumes the sharp Hausdorff-Young inequality on such…

Classical Analysis and ODEs · Mathematics 2021-10-20 Mokshay Madiman , Peng Xu

We prove a theorem, which generalises C. Franchetti's estimate for the norm of a projection onto a rich subspace of $L^p([0, 1])$ and the authors' related estimate for compact operators on $L^p([0, 1])$, $1 \le p < \infty$.

Functional Analysis · Mathematics 2020-08-18 Eugene Shargorodsky , Teo Sharia

In \cite{MR447956}, Muckenhoupt and Wheeden formulated a weighted weak $(p,p)$ inequality where the weight for the weak $L^p$ space is treated as a multiplier rather than a measure. They proved such inequalities for the Hardy-Littlewood…

Classical Analysis and ODEs · Mathematics 2024-10-08 Brandon Sweeting

We propose practical algorithms for entrywise $\ell_p$-norm low-rank approximation, for $p = 1$ or $p = \infty$. The proposed framework, which is non-convex and gradient-based, is easy to implement and typically attains better…

Machine Learning · Computer Science 2018-05-25 Anastasios Kyrillidis

We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…

Group Theory · Mathematics 2024-11-20 Ben Hayes , Srivatsav Kunnawalkam Elayavalli