Related papers: Rooted trees and an exponential-like series

We study the central extensions of Lie algebras graded by an irreducible locally finite root system.

In this book, I explored differential equations for operation in Lie group and for representations of group Lie in a vector space.

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

This paper is the third in a series that researches the Morse Theory, gradient flows, concavity and complexity on smooth compact manifolds with boundary. Employing the local analytic models from \cite{K2}, for \emph{traversally generic…

We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…

Splint of root system of simple Lie algebra appears naturally in the study of (regular) embeddings of reductive subalgebras. It can be used to derive branching rules. Application of splint properties drastically simplifies calculations of…

We compute the expansion of the Catalan family of Lie idempotents introduced in [Menous et al., Adv. Applied Math. 51 (2013), 177-22] on the PBW basis of the Lie module. It is found that the coefficient of a tree depends only on its number…

The connections between Euler's equations on central extensions of Lie algebras and Euler's equations on the original, extended algebras are described. A special infinite sequence of central extensions of nilpotent Lie algebras constructed…

Using the combinatorial species setting, we propose two new operad structures on multigraphs and on pointed oriented multigraphs. The former can be considered as a canonical operad on multigraphs, directly generalizing the…

We explore the relationship between (non-planar) rooted trees and free trees, i.e. without root. We give in particular, for non-rooted trees, a substitute for the Lie bracket given by the antisymmetrization of the pre-Lie product.

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…

This paper introduces a differentiable framework that embeds the axiomatic structure of Random Utility Models (RUM) directly into deep neural networks. Although projecting empirical choice data onto the RUM polytope is NP-hard in general,…

We construct two families of orthogonal polynomials associated with the universal central extensions of the superelliptic Lie algebras. These polynomials satisfy certain fourth order linear differential equations, and one of the families is…

In [26], the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway's ordered field $\mathbf{No}$ of surreal numbers was brought to the fore and employed to provide necessary and sufficient conditions for an ordered…

Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…

We investigate a class of Lie algebras which we call {\it generalized reductive Lie algebras}. These are generalizations of semi-simple, reductive, and affine Kac-Moody Lie algebras. A generalized reductive Lie algebra which has an…

We study a family of tree-type diagrams that arise in studies of the cumulant expansion in discrete Erd\H os-R\'enyi random matrix models. Using a version of the Pr\" ufer code, we obtain an explicit expression for the number of tree-type…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…