February 1, 2017

Errata and Supplements toMatrices and Matroids for Systems Analysis (Springer, 2000)• Page VII, line7:

Bernhardt• Page 34, line 6:

Put . (period) after “Proposition 2.1.2”• Page 41, (2.16):

Entry a41 is misplaced. The matrix should be:=⇒Bernhard

C146
R1 4′ a44 a46
6′ a64 a66
Pr APc =
R2 2′
R3 1′
R4 5′
R5 3′

C25C3
2a25

a22
a12

C4
1a41

C53a63a51

a13a53a33• Page 41, last line:
C1 ⪯ C2 ⪯ C3 ⪯ C5 , C4 ⪯ C5=⇒C2 ⪯ C3 ⪯ C5 , C1 ⪯ C4 ⪯ C5

• Page 46, Figure 2.2 (poorly printed):
Broken lines should be connected line segments.
• Page 52, line 16 (poorly printed):
L1 ∨ L2 the sublattice generated by L1 ∪ L2 . The family Λ(V ; V0 , V∞ ) formsa lattice (Λ(V ; V0 , V∞ ), ∨, ∧)• Page 79, lines −5 and −3:

contraposition• Page 142, line 26:

MQ=⇒M(Q)• Page 142, line −5:

MQ=⇒M(Q)• Page 143, line 12:∂(M ∩ CQ )=⇒ ∂M ∩ CQ

• Page 144, line 5:∂(M ∩ CQ )=⇒=⇒contrapositive∂M ∩ CQ• Page 288, lines 2 (Theorem 5.2.12):1≤k ≤r−1=⇒0≤k≤r• Page 387, last line of Remark 6.5.3:

contraposition=⇒contrapositive• Page 435, Proposition 7.3.8:
equal to the maximum size =⇒equal to twice the maximum size1• Page 455, Ref. 59 (I. S. Duﬀ, A. M. Erisman, and J. K. Reid):
Discrete =⇒ Direct• Page 455, Ref. 62 (I. S. Duﬀ, R. G. Grimes, and J. G. Lewis):
User’s =⇒ Users’
TR/PA/92/86, 1992. =⇒ TR/PA/92/86, CERFACS, 1992.
• Page 456, Ref. 82 (S. Fujishige):
2nd ed., Elsevier, Amsterdam, 2005.
• Page 456, Ref. 91 (J. F. Geelen):preprint, 1997. =⇒ Combinatorica, 20 (2000), 61–70.
• Page 456, Ref. 93 (J. F. Geelen, S. Iwata, and K. Murota):
RIMS Preprint No. 1149, Kyoto University, July 1997.
=⇒ J. Combin. Theory, B88 (2003), 377–398.
• Page 459, Ref. 139 (S. Iwata):
Erratum in Combinatorica, 16 (1996), 449.
• Page 459, Ref. 141 (S. Iwata):
Final form in Algorithmica, 36 (2003), 331–341.
• Page 459, Ref. 142 (S. Iwata):
Discrete Mathematics and Systems Science Research Report, Osaka University, inpreparation.
=⇒ in preparation.
• Page 459, Ref. 146 (S. Iwata and K. Murota):
RIMS Preprint, No. 1113, Kyoto University, 1996.
=⇒ Math. Programming, A90 (2001), 353–371.
• Page 461, Ref. 189 (S. B. Maurer):
129–237 =⇒ 129–137.
• Page 463, Ref. 233 (K. Murota):(1999) =⇒ (1998)• Page 463, Ref. 236 (K. Murota):
L-convex functions and M-convex functions, in: Encyclopaedia of Optimization (P.
M. Pardalos and C. A. Floudas, eds.), Kluwer Academic Publishers, Boston, 2000,to appear.
=⇒ Discrete Convex Analysis, SIAM Monographs on Discrete Mathematics andApplications, Vol. 10, Society for Industrial and Applied Mathematics, Philadelphia,
2003.
• Page 464, Ref. 252 (M. Newman):London =⇒ New York2

• Page 466, Ref. 299 (A. Shioura):
Research Report, No. 21, Dept. Mech. Eng., Sophia University, 1998.
=⇒ IEICE Trans. Fundment. Electr., Comm. Comput. Sci., E83-A (2000),586–589.
• Page 467, Ref. 327 (J. W. van der Woude):1998. =⇒ SIAM J. Control Opt., 38 (1999), 1–21.
• Page 468, line 23:(Add the following items)

References added for softcover edition
354. J. Geelen and S. Iwata: Matroid matching via mixed skew-symmetric matrices,Combinatorica, 25 (2005), 187–215.
355. N. J. A. Harvey, D. R. Karger, and K. Murota: Deterministic network coding
by matrix completion, Proc. Sixteenth Annual ACM-SIAM Symp. Disc. Algorithms,(2005), 489–498.
356. N. J. A. Harvey, D. R. Karger, and S. Yekhanin: The complexity of matrix
completion, Proc. Seventeenth Annual ACM-SIAM Symp. Disc. Algorithms, (2006),
1103–1111.
357. S. Iwata: Linking systems and matroid pencils, J. Oper. Res. Soc. Japan, 50(2007), 315–324.
358. S. Iwata and R. Shimizu: Combinatorial analysis of singular matrix pencils,
SIAM J. Matrix Anal. Appl., 29 (2007), 245–259.
359. S. Iwata and M. Takamatsu: Computing the degrees of all cofactors in mixed
polynomial matrices, SIAM J. Disc. Math., 23 (2009), 647–660.
360. S. Iwata and M. Takamatsu: Index minimization of diﬀerential-algebraic equations in hybrid analysis for circuit simulation, Math. Programming, 121 (2010),
105–121.
(end)

3