Related papers: A note on Puder's generalised co-growth formula fo…

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…

In a recent preprint, Gullerud and Walker [2] proved a theorem and made a conjecture about the correctness of efficiently generating B\'ezout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, confirm that…

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances…

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

For coprime dimension vectors certain torus fixed points of the Kronecker moduli space are indecomposable tree modules. They are indecomposable representations of the regular m-tree and can be glued in order to get stable torus fixed point…

We equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion of…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive…

We prove two congruences for the coefficients of power series expansions in t of modular forms where t is a modular function. As a result, we settle two recent conjectures of Chan, Cooper and Sica. Additionally, we provide a table of…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vertices, in which the labels increase along every chain from…

We introduce the notion of generalized bialgebra, which includes the classical notion of bialgebra (Hopf algebra) and many others. We prove that, under some mild conditions, a connected generalized bialgebra is completely determined by its…

Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…

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).…

Using non-trivial mathematical properties of a class of nonlinear evolution equations, we obtain the universal terms in the asymptotic expansion in rapidity of the saturation scale and of the unintegrated gluon density from the…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…