Extension of MacMahon's Master Theorem to pre-semi-rings

Linear Algebra and Its Applications

Volumn 338, Issue 1-3, 2001, Pages 19-26

  Minoux, M ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Combinatorial matrix algebra; Determinantal identities; Formal series; Semi rings

Indexed keywords

EID: 0035889791     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00376-7     Document Type: Article

References (13)

1. Atkin A.O.L., Boros E., Cechlárová K., Pelad U. Powers of circulants in bottleneck algebra. Linear Algebra Appl. 258:1997;137-148.
2. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. 1991;Cambridge University Press, Cambridge.
3. P. Cartier, D. Foata, Problèmes Combinatoires de Commutation et Réarrangement. Lectures Notes in Mathematics, vol. 85, Springer, Berlin, 1969.
4. D. Foata, Etude algébriques de certains problèmes d'analyse combinatoire et du calcul des probabilités, Publ. Inst. Stat. Univ. Paris 14 (1965) 81-241.
5. Foata D. A combinatorial proof of Jacobi's identity. Ann. Discrete Math. 6:1980;125-135.
6. P.A. MacMahon, Combinatory Analysis, Cambridge University Press, Cambridge, 1915; Chelsea, New York, 1960.
7. Minoux M. Bideterminants, Arborescences and extension of the matrix-tree theorem to semirings. Discrete Math. 171:1997;191-200.
8. Minoux M. A generalization of the all minors matrix-tree theorem to semi-rings. Discrete Math. 199:1999;139-158.
9. Orlin J.B. Line-digraphs, arborescences and theorems of Tutte and Knuth. J. Combin. Theory, Ser. B. 25:1978;187-198.
10. Rutherford D.E. The Cayley-Hamilton theorem for semirings. Proc. Royal Soc. Edinburgh, Ser. A. 66:1964;211-215.
11. Straubing H. A combinatorial proof of the Cayley-Hamilton theorem. Discrete Math. 43:1983;273-279.
12. Temperley H.N.V. Graph theory and Applications. 1981;Ellis Horwood, Chichester, UK.
13. Zeilberger D. A combinatorial approach to matrix algebra. Discrete Math. 56:1985;61-72.