21,232 research outputs found
Bounding right-arm rotation distances
Rotation distance measures the difference in shape between binary trees of
the same size by counting the minimum number of rotations needed to transform
one tree to the other. We describe several types of rotation distance where
restrictions are put on the locations where rotations are permitted, and
provide upper bounds on distances between trees with a fixed number of nodes
with respect to several families of these restrictions. These bounds are sharp
in a certain asymptotic sense and are obtained by relating each restricted
rotation distance to the word length of elements of Thompson's group F with
respect to different generating sets, including both finite and infinite
generating sets.Comment: 30 pages, 11 figures. This revised version corrects some typos and
has some clearer proofs of the results for the lower bounds and better
figure
On a Subposet of the Tamari Lattice
We explore some of the properties of a subposet of the Tamari lattice
introduced by Pallo, which we call the comb poset. We show that three binary
functions that are not well-behaved in the Tamari lattice are remarkably
well-behaved within an interval of the comb poset: rotation distance, meets and
joins, and the common parse words function for a pair of trees. We relate this
poset to a partial order on the symmetric group studied by Edelman.Comment: 21 page
Representing and retrieving regions using binary partition trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees concentrate in a compact and structured way the set of regions that compose an image. Since the tree is able to represent images in a multiresolution way, only simple descriptors need to be attached to the nodes. Moreover, this representation is used for similarity based region retrieval.Peer ReviewedPostprint (published version
KP line solitons and Tamari lattices
The KP-II equation possesses a class of line soliton solutions which can be
qualitatively described via a tropical approximation as a chain of rooted
binary trees, except at "critical" events where a transition to a different
rooted binary tree takes place. We prove that these correspond to maximal
chains in Tamari lattices (which are poset structures on associahedra). We
further derive results that allow to compute details of the evolution,
including the critical events. Moreover, we present some insights into the
structure of the more general line soliton solutions. All this yields a
characterization of possible evolutions of line soliton patterns on a shallow
fluid surface (provided that the KP-II approximation applies).Comment: 49 pages, 36 figures, second version: section 4 expande
Bounding right-arm rotation distances
Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets
Quantum automata, braid group and link polynomials
The spin--network quantum simulator model, which essentially encodes the
(quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable
to address problems arising in low dimensional topology and group theory. In
this combinatorial framework we implement families of finite--states and
discrete--time quantum automata capable of accepting the language generated by
the braid group, and whose transition amplitudes are colored Jones polynomials.
The automaton calculation of the polynomial of (the plat closure of) a link L
on 2N strands at any fixed root of unity is shown to be bounded from above by a
linear function of the number of crossings of the link, on the one hand, and
polynomially bounded in terms of the braid index 2N, on the other. The growth
rate of the time complexity function in terms of the integer k appearing in the
root of unity q can be estimated to be (polynomially) bounded by resorting to
the field theoretical background given by the Chern-Simons theory.Comment: Latex, 36 pages, 11 figure
- …