English
Related papers

Related papers: An optimization problem and point-evaluation in Pa…

200 papers

The Cheeger problem for a bounded domain $\Omega\subset\mathbb{R}^{N}$, $N>1$ consists in minimizing the quotients $|\partial E|/|E|$ among all smooth subdomains $E\subset\Omega$ and the Cheeger constant $h(\Omega)$ is the minimum of these…

Analysis of PDEs · Mathematics 2011-07-14 Hamilton Bueno , Grey Ercole

For $1<p<\infty$ and $M$ the centered Hardy-Littlewood maximal operator on $\mathbb{R}$, we consider whether there is some $\varepsilon=\varepsilon(p)>0$ such that $\|Mf\|_p\ge (1+\varepsilon)||f||_p$. We prove this for $1<p<2$. For $2\le…

Classical Analysis and ODEs · Mathematics 2019-07-22 Paata Ivanisvili , Samuel Zbarsky

Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexity of finding an $\epsilon$-stationary point with…

Optimization and Control · Mathematics 2025-12-01 Lesi Chen , Jingzhao Zhang

We study vector-valued Littlewood-Paley-Stein theory for semigroups of regular contractions $\{T_t\}_{t>0}$ on $L_p(\Omega)$ for a fixed $1<p<\infty$. We prove that if a Banach space $X$ is of martingale cotype $q$, then there is a constant…

Functional Analysis · Mathematics 2024-02-13 Quanhua Xu

The $\ell_p$ linear regression problem is to minimize $f(x)=||Ax-b||_p$ over $x\in\mathbb{R}^d$, where $A\in\mathbb{R}^{n\times d}$, $b\in \mathbb{R}^n$, and $p>0$. To avoid overfitting and bound $||x||_2$, the constrained $\ell_p$…

Machine Learning · Computer Science 2019-02-28 Ibrahim Jubran , David Cohn , Dan Feldman

The Hardy--Littlewood inequality for $m$-linear forms on $\ell _{p}$ spaces and $m<p\leq 2m$ asserts that \begin{equation*} \left( \sum_{j_{1},...,j_{m}=1}^{\infty }\left\vert T\left( e_{j_{1}},\ldots ,e_{j_{m}}\right) \right\vert…

Functional Analysis · Mathematics 2016-09-13 N. Albuquerque , G. Araújo , M. Maia , T. Nogueira , D. Pellegrino , J. Santos

$ \newcommand{\SVP}{\textsf{SVP}} \newcommand{\CVP}{\textsf{CVP}} \newcommand{\eps}{\varepsilon} $We show a number of reductions between the Shortest Vector Problem and the Closest Vector Problem over lattices in different $\ell_p$ norms…

Data Structures and Algorithms · Computer Science 2021-04-15 Divesh Aggarwal , Yanlin Chen , Rajendra Kumar , Zeyong Li , Noah Stephens-Davidowitz

As shown in [A1], the lowest constants appearing in the weak type (1,1) inequalities satisfied by the centered Hardy-Littlewood maximal operator associated to certain finite radial measures, grow exponentially fast with the dimension. Here…

Classical Analysis and ODEs · Mathematics 2010-03-13 J. M. Aldaz , J. Pérez Lázaro

Rademacher's Theorem can be interpreted as an almost-everywhere \emph{little-$o$ improvement principle}: if a function admits a uniform pointwise first-order Lipschitz control at every point, then this control improves to a vanishing one at…

Functional Analysis · Mathematics 2026-02-10 Thomas Lamby

In this paper we prove that the shape optimization problem $$\min\left\{\lambda_k(\Omega):\ \Omega\subset\R^d,\ \Omega\ \hbox{open},\ P(\Omega)=1,\ |\Omega|<+\infty\right\},$$ has a solution for any $k\in\N$ and dimension $d$. Moreover,…

Analysis of PDEs · Mathematics 2013-10-01 Guido De Philippis , Bozhidar Velichkov

Suppose that $1<p\leq\infty$ and $\varphi\in L^{p}(\mathbb{B}^{n},\mathbb{R}^{n}).$ In this note, we use H\"{o}lder inequality and some basic properties of hypergeometric functions to establish the sharp constant $C_{p}$ and function…

Complex Variables · Mathematics 2025-10-07 Deguang Zhong , Fangming Cai , Dongping Wei

Let $p(\cdot):\ \mathbb R^n\to(0,\infty)$ be a variable exponent function satisfying the globally log-H\"older continuous condition. In this article, the authors first introduce the variable weak Hardy space on $\mathbb R^n$,…

Classical Analysis and ODEs · Mathematics 2016-09-27 Xianjie Yan , Dachun Yang , Wen Yuan , Ciqiang Zhuo

We study a minimizing problem associated with the singular problem \[ \left\{ \begin{array} [c]{ll} -\operatorname{div}\left( \left\vert \nabla u\right\vert ^{p-2}\nabla u\right) =\lambda u^{-1} & \mathrm{in\ }\Omega\\ u>0 & \mathrm{in\…

Analysis of PDEs · Mathematics 2018-07-31 Grey Ercole , Gilberto de Assis Pereira

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

Combinatorics · Mathematics 2021-05-25 Jiaxin Xie , Zhiqiang Xu , Ziheng Zhu

We establish an uncertainty principle for functions $f: \mathbb{Z}/p \rightarrow \mathbb{F}_q$ with constant support (where $p \mid q-1$). In particular, we show that for any constant $S > 0$, functions $f: \mathbb{Z}/p \rightarrow…

Combinatorics · Mathematics 2019-06-27 Saad Quader , Alexander Russell , Ravi Sundaram

A mean step in Haagerup's proof for the optimal constants in Khintchine's inequality is to show integral inequalities of type $\int(g^s-f^s)\mathrm{d}\mu\geq 0$. F.L. Nazarov and A.N. Podkorytov made Haagerup's proof much more clearer for…

Functional Analysis · Mathematics 2017-09-11 Olaf Mordhorst

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…

Combinatorics · Mathematics 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz

The eigenvalue problem for the p-Laplace operator with p>1 on planar domains with the zero Dirichlet boundary condition is considered. The Constrained Descent Method and the Constrained Mountain Pass Algorithm are used in the Sobolev space…

Numerical Analysis · Mathematics 2011-06-21 Jiří Horák

We will prove that if $\phi$ belongs to the class $A_1(\R)$ with constant $c\ge1$ then the decreasing rearrangement of $\phi$, belongs to the same class with constant not more than $c$. We also find for such $\phi$ the exact best possible…

Functional Analysis · Mathematics 2014-04-01 Eleftherios N. Nikolidakis

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan