Related papers: The algebra of binary trees is affine complete
In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…
We introduce the notion of P-polynomial coherent configurations and show that they can have at most two fibres. We then introduce a class of two-fibre coherent configurations which have two distinguished bases for the coherent algebra,…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…
In this note functions that transform open segments of a linear space into open segments of another linear space are studied and characterized. Assuming that the range is non-collinear, it is proved that such a map can always be expressed…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible…
Racks and quandles are algebraic structures with a single binary operation that is right self-distributive and right invertible, and additionally idempotent in the case of quandles. The invertibility condition is equivalent to the existence…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
Left invariant affine structures in a Lie group $G$ are in one-to-one correspondence with left-symmetric algebras over its Lie algebra $\mathfrak g=T_eG$ (``over'' means that the commutator $[x,y]=xy-yx$ coincides with the Lie bracket;…
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…
We investigate the structural relationship between prefix-free codes over the binary alphabet and a class of unlabeled rooted trees, which we call \emph{symmetric} trees. We establish a canonical correspondence between prefix-free codes and…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…
A class of linear positive, trace preserving maps in $M_n$ is given in terms of affine maps in $\bBR^{n^2-1}$ which map the closed unit ball into itself.
It is shown that if two transcendental entire functions permute, and if one of them satisfies an algebraic differential equation, then so does the other one.
In this paper we face the problem of representation of functional data with the tools of algebraic topology. We represent functions by means of merge trees, which, like the more commonly used persistence diagrams, are invariant under…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
An m-extracting procedure produces unbiased random bits from a loaded dice with m faces. A binarization takes inputs from an m-faced dice and produce bit sequences to be fed into a (binary) extracting procedure to obtain random bits. Thus,…
Let $\phi\colon A\rightarrow B$ be an algebra extension. We prove that if $\phi$ is split, the derived-discreteness of $A$ implies the derived-discreteness of $B$; if $\phi$ is separable and the right $A$-module $B$ is projective, the…