Related papers: Trees, Tight-Spans and Point Configuration

Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in…

The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…

This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…

In this paper, we introduce the notion of partially ordered {\epsilon}-chainable metric spaces and we derive new coupled fixed point theorems for uniformly locally contractive mappings on such spaces.

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

In this paper, the notions of first-order and second-order generalized linear spans and index set are defined. Moreover, their properties are investigated and applied to the studies of extension of isometries. We develop the theory of…

We develop a unified framework for nonlinear subdivision schemes on complete metric spaces (CMS). We begin with CMS preliminaries and formalize refinement in CMS, retaining key structural properties, such as locality. We prove a convergence…

Prior to modern Earth observation technologies, historical maps provide a unique record of long-term urban transformation and offer a lens on the evolving identity of cities. However, extracting consistent and fine-grained change…

The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…

We introduce a new method for studying length spectrum rigidity problems based on a combination of ideas from dynamical systems and geometric group theory. This allows us to compare the marked length spectrum of metrics and distance-like…

The tight span $T_d$ of a metric $d$ on a finite set is the subcomplex of bounded faces of an unbounded polyhedron defined by~$d$. If $d$ is generic then $T_d$ is known to be dual to a regular triangulation of a second hypersimplex. A tight…

In recent years a lot of attention has been paid to topological spaces which are a bit more general than smooth manifolds - orbifolds. Orbifolds are intuitively speaking manifolds with some singularities. The formal definition is also…

The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper,…

In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…

We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…

We introduce the metric space valued in partially ordered groups, and define the convergence of sequences and the multi-valued weak contractions, etc., on the space. We then establish endpoint theorems for the defined maps. Our…

This article concludes the comprehensive study started in [Sz5], where the first non-trivial isospectral pairs of metrics are constructed on balls and spheres. These investigations incorporate 4 different cases since these balls and spheres…

In 1966, John Isbell introduced a construction on categories which he termed the "couple category" but which has since come to be known as the Isbell envelope. The Isbell envelope, which combines the ideas of contravariant and covariant…

An important problem in geometric computing is defining and computing similarity between two geometric shapes, e.g. point sets, curves and surfaces, etc. Important geometric and topological information of many shapes can be captured by…

Pointwise tangential dimensions are introduced for metric spaces. Under regularity conditions, the upper, resp. lower, tangential dimensions of X at x can be defined as the supremum, resp. infimum, of box dimensions of the tangent sets, a…