Related papers: Tree-like is not a transitive relation on paths

The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…

This paper addresses the Mountain Pass Theorem for locally Lipschitz functions on finite-dimensional vector spaces in terms of tangencies. Namely, let $f \colon \mathbb R^n \to \mathbb R$ be a locally Lipschitz function with a mountain pass…

We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the…

We study the equivalence of Poisson structures around a given symplectic leaf of nonzero dimension. Some criteria of Poisson equivalence are derived from a homotopy argument for coupling Poisson structures. In the case when the transverse…

Walk dimension is an important conception in analysis of fractals. In this paper we prove that the walk dimension of a connected compact set possessing an Alfors regular measure is an invariant under Lipschitz transforms. As an application,…

Rough path theory provides one with the notion of signature, a graded family of tensors which characterise, up to a negligible equivalence class, and ordered stream of vector-valued data. In the last few years, use of the signature has…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

This paper proposes that common measures for network transitivity, based on the enumeration of transitive triples, do not reflect the theoretical statements about transitivity they aim to describe. These statements are often formulated as…

Hybridization networks are representations of evolutionary histories that allow for the inclusion of reticulate events like recombinations, hybridizations, or lateral gene transfers. The recent growth in the number of hybridization network…

We prove that in finite time a trajectory of a Lipschitz vector field in $\hbox{\bbbb R}^{\hbox{\tmm n}}$ can not have infinite rotation around a given point. This result extends to the mutual rotation of two trajectories of a field in…

Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…

Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been extended to several tasks related to query evaluation, such…

We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…

We give a simple quantitative condition, involving the "mapping content" of Azzam--Schul, that implies that a Lipschitz map from a Euclidean space to a metric space must be close to factoring through a tree. Using results of Azzam--Schul…

Ptolemy's inequality is a classic relationship between the distances among four points in Euclidean space. Another relationship between six distances is the 4-point condition, an inequality satisfied by the lengths of the six paths that…

We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…

The notion of disjoint $\mathcal{A}$-transitivity for a Furstenberg family $\mathcal{A}$ is introduced with the aim to generalize properties derived from disjoint hypercyclic operators. We begin a systematic study by showing some of the…

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

Given two rooted, labeled trees $P$ and $T$ the tree path subsequence problem is to determine which paths in $P$ are subsequences of which paths in $T$. Here a path begins at the root and ends at a leaf. In this paper we propose this…