Related papers: Asymptotically Optimal Multi-Paving
In this article we extend several foundational results of the theory of complete minimal surfaces of finite index in the Euclidean space to minimal surfaces in asymptotically flat manifolds and, more generally, to marginally outer-trapped…
Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We…
This paper investigates asymptotic fixed point results for nonlinear contractions, with emphasis on Kirk-type theorems and their generalizations. A central difficulty in the literature has been the requirement that the mapping possesses a…
The full asymptotic expansion of the equivariant complex Ray-Singer torsion for high powers of line bundles on symmetric spaces is given in an explicit form. In the case of isolated fixed points this expansion is given for general complex…
The Schouten tensor \ $A$ \ of a Riemannian manifold \ $(M,g)$ provides important scalar curvature invariants $\sigma_k$, that are the symmetric functions on the eigenvalues of $A$, where, in particular, $\sigma_1$ \ coincides with the…
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompact $\mathsf{RCD}(K,N)$ spaces $(X,\mathsf{d},\mathcal{H}^N)$. Under the sole (necessary) assumption that the measure of unit balls is…
In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…
We study optimal design problems where the design corresponds to a coefficient in the principal part of the state equation. The state equation, in addition, is parameter dependent, and we allow it to change type in the limit of this…
Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…
We develop new solvability methods for divergence form second order, real and complex, elliptic systems above Lipschitz graphs, with $L_2$ boundary data. The coefficients $A$ may depend on all variables, but are assumed to be close to…
In many statistical signal processing applications, the estimation of nuisance parameters and parameters of interest is strongly linked to the resulting performance. Generally, these applications deal with complex data. This paper focuses…
Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
Asymptotic expansion is constructed and justified for the solution to a nonuniform Neumann boundary-value problem for the Poisson equation with the right-hand side that depends both on longitudinal and transversal variables in a thin…
We provide an existence result for a Schr\"odinger-Poisson system in gradient form, set in the whole plane, in the case of zero mass. Since the setting is limiting for the Sobolev embedding, we admit nonlinearities with subcritical or…
The all pairs shortest path problem (APSP) is one of the foundational problems in computer science. For weighted dense graphs on $n$ vertices, no truly sub-cubic algorithms exist to compute APSP exactly even for undirected graphs. This is…
We study the $\epsilon$-pseudospectra $\sigma_\epsilon(A)$ of square matrices $A \in \mathbb{C}^{N \times N}$. We give a complete characterization of the $\epsilon$-pseudospectrum of any $2 \times 2$ matrix and describe the asymptotic…
The problem of a spinless particle subject to a general mixing of vector and scalar inversely linear potentials in a two-dimensional world is analyzed. Exact bounded solutions are found in closed form by imposing boundary conditions on the…
Greedy minimum weight spanning tree packings have proven to be useful in connectivity-related problems. We study the process of greedy minimum weight base packings in general matroids and explore its applications. For general matroids, we…
We propose ALFCG (Adaptive Lipschitz-Free Conditional Gradient), the first \textit{adaptive} projection-free framework for stochastic composite nonconvex minimization that \textit{requires neither global smoothness constants nor line…