Related papers: Lower bounds for the reach and applications

Constrained Optimization solution algorithms are restricted to point based solutions. In practice, single or multiple objectives must be satisfied, wherein both the objective function and constraints can be non-convex resulting in multiple…

This paper addresses a class of nonsmooth and nonconvex optimization problems defined on complete Riemannian manifolds. The objective function has a composite structure, combining convex, differentiable, and lower semicontinuous terms,…

The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…

Associated to every closed, embedded submanifold $N$ in a connected Riemannian manifold $M$, there is the distance function $d_N$ which measures the distance of a point in $M$ from $N$. We analyze the square of this function and show that…

The perimeter of a measurable subset of $\mathbb R^N$ is the total variation of its characteristic function. We generalize this notion to a subset $E$ of a closed Riemannian manifold. We show that the perimeter of $E$ is the limit of the…

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for instance, about the connected components, holes, tunnels and…

In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular…

In this paper we generalize the main result of [4] for manifolds that are not necessarily Einstein. In fact, we obtain an upper bound for the volume of a locally volume-minimizing closed hypersurface $\Sigma$ of a Riemannian 5-manifold $M$…

We consider the consensus problem in a decentralized network, focusing on a compact submanifold that acts as a nonconvex constraint set. By leveraging the proximal smoothness of the compact submanifold, which encompasses the local singleton…

Let $\ncal_{\phi_{\lambda}}$ be the nodal hypersurface of a $\Delta$-eigenfunction $\phi_{\lambda}$ of eigenvalue $\lambda^2$ on a smooth Riemannian manifold. We prove the following lower bound for its surface measure:…

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…

Let (M^n_i,g_i,p_i) be a sequence of smooth pointed complete n-dimensional Riemannian Manifolds with uniform bounds on the sectional curvatures and let (X,d,p) be a metric space such that (M^n_i,g_i,p_i) -> (X,d,p) in the Gromov-Hausdorff…

This paper investigates the question of which smooth compact 4-manifolds admit Riemannian metrics that minimize the L2-norm of the curvature tensor. Metrics with this property are called OPTIMAL; Einstein metrics and scalar-flat…

Let $\mathcal{A}(H)$ and $\mathcal{Q}(H)$ be the adjacency tensor and signless Laplacian tensor of an $r$-uniform hypergraph $H$. Denote by $\rho(H)$ and $\rho(\mathcal{Q}(H))$ the spectral radii of $\mathcal{A}(H)$ and $\mathcal{Q}(H)$,…

We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…

Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering applications. In this paper we present an algorithm to compute a set of…

A smooth five-dimensional s-cobordism becomes a smooth product if stabilized by a finite number n of $S^2xS^2x[0,1]$'s. We show that for amenable fundamental groups, the minimal n is subextensive in covers, i.e., n(cover)/index(cover) has…

We derive lower bounds on the black-box oracle complexity of large-scale smooth convex minimization problems, with emphasis on minimizing smooth (with Holder continuous, with a given exponent and constant, gradient) convex functions over…

We establish geometric lower bounds for the smallest positive eigenvalue of the Hodge Laplacian in the class of non-convex domains given by Euclidean annular regions with a convex outer boundary and a spherical inner boundary. These bounds…