Related papers: Trees, functional equations, and combinatorial Hop…
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…
Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…
The representations of some Hopf algebras have curious behavior: Nonprojective modules may have projective tensor powers, and the variety of a tensor product of modules may not be contained in the intersection of their varieties. We explain…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
The Connes-Kreimer Hopf algebra of rooted trees, its dual, and the Foissy Hopf algebra of of planar rooted trees are related to each other and to the well-known Hopf algebras of symmetric and quasi-symmetric functions via a pair of…
The so called induction functors appear in several areas of Algebra in different forms. Interesting examples are the induction functors in the Theory of Affine Algebraic groups. In this note we investigate the so called Hopf pairings…
A notion of heaps of modules as an affine version of modules over a ring or, more generally, over a truss, is introduced and studied. Basic properties of heaps of modules are derived. Examples arising from geometry (connections, affine…
We build a theory of binary trees on finite multisets that categorifies, or operationalizes, the entropy of a finite probability distribution. Multisets operationalize probabilities as the event outcomes of an experiment. Huffman trees…
This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and…
In this work, we propose a systematic derivation of normal forms for dispersive equations using decorated trees introduced in arXiv:2005.01649. The key tool is the arborification map which is a morphism from the Butcher-Connes-Kreimer Hopf…
The output of a machine learning algorithm can usually be represented by one or more multivariate functions of its input variables. Knowing the global properties of such functions can help in understanding the system that produced the data…
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 establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…
Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf…
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…
It is known that the vector space spanned by labeled rooted trees forms a Hopf algebra. Let k be a field and let R be a commutative k-algebra. Let H denote the Hopf algebra of rooted trees labeled using derivations D in Der(R). In this…