相关论文: The local Steiner problem in finite-dimensional no…

We consider multi-spike positive solutions to the Lane-Emden problem in any bounded smooth planar domain and compute their Morse index, extending to the dimension $N=2$ classical theorems due to Bahri-Li-Rey (1995) and Rey (1999) when…

The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ model of distributed computing and present…

The conforming finite element Galerkin method is applied to discretise in the spatial direction for a class of strongly nonlinear parabolic problems. Using elliptic projection of the associated linearised stationary problem with Gronwall…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…

The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum has been shown experimentally to give asymptotically…

We consider $\mathbb{S}^2$-valued maps on a domain $\Omega\subset\mathbb{R}^N$ minimizing a perturbation of the Dirichlet energy with vertical penalization in $\Omega$ and horizontal penalization on $\partial\Omega$. We first show the…

Many spatial models exhibit locality structures that effectively reduce their intrinsic dimensionality, enabling efficient approximation and sampling of high-dimensional distributions. However, existing approximation techniques primarily…

We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…

Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…

We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…

This paper is concerned with the Hamiltonian elliptic system in dimension two\begin{equation*}\aligned \left\{ \begin{array}{lll} -\epsilon^2\Delta u+V(x)u=g(v)\ & \text{in}\quad \mathbb{R}^2,\\ -\epsilon^2\Delta v+V(x)v=f(u)\ &…

The solutions of elliptic problems with a Dirac measure in right-hand side are not H1 and therefore the convergence of the finite element solutions is suboptimal. Graded meshes are standard remedy to recover quasi-optimality, namely…

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

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…

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…

In this paper, we introduce a specific type of Euclidean tree called LED (Leaves of Equal Depth) tree. LED trees can be used in computational phylogeny, since they are a natural representative of the time evolution of a set of species in a…

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…

We give $L^1$-norm estimates for exponential sums of a finite sets $A$ consisting of integers or lattice points. Under the assumption that $A$ possesses sufficient multidimensional structure, our estimates are stronger than those of…