On Labeled and Unlabeled Combinatorial Structures

DOI10.1080/03610926.2011.581184MaRDI QIDQ2890094zbMATH OpenOpenAlexFDO

Authors K.-H. Indlekofer

Publication date 8 June 2012

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2011.581184

zbMATH Keywords

additive arithmetical semigroupscharacteristic functioncombinatoricsdistribution function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Arithmetic functions in probabilistic number theory (11K65) Distribution of primes (11N05) Distribution functions associated with additive and positive multiplicative functions (11N60) Commutative semigroups (20M14) Combinatorial probability (60C05) Characteristic functions; other transforms (60E10)

Recommendations

• scientific article; zbMATH DE number 1504592
• Combinatorial labelings of graphs
• k-Combinations of an unlabelled graph
• scientific article; zbMATH DE number 5242079
• A calculus for the random generation of labelled combinatorial structures
• Labelings of discrete structures -- new challenges
• Labellings of graphs and incidence algebras
• A combinatorial link between labelled graphs and increasingly labelled Schröder trees
• scientific article; zbMATH DE number 3914328
• scientific article; zbMATH DE number 5291590

Cites work

• A mean-value theorem for multiplicative functions
• scientific article; zbMATH DE number 3637953 (Why is no real title available?)
• scientific article; zbMATH DE number 1557173 (Why is no real title available?)
• On a certain class of infinite products with an application to arithmetical semigroups

Cited in

(2)

• Counting unlabeled structures
• k-Combinations of an unlabelled graph

This page was built for publication: On Labeled and Unlabeled Combinatorial Structures

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