Mathematics – Combinatorics
Scientific paper
2009-01-11
Mathematics
Combinatorics
11 pages, Affiliated to The Internet Gian-Carlo Polish Seminar http://ii.uwb.edu.pl/akk/sem/sem_rota.htm
Scientific paper
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.
No associations
LandOfFree
Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-531877