Related papers: On Generalizing Trace Minimization
We give a necessary and sufficient condition on the cost function so that the map solution of Monge's optimal transportation problem is continuous for arbitrary smooth positive data. This condition was first introduced by Ma, Trudinger and…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…
Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a…
We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…
Max-affine regression refers to a model where the unknown regression function is modeled as a maximum of $k$ unknown affine functions for a fixed $k \geq 1$. This generalizes linear regression and (real) phase retrieval, and is closely…
This paper studies a natural generalization of the problem of minimizing a univariate convex function $f$ by querying its values sequentially. At each time-step $t$, the optimizer can invest a budget $b_t$ in a query point $X_t$ of their…
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the…
We prove that the minimally displaced set of a relatively irreducible automorphism of a free splitting, situated in a deformation space, is uniformly locally finite. The minimally displaced set coincides with the train track points for an…
Let Y be a compact reduced subspace of a complex manifold X, and let F be a subsheaf of the tangent bundle T_X which is closed under the Lie bracket. This paper discusses criteria to guarantee that infinitesimal deformations of the…
This paper considers optimization problems on the Stiefel manifold $X^{\mathsf{T}}X=I_p$, where $X\in \mathbb{R}^{n \times p}$ is the variable and $I_p$ is the $p$-by-$p$ identity matrix. A framework of constraint preserving update schemes…
Let $k$ be a field of characteristic zero. Fix a smooth algebraic curve $X$ and a split reductive group $G$ over $k$. We show that the Beilinson--Drinfeld affine Grassmannian $\mathrm{Gr}_{G, \mathrm{Ran}(X)}$ is the presheaf colimit of the…
The paper concerns the analysis of global minimizers of a Dirichlet-type energy functional defined on the space of vector fields $H^1(S,T)$, where $S$ and $T$ are surfaces of revolution. The energy functional we consider is closely related…
We provide a number of sufficient conditions for that minimizers of the one-dimensional Rudin-Osher-Fatemi functional satisfy the Dirichlet data in the trace sense. For this purpose we use results specific for the total variation flow. We…
Let K be the function field of a connected regular scheme S of dimension 1, and let f : X -> Y be a finite cover of projective smooth and geometrically connected curves over K with g(X) greater or equal to 2. Suppose that f can be extended…
In this paper we consider a class of unfitted finite element methods for discretization of partial differential equations on surfaces. In this class of methods known as the Trace Finite Element Method (TraceFEM), restrictions or traces of…
It is well-known that convex variational problems with linear growth and Dirichlet boundary conditions might not have minimizers if the boundary condition is not suitably relaxed. We show that for a wide range of integrands, including the…
Last passage times arise in a number of areas of applied probability, including risk theory and degradation models. Such times are obviously not stopping times since they depend on the whole path of the underlying process. We consider the…
We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…
Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…