Recent Comments
pavfer on Another Forgotten Bet: Is Don… Gil Kalai on To cheer you up in difficult t… Eitan Bachmat on To cheer you up in difficult t… 구글의 양자컴퓨터 vs 고전 시뮬레이… on Gil’s Collegial Quantum… Anonymous on To cheer you up in difficult t… Gil Kalai on To cheer you up in difficult t… Ehud Friedgut on To cheer you up in difficult t… Anonymous on To cheer you up in difficult t… Gil Kalai on To cheer you up in difficult t… Anonymous for the th… on To cheer you up in difficult t… Yuval Rabani on A Proof by Induction with a… Gil Kalai on To cheer you up in difficult t…
Tag Archives: Flag complexes
Karim Adiprasito: Flag simplicial complexes and the non-revisiting path conjecture (A combinatorial proof of the Adiprasito-Benedetti theorem.)
This post is authored by Karim Adiprasito The past months have seen some exciting progress on diameter bounds for polytopes and polytopal complexes, both in the negative and in the positive direction. Jesus de Loera and Steve Klee described simplicial polytopes which are not … Continue reading
Posted in Convex polytopes, Guest blogger
Tagged Convex polytopes, Flag complexes, Hirsch conjecture, Karim Adiprasito
Leave a comment
