Related papers: Cayley's formula from middle school math
Using Singular Rescaling We Prove Some Bifurcation Results. This note Presents short proofs for some Bifurcation results which had been appeared with other authors.
We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to…
Using the Lagrange inversion formula, $t$-ary trees are enumerated with respect to edge type (left, middle, right for ternary trees).
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The…
The note complements topological aspects of the theory of chiral algebras.
The goal of this note is to provide a constructive version of the proof of local structure of etale algebras.
We give characterizations for the parabolicity of regular trees.
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a…
We consider the ferromagnetic n.n Ising model on Cayley trees in absence of external fields submitted to a modified majority rule transformation with overlapping cells already known to lead to non-Gibbsian measures. We describe the…
We consider so-called simple families of labelled trees, which contain, e.g., ordered, unordered, binary and cyclic labelled trees as special instances, and study the global and local behaviour of the number of inversions. In particular we…
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…
Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…
We consider Bernoulli (bond) percolation with parameter $p$ on the Cayley tree of order $k$. We introduce the notion of zebra-percolation that is percolation by paths of alternating open and closed edges. In contrast with standard…
There is a one-to-one correspondence between natural numbers and rooted trees; the number is called the Matula number of the rooted tree. We show how a large number of properties of trees can be obtained directly from the corresponding…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
We present a proof of the Chevalley-Weil Theorem that is somewhat different from the proofs appearing in the literature and with somewhat weaker hypotheses, of purely topological type. We also provide a discussion of the assumptions, and an…
In this note we give an elementary demonstration of the fact that AB=I implies BA=I for square matrices A,B with coefficients in a field K. By elementary we mean that our proof follows from the very definitions of matrix and product of a…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
This survey paper is an expanded version of lectures given at the Clay Mathematics Academy ; see http://www.claymath.org/programs/outreach/academy/colloquium2005.php These lectures were intended to very young (and motivated) college…
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.