Related papers: A classification of plane and planar 2-trees
We prove the relationship between the Hosoya polynomial and the edge-Hosoya polynomial of trees. The connection between the edge-hyper-Wiener index and the edge-Hosoya polynomial is established. With these results we also prove formulas for…
Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We design exact polynomial expansions of a class of Feynman--Kac particle distributions. These expansions are finite and are parametrized by coalescent trees and other related combinatorial quantities. The accuracy of the expansions at any…
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).…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
Generalizing Jones's notion of a planar algebra, we have previously introduced an A_2-planar algebra capturing the structure contained in the double complex pertaining to the subfactor for a finite SU(3) ADE graph with a flat cell system.…
We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…
We generalize Jones' planar algebras by internalising the notion to a pivotal braided tensor category $\mathcal{C}$. To formulate the notion, the planar tangles are now equipped with additional `anchor lines' which connect the inner circles…
This is a collection of articles, written as sections, on arithmetic properties of differential equations, holomorphic foliations, Gauss-Manin connections and Hodge loci. Each section is independent from the others and it has its own…
In this paper, we expand on the work of Guo and Zeng from 2007 on a generalization of the Ramanujan polynomials and planar trees. We manage to find combinatorial interpretations of this family of polynomials in terms of Greg trees, Cayley…
The combinatorics of RNA plays a central role in biology. Mathematical biologists have several commonly-used models for RNA: words in a fixed alphabet (representing the primary sequence of nucleotides) and plane trees (representing the…
In this paper, dual complex Pell numbers and quaternions are defined. Also, some algebraic properties of dual-complex Pell numbers and quaternions which are connected with dual complex numbers and Pell numbers are investigated. Furthermore,…
In arXiv:0909.0508 D-particle degeneracies were calculated using novel methods. By analysing this refined computation of the index in the setting of the topological B model, a correspondence is found between flow trees in the supergravity…
An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and…
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…
We investigate certain Eisenstein congruences, as predicted by Harder, for level p paramodular forms of genus 2. We use algebraic modular forms to generate new evidence for the conjecture. In doing this we see explicit computational…