Related papers: Connected perimeter of planar sets
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
We introduce a notion of non-local perimeter which is defined through an arbitrary positive Borel measure on $\mathbb{R}^d$ which integrates the function $1\wedge |x|$. Such definition of non-local perimeter encompasses a wide range of…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
The classical uniformization theorem states that any simply connected Riemann surface is conformally equivalent to the disk, the plane, or the sphere, each equipped with a standard conformal structure. We give a similar uniformization for…
We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
The theory of descriptive nearness is usually adopted when dealing with sets that share some common properties even when the sets are not spatially close, i.e., the sets have no members in common. Set description results from the use of…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the…
The concept of definability of physical fields within a set-theoretical foundation is introduced. We propose an axiomatic set theory and show the Schroedinger equation and, more generally, a nonlinear sigma model come naturally out of the…
We prove a quantitative version of the isoperimetric inequality for a non local perimeter of Minkowski type. We also apply this result to study isoperimetric problems with repulsive interaction terms, under convexity constraints. We show…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
In this note we provide a quasisymmetric taming of uniformly perfect and uniformly disconnected sets that generalizes a result of MacManus from 2 to higher dimensions. In particular, we show that a compact subset of $\mathbb{R}^n$ is…
In this paper we study the connectedness of the fibers of integrable systems that extend complexity one $T$-spaces with proper moment maps, assuming that every tall singular point is non-degenerate. Our main result states that if there are…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
We introduce the notion of metric semilattice on the metric space and prove the criterion of $\R$-tree as connected geodesic metric space $X$ admitting the partial order, such that $X$ is semilinear metric semilattice. Also we state the…