\alpha \leq maxflow -> 1/\alpha\leq maxflow

and in Menger’s theorem

max-flow -> maxflow ]]>

1. p73, “that combination down on two piece of paper (one for Lara, one for Indiana),”

Should be pieces.

2. p103, under Algebra Homomorphism, the product limit equality is wrong (or rather, is right, but is the wrong equality).

I’m also rather interested in the conclusion of the wonderfully bright Tomb Raider article. It’s been snipped off in such a cruel way ;)

]]>In fact, one can also ask the slightly stronger property of “strong” regularity, meaning that the centralizer of the element is a maximal torus (another standard fact being that regular semisimple elements are those with centralizer whose connected component of the identity is a maximal torus; see 2.11 in Steinberg’s paper). For a group like SL(n) – “simply-connected” being the keyword -, regular and strongly regular coincide (another theorem of Steinberg), but for SO(n) or PSL(n), it’s not necessarily the case. The genericity of strongly regular elements is 2.15 in Steinberg’s paper.

(Another comment about url’s: the LaTeX package url has a macro \url{…} which typesets long URLs with line-breaks; whether it’s a good thing to have line-breaks is debatable, but at least it avoids oveflowing lines).

]]>(a) I would not say that the fact that two elements that commute with a third one are likely to commute with each other is specific to SL_2. That fact is true for SL_n, and, if memory serves me correctly, for any semisimple group of Lie type: a generic element of a semisimple group is regular semisimple. (It would be nice to have a reference for this, actually.)

(b) Less importantly: my paper on SL_2 finally appeared last month.

]]>