Related papers: A note on Puder's generalised co-growth formula fo…
Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…
The cluster cumulant formula of Kubo is derived by appealing only to elementary properties of subsets and binomial coefficients. It is shown to be a binomial transform of the grand potential. Extensivity is proven without introducing…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
Our previous work presented explicit formulas for the generalized zeta function and the generalized Ihara zeta function corresponding to the Grover walk and the positive-support version of the Grover walk on the regular graph via the…
We prove an infinitary disjoint union theorem for level products of trees. To implement the proof we develop a Hales-Jewett type result for words indexed by a level product of trees.
This paper establishes the equivalence of the Aubin property and the strong regularity for generalized equations over $C^2$-cone reducible sets. This result resolves a long-standing question in variational analysis and extends the…
We prove a combinatorial formula for LLT cumulants of melting lollipops as a positive combination of LLT polynomials indexed by spanning trees. The result gives an affirmative answer to a general positivity question for this class of…
Stretching the parameters of a Littlewood-Richardson coefficient of value 2 by a factor of n results in a coefficient of value n+1. We give a geometric proof of a generalization for representations of quivers.
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…
Complement-reducible graphs (or cographs) are the graphs formed from the single-vertex graph by the operations of complement and disjoint union. By combining the Johnson-Newman theorem on generalized cospectrality with the standard tools in…
Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
Using a theorem of J. Groves we give a ping-pong proof of Osin's uniform exponential growth for solvable groups. We discuss slow exponential growth and show that this phenomenon disappears as one passes to a finite index subgroup.
This paper derives a unifying theorem establishing consistency results for a broad class of tree-based algorithms. It improves current results in two aspects. First of all, it can be applied to algorithms that vary from traditional Random…
In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…
We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…
The classical Clifford correspondence for normal subgroups is considered in the more general setting of semisimple Hopf algebras. We prove that this correspondence still holds if the extension determined by the normal Hopf subalgebra is…
A generalization of the generating function for Gegenbauer polynomials is introduced whose coefficients are given in terms of associated Legendre functions of the second kind. We discuss how our expansion represents a generalization of…
The surface Tutte polynomial has recently been generalised to pseudo-surfaces equipping it with recursive deletion-contraction relations. We use these relations to show that this generalisation naturally possesses a quasi-tree expansion.…