In 2014, Vargas first defined a super-shuffle product and a cut-box coproduct on permutations. In 2020, Aval, Bergeron and Machacek introduced the super-shuffle product and the cut-box coproduct on labeled simple grap...In 2014, Vargas first defined a super-shuffle product and a cut-box coproduct on permutations. In 2020, Aval, Bergeron and Machacek introduced the super-shuffle product and the cut-box coproduct on labeled simple graphs. In this paper, we generalize the super-shuffle product and the cut-box coproduct from labeled simple graphs to (0,1)-matrices. Then we prove that the vector space spanned by (0,1)-matrices with the super-shuffle product is a graded algebra and with the cut-box coproduct is a graded coalgebra.展开更多
In this paper, using a graph theoretic approach, we give a necessary and sufficient condition for a (0,1)-matrix to be a nonsingular generalized ultrametric matrix.
In this note, we show that the number of digraphs with n vertices and with cycles of length k, 0 ≤ k ≤ n, is equal to the number of n × n (0,1)-matrices whose eigenvalues are the collection of copies of the ent...In this note, we show that the number of digraphs with n vertices and with cycles of length k, 0 ≤ k ≤ n, is equal to the number of n × n (0,1)-matrices whose eigenvalues are the collection of copies of the entire kth unit roots plus, possibly, 0’s. In particular, 1) when k = 0, since the digraphs reduce to be acyclic, our result reduces to the main theorem obtained recently in [1] stating that, for each n = 1, 2, 3, …, the number of acyclic digraphs is equal to the number of n × n (0,1)-matrices whose eigenvalues are positive real numbers;and 2) when k = n, the digraphs are the Hamiltonian directed cycles and it, therefore, generates another well-known (and trivial) result: the eigenvalues of a Hamiltonian directed cycle with n vertices are the nth unit roots [2].展开更多
文摘In 2014, Vargas first defined a super-shuffle product and a cut-box coproduct on permutations. In 2020, Aval, Bergeron and Machacek introduced the super-shuffle product and the cut-box coproduct on labeled simple graphs. In this paper, we generalize the super-shuffle product and the cut-box coproduct from labeled simple graphs to (0,1)-matrices. Then we prove that the vector space spanned by (0,1)-matrices with the super-shuffle product is a graded algebra and with the cut-box coproduct is a graded coalgebra.
文摘In this paper, using a graph theoretic approach, we give a necessary and sufficient condition for a (0,1)-matrix to be a nonsingular generalized ultrametric matrix.
文摘In this note, we show that the number of digraphs with n vertices and with cycles of length k, 0 ≤ k ≤ n, is equal to the number of n × n (0,1)-matrices whose eigenvalues are the collection of copies of the entire kth unit roots plus, possibly, 0’s. In particular, 1) when k = 0, since the digraphs reduce to be acyclic, our result reduces to the main theorem obtained recently in [1] stating that, for each n = 1, 2, 3, …, the number of acyclic digraphs is equal to the number of n × n (0,1)-matrices whose eigenvalues are positive real numbers;and 2) when k = n, the digraphs are the Hamiltonian directed cycles and it, therefore, generates another well-known (and trivial) result: the eigenvalues of a Hamiltonian directed cycle with n vertices are the nth unit roots [2].
