Arithmetic for rooted trees

DOI10.1007/s00224-016-9731-zzbMath1358.05055arXiv1510.05512OpenAlexW2962701612MaRDI QIDQ519885

Fabrizio Luccio

Publication date: 31 March 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05512

zbMATH Keywords

arithmeticrooted treeprime treetree equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Enumeration in graph theory (05C30) Data structures (68P05) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Submodular functions and rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on number of steals in rooted trees
• The algebra of binary search trees
• The arithmetic of trees
• Graph multiplication
• Weak reconstruction of strong product graphs
• Trees, functional equations, and combinatorial Hopf algebras
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Lexicographic generation of ordered trees
• On the Hopf algebra strucutre of perturbative quantum field theories
• Arithmetree.
• Combinatorics of rooted trees and Hopf algebras
• Définition et etude des Bilangages réguliers
• Dialgebras and related operads

This page was built for publication: Arithmetic for rooted trees