Related papers: The planar Tree Lagrange Inversion Formula

I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by…

S-matrices can be written Lorentz covariantly in terms of free field strengths for vector states, allowing arbitrary gauge choices. In string theory the vertex operators can be chosen so this gauge invariance is automatic. As examples we…

The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…

Modular graph forms are a class of non-holomorphic modular forms that arise in the low-energy expansion of genus-one closed string amplitudes. In this work, we introduce a systematic procedure to convert lattice-sum representations of…

Let G be a reductive connected linear algebraic group over an algebraically closed field of positive characteristic and let g be its Lie algebra. First we extend a well-known result about the Picard group of a semisimple group to reductive…

One defines a new tree-indexed series, with coefficients that are polynomials in x over the ring Q(q). Several special evaluations of this series are obtained, in particular when x is replaced by a q-integer. By taking a limit value when x…

The aim of this paper consists of providing summation formulas for the $k$-Fibonacci numbers ($k \in \mathbb{Z}$, $k \geq 2$) and their asymptotic equivalents in terms of generalized binomial coefficients. Our main tools are the Lagrange…

In this article we describe the $T_{comp}$-equivariant topological $K$-ring of a $T$-{\it cellular} complete toric variety. We further show that $K_{T_{comp}}^0(X)$ is isomorphic as an $R(T_{comp})$-algebra to the ring of piecewise Laurent…

It is shown that the Lorentz invariant $f(T)$ gravity, defined by the coframe-connection-multiplier form of the Lagrangian, can be gauge-fixed to the pure coframe form. After clarifying basic aspects of the problem in the Lagrangian…

Motivated by the problem of reconstructing evolutionary history, Nishimura et al. defined $k$-leaf powers as the class of graphs $G=(V,E)$ which has a $k$-leaf root $T$, i.e., $T$ is a tree such that the vertices of $G$ are exactly the…

Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…

Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…

$S$-matrix elements are invariant under field redefinitions of the Lagrangian. They are determined by geometric quantities such as the curvature of the field-space manifold of scalar and gauge fields. We present a formalism where scalar and…

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

The set of formal power series with coefficients in an associative but noncommutative algebra becomes a loop with the substitution product. We initiate the study of this loop by describing certain Lie and Sabinin algebras related to it.…

The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Tanglegrams are formed by taking two rooted binary trees $T$ and $S$ with the same number of leaves and uniquely matching each leaf in $T$ with a leaf in $S$. They are usually represented using layouts, which embed the trees and the…

Generalized Effective Field Theory (GEFT) is the non-renormalizable extension of an Effective Field Theory where the Wilson coefficients are endowed by their own, independent scale dependence. Such an effective theory can be constructed by…