Related papers: Trees, functional equations, and combinatorial Hop…
Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the…
We introduce a coloured generalization $\mathrm{NSym}_A$ of the Hopf algebra of non-commutative symmetric functions described as a subalgebra of the of rooted ordered coloured trees Hopf algebra. Its natural basis can be identified with the…
There is a long tradition of categorifying combinatorial Hopf algebras by the modules of a tower of algebras (or even better via the representation theory of a tower of groups). From the point of view of combinatorics, such a…
Tree ensembles have demonstrated state-of-the-art predictive performance across a wide range of problems involving tabular data. Nevertheless, the black-box nature of tree ensembles is a strong limitation, especially for applications with…
Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
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…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
In this article we use the HW maps to solve arbitrary equations f=0, by providing an effective enumeration of the roots of f, as these project on and at the branches of the HW maps. This is just an enumeration of the projection points…
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…
Recently, harmonic functions and frequently universal harmonic functions on a tree $T$ have been studied, taking values on a separable Fr\'{e}chet space $E$ over the field $\mathbb{C}$ or $\mathbb{R}$. In the present paper, we allow the…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…
Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…
We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…
A non-commutative, planar, Hopf algebra of rooted trees was proposed in L. Foissy, Bull. Sci. Math. 126 (2002) 193-239. In this paper we propose such a non-commutative Hopf algebra for graphs. In order to define a non-commutative product we…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…