Related papers: Random assignment problems on ${2d}$ manifolds

In this paper, we study the first eigenvalue of the Laplace--Beltrami operator on the Lawson minimal surfaces $\xi_{m,k}$ embedded in the unit three-sphere $\mathbb{S}^3$. Motivated by Yau's conjecture on the first eigenvalue of closed…

The Signorini problem for the Laplace operator is considered in a general polygonal domain. It is proved that the coincidence set consists of a finite number of boundary parts plus isolated points. The regularity of the solution is…

We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\mathcal{M}$. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to…

Let M be an n X n symmetric cost matrix. Assume that D is a derangement of edges in M, i.e., a set of point-disjoint cycles containing all of the n points of M.The modified Floyd-Warshall algorithm applied to ((D')^-1)A^- (where A is an…

We consider the first eigenvalue $\lambda_1(\Omega,\sigma)$ of the Laplacian with Robin boundary conditions on a compact Riemannian manifold $\Omega$ with smooth boundary, $\sigma\in\bf R$ being the Robin boundary parameter. When $\sigma>0$…

In the paper a model problem for the location of a given number $N$ of points in a given region $\Omega$ and with a given resources density $\rho(x)$ is considered. The main difference between the usual location problems and the present one…

In this work we analyze convergence of solutions for the Laplace operator with Neumann boundary conditions in a two-dimensional highly oscillating domain which degenerates into a segment (thin domains) of the real line. We consider the case…

In this paper we study the complexity and domination analysis in the context of the \emph{bipartite quadratic assignment problem}. Two variants of the problem, denoted by BQAP1 and BQAP2, are investigated. A formula for calculating the…

We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…

We solve the classical and quantum problems for the 1D sigma model with target space the flag manifold $\mathrm{U}(3)\over \mathrm{U}(1)^3$, equipped with the most general invariant metric. In particular, we explicitly describe all…

In this paper, we consider the following overdetermined eigenvalue problem on an unbounded domain $\Omega\subset\mathbb{R}^{N+1}$ with $N\geq1$ \begin{equation} \left\{ \begin{array}{ll} -\Delta u=\lambda u\,\, &\text{in}\,\, \Omega,\\ u=0…

We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an…

In this work, we study a single-machine scheduling problem that aims at minimizing the total cost of a schedule subject to start-time dependent costs. This framework naturally captures scenarios where costs fluctuate throughout the day,…

We prove uniform $L^p$ estimates for resolvents of higher order elliptic self-adjoint differential operators on compact manifolds without boundary, generalizing a corresponding resul of [3] in the case of Laplace-- Beltrami operators on…

We study optimization over Riemannian embedded submanifolds, where the objective function is relatively smooth in the ambient Euclidean space. Such problems have broad applications but are still largely unexplored. We introduce two…

We carry on our study of the connection between two shape optimization problems with spectral cost. On the one hand, we consider the optimal design problem for the survival threshold of a population living in a heterogenous habitat…

We consider the following question. We are given a dense digraph $D_0$ with minimum in- and out-degree at least $\alpha n$, where $\alpha>0$ is a constant. We then add random edges $R$ to $D_0$ to create a digraph $D$. Here an edge $e$ is…

This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switching. We show that the problem is NP-hard and evaluate the…

We consider the problem of optimal recovery of true ranking of $n$ items from a randomly chosen subset of their pairwise preferences. It is well known that without any further assumption, one requires a sample size of $\Omega(n^2)$ for the…

Let $(M,g)$ be a closed, smooth, Riemannian manifold of dimension $m \geq 1$. Let $\eta$ be a smooth $(0,1)$-tensor field on $M$. The divergence of $\eta$ is defined as $\text{div}_g(\eta):=g^{ij}(\nabla \eta)_{ij}$. Now let $\Delta_g$ be a…