Arithmetic for rooted trees (Q519885): Difference between revisions

From MaRDI portal
Merged Item from Q5282821
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Définition et etude des Bilangages réguliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The arithmetic of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebra of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, functional equations, and combinatorial Hopf algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of rooted trees and Hopf algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hopf algebra strucutre of perturbative quantum field theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on number of steals in rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialgebras and related operads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic generation of ordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak reconstruction of strong product graphs / rank
 
Normal rank

Revision as of 14:19, 13 July 2024

scientific article; zbMATH DE number 6747569
Language Label Description Also known as
English
Arithmetic for rooted trees
scientific article; zbMATH DE number 6747569

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references