Related papers: On intervals in some posets of forests
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…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…
We prove that characteristic equations of certain types of delay differential systems, under some mild conditions on their coefficients, can possess infinitely many complex roots.
We obtain the double factorization of braided bialgebras or braided Hopf algebras, give relation among integrals and semisimplicity of braided Hopf algebra and its factors.
In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be…
We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high…
We introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and…
We call an interval $[x,y]$ in a poset {\em small} if $y$ is the join of some elements covering $x$. In this paper, we study the chains of paths from a given arbitrary (binary) path $P$ to the maximum path having only small intervals. More…
This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…
We investigate residue-type indices for germs of holomorphic foliations in the plane and characterize second type foliations - those not containing tangent saddle-nodes in the reduction of singularities - by an expression involving the…
We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…
Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized…
In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…
We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…