English
Related papers

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

200 papers

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , Hao Pan

In a recent paper of Wolff the optimal decay of circular L^p means of compactly supported measures of finite energy was given for p>=2, with application to Falconer's distance problem. The question was then raised in that paper as to…

Classical Analysis and ODEs · Mathematics 2007-05-23 Terence Tao

For $p \in (1,N)$ and $\Omega \subseteq \mathbb{R}^N$ open, the Beppo-Levi space $\mathcal{D}^{1,p}_0(\Omega)$ is the completion of $C_c^{\infty}(\Omega)$ with respect to the norm $\left( \int_{\Omega}|\nabla u|^p \right)^ \frac{1}{p}.$…

Analysis of PDEs · Mathematics 2021-02-11 T. V. Anoop , Ujjal Das

The question of triviality of solutions of the semilinear Ornstein-Uhlenbeck equation, \[ \Delta w-\frac{1}{2} \langle x,\nabla w\rangle-\frac{\lambda}{p-1}w+|w|^{p-1}w=0, \] is considered. It is shown, that if $p>1$ is Sobolev subcritical…

Analysis of PDEs · Mathematics 2022-07-18 Michał Fabisiak , Mikołaj Sierżęga

We consider local minimizers of the functional \[ \sum_{i=1}^N \int (|u_{x_i}|-\delta_i)^p_+\, dx+\int f\, u\, dx, \] where $\delta_1,\dots,\delta_N\ge 0$ and $(\,\cdot\,)_+$ stands for the positive part. Under suitable assumptions on $f$,…

Analysis of PDEs · Mathematics 2014-09-09 Pierre Bousquet , Lorenzo Brasco , Vesa Julin

This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…

Computational Complexity · Computer Science 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

We refine the classical Cauchy--Schwartz inequality $\|X\|_{1} \leq \|X\|_{2}$ by demonstrating that for any $p$ and $q$ with $q>p>2$, there exists a constant $C=C(p,q)$ such that $\|X\|_1 \leq 1 - C \Big{(}\|X\|_p^p -…

Probability · Mathematics 2024-07-09 Paata Ivanisvili , Yonathan Stone

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

Classical Analysis and ODEs · Mathematics 2019-08-23 Samuel Zbarsky

It is shown that solutions to the anisotropic least gradient problem for boundary data $f \in L^p(\partial\Omega)$ lie in $L^{\frac{Np}{N-1}}(\Omega)$; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally…

Analysis of PDEs · Mathematics 2019-04-26 Wojciech Górny

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…

Optimization and Control · Mathematics 2025-11-06 Lei Wang , Xin Liu , Xiaojun Chen

In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…

Functional Analysis · Mathematics 2026-02-16 Zdeněk Mihula , Luboš Pick , Daniel Spector

An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the…

Computational Complexity · Computer Science 2007-05-23 Marcus Hutter

We find the best possible constant $C$ in the inequality $$\|\varphi\|_{L^r}^{\phantom{\frac{p}{r}}}\leq C\|\varphi\|_{L^p}^{\frac{p}{r}}\|\varphi\|_{\mathrm{BMO}}^{1-\frac{p}{r}}$$ for all possible values of parameters $p$ and $r$ such…

Classical Analysis and ODEs · Mathematics 2022-07-01 Vasily Vasyunin , Pavel Zatitskiy , Ilya Zlotnikov

The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…

Optimization and Control · Mathematics 2026-03-02 Sanjay Manoj , Melkior Ornik

Let $G$ be a finite (not necessarily abelian) group and let $p=p(G)$ be the smallest prime number dividing $|G|$. We prove that $d(G)\leq \frac{|G|}{p}+9p^2-10p$, where $d(G)$ denotes the small Davenport constant of $G$ which is defined as…

Number Theory · Mathematics 2013-08-13 Weidong Gao , Yuanlin Li , Jiangtao Peng

We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…

Analysis of PDEs · Mathematics 2018-11-13 Vladimir Bobkov , Enea Parini

In the last decades, a lot of progress has been made on the subject of maximal regularity. The property of maximal $L^p$ regularity is an a priori estimate and reads as follows: For A the negative generator of an analytic semigroup on a…

Analysis of PDEs · Mathematics 2023-11-15 Sylvie Monniaux

This paper introduces and studies the optimal control problem with equilibrium constraints (OCPEC). The OCPEC is an optimal control problem with a mixed state and control equilibrium constraint formulated as a complementarity constraint and…

Optimization and Control · Mathematics 2016-05-03 Lei Guo , Jane Ye

Let $P$ be a set of $n$ points in $\Re^2$. For a parameter $\varepsilon\in (0,1)$, a subset $C\subseteq P$ is an \emph{$\varepsilon$-kernel} of $P$ if the projection of the convex hull of $C$ approximates that of $P$ within…

Computational Geometry · Computer Science 2023-03-15 Pankaj K. Agarwal , Sariel Har-Peled

The goal of the \emph{alignment problem} is to align a (given) point cloud $P = \{p_1,\cdots,p_n\}$ to another (observed) point cloud $Q = \{q_1,\cdots,q_n\}$. That is, to compute a rotation matrix $R \in \mathbb{R}^{3 \times 3}$ and a…

Computer Vision and Pattern Recognition · Computer Science 2021-01-12 Ibrahim Jubran , Alaa Maalouf , Ron Kimmel , Dan Feldman