Reading through various papers on polytopes I have come across really interesting examples of simplical polytopes and non-shellable (or non-PL) simplicial spheres but sometimes it is hard to keep track of their provenance. The nice thing about the simplicial case is that in order to get the whole combinatorial structure all one needs is the list of the facets. My question:


**Are there any "comprehensive" resources for examples of simplicial polytopes or spheres?**


Here by comprehensive I mean either examples obtained via some construction method or an aggregate of various results in the field. These examples could come in any form I guess, but a simple list of facets would probably be the easiest to work with.


I've been searching around a bit and found the following sources:


* John Palmieri gives an implementation in Sage of a few interesting examples of nonshellable spheres and manifolds [here](http://doc.sagemath.org/html/en/reference/homology/sage/homology/examples.html).
* Frank Lutz gives examples of small non-constructible spheres [here](http://arxiv.org/pdf/math/0309149.pdf) and he also has a few papers enumerating $3$-manifolds with $10$ vertices [here](http://arxiv.org/pdf/math/0604018v2.pdf) and vertex-transitive triangulations (with E. Köhler) [here](http://arxiv.org/abs/math/0506520). Although in the latter $2$ papers the facet-lists are not given.


I am sure there are many other papers that give examples of various interesting triangulations that I am not aware of so even if you do not know of a database of such examples, answering with specific papers would be useful, I think.


Thank you!



"Database" of simplicial polytopes/spheres
You can find Frank Lutz's lists of simplicial spheres (and other manifolds) [here](http://page.math.tu-berlin.de/~lutz/stellar/3-manifolds.html):


Let me shamelessly self-advertise my list of simplicial 4-polytopes with up to $10$ vertices and various families of neighborly polytopes [here](http://page.mi.fu-berlin.de/moritz/polys/inscribe/). I give realization with rational coordinates (inscribed, if possible). You can extract the lists of facets easily from the coordinates. For the simplicial 4-polytopes with 10 vertices I use the same numbering as Frank Lutz uses for the simplicial 3-spheres. Of course some of the spheres are non-realizable ($85\ 878$ to be precise), and then the corresponding number does not appear in my list.


There is an arxiv preprint summarizing the results: [Realizability and inscribability for some simplicial spheres and matroid polytopes](http://arxiv.org/abs/1508.02531).


You might also be interested in the following pages by Hiroyuki Miyata:


* <http://www-imai.is.s.u-tokyo.ac.jp/~hmiyata/oriented_matroids/>
* <https://sites.google.com/site/hmiyata1984/neighborly_polytopes>


and Lukas Finschi's ["Homepage of Oriented Matroids"](http://www.om.math.ethz.ch/).


For (simplicial) 3-dimensional polytopes, it is very very fast to generate the combinatorial types of triangulations using [plantri](https://cs.anu.edu.au/people/Brendan.McKay/plantri/), by Gunnar Brinkmann and Brendan McKay, so there really is no need for a database. (At least for polytopes with a small number of vertices. A database of *"interesting polytopes"* and not *"all polytopes up to a certian number of vertices"* would still be something nice to have)


