A generalization of the all minors matrix tree theorem to semirings (Q1297437): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-digraphs, arborescences and theorems of Tutte and Knuth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786986 / rank
 
Normal rank

Revision as of 20:33, 28 May 2024

scientific article
Language Label Description Also known as
English
A generalization of the all minors matrix tree theorem to semirings
scientific article

    Statements

    A generalization of the all minors matrix tree theorem to semirings (English)
    0 references
    9 January 2000
    0 references
    This paper extends to semirings the `all minors matrix tree theorem', which is a generalization of the ``matrix tree theorem''. The latter relates the values of the determinant of square submatrices of a given square matrix to the sum of the weights of some families of forests in the associated weighted graph. Since a semiring is no longer assumed to be a group with respect to addition, the combinatorial proof given significantly differs from the one working on the fields of real numbers. Even the statement of the result has to be changed, since the standard concept of determinant of a matrix is not relevant any more and must be replaced by the concept of bideterminant.
    0 references
    bideterminant
    0 references
    forest
    0 references
    semirings
    0 references
    minors
    0 references
    tree
    0 references
    determinant
    0 references
    weighted graph
    0 references
    0 references

    Identifiers