Related papers: The planar Tree Lagrange Inversion Formula

We find presentations for subalgebras of invariants of the coordinate algebras of binary symmetric models of phylogenetic trees studied by Buczynska and Wisniewski in \cite{BW}. These algebras arise as toric degenerations of rings of global…

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

A tanglegram consists of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. Tanglegrams are drawn with the leaves on two parallel lines, the trees on either side of the strip…

For any complex parameters $x$ and $\nu$, we provide a new class of linear inversion formulas $T = A(x,\nu) \cdot S \Leftrightarrow S = B(x,\nu) \cdot T$ between sequences $S = (S_n)_{n \in \mathbb{N}^*}$ and $T = (T_n)_{n \in…

The geometrical structure known as the Tulczyjew triple has proved to be very useful in describing mechanical systems, even those with singular Lagrangians or subject to constraints. Starting from basic concepts of variational calculus, we…

We establish a correspondence between automorphisms and derivations on certain algebras of generalised power series. In particular, we describe a Lie algebra of derivations on a field $k(\!(G)\!)$ of generalised power series, exploiting our…

We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…

We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems, tree resolution, into formulas that require large rank in any proof system that manipulates polynomials…

The recursion tree resulting from Karatsuba's formula is built here by using an interleaved splitting scheme rather than the traditional left/right one. This allows an easier access to the nodes of the tree and $2n-1$ of them are initially…

We prove a multivariate Lagrange-Good formula for functionals of uncountably many variables and investigate its relation with inversion formulas using trees. We clarify the cancellations that take place between the two aforementioned…

Let $K$ be an arbitrary field of characteristic zero and $A$ a commutative associative $ K$-algebra which is an integral domain. Denote by $R$ the fraction field of $A$ and by $W(A)=RDer_{\mathbb K}A,$ the Lie algebra of $\mathbb…

A $k$-leaf power of a tree $T$ is a graph $G$ whose vertices are the leaves of $T$ and whose edges connect pairs of leaves whose distance in $T$ is at most $k$. A graph is a leaf power if it is a $k$-leaf power for some $k$. Over 20 years…

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every…

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).

Let k be a commutative ring. We find and characterize a new family of twisted planes (i. e. associative unitary k-algebra structures on the k-module k[X,Y], having k[X] and and k[Y] as subalgebras).Similar results are obtained for the…

We give presentation of composition inverse of formal power serie in a logarithmic form.

A real Lie algebra with a compatible Hilbert space structure (in the sense that the scalar product is invariant) is called a Hilbert-Lie algebra. Such Lie algebras are natural infinite-dimensional analogues of the compact Lie algebras; in…

A graph $G$ is a $k$-leaf power if there exists a tree $T$ whose leaf set is $V(G)$, and such that $uv \in E(G)$ if and only if the distance between $u$ and $v$ in $T$ is at most $k$. The graph classes of $k$-leaf powers have several…

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…