Contact

This is both my professional homepage and a blog --- really more of the former than the latter.
Contact me
  • Email:
  • Comment on a post on the Blog

My office is here:
r411
Institute of Computer Science
University of Tartu
2 Liivi
50409 Tartu
Estonia


 
DOT (Boy, was I fat!)

4 comments:

  1. Hi Dirk,

    This question is in reference to your posting "Best combinatorial bound for extension complexity". May I know what exactly you mean by combinatorially equivalent polytopes, in questions 2 and 3?

    Thanks and regards,
    Ashish
    (ashish.chiplunkar@gmail.com)

    ReplyDelete
  2. Hi Ashish
    Two polytopes are called combinatorially equivalent, if they have the same face lattice. The point is that this does not, in general, imply that the two polytopes are projectively isomorphic.

    ReplyDelete
  3. Hi Dirk,

    I am Adewusi Janet, a research tutor at the African Institute for Mathematical Sciences. This question is from the definition of your posting of " C-extension of a pair of convex polyhedral cones ". Can the definition be used in a measurable space?

    Thanks and best regards,
    Janet
    (f.adewusi@aims.edu.gh)

    ReplyDelete
  4. Hi Dirk,

    I am Adewusi Janet, a research tutor at the African Institute for Mathematical Sciences. This question is from the definition of your posting of " C-extension of a pair of convex polyhedral cones ". Can the definition be used in a measurable space?

    Thanks and best regards,
    Janet
    (f.adewusi@aims.edu.gh)

    ReplyDelete