Related papers: The Algebra of Binary Search Trees
To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
We construct a bialgebra object in the category of linear maps LM from a cocommutative rack bialgebra. The construction does extend to some non-cocommutative rack bialgebras, as is illustrated by a concrete example. As a separate result, we…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
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…
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
Typed decorated trees are used by Bruned, Hairer and Zambotti to give a description of a renormalisation processon stochastic PDEs. We here study the algebraic structures on these objects: multiple prelie algebrasand related operads…
We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…
The concept of weighted infinitesimal bialgebras provides an algebraic framework for understanding the non-homogeneous associative Yang-Baxter equation. In this paper, we endow the space of decorated planar rooted forests with a…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…
We describe the proalgebraic groups represented by three Hopf algebras on planar binary trees previously introduced by the author and Christian Brouder in relation with the renormalization of quantum electrodynamics. Using two monoidal…
The vector space spanned by rooted forests admits two graded bialgebra structures. The first is defined by A. Connes and D. Kreimer using admissible cuts, and the second is defined by D. Calaque, K. Ebrahimi-Fard and the second author using…
We equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion of…
We present a library of formalized results around symmetric functions and the character theory of symmetric groups. Written in Coq/Rocq and based on the Mathematical Components library, it covers a large part of the contents of a graduate…
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…