Related papers: Connected perimeter of planar sets
A general definition has been proposed recently of a linear connection and a metric in noncommutative geometry. It is shown that to within normalization there is a unique linear connection on the quantum plane and there is no metric.
We show that every bounded domain in a metric measure space can be approximated in measure from inside by closed $BV$-extension sets. The extension sets are obtained by minimizing the sum of the perimeter and the measure of the difference…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…
We define a generalization of the fixed point set, called the bounded fixed set, for a group acting by isometries on a metric space. An analogue of the P. A. Smith theorem is proved for metric spaces of finite asymptotic dimension, which…
In this paper, we investigate the minimization of a functional in which the usual perimeter is competing with a nonlocal singular term comparable (but not necessarily equal to) a fractional perimeter. The motivation for this problem is a…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
In the literature, various types of points and meager sets whose complements are connected have been studied, such as colocally connected points, non-weak cut points/sets, non-block points/sets, shore points/sets, etc. We extend that study,…
We consider the isoperimetric problem for clusters in the plane with a double density, that is, perimeter and volume depend on two weights. In this paper we consider the isotropic case, in the parallel paper "On the Steiner property for…
We consider the nonlinear Schr{\"o}dinger equation with a short-range external potential, in a semi-classical scaling. We show that for fixed Planck constant, a com-plete scattering theory is available, showing that both the potential and…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
Almost contact manifolds with B-metric are considered. A special linear connection is introduced, which preserves the almost contact B-metric structure on these manifolds. This connection is investigated on some classes of the considered…
In this paper, we introduce the Fixed Topology Minimum-Length Tree with Neighborhood Problem, which aims to embed a rooted tree-shaped graph into a $d$-dimensional metric space while minimizing its total length provided that the nodes must…
In the first part of this paper we show that a set $E$ has locally finite $s$-perimeter if and only if it can be approximated in an appropriate sense by smooth open sets. In the second part we prove some elementary properties of local and…
We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…
Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…
We verify that an isoperimetric minimizing cluster on a simply connected homogeneous Riemannian manifold with at most one end always has connected boundary. In particular, the boundary of a single-bubble isoperimetric minimizer on such…
We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is…
We study metric spaces defined via a conformal weight, or more generally a measurable Finsler structure, on a domain $\Omega \subset \mathbb{R}^2$ that vanishes on a compact set $E \subset \Omega$ and satisfies mild assumptions. Our main…