Skip to main content

Timeline for Erich Stiemke biography

Current License: CC BY-SA 4.0

11 events
when toggle format what by license comment
May 30, 2018 at 2:39 history edited j.c. CC BY-SA 4.0
fix typos, add link to first reference
May 30, 2018 at 0:10 history edited Martin Sleziak CC BY-SA 4.0
added links to papers
May 25, 2018 at 10:20 comment added Peter Heinig @Cherng-tiaoPerng: many thanks for pointing out, and sorry for the late answer (didn't look earlier). I corrected the oversight; however, I corrected it in the antecedent, not the conclusion of the implication (because the usual convention nowadays is to imagine columns as 'vertical' and rows as 'horizontal', and to imagine the rows of the matrix to correspond to the coefficients in the linear equations).
May 25, 2018 at 10:15 history edited Peter Heinig CC BY-SA 4.0
Corrected an error I made in stating Stiemke's 1915 result. Thanks to a commenter for pointing it out..
May 19, 2018 at 20:28 comment added Richard Stanley Stiemke's 1915 theorem follows immediately from the duality theorem for linear programming and is considered a forerunner of the duality theorem. See for instance Chapter 7 of A. Schrijver, Theory of Integer and Linear Programming.
May 19, 2018 at 3:50 comment added Cherng-tiao Perng The last statement should be "then there exists $v\in {\mathbb R}^n$ having all components strictly positive such that $v^TA=0$".
May 18, 2018 at 21:44 comment added Nik Weaver I don't understand the theorem --- take $n = 2$ and $m = 1$ and $A = \left[\begin{matrix}1\cr -1\end{matrix}\right]$ ...?
May 18, 2018 at 20:11 history edited Peter Heinig CC BY-SA 4.0
Additions.
May 18, 2018 at 20:08 comment added Peter Heinig @AlexM.: only one university in Berlin. Nowadays there are three.
May 18, 2018 at 19:59 comment added Alex M. "there was only one such before WW2" - I beg your pardon: one such what?
May 18, 2018 at 19:44 history answered Peter Heinig CC BY-SA 4.0