Results 41 to 50 of about 1,259,069 (138)
Counting smaller trees in the Tamari order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We introduce new combinatorial objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton ...
Grégory Chatel, Viviane Pons
doaj +1 more source
Two bijections on Tamari Intervals [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We use a recently introduced combinatorial object, the $\textit{interval-poset}$, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results.
Frédéric Chapoton +2 more
doaj +1 more source
Clifford Algebras, Spin Groups and Qubit Trees
Quanta, 2022 Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of superfluous ...
Alexander Yurievich Vlasov
doaj +1 more source
The height of random binary unlabelled trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local
Nicolas Broutin, Philippe Flajolet
doaj +1 more source
Single-crossover recombination and ancestral recombination trees [PDF]
, 2011 von Wangenheim U. Single-crossover recombination and ancestral recombination trees. Bielefeld: Universität Bielefeld; 2011.Modeling the process of recombination in the deterministic limit of an infinite population leads to a large coupled nonlinear ...
von Wangenheim, Ute
core
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Algorithms, 2021 Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees.
David Schaller +3 more
doaj +1 more source
Constructing Binary Huffman Tree
Formalized Mathematics, 2013 Summary Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm.
Hiroyuki Okazaki +2 more
openaire +4 more sources
Bringing trees to the I-205 multi-use path [PDF]
, 2010 This archived document is maintained by the Oregon State Library as part of the Oregon Documents Depository Program. It is for informational purposes and may not be suitable for legal purposes.Title from PDF caption (viewed on May 10, 2016).Logos ...
core
, 1996 A longer and updated version of this paper appears in: Shenoy, P. P., "Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture," International Journal of Approximate Reasoning, 17(2--3), 1997, 239--263 (available from .The main goal ...
Shenoy, Prakash P.
core +1 more source