A group-theoretical generalization of Pascal's triangle (Q1174159)

A recently published estimation of the number of a certain class of subgroups within their groups by the same author relies on the theorems on certain triangles of rational numbers presented in this paper. The triangles generalise Pascal's \((\lambda\) over \(\mu)\) in a certain manner. For any finite connected graph --- loops and multiple edges allowed --- such a triangle is derived from a numbering of nodes and edges combined with \(\lambda\) and \(\mu\); the numbering is taken out of the special class described in the introduction. It turns out that two properties of Pascal's \((\lambda\) over \(\mu)\) are preserved in ``most'' cases: (1) unimodularity (within each row), (2) convergence of the infinite sum of reciprocals; the exception results from mild restrictions on the type rank of the numbered graph being base of the triangle. The numbering, derivation of the triangle, typing, and ranking employ mainly (and repeatedly) divisibility in \(\mathbb{N}\). Only definitions and proofs are given; a deeper insight e.g. into the rôle which the divisibility plays in the observed relations --- properties and restrictions --- may still await its expression. Reviewer's remark: The reference to a partial order intended as additional explanation in the introduction is somehow marred or incomplete, but not needed for the results (and clarification).