Related papers: Variational approximation of functionals defined o…
Singular perturbations have been used to select solutions of (non-convex) variational problems with a multiplicity of minimizers. The prototype of such an approach is the gradient theory of phase transitions by L. Modica, who specialized…
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The…
We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show…
We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…
We propose to compute approximations to general invariant sets in dynamical systems by minimizing the distance between an appropriately selected finite set of points and its image under the dynamics. We demonstrate, through computational…
Let $n \in \mathbb{N}_{\geq 2}$. We prove that for every $k \geq 4$ there exist uniform but non-homogeneous Steiner bundles on $\mathbb{P}^n$ of $k$-type with disconnected splitting type, and we further investigate almost-uniform Steiner…
We review the recent generalized fractional calculus of variations. We consider variational problems containing generalized fractional integrals and derivatives and study them using indirect methods. In particular, we provide necessary…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
We consider a new Steiner tree problem, called vertex-cover-weighted Steiner tree problem. This problem defines the weight of a Steiner tree as the minimum weight of vertex covers in the tree, and seeks a minimum-weight Steiner tree in a…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
The (2+1)-dimensional Thirring model is studied by using the Gaussian approximation method in the functional Schr\"odinger picture. Although the dynamical symmetry breaking does not occur in the large N limit, it does occur in the Gaussian…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
We have implemented the dynamical vertex approximation (D$\Gamma$A) in its full parquet-based version to include spatial correlations on all length scales and in {\sl all} scattering channels. The algorithm is applied to study the…
We introduce a natural definition of $L^p$-convergence of maps, $p \ge 1$, in the case where the domain is a convergent sequence of measured metric space with respect to the measured Gromov-Hausdorff topology and the target is a…
An effective U(1) gauge invariant theory is constructed for a non-commutative Schrodinger field coupled to a background U(1)_{\star} gauge field in 2+1-dimensions using first order Seiberg-Witten map. We show that this effective theory can…
Let F ($\nu$) be the centered Gamma law with parameter $\nu$ > 0 and let us denote by P Y the probability distribution of a random vector Y. We develop a multidimensional variant of the Stein's method for Gamma approximation that allows to…
The projection onto the epigraph or a level set of a closed proper convex function can be achieved by finding a root of a scalar equation that involves the proximal operator as a function of the proximal parameter. This paper develops the…
The uniform asymptotic approximation method provides a powerful, systematically-improved, and error-controlled approach to construct accurate analytical approximate solutions of mode functions of perturbations of the…
We consider the planar limit of Chern-Simons theories coupled to a scalar $\phi$ in the fundamental representation of a $U(N)_k$ gauge group, at both the regular and Wilson-Fisher conformal points. These theories have one single-trace…