Related papers: Counting smaller trees in the Tamari order
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function. These pointer recursive functions classes are proven equivalent…
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanning tree problem is first constructed. This problem…
In a tropical approximation, any tree-shaped line soliton solution, a member of the simplest class of soliton solutions of the Kadomtsev-Petviashvili (KP-II) equation, determines a chain of planar rooted binary trees, connected by right…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
An m-ballot path of size n is a path on the square grid consisting of north and east steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my}. The set of these paths can be equipped with a lattice structure, called…
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely…
Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…
Bernardi has given a general formula for the number of regions of a deformation of the braid arrangement as a signed sum over boxed trees. We prove that each set of boxed trees which share an underlying (rooted labeled plane) tree…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
In this paper, we find recursive formulas for the Tutte polynomial of a family of small-world networks: Farey graphs, which are modular and have an exponential degree hierarchy. Then, making use of these formulas, we determine the number of…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…
We introduce some classes of increasing labeled and multilabeled trees, and we show that these trees provide combinatorial interpretations for certain Thron-type continued fractions with coefficients that are quasi-affine of period 2. Our…
A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams…
We introduce cubic coordinates, which are integer words encoding intervals in the Tamari lattices. Cubic coordinates are in bijection with interval-posets, themselves known to be in bijection with Tamari intervals. We show that in each…
This paper proves four conjectured generating series, due to Chapoton, which concern invariants of posets and polytopes associated with a specific sequence of arbors. Two of these conjectures provide closed-form formulas for the generating…
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).…