Related papers: Optimal stretching for lattice points under convex…
In this paper, we prove that if the initial submanifold $M_0$ of dimension $n(\ge6)$ satisfies an optimal pinching condition, then the mean curvature flow of arbitrary codimension in hyperbolic spaces converges to a round point in finite…
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this…
We consider ILPs, where each variable corresponds to an integral point within a polytope $\mathcal{P}$, i. e., ILPs of the form $\min\{c^{\top}x\mid \sum_{p\in\mathcal P\cap \mathbb Z^d} x_p p = b, x\in\mathbb Z^{|\mathcal P\cap \mathbb…
In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translations under a…
Particle gradient descent, which uses particles to represent a probability measure and performs gradient descent on particles in parallel, is widely used to optimize functions of probability measures. This paper considers particle gradient…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
We discuss some aspects of the continuum limit of some lattice models, in particular the $2D$ $O(N)$ models. The continuum limit is taken either in an infinite volume or in a box whose size is a fixed fraction of the infinite volume…
In this paper we address the problem of finding well approximating lattices for a given finite set $A$ of points in ${\mathbb R}^n$. More precisely, we search for $\v{o},\v{d_1}, \dots,\v{d_n}\in \mathbb{R}^n$ such that $\v{a}-\v{o}$ is…
We study the continuity of an abstract generalization of the maximum-entropy inference - a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a…
The problem of maximizing the $L^p$ norms of chords connecting points on a closed curve separated by arclength $u$ arises in electrostatic and quantum--mechanical problems. It is known that among all closed curves of fixed length, the…
Dependencies of the optimal constants in strong and weak type bounds will be studied between maximal functions corresponding to the Hardy--Littlewood averaging operators over convex symmetric bodies acting on $\mathbb R^d$ and $\mathbb…
The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…
A new lower bound on the average reconstruction error variance of multidimensional sampling and reconstruction is presented. It applies to sampling on arbitrary lattices in arbitrary dimensions, assuming a stochastic process with constant,…
Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…
In this article, we continue the study of the problem of $L^p$-boundedness of the maximal operator $M$ associated to averages along isotropic dilates of a given, smooth hypersurface $S$ of finite type in 3-dimensional Euclidean space. An…
In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…
There has been recent work using Shape Theory to answer the longstanding and conceptually interesting problem of what is the probability that a triangle is obtuse. This is resolved by three kissing cap-circles of rightness being realized on…
Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$. We consider the problem of computing a maximum…