A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs
1992
Discrete Mathematics
Preserved Fulltext
Poljak, A decomposition of strongly unimodular matrices into incidence matrices of digraphs, Discrete Mathematics 102 (1992) 143-147. A new decomposition of strongly unimodular matrices is given. ...
The result follows directly from an iterated application of Lemma 2.1. 0 Remark. This gives another decomposition of strongly unimodular matrices into (almost) basic RU matrices. ...
Introduction-Building up a strongly unimodular matrix A matrix A is said to be totally unimodular (TU) if the determinant of each of its square submatrices is 0, fl. ...
doi:10.1016/0012-365x(92)90048-k
fatcat:itqqmhghtfc7fn5dxu2kk3duoi
Discrete Mathematics for Computer Science, Some Notes
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Indeed I begin with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system "a la Prawitz". ...
The rest of the material is more or less traditional but I emphasize partial functions more than usual (after all, programs may not terminate for all input) and I provide a fairly complete account of the ...
As a consequence, these matrices are not necessarily totally unimodular. ...
arXiv:0805.0585v1
fatcat:pzc5agtaxvh3hpqo3yvygy2sjq