Related papers: Connected perimeter of planar sets
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We…
In Euclidean space, the integration by parts formula for a set of finite perimeter is expressed by the integration with respect to a type of surface measure. According to geometric measure theory, this surface measure is realized by the…
We look for minimizers of the buckling load problem with perimeter constraint in any dimension. In dimension 2, we show that the minimizing plates are convex; in higher dimension, by passing through a weaker formulation of the problem, we…
The question whether a Riemannian manifold is geodesically connected can be studied from geometrical as well as variational methods, and accurate results can be obtained by using the associated distance and related properties of the…
It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…
Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this paper, however, we show a clear connection of both concepts, as…
We extend a classical theorem of Hartshorne concerning the connectedness of the punctured spectrum of a local ring by analyzing the homology groups of a simplicial complex associated with the minimal primes of a local ring.
The goal of this article is to study compact quasi-Einstein manifolds with boundary. We provide boundary estimates for compact quasi-Einstein manifolds simi\-lar to previous results obtained for static and $V$-static spaces. In addition, we…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…
Fractional minimum positive semidefinite rank is defined from $r$-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An…
We introduce in this paper an equivalence notion for submersions $U \to \R$, $U$ open in $\R^2$, which makes it possible to identify a smooth planar curve with a unique class of submersions. This idea, which extends to the nonlinear setting…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…
In this article, we consider and analyse a small variant of a functional originally introduced in \cite{BLS,LS} to approximate the (geometric) planar Steiner problem. This functional depends on a small parameter $\varepsilon>0$ and…
We study the least gradient problem in bounded regions with Lipschitz boundary in the plane. We provide a set of conditions for the existence of solutions in non-convex simply connected regions. We assume the boundary data is continuous and…
The aim of the present paper is to study the properties of Riemannian manifolds equipped with a projective semi-symmetric connection.
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We consider pairs of a non-empty compact connected and locally connected Hausdorff space and a real-valued continuous function. Our aim is to measure the difference between this kind of the pairs. In this notes we introduce new…