Related papers: Bounds on Discrete Potentials of Spherical (k,k)-D…

For a symmetric convex body $K\subset\mathbb{R}^n$, the Dvoretzky dimension $k(K)$ is the largest dimension for which a random central section of $K$ is almost spherical. A Dvoretzky-type theorem proved by V.~D.~Milman in 1971 provides a…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare. In…

In this paper, we obtain optimal upper bounds for all the Neumann eigenvalues in two situations (that are closely related). First we consider a one-dimensional Sturm-Liouville eigenvalue problem where the density is a function $h(x)$ whose…

In this paper, we investigate $L^p-$boundedness of the bilinear spherical maximal function associated with a general set $E\subset\R_+$. We quantify the range of $L^p-$boundedness in terms of a dilation-invariant notion of upper Minkowski…

The Gamma-limit of higher-order singular perturbations of the Perona-Malik functional is analyzed. The energies considered combine the critically scaled logarithmic term with a k-th order regularization designed to balance bulk and…

Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…

The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…

Let $K$ be a centrally symmetric spherical and simplicial polytope, whose vertices form a $\frac{1}{4n}-$net in the unit sphere in $\mathbb{R}^n$. We prove a uniform lower bound on the norms of all hyperplane projections $P: X \to X$, where…

In a previous work on the large $|k|$ behavior of complex geometric optics solutions to a system of d-bar equations, we treated in detail the situation when a certain potential is the characteristic function of a strictly convex set with…

We study boundary value problems for bounded uniform domains in $\mathbb{R}^n$, $n\geq 2$, with non-Lipschitz (and possibly fractal) boundaries. We prove Poincar\'e inequalities with trace terms and uniform constants for uniform…

We study the problem of maximizing the $k$-th eigenvalue functional over the class of absolutely continuous measures on a closed Riemannian manifold of dimension $m\geq 3$. For dimensions $3 \leq m \leq 6$, we generalize the work of…

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

We consider generalizations of the classical secretary problem, also known as the problem of optimal choice, to posets where the only information we have is the size of the poset and the number of maximal elements. We show that, given this…

It is well known that a hyperbolic domain in the complex plane has uniformly perfect boundary precisely when the product of its hyperbolic density and the distance function to its boundary has a positive lower bound. We extend this…

A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C$. Spherical codes have been extensively studied since their introduction in the 1970's by Delsarte, Goethals and…

The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

A general framework for determining fundamental bounds in nanophotonics is introduced in this paper. The theory is based on convex optimization of dual problems constructed from operators generated by electromagnetic integral equations. The…

In this work, first we prove that for any compact set $K\subset\mathbb{R}^{n}$ and any continuous function $\phi$ defined on $\partial K$, there exists a bounded weak solution in $C(\bar{\mathbb{R}^{n}\backslash K}) \cap…