Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
arXiv:0901.1337
Abstract
F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(a) are considered. For such specific sequences a new interpretation with respect to Kwasniewski general combinatorial interpretation of F-nomial coefficients is unearhed. Namely, for tiling sequences F = N(a)$ the F-nomial coefficients are equal to the number of labeled special bipartite multigraphs denoted here as a-multigraphs G(a,n,k). An explicit relation between the number of k-colored a-multigraphs and multi N(a)-nomial coefficients is established. We also prove that the unsigned values of the first row of inversion matrix for N(a) -nomial coefficients considered here are equal to the numbers of directed acyclic a-multigraphs with n nodes.
11 pages, Affiliated to The Internet Gian-Carlo Polish Seminar http://ii.uwb.edu.pl/akk/sem/sem_rota.htm
References in corpus (8)
- Cobweb posets as noncommutative prefabs
- On cobweb posets and their combinatorially admissible sequences
- Cobweb posets - Recent Results
- On Cobweb posets tiling problem
- On Cobweb Posets and Discrete F-Boxes Tilings
- On cobweb posets most relevant codings
- On multi F-nomial coefficients and Inversion formula for F-nomial coefficients
- Graded posets zeta matrix formula
Cited by in corpus (5)
- How the work of Gian Carlo Rota had influenced my group research and life
- Generalization of Fibonomial Coefficients
- On natural join of posets properties and first applications
- Natural join construction of graded posets versus ordinal sum and discrete hyper boxes
- Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II