Related papers: Ultrametric properties for valuation spaces of nor…

Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in…

Minimum spanning trees and forests are powerful sparsification techniques that remove cycles from weighted graphs to minimize total edge weight while preserving node connectivity. They have applications in computer science, network science,…

It is shown that a superconformal surface with arbitrary codimension in flat Euclidean space has a (necessarily unique) dual superconformal surface if and only if the surface is S-Willmore, the latter a well-known necessary condition to…

The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a}…

Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…

We describe a construction of ordered algebraic structures (ordered abelian semigroups, ordered commutative semirings, etc.) and describe applications to codimension-1 laminations. For a suitable ordered semi- algebraic structure $\mathbb…

The concepts of orthology, paralogy, and xenology play a key role in molecular evolution. Orthology and paralogy distinguish whether a pair of genes originated by speciation or duplication. The corresponding binary relations on a set of…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

The regularity of systolically extremal surfaces is a notoriously difficult problem already discussed by M. Gromov in 1983, who proposed an argument toward the existence of $L^2$-extremizers exploiting the theory of $r$-regularity developed…

A framework to handle tree decompositions of the components of a Borel graph in a Borel fashion is introduced, along the lines of Tserunyan's Stallings Theorem for equivalence relations arXiv:1805.09506. This setting leads to a notion of…

We give a de Finetti type representation for exchangeable random coalescent trees (formally described as semi-ultrametrics) in terms of sampling iid sequences from marked metric measure spaces. We apply this representation to define…

If $X$ is a (topological) space, the $n$th finite subset space of $X$, denoted by $X(n)$, consists of $n$-point subsets of $X$ (i.e., nonempty subsets of cardinality at most $n$) with the quotient topology induced by the unordering map…

The Urysohn universal metric space U is characterized up to isometry by the following properties: (1) U is complete and separable; (2) U contains an isometric copy of every separable metric space; (3) every isometry between two finite…

We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…

In ``Characterization, stability and convergence of hierarchical clustering methods'' by G. E. Carlsson, F. Memoli, the natural way to construct an ultrametric space from a given metric space was presented. It was shown that the…

Fitting distances to tree metrics and ultrametrics are two widely used methods in hierarchical clustering, primarily explored within the context of numerical taxonomy. Given a positive distance function…

Let $\Bbbk$ be an algebraically closed field of characteristic $p>2$. Let $\mathcal{O}_n=\Bbbk[X_1,\ldots,X_n]/(X_1^p,\ldots, X_n^p)$, a truncated polynomial ring in $n$ variables, and denote by $\mathcal{L}$ the derivation algebra of…

The Urysohn space is a separable complete metric space with two fundamental properties: (a) universality: every separable metric space can be isometrically embedded in it; (b) ultrahomogeneity: every finite isometry between two finite…

An automorphism on a complex supermanifold $\mathcal M$ is called unipotent if it reduces to the identity on the associated graded supermanifold $gr(\mathcal M)$. These automorphisms are close to be complementary to those responsible for…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…