Migrate neighborly to combinatorial polyhedron

[kliem]

We migrate is_neighborly and neighborliness to CombinatorialPolyhedron.
It is also faster now, as use the f-vector instead of indirectly getting the number of k-faces.

Along the way we add is_simplex to CombinatorialPolyhedron and cache the methods f_vector and n_vertices.

CC: @jplab @LaisRast

Component: geometry

Keywords: neighborly polytopes

Author: Jonathan Kliem

Branch/Commit: aa535d8

Reviewer: Jean-Philippe Labbé, Laith Rastanawi

Issue created by migration from https://trac.sagemath.org/ticket/29565

[kliem]

Commit: 847740a

[kliem]

Branch: public/29565

[kliem]

New commits:

847740a

migrate neighborly to combinatorial polyhedron

[LaisRast]

comment:2

• I would suggest adding the definitions of "k-neighborly" and "neighborly" instead of referring to Wikipedia.

• The sentence for the d-simplex is not a definition. It is just an example. So why should it be mentioned?

-        - ``True`` if the every set of up to ``k`` vertices forms a face,
+        - ``True`` if every set of up to ``k`` vertices forms a face

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

0f74036

improvements in the documentation

[sagetrac-git]

Changed commit from 847740a to 0f74036