The uplift principle for ordered trees

DOI10.1016/J.AML.2011.11.018zbMATH Open1241.05019DBLPjournals/appml/CheonS12OpenAlexW1977453136WikidataQ60692115 ScholiaQ60692115MaRDI QIDQ419136FDOQ419136

Louis W. Shapiro, Gi-Sang Cheon

Publication date: 18 May 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.11.018

Recommendations

• scientific article; zbMATH DE number 1111371
• scientific article; zbMATH DE number 2232270
• scientific article; zbMATH DE number 702881
• scientific article; zbMATH DE number 3865301
• Generating functions for generating trees

zbMATH Keywords

Riordan matrixmutatorordered treeuplift principle

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Analytic combinatorics
• The Riordan group
• Title not available (Why is that?)
• Title not available (Why is that?)
• The enumeration of tree-like polyhexes
• Title not available (Why is that?)
• Protected points in ordered trees

Cited In (6)

• On the \(r\)-central coefficient matrices of the Catalan triangles
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• Title not available (Why is that?)
• Weakly protected points in ordered trees
• Profiles of ordered trees with mutation and associated Riordan matrices
• Protected Branches in Ordered Trees

Uses Software

• OEIS

This page was built for publication: The uplift principle for ordered trees

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