A multiset version of determinants and the Coin arrangements lemma

被引：1
|
作者：
Faal, Hossein Teimoori [1 ]
机构：
[1] Allameh Tabatabai Univ, Dept Math & Comp Sci, Tehran, Iran
来源：
THEORETICAL COMPUTER SCIENCE | 2019年 / 793卷
关键词：
Multiset version; Combinatorics on words; Cycle cover; Lyndon cover; Coin arrangements lemma;
D O I：
10.1016/j.tcs.2019.04.010
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we first give a multiset version of the graph-theoretical interpretation of the classic determinant of a matrix A based on a multiset generalization of the cycle cover of its associated digraph D(A). Then, as a direct consequence of this interpretation, we present another algebraic proof of a weighted version of the original coin arrangements lemma. (C) 2019 Published by Elsevier B.V.
引用
收藏
页码：36 / 43
页数：8
相关论文
共 50 条
12345