Related papers: Covering Numbers for Convex Functions

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

In this paper, we introduce a class of functions that assume only a limited number $\lambda$ of values within a given Hamming $\rho$-ball and call them locally $(\rho, \lambda)$-bounded functions. We develop function-correcting codes (FCCs)…

This paper constructs unique compactly supported functions in Sobolev spaces that have minimal norm, maximal support, and maximal central value, under certain renormalizations. They may serve as optimized basis functions in interpolation or…

Determining the minimum density of a covering of $\mathbb{R}^{n}$ by Euclidean unit balls as $n\to\infty$ is a major open problem, with the best known results being the lower bound of $\left(\mathrm{e}^{-3/2}+o(1)\right)n$ by Coxeter, Few…

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

We precisely evaluate the operator norm of the uncentered Hardy-Littlewood maximal function on $L^p(\Bbb R^1)$. We also compute the operator norm of the uncentered Hardy-Littlewood maximal function over rectangles on $L^p(\Bbb R^n)$, and we…

It is shown that the Hardy-Littlewood maximal function associated to the cube in $\mathbb R^n$ obeys dimensional free bounds in $L^p$ fir $p>1$. Earlier work only covered the range $p>\frac 32$.

Let $\mathbb{T}^d$ denote the $d$-dimensional torus. We consider the problem of optimally recovering a target function $f^*:\mathbb{T}^d\rightarrow \mathbb{C}$ from samples of its Fourier coefficients. We make classical smoothness…

In this paper, we show that if $L_p$ Gaussian surface area measure is proportional to the spherical Lebesgue measure, then the corresponding convex body has to be a centered disk when $p\in[0,1)$. Moreover, we investigate $C^0$ estimate of…

Upper bounds are obtained for the $p$-capacity of compact sets in $\R^d$, with $d \ge 2$ and $1<p<d$. Upper and lower bounds are obtained for the product of $p$-capacity and powers of the $q$-torsional rigidity over the collection of all…

We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$…

We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where $c$ is a convex function on $R^d$ and $w_1x,...,w_dx$ are linear forms on $R^n$, $$\max \{c(w_1 x,...,w_d x):…

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

In this paper, we determine the $L^p(\mathbb{R})\times L^q(\mathbb{R})\rightarrow L^r(\mathbb{R})$ boundedness of the bilinear Hilbert transform $H_{\gamma}(f,g)$ along a convex curve $\gamma$…

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…

Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.

Compensated convex transforms have been introduced for extended real-valued functions defined over $\mathbb{R}^n$. In their application to image processing, interpolation, and shape interrogation, where one deals with functions defined over…

In recent work, the first two authors constructed a generalized continued fraction called the $p$-continued fraction, characterized by the property that its convergents (a subsequence of the regular convergents) are best approximations with…