Hirsch polytopes with exponentially long combinatorial segments (Q1675265): Difference between revisions

In this article authors give constructions of combinatorial segments (as defined by Adiprasito and Benedetti, these are certain types of paths in dual graphs of pure complexes). Their properties like their maximum lengths, their behavior with respect to the classical operations on the simplicial complexes etc. have been investigated by introducing the notion of monotonic conservative paths. Authors construct monotone conservative paths in banner complexes and give upper bounds for the lengths of these paths. Authors also construct exponentially long monotone conservative paths using the notion of join and one point suspension and give lower bounds for the lengths of these paths. Limitations of combinatorial segments have also been studied using exponentially long combinatorial segments in the normal complexes. Some results of Adiprasito and Benedetti have been re-proved here. The paper is long, technical and difficult to read.