Related papers: The planar Tree Lagrange Inversion Formula

If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…

The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study…

We point out how Banach Fixed Point Theorem, and the Picard successive approximation methods induced by it, allows us to treat some mathematical methods in Combinatorics. In particular we get, by this way, a proof and an iterative algorithm…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

We compute the isomorphism class in $\mathfrak{KK}^{alg}$ of all noncommutative generalized Weyl algebras $A=\CC[h](\sigma, P)$, where $\sigma(h)=qh+h_0$ is an automorphism of $\CC[h]$, except when $q\neq 1$ is a root of unity. In…

For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$. We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial…

Lagrangian modelling can be used to derive mathematical models for complex power electronic converters. This approach uses scalar quantities (kinetic and potential energy) to derive models, which is simpler than using (vector-based) force…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

The transformation of a Laguerre series $f (z) = \sum_{n=0}^{\infty} \lambda_{n}^{(\alpha)} L_{n}^{(\alpha)} (z)$ to a power series $f (z) = \sum_{n=0}^{\infty} \gamma_{n} z^{n}$ is discussed. Many nonanalytic functions can be expanded in…

We consider the lagrangian $L=F(R)$ in classical (=non-quantized) two-dimensional fourth-order gravity and give new relations to Einstein's theory with a non-minimally coupled scalar field. We distinguish between scale-invariant lagrangians…

The spectral form factor, k(t), is the Fourier transform of the two level correlation function C(x), which is the averaged probability for finding two energy levels spaced x mean level spacings apart. The average is over a piece of the…

We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

It is well-known that Lagrange's four-square theorem, stating that every natural number may be written as the sum of four squares, may be proved using methods from the classical theory of modular forms and theta functions. We revisit this…

Employing a recent technology of tree surgery we prove a ``deletion-constriction'' formula for products of rooted spanning trees on weighted directed graphs that generalizes deletion-contraction on undirected graphs. The formula implies…

By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…

Let $\mathbb F$ be a local field and $G$ be a linear algebraic group defined over $\mathbb F$. For $k\in\mathbb N$, let $g\to g^k$ be the $k$-th power map $P_k$ on $G(\mathbb F)$. The purpose of this article is two-fold. First, we study the…

A complete group classification of a class of variable coefficient (1+1)-dimensional telegraph equations $f(x)u_{tt}=(H(u)u_x)_x+K(u)u_x$, is given, by using a compatibility method and additional equivalence transformations. A number of new…