Related papers: About Fibonacci trees. II -- generalized Fibonacci…
In the context of reconstructing phylogenetic networks from a collection of phylogenetic trees, several characterisations and subsequently algorithms have been established to reconstruct a phylogenetic network that collectively embeds all…
Let p=tp(a/A) be a stationary type in an arbitrary finite rank stable theory, and P an A-invariant family of partial types. The following property is introduced and characterised: whenever c is definable over (A,a) and a is not algebraic…
We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…
We examine the question of which finitely generated groups act properly on a finite product of locally finite simplicial trees and present evidence in favour of hyperbolic surface groups having such an action. We also give a completely…
Embedded topic models are able to learn interpretable topics even with large and heavy-tailed vocabularies. However, they generally hold the Euclidean embedding space assumption, leading to a basic limitation in capturing hierarchical…
Geodesic regular tree structures are essential to combat numerical precision issues that arise while working with large-scale computational hyperbolic geometry and have applications in algorithms based on distances in such tessellations. We…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
The study of geometric group theory has suggested several theorems related to subdivision tilings that have a natural hyperbolic structure. However, few examples exist. We construct subdivision tilings for the complement of every…
We extend the analogy between the extended Robba rings of p-adic Hodge theory and the one-dimensional affinoid algebras of rigid analytic geometry, proving some fundamental properties that are well known in the latter case. In particular,…
A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons…
We describe a new and robust method to prove rigidity results in complex dynamics. The new ingredient is the geometry of the critical puzzle pieces: under control of geometry and ``complex bounds'', two generalized polynomial-like maps…
Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…
The purpose of this paper is to build an algebraic framework suited to regularise branched structures emanating from rooted forests and which encodes the locality principle. This is achieved by means of the universal properties in the…
The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…
Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees there exists a larger tree (called a supertree) that contains the topologies of all k input…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
We define 2-dimensional topological substitutions. A tiling of the Euclidean plane, or of the hyperbolic plane, is substitutive if the underlying 2-complex can be obtained by iteration of a 2-dimensional topological substitution. We prove…