Lognormal Degree Distribution in the Partition Graphs

MaRDI QIDQ6391633zbMATH OpenFDO

Authors Hartosh Singh Bal

Publication date 20 February 2022

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Vertex degrees (05C07) Structural characterization of families of graphs (05C75) Elementary theory of partitions (11P81) Combinatorics on words (68R15) Combinatorial codes (94B25)

Abstract: The enumeration of higher-dimensional partitions has proved to be a difficult problem. Here we demonstrate a method for listing and recursively enumerating such partitions as words. We use this to estimate some elementary universal bounds on all such partitions in each dimension. The method allows us to recover generating function expression for ordinary partitions through the combinatorics of words. We also show that the words for ordinary partitions form a connected bipartite subgraph of the hypercube $Q_{n-1}$ for each $n$.

This page was built for publication: Lognormal Degree Distribution in the Partition Graphs

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