Arithmetical semigroups related to trees and polyhedra

DOI10.1006/jcta.1998.2917zbMath0918.05006OpenAlexW2015233175MaRDI QIDQ1284470

Arnold Knopfmacher, John Knopfmacher

Publication date: 26 April 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2917

zbMATH Keywords

polyhedraenumerationtreesisomorphism classesnon-isomorphic structures

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Semigroups (20M99)

Related Items

ANALYTIC AND PROBABILISTIC THEORY OF ADDITIVE ARITHMETICAL SEMIGROUPS, ABSTRACT NUMBER SYSTEMS AND LOGICAL LIMIT LAWS, ABOUT THE RADIUS OF CONVERGENCE OF THE ZETA FUNCTION OF AN ADDITIVE ARITHMETICAL SEMIGROUP, Asymptotics of combinatorial structures with large smallest component, ON MURATA DENSITIES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of trees in a random forest
• Some asymptotic results useful in enumeration problems
• Arithmetical properties of finite graphs and polynomials
• On the enumeration of convex polyhedra
• The number of trees
• Singularity Analysis of Generating Functions
• Counting Interval Graphs
• Almost all Convex Polyhedra are Asymmetric
• The Asymptotic Number of Convex Polyhedra
• Asymptotic Methods in Enumeration
• A Relationship between two Sequences and Arithmetical Semigroups
• Lectures on Polytopes
• Counting finite models
• Distinct Degree Factorizations for Polynomials over a Finite Field