Related papers: Lagrange inversion and combinatorial species with …

Lajos Takacs gave a somewhat formidable alternating sum formula for the number of forests of unrooted trees on $n$ labeled vertices. Here we use a weight-reversing involution on suitable tree configurations to give a combinatorial…

The process of un-reduction, a sort of reversal of reduction by the Lie group symmetries of a variational problem, is explored in the setting of field theories. This process is applied to the problem of curve matching in the plane, when the…

The paper introduces a new concept of $\Lambda $-variation of multivariable functions and investigates its connection with the convergence of multidimensional Fourier series

We introduce a certain class of 2-type Galton-Watson trees with edge lengths. We prove that, after an adequate rescaling, the weighted height function of a forest of such trees converges in law to the reflected Brownian motion. We then use…

This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…

We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the $n$th minimal worst case error and show that under certain conditions, it can be bounded…

We show that if a nontrivial group admits a locally invariant ordering, then it admits uncountably many locally invariant orderings. For the case of a left-orderable group, we provide an explicit construction of uncountable families of…

We discuss relations between certain invariants of varieties in positive characteristic, like the a-number and the height of the Artin-Mazur formal group. We calculate the a-number for Fermat surfaces

Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…

In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is…

Tree-based ensemble methods, as Random Forests and Gradient Boosted Trees, have been successfully used for regression in many applications and research studies. Furthermore, these methods have been extended in order to deal with uncertainty…

We consider the functional inverse of the Gamma function in the complex plane, where it is multi-valued, and define a set of suitable branches by proposing a natural extension from the real case.

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

The classical Lagrange inversion formula is extended to analytic and non--analytic inversion problems on non--Archimedean fields. We give some applications to the field of formal Laurent series in $n$ variables, where the non--analytic…

Lagrangian descriptions of irreducible and reducible integer higher-spin representations of the Poincare group subject to a Young tableaux $Y[\hat{s}_1,\hat{s}_2]$ with two columns are constructed within a metric-like formulation in a…

We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…

We propose a new approach to linear ill-posed inverse problems. Our algorithm alternates between enforcing two constraints: the measurements and the statistical correlation structure in some transformed space. We use a non-linear multiscale…

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…