Related papers: Rooted Tree Maps
We review Kreimer's construction of a Hopf algebra associated to the Feynman graphs of a perturbative quantum field theory.
New deformed affine algebras A_{\hbar,\eta}(\hat{g}) are defined for any simply-laced classical Lie algebra g, which are generalizations of the algebra A_{\hbar,\eta}(\hat{sl_2}) recently proposed by Khoroshkin, Lebedev and Pakuliak (KLP).…
We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps.…
Let $Q$ be a tree-type quiver, $\mathbf{k} Q$ its path algebra, and $\lambda$ a nonzero element in the field $\mathbf{k}$. We construct irreducible morphisms in the Auslander-Reiten quiver of the transjective component of the bounded…
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…
The Carrell-Chapuy recurrence formulas dramatically improve the efficiency of counting orientable rooted maps by genus, either by number of edges alone or by number of edges and vertices. This paper presents an implementation of these…
This paper provides a primer in quantum field theory (QFT) based on Hopf algebra and describes new Hopf algebraic constructions inspired by QFT concepts. The following QFT concepts are introduced: chronological products, S-matrix, Feynman…
Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus,…
We introduce new partial order structures on the underlying sets of free nonsymmetric operads. These posets involve decorated ordered rooted trees, and their terminal intervals are lattices. These lattices are not graded, not self-dual, and…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
We develop a noncompact version of the Hopf maps based on the split algebras. The split algebras consist of three species: split-complex numbers, split quaternions, and split octonions. They correspond to three noncompact Hopf maps that…
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…
We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…
We extend the previously established zesting techniques from fusion categories to general tensor categories. In particular we consider the category of comodules over a Hopf algebra, providing a detailed translation of the categorical…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
This masters thesis reviews the algebraic formulation of renormalization using Hopf algebras as pioneered by Dirk Kreimer and applies it to a toy model of quantum field theory given through iterated insertions of a single primitive…
We extend the theory of Interacting Hopf algebras with an order primitive, and give a sound and complete axiomatisation of the prop of polyhedral cones. Next, we axiomatise an affine extension and prove soundness and completeness for the…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Using the shuffle structure of the graphs, we introduce a new kind of the Hopf algebraic structure for tagged graphs with, or without loops. Like a quantum group structure, its product is non-commutative. With the help of the Hopf algebraic…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…