Related papers: Ultrametric properties for valuation spaces of nor…

We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…

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…

Motivated from the study of eccentricity, center, and sum of eccentricities in graphs and trees, we introduce several new distance-based global and local functions based on the smallest distance from a vertex to some leaf (called the…

Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…

Multivariate renormalisation techniques are implemented in order to build, study and then renormalise at the poles, branched zeta functions associated with trees. For this purpose, we first prove algebraic results and develop analytic…

For a finitely generated group $G$, we introduce an asymmetric pseudometric on projectivized deformation spaces of $G$-trees, using stretching factors of $G$-equivariant Lipschitz maps, that generalizes the Lipschitz metric on Outer space…

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

We consider classes $ \mathcal{A}_M(S) $ of functions holomorphic in an open plane sector $ S $ and belonging to a strongly non-quasianalytic class on the closure of $ S $. In $ \mathcal{A}_M(S) $, we construct functions which are flat at…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

The Aluffi algebra is algebraic definition of characteristic cycles of a hypersurface in intersection theory. In this paper we focus on the Aluffi algebra of quasi-homogeneous and locally Eulerian hypersurface with isolated singularities.…

Many multivariate data sets exhibit a form of positive dependence, which can either appear globally between all variables or only locally within particular subgroups. A popular notion of positive dependence that allows for localized…

Let $G=(V,E)$ be a finite connected graph with vertex set $V$ and edge set $E$, and let $U(G)$ be the set of all ultrametric spaces $(V,d_l)$ generated by vertex labelings $l\colon V \to \mathbb R^+$. We prove that the inequality $$ |D(V)|…

Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…

We show that any normal irreducible affine $n$-dimensional $SL_n$-variety $X$ is determined by its automorphism group in the category of normal irreducible affine varieties: if $Y$ is an irreducible affine normal algebraic variety such that…

Let $X \subset \mathbb{P}(w_0, w_1, w_2, w_3)$ be a quasismooth well-formed weighted projective hypersurface and let $L = lcm(w_0,w_1,w_2,w_3)$. We characterize when $X$ is rational under the assumption that $L$ divides $deg(X)$ by…

We derive a general formula for the Euler characteristic of a fibration of projective hypersurfaces in terms of invariants of an arbitrary base variety. When the general fiber is an elliptic curve, such formulas have appeared in the physics…

One of the most famous algorithmic meta-theorems states that every graph property that can be defined by a sentence in counting monadic second order logic (CMSOL) can be checked in linear time for graphs of bounded treewidth, which is known…

If $X \subset \mathbb P^n$ is a reduced subscheme, we say that $X$ admits an unexpected hypersurface of degree $t$ for multiplicity $m$ if the imposition of having multiplicity $m$ at a general point $P$ fails to impose the expected number…

In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…

In this paper, we characterise graphs that are quasi-isometric to graphs with bounded treewidth. Specifically, we prove that a graph is quasi-isometric to a graph with bounded treewidth if and only if it has a tree-decomposition where each…