26,453 research outputs found
Solving Non-homogeneous Nested Recursions Using Trees
The solutions to certain nested recursions, such as Conolly's C(n) =
C(n-C(n-1))+C(n-1-C(n-2)), with initial conditions C(1)=1, C(2)=2, have a
well-established combinatorial interpretation in terms of counting leaves in an
infinite binary tree. This tree-based interpretation, which has a natural
generalization to a k-term nested recursion of this type, only applies to
homogeneous recursions, and only solves each recursion for one set of initial
conditions determined by the tree. In this paper, we extend the tree-based
interpretation to solve a non-homogeneous version of the k-term recursion that
includes a constant term. To do so we introduce a tree-grafting methodology
that inserts copies of a finite tree into the infinite k-ary tree associated
with the solution of the corresponding homogeneous k-term recursion. This
technique can also be used to solve the given non-homogeneous recursion with
various sets of initial conditions.Comment: 14 page
Counting smaller elements in the Tamari and m-Tamari lattices
We introduce new combinatorial objects, the interval- posets, that encode
intervals of the Tamari lattice. We then find a combinatorial interpretation of
the bilinear operator that appears in the functional equation of Tamari
intervals described by Chapoton. Thus, we retrieve this functional equation and
prove that the polynomial recursively computed from the bilinear operator on
each tree T counts the number of trees smaller than T in the Tamari order. Then
we show that a similar m + 1-linear operator is also used in the functionnal
equation of m-Tamari intervals. We explain how the m-Tamari lattices can be
interpreted in terms of m+1-ary trees or a certain class of binary trees. We
then use the interval-posets to recover the functional equation of m-Tamari
intervals and to prove a generalized formula that counts the number of elements
smaller than or equal to a given tree in the m-Tamari lattice.Comment: 46 pages + 3 pages of code appendix, 27 figures. Long version of
arXiv:1212.0751. To appear in Journal of Combinatorial Theory, Series
Compact Binary Relation Representations with Rich Functionality
Binary relations are an important abstraction arising in many data
representation problems. The data structures proposed so far to represent them
support just a few basic operations required to fit one particular application.
We identify many of those operations arising in applications and generalize
them into a wide set of desirable queries for a binary relation representation.
We also identify reductions among those operations. We then introduce several
novel binary relation representations, some simple and some quite
sophisticated, that not only are space-efficient but also efficiently support a
large subset of the desired queries.Comment: 32 page
Logics for Unranked Trees: An Overview
Labeled unranked trees are used as a model of XML documents, and logical
languages for them have been studied actively over the past several years. Such
logics have different purposes: some are better suited for extracting data,
some for expressing navigational properties, and some make it easy to relate
complex properties of trees to the existence of tree automata for those
properties. Furthermore, logics differ significantly in their model-checking
properties, their automata models, and their behavior on ordered and unordered
trees. In this paper we present a survey of logics for unranked trees
- …