Construction and composition of rooted trees via descent functions

DOI10.1155/2013/543913zbMATH Open1326.05030arXiv1409.6157OpenAlexW2014646742WikidataQ58919877 ScholiaQ58919877MaRDI QIDQ895943FDOQ895943

Authors: Marco Abrate, Stefano Barbero, Umberto Cerruti, Nadir Murru 

Publication date: 11 December 2015

Published in: Algebra (Search for Journal in Brave)

Abstract: We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions. Moreover, in this way, we are able to compose rooted trees with each other. Such a new composition of rooted trees is a very powerful tool applied in this paper in order to obtain important results as the creation of new rational and Pythagorean trees.

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

Recommendations

• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• Counting forests by descents and leaves
• Woon's tree and sums over compositions

zbMATH Keywords

composed rooted treesPythagorean trees

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• The number of Baxter permutations
• Locating terms in the Stern-Brocot tree
• Recounting the Rationals

Cited In (3)

• Title not available (Why is that?)
• Bottom-Up derivatives of tree expressions
• Iterated joining of rooted trees

This page was built for publication: Construction and composition of rooted trees via descent functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895943)