Related papers: A Subconvex Metaplectic Prime Geodesic Theorem and…

We study results related to a conjecture formulated by Strohmer and Beaver about optimal Gaussian Gabor frame set-ups. Our attention will be restricted to the case of Gabor systems with standard Gaussian window and rectangular lattices of…

On a closed Riemannian surface of negative curvature, we prove a characterization for configurations of closed geodesics arising from one parameter Allen-Cahn min-max constructions. One of the facts we conclude is that every geodesic occurs…

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Let $X$ be a weakly pseudoconvex manifold and $L\longrightarrow X$ be a holomorphic line bundle with a singular positive Hermitian metric $h$. In this article, we provide a points separation theorem and an embedding for the adjoint linear…

The Bishop-Gromov theorem upperbounds the rate of growth of volume of geodesic balls in a space, in terms of the most negative component of the Ricci curvature. In this paper we prove a strengthening of the Bishop-Gromov bound for…

In this article we prove the global existence of a unique strong solution to the initial boundary-value problem for a fourth-order exponential PDE. The equation we study was originally proposed to study the evolution of crystal surfaces,…

Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization, geodesically convex (g-convex) optimization is much less developed. In this paper we contribute to the…

We propose a definition for the length of closed geodesics in a globally hyperbolic maximal compact (GHMC) Anti-De Sitter manifold. We then prove that the number of closed geodesics of length less than $R$ grows exponentially fast with $R$…

The famous Nakayama conjecture states that the dominant dimension of a non-selfinjective finite dimensional algebra is finite. In \cite{Yam}, Yamagata stated the stronger conjecture that the dominant dimension of a non-selfinjective finite…

This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…

Approximate a smooth convex body $K$ with nonvanishing curvature by the convex hull of $n$ independent random points sampled from its boundary $\partial K$. In case the points are distributed according to the optimal density, we prove that…

Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…

We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

Mixed superposition rules are, in short, a method to describe the general solutions of a time-dependent system of first-order differential equations, a so-called Lie system, in terms of particular solutions of other ones. This article is…

The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible…

In this paper, we obtain analytical solutions of Laplace transform based some generalized class of the hyperbolic integrals in terms of hypergeometric functions ${}_3F_2 (\pm1)$, ${}_4F_3 (\pm1)$, ${}_5F_4(\pm1)$, ${}_6F_5(\pm1)$,…

The question whether the Simplex Algorithm admits an efficient pivot rule remains one of the most important open questions in discrete optimization. While many natural, deterministic pivot rules are known to yield exponential running times,…

Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…

We propose a new second-order method for geodesically convex optimization on the natural hyperbolic metric over positive definite matrices. We apply it to solve the operator scaling problem in time polynomial in the input size and…