A multiset version of determinants and the Coin arrangements lemma

作者: Hossein Teimoori Faal

DOI: 10.1016/J.TCS.2019.04.010

关键词:

摘要: Abstract In this paper, we first give a multiset version of the graph-theoretical interpretation classic determinant matrix A based on generalization cycle cover its associated digraph D ( ) . Then, as direct consequence interpretation, present another algebraic proof weighted original coin arrangements lemma.

参考文章(7)
Christian Choffrut, Juhani Karhumäki, Combinatorics of words Handbook of formal languages, vol. 1. pp. 329- 438 ,(1997) , 10.1007/978-3-642-59136-5_6
Richard A. Brualdi, Dragos Cvetkovic, A Combinatorial Approach to Matrix Theory and Its Applications ,(2008)
Apostolos Syropoulos, Mathematics of Multisets WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View. pp. 347- 358 ,(2000) , 10.1007/3-540-45523-X_17
Miklós Bóna, Combinatorics of Permutations ,(2004)
Hossein Teimoori Faal, Martin Loebl, Bass' identity and a coin arrangements lemma The Journal of Combinatorics. ,vol. 33, pp. 736- 742 ,(2012) , 10.1016/J.EJC.2011.09.028
Hossein Teimoori Faal, A Multiset Version of Even-Odd Permutations Identity International Journal of Foundations of Computer Science. ,vol. 30, pp. 683- 691 ,(2019) , 10.1142/S0129054119500163