Related papers: Trees, functional equations, and combinatorial Hop…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…

We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…

We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…

We introduce a graded Hopf algebra based on the set of parking functions (hence of dimension (n+1)^{n-1} in degree n). This algebra can be embedded into a noncommutative polynomial algebra in infinitely many variables. We determine its…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…

We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.

We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…

We survey variety theory for modules of finite dimensional Hopf algebras, recalling some definitions and basic properties of support and rank varieties where they are known. We focus specifically on properties known for classes of examples…

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

In this note we discuss trees similar to the Calkin-Wilf tree, a binary tree that enumerates all positive rational numbers in a simple way. The original construction of Calkin and Wilf is reformulated in a more algebraic language, and an…

A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of…

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…