Base class for polyhedra: Methods regarding the combinatorics of a polyhedron#
Excluding methods relying on sage.graphs
.
- class sage.geometry.polyhedron.base3.Polyhedron_base3(parent, Vrep, Hrep, Vrep_minimal=None, Hrep_minimal=None, pref_rep=None, mutable=False, **kwds)#
Bases:
sage.geometry.polyhedron.base2.Polyhedron_base2
Methods related to the combinatorics of a polyhedron.
See
sage.geometry.polyhedron.base.Polyhedron_base
.- a_maximal_chain()#
Return a maximal chain of the face lattice in increasing order.
EXAMPLES:
sage: P = polytopes.cube() sage: P.a_maximal_chain() [A -1-dimensional face of a Polyhedron in ZZ^3, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 3-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 8 vertices] sage: P = polytopes.cube() sage: chain = P.a_maximal_chain(); chain [A -1-dimensional face of a Polyhedron in ZZ^3, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 3-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 8 vertices] sage: [face.ambient_V_indices() for face in chain] [(), (5,), (0, 5), (0, 3, 4, 5), (0, 1, 2, 3, 4, 5, 6, 7)]
- adjacency_matrix(algorithm=None)#
Return the binary matrix of vertex adjacencies.
INPUT:
algorithm
– string (optional); specify whether the face generator starts with facets or vertices:'primal'
– start with the facets'dual'
– start with the verticesNone
– choose automatically
EXAMPLES:
sage: polytopes.simplex(4).vertex_adjacency_matrix() [0 1 1 1 1] [1 0 1 1 1] [1 1 0 1 1] [1 1 1 0 1] [1 1 1 1 0]
The rows and columns of the vertex adjacency matrix correspond to the
Vrepresentation()
objects: vertices, rays, and lines. The \((i,j)\) matrix entry equals \(1\) if the \(i\)-th and \(j\)-th V-representation object are adjacent.Two vertices are adjacent if they are the endpoints of an edge, that is, a one-dimensional face. For unbounded polyhedra this clearly needs to be generalized and we define two V-representation objects (see
sage.geometry.polyhedron.constructor
) to be adjacent if they together generate a one-face. There are three possible combinations:Two vertices can bound a finite-length edge.
A vertex and a ray can generate a half-infinite edge starting at the vertex and with the direction given by the ray.
A vertex and a line can generate an infinite edge. The position of the vertex on the line is arbitrary in this case, only its transverse position matters. The direction of the edge is given by the line generator.
For example, take the half-plane:
sage: half_plane = Polyhedron(ieqs=[(0,1,0)]) sage: half_plane.Hrepresentation() (An inequality (1, 0) x + 0 >= 0,)
Its (non-unique) V-representation consists of a vertex, a ray, and a line. The only edge is spanned by the vertex and the line generator, so they are adjacent:
sage: half_plane.Vrepresentation() (A line in the direction (0, 1), A ray in the direction (1, 0), A vertex at (0, 0)) sage: half_plane.vertex_adjacency_matrix() [0 0 1] [0 0 0] [1 0 0]
In one dimension higher, that is for a half-space in 3 dimensions, there is no one-dimensional face. Hence nothing is adjacent:
sage: Polyhedron(ieqs=[(0,1,0,0)]).vertex_adjacency_matrix() [0 0 0 0] [0 0 0 0] [0 0 0 0] [0 0 0 0]
EXAMPLES:
In a bounded polygon, every vertex has precisely two adjacent ones:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 1) A vertex at (0, 1) (1, 0, 1, 0) A vertex at (1, 0) (0, 1, 0, 1) A vertex at (3, 0) (1, 0, 1, 0) A vertex at (4, 1)
If the V-representation of the polygon contains vertices and one ray, then each V-representation object is adjacent to two V-representation objects:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)], ....: rays=[(0,1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 0, 1) A ray in the direction (0, 1) (1, 0, 1, 0, 0) A vertex at (0, 1) (0, 1, 0, 1, 0) A vertex at (1, 0) (0, 0, 1, 0, 1) A vertex at (3, 0) (1, 0, 0, 1, 0) A vertex at (4, 1)
If the V-representation of the polygon contains vertices and two distinct rays, then each vertex is adjacent to two V-representation objects (which can now be vertices or rays). The two rays are not adjacent to each other:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)], ....: rays=[(0,1), (1,1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 0, 0) A ray in the direction (0, 1) (1, 0, 1, 0, 0) A vertex at (0, 1) (0, 1, 0, 0, 1) A vertex at (1, 0) (0, 0, 0, 0, 1) A ray in the direction (1, 1) (0, 0, 1, 1, 0) A vertex at (3, 0)
The vertex adjacency matrix has base ring integers. This way one can express various counting questions:
sage: P = polytopes.cube() sage: Q = P.stack(P.faces(2)[0]) sage: M = Q.vertex_adjacency_matrix() sage: sum(M) (4, 4, 3, 3, 4, 4, 4, 3, 3) sage: G = Q.vertex_graph() # optional - sage.graphs sage: G.degree() # optional - sage.graphs [4, 4, 3, 3, 4, 4, 4, 3, 3]
- bounded_edges()#
Return the bounded edges (excluding rays and lines).
OUTPUT:
A generator for pairs of vertices, one pair per edge.
EXAMPLES:
sage: p = Polyhedron(vertices=[[1,0],[0,1]], rays=[[1,0],[0,1]]) sage: [ e for e in p.bounded_edges() ] [(A vertex at (0, 1), A vertex at (1, 0))] sage: for e in p.bounded_edges(): print(e) (A vertex at (0, 1), A vertex at (1, 0))
- combinatorial_polyhedron()#
Return the combinatorial type of
self
.See
sage.geometry.polyhedron.combinatorial_polyhedron.base.CombinatorialPolyhedron
.EXAMPLES:
sage: polytopes.cube().combinatorial_polyhedron() A 3-dimensional combinatorial polyhedron with 6 facets sage: polytopes.cyclic_polytope(4,10).combinatorial_polyhedron() A 4-dimensional combinatorial polyhedron with 35 facets sage: Polyhedron(rays=[[0,1], [1,0]]).combinatorial_polyhedron() A 2-dimensional combinatorial polyhedron with 2 facets
- f_vector(num_threads=None, parallelization_depth=None, algorithm=None)#
Return the f-vector.
INPUT:
num_threads
– integer (optional); specify the number of threads; otherwise determined byncpus()
parallelization_depth
– integer (optional); specify how deep in the lattice the parallelization is donealgorithm
– string (optional); specify whether the face generator starts with facets or vertices:'primal'
– start with the facets'dual'
– start with the verticesNone
– choose automatically
OUTPUT:
Return a vector whose \(i\)-th entry is the number of \(i-2\)-dimensional faces of the polytope.
Note
The
vertices
as given byvertices()
do not need to correspond to \(0\)-dimensional faces. If a polyhedron contains \(k\) lines they correspond to \(k\)-dimensional faces. See example below.EXAMPLES:
sage: p = Polyhedron(vertices=[[1, 2, 3], [1, 3, 2], ....: [2, 1, 3], [2, 3, 1], [3, 1, 2], [3, 2, 1], [0, 0, 0]]) sage: p.f_vector() (1, 7, 12, 7, 1) sage: polytopes.cyclic_polytope(4,10).f_vector() (1, 10, 45, 70, 35, 1) sage: polytopes.hypercube(5).f_vector() (1, 32, 80, 80, 40, 10, 1)
Polyhedra with lines do not have \(0\)-faces:
sage: Polyhedron(ieqs=[[1,-1,0,0],[1,1,0,0]]).f_vector() (1, 0, 0, 2, 1)
However, the method
Polyhedron_base.vertices()
returns two points that belong to theVrepresentation
:sage: P = Polyhedron(ieqs=[[1,-1,0],[1,1,0]]) sage: P.vertices() (A vertex at (1, 0), A vertex at (-1, 0)) sage: P.f_vector() (1, 0, 2, 1)
- face_generator(face_dimension=None, algorithm=None, **kwds)#
Return an iterator over the faces of given dimension.
If dimension is not specified return an iterator over all faces.
INPUT:
face_dimension
– integer (defaultNone
), yield only faces of this dimension if specifiedalgorithm
– string (optional); specify whether to start with facets or vertices:'primal'
– start with the facets'dual'
– start with the verticesNone
– choose automatically
OUTPUT:
A
FaceIterator_geom
. This class iterates over faces asPolyhedronFace
. Seeface
for details. The order is random but fixed.EXAMPLES:
sage: P = polytopes.cube() sage: it = P.face_generator() sage: it Iterator over the faces of a 3-dimensional polyhedron in ZZ^3 sage: list(it) [A 3-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 8 vertices, A -1-dimensional face of a Polyhedron in ZZ^3, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices] sage: P = polytopes.hypercube(4) sage: list(P.face_generator(2))[:4] [A 2-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 4 vertices, A 2-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 4 vertices]
If a polytope has more facets than vertices, the dual mode is chosen:
sage: P = polytopes.cross_polytope(3) sage: list(P.face_generator()) [A 3-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 6 vertices, A -1-dimensional face of a Polyhedron in ZZ^3, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices, A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 3 vertices, A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices]
The face iterator can also be slightly modified. In non-dual mode we can skip subfaces of the current (proper) face:
sage: P = polytopes.cube() sage: it = P.face_generator(algorithm='primal') sage: _ = next(it), next(it) sage: face = next(it) sage: face.ambient_H_indices() (5,) sage: it.ignore_subfaces() sage: face = next(it) sage: face.ambient_H_indices() (4,) sage: it.ignore_subfaces() sage: [face.ambient_H_indices() for face in it] [(3,), (2,), (1,), (0,), (2, 3), (1, 3), (1, 2, 3), (1, 2), (0, 2), (0, 1, 2), (0, 1)]
In dual mode we can skip supfaces of the current (proper) face:
sage: P = polytopes.cube() sage: it = P.face_generator(algorithm='dual') sage: _ = next(it), next(it) sage: face = next(it) sage: face.ambient_V_indices() (7,) sage: it.ignore_supfaces() sage: next(it) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: face = next(it) sage: face.ambient_V_indices() (5,) sage: it.ignore_supfaces() sage: [face.ambient_V_indices() for face in it] [(4,), (3,), (2,), (1,), (0,), (1, 6), (3, 4), (2, 3), (0, 3), (0, 1, 2, 3), (1, 2), (0, 1)]
In non-dual mode, we cannot skip supfaces:
sage: it = P.face_generator(algorithm='primal') sage: _ = next(it), next(it) sage: next(it) A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: it.ignore_supfaces() Traceback (most recent call last): ... ValueError: only possible when in dual mode
In dual mode, we cannot skip subfaces:
sage: it = P.face_generator(algorithm='dual') sage: _ = next(it), next(it) sage: next(it) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: it.ignore_subfaces() Traceback (most recent call last): ... ValueError: only possible when not in dual mode
We can only skip sub-/supfaces of proper faces:
sage: it = P.face_generator(algorithm='primal') sage: next(it) A 3-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 8 vertices sage: it.ignore_subfaces() Traceback (most recent call last): ... ValueError: iterator not set to a face yet
See also
ALGORITHM:
See
FaceIterator
.
- faces(face_dimension)#
Return the faces of given dimension
INPUT:
face_dimension
– integer. The dimension of the faces whose representation will be returned.
OUTPUT:
A tuple of
PolyhedronFace
. See modulesage.geometry.polyhedron.face
for details. The order is random but fixed.See also
face_generator()
,facet()
.EXAMPLES:
Here we find the vertex and face indices of the eight three-dimensional facets of the four-dimensional hypercube:
sage: p = polytopes.hypercube(4) sage: list(f.ambient_V_indices() for f in p.faces(3)) [(0, 5, 6, 7, 8, 9, 14, 15), (1, 4, 5, 6, 10, 13, 14, 15), (1, 2, 6, 7, 8, 10, 11, 15), (8, 9, 10, 11, 12, 13, 14, 15), (0, 3, 4, 5, 9, 12, 13, 14), (0, 2, 3, 7, 8, 9, 11, 12), (1, 2, 3, 4, 10, 11, 12, 13), (0, 1, 2, 3, 4, 5, 6, 7)] sage: face = p.faces(3)[3] sage: face.ambient_Hrepresentation() (An inequality (1, 0, 0, 0) x + 1 >= 0,) sage: face.vertices() (A vertex at (-1, -1, 1, -1), A vertex at (-1, -1, 1, 1), A vertex at (-1, 1, -1, -1), A vertex at (-1, 1, 1, -1), A vertex at (-1, 1, 1, 1), A vertex at (-1, 1, -1, 1), A vertex at (-1, -1, -1, 1), A vertex at (-1, -1, -1, -1))
You can use the
index()
method to enumerate vertices and inequalities:sage: def get_idx(rep): return rep.index() sage: [get_idx(_) for _ in face.ambient_Hrepresentation()] [4] sage: [get_idx(_) for _ in face.ambient_Vrepresentation()] [8, 9, 10, 11, 12, 13, 14, 15] sage: [ ([get_idx(_) for _ in face.ambient_Vrepresentation()], ....: [get_idx(_) for _ in face.ambient_Hrepresentation()]) ....: for face in p.faces(3) ] [([0, 5, 6, 7, 8, 9, 14, 15], [7]), ([1, 4, 5, 6, 10, 13, 14, 15], [6]), ([1, 2, 6, 7, 8, 10, 11, 15], [5]), ([8, 9, 10, 11, 12, 13, 14, 15], [4]), ([0, 3, 4, 5, 9, 12, 13, 14], [3]), ([0, 2, 3, 7, 8, 9, 11, 12], [2]), ([1, 2, 3, 4, 10, 11, 12, 13], [1]), ([0, 1, 2, 3, 4, 5, 6, 7], [0])]
- facet_adjacency_matrix(algorithm=None)#
Return the adjacency matrix for the facets.
INPUT:
algorithm
– string (optional); specify whether the face generator starts with facets or vertices:'primal'
– start with the facets'dual'
– start with the verticesNone
– choose automatically
EXAMPLES:
sage: s4 = polytopes.simplex(4, project=True) sage: s4.facet_adjacency_matrix() [0 1 1 1 1] [1 0 1 1 1] [1 1 0 1 1] [1 1 1 0 1] [1 1 1 1 0] sage: p = Polyhedron(vertices=[(0,0),(1,0),(0,1)]) sage: p.facet_adjacency_matrix() [0 1 1] [1 0 1] [1 1 0]
The facet adjacency matrix has base ring integers. This way one can express various counting questions:
sage: P = polytopes.cube() sage: Q = P.stack(P.faces(2)[0]) sage: M = Q.facet_adjacency_matrix() sage: sum(M) (4, 4, 4, 4, 3, 3, 3, 3, 4)
- facets()#
Return the facets of the polyhedron.
Facets are the maximal nontrivial faces of polyhedra. The empty face and the polyhedron itself are trivial.
A facet of a \(d\)-dimensional polyhedron is a face of dimension \(d-1\). For \(d \neq 0\) the converse is true as well.
OUTPUT:
A tuple of
PolyhedronFace
. Seeface
for details. The order is random but fixed.See also
EXAMPLES:
Here we find the eight three-dimensional facets of the four-dimensional hypercube:
sage: p = polytopes.hypercube(4) sage: p.facets() (A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices)
This is the same result as explicitly finding the three-dimensional faces:
sage: dim = p.dimension() sage: p.faces(dim-1) (A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices, A 3-dimensional face of a Polyhedron in ZZ^4 defined as the convex hull of 8 vertices)
The
0
-dimensional polyhedron does not have facets:sage: P = Polyhedron([[0]]) sage: P.facets() ()
- greatest_common_subface_of_Hrep(*Hrepresentatives)#
Return the largest face that is contained in
Hrepresentatives
.INPUT:
Hrepresentatives
– facets or indices of Hrepresentatives; the indices are assumed to be the indices of theHrepresentation()
OUTPUT: a
PolyhedronFace
EXAMPLES:
sage: P = polytopes.permutahedron(5) sage: P.meet_of_Hrep() A 4-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 120 vertices sage: P.meet_of_Hrep(1) A 3-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 24 vertices sage: P.meet_of_Hrep(4) A 3-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 12 vertices sage: P.meet_of_Hrep(1,3,7) A 1-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 2 vertices sage: P.meet_of_Hrep(1,3,7).ambient_H_indices() (0, 1, 3, 7)
The indices are the indices of the
Hrepresentation()
.0
corresponds to an equation and is ignored:sage: P.meet_of_Hrep(0) A 4-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 120 vertices
The input is flexible:
sage: P.meet_of_Hrep(P.facets()[-1], P.inequalities()[2], 7) A 1-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 2 vertices
The
Hrepresentatives
must belong toself
:sage: P = polytopes.cube(backend='ppl') sage: Q = polytopes.cube(backend='field') sage: f = P.facets()[0] sage: P.meet_of_Hrep(f) A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: Q.meet_of_Hrep(f) Traceback (most recent call last): ... ValueError: not a facet of ``self`` sage: f = P.inequalities()[0] sage: P.meet_of_Hrep(f) A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: Q.meet_of_Hrep(f) Traceback (most recent call last): ... ValueError: not a facet of ``self``
- incidence_matrix()#
Return the incidence matrix.
Note
The columns correspond to inequalities/equations in the order
Hrepresentation()
, the rows correspond to vertices/rays/lines in the orderVrepresentation()
.See also
EXAMPLES:
sage: p = polytopes.cuboctahedron() sage: p.incidence_matrix() [0 0 1 1 0 1 0 0 0 0 1 0 0 0] [0 0 0 1 0 0 1 0 1 0 1 0 0 0] [0 0 1 1 1 0 0 1 0 0 0 0 0 0] [1 0 0 1 1 0 1 0 0 0 0 0 0 0] [0 0 0 0 0 1 0 0 1 1 1 0 0 0] [0 0 1 0 0 1 0 1 0 0 0 1 0 0] [1 0 0 0 0 0 1 0 1 0 0 0 1 0] [1 0 0 0 1 0 0 1 0 0 0 0 0 1] [0 1 0 0 0 1 0 0 0 1 0 1 0 0] [0 1 0 0 0 0 0 0 1 1 0 0 1 0] [0 1 0 0 0 0 0 1 0 0 0 1 0 1] [1 1 0 0 0 0 0 0 0 0 0 0 1 1] sage: v = p.Vrepresentation(0) sage: v A vertex at (-1, -1, 0) sage: h = p.Hrepresentation(2) sage: h An inequality (1, 1, -1) x + 2 >= 0 sage: h.eval(v) # evaluation (1, 1, -1) * (-1/2, -1/2, 0) + 1 0 sage: h*v # same as h.eval(v) 0 sage: p.incidence_matrix() [0,2] # this entry is (v,h) 1 sage: h.contains(v) True sage: p.incidence_matrix() [2,0] # note: not symmetric 0
The incidence matrix depends on the ambient dimension:
sage: simplex = polytopes.simplex(); simplex A 3-dimensional polyhedron in ZZ^4 defined as the convex hull of 4 vertices sage: simplex.incidence_matrix() [1 1 1 1 0] [1 1 1 0 1] [1 1 0 1 1] [1 0 1 1 1] sage: simplex = simplex.affine_hull_projection(); simplex A 3-dimensional polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: simplex.incidence_matrix() [1 1 1 0] [1 1 0 1] [1 0 1 1] [0 1 1 1]
An incidence matrix does not determine a unique polyhedron:
sage: P = Polyhedron(vertices=[[0,1],[1,1],[1,0]]) sage: P.incidence_matrix() [1 1 0] [1 0 1] [0 1 1] sage: Q = Polyhedron(vertices=[[0,1], [1,0]], rays=[[1,1]]) sage: Q.incidence_matrix() [1 1 0] [1 0 1] [0 1 1]
An example of two polyhedra with isomorphic face lattices but different incidence matrices:
sage: Q.incidence_matrix() [1 1 0] [1 0 1] [0 1 1] sage: R = Polyhedron(vertices=[[0,1], [1,0]], rays=[[1,3/2], [3/2,1]]) sage: R.incidence_matrix() [1 1 0] [1 0 1] [0 1 0] [0 0 1]
The incidence matrix has base ring integers. This way one can express various counting questions:
sage: P = polytopes.twenty_four_cell() sage: M = P.incidence_matrix() sage: sum(sum(x) for x in M) == P.flag_f_vector(0, 3) # optional - sage.combinat True
- is_bipyramid(certificate=False)#
Test whether the polytope is combinatorially equivalent to a bipyramid over some polytope.
INPUT:
certificate
– boolean (default:False
); specifies whether to return two vertices of the polytope which are the apices of a bipyramid, if found
OUTPUT:
If
certificate
isTrue
, returns a tuple containing:Boolean.
None
or a tuple containing:The first apex.
The second apex.
If
certificate
isFalse
returns a boolean.EXAMPLES:
sage: P = polytopes.octahedron() sage: P.is_bipyramid() True sage: P.is_bipyramid(certificate=True) (True, [A vertex at (1, 0, 0), A vertex at (-1, 0, 0)]) sage: Q = polytopes.cyclic_polytope(3,7) sage: Q.is_bipyramid() False sage: R = Q.bipyramid() sage: R.is_bipyramid(certificate=True) (True, [A vertex at (1, 3, 13, 63), A vertex at (-1, 3, 13, 63)])
- is_lawrence_polytope()#
Return
True
ifself
is a Lawrence polytope.A polytope is called a Lawrence polytope if it has a centrally symmetric (normalized) Gale diagram.
EXAMPLES:
sage: P = polytopes.hypersimplex(5,2) # optional - sage.combinat sage: L = P.lawrence_polytope() # optional - sage.combinat sage: L.is_lattice_polytope() # optional - sage.combinat True sage: egyptian_pyramid = polytopes.regular_polygon(4).pyramid() # optional - sage.number_field sage: egyptian_pyramid.is_lawrence_polytope() # optional - sage.number_field True sage: polytopes.octahedron().is_lawrence_polytope() False
REFERENCES:
For more information, see [BaSt1990].
- is_neighborly(k=None)#
Return whether the polyhedron is neighborly.
If the input
k
is provided, then return whether the polyhedron isk
-neighborlyA polyhedron is neighborly if every set of \(n\) vertices forms a face for \(n\) up to floor of half the dimension of the polyhedron. It is \(k\)-neighborly if this is true for \(n\) up to \(k\).
INPUT:
k
– the dimension up to which to check if every set ofk
vertices forms a face. If nok
is provided, check up to floor of half the dimension of the polyhedron.
OUTPUT:
True
if every set of up tok
vertices forms a face,False
otherwise
See also
EXAMPLES:
sage: cube = polytopes.hypercube(3) sage: cube.is_neighborly() True sage: cube = polytopes.hypercube(4) sage: cube.is_neighborly() False
Cyclic polytopes are neighborly:
sage: all(polytopes.cyclic_polytope(i, i + 1 + j).is_neighborly() for i in range(5) for j in range(3)) True
The neighborliness of a polyhedron equals floor of dimension half (or larger in case of a simplex) if and only if the polyhedron is neighborly:
sage: testpolys = [polytopes.cube(), polytopes.cyclic_polytope(6, 9), polytopes.simplex(6)] sage: [(P.neighborliness() >= P.dim() // 2) == P.is_neighborly() for P in testpolys] [True, True, True]
- is_prism(certificate=False)#
Test whether the polytope is combinatorially equivalent to a prism of some polytope.
INPUT:
certificate
– boolean (default:False
); specifies whether to return two facets of the polytope which are the bases of a prism, if found
OUTPUT:
If
certificate
isTrue
, returns a tuple containing:Boolean.
None
or a tuple containing:List of the vertices of the first base facet.
List of the vertices of the second base facet.
If
certificate
isFalse
returns a boolean.EXAMPLES:
sage: P = polytopes.cube() sage: P.is_prism() True sage: P.is_prism(certificate=True) (True, [(A vertex at (1, -1, -1), A vertex at (1, -1, 1), A vertex at (-1, -1, 1), A vertex at (-1, -1, -1)), (A vertex at (1, 1, -1), A vertex at (1, 1, 1), A vertex at (-1, 1, -1), A vertex at (-1, 1, 1))]) sage: Q = polytopes.cyclic_polytope(3,8) sage: Q.is_prism() False sage: R = Q.prism() sage: R.is_prism(certificate=True) (True, [(A vertex at (0, 3, 9, 27), A vertex at (0, 6, 36, 216), A vertex at (0, 0, 0, 0), A vertex at (0, 7, 49, 343), A vertex at (0, 5, 25, 125), A vertex at (0, 1, 1, 1), A vertex at (0, 2, 4, 8), A vertex at (0, 4, 16, 64)), (A vertex at (1, 6, 36, 216), A vertex at (1, 0, 0, 0), A vertex at (1, 7, 49, 343), A vertex at (1, 5, 25, 125), A vertex at (1, 1, 1, 1), A vertex at (1, 2, 4, 8), A vertex at (1, 4, 16, 64), A vertex at (1, 3, 9, 27))])
- is_pyramid(certificate=False)#
Test whether the polytope is a pyramid over one of its facets.
INPUT:
certificate
– boolean (default:False
); specifies whether to return a vertex of the polytope which is the apex of a pyramid, if found
OUTPUT:
If
certificate
isTrue
, returns a tuple containing:Boolean.
The apex of the pyramid or
None
.
If
certificate
isFalse
returns a boolean.EXAMPLES:
sage: P = polytopes.simplex(3) sage: P.is_pyramid() True sage: P.is_pyramid(certificate=True) (True, A vertex at (1, 0, 0, 0)) sage: egyptian_pyramid = polytopes.regular_polygon(4).pyramid() # optional - sage.rings.number_field sage: egyptian_pyramid.is_pyramid() # optional - sage.rings.number_field True sage: Q = polytopes.octahedron() sage: Q.is_pyramid() False
For the \(0\)-dimensional polyhedron, the output is
True
, but it cannot be constructed as a pyramid over the empty polyhedron:sage: P = Polyhedron([[0]]) sage: P.is_pyramid() True sage: Polyhedron().pyramid() Traceback (most recent call last): ... ZeroDivisionError: rational division by zero
- is_simple()#
Test for simplicity of a polytope.
See Wikipedia article Simple_polytope
EXAMPLES:
sage: p = Polyhedron([[0,0,0],[1,0,0],[0,1,0],[0,0,1]]) sage: p.is_simple() True sage: p = Polyhedron([[0,0,0],[4,4,0],[4,0,0],[0,4,0],[2,2,2]]) sage: p.is_simple() False
- is_simplex()#
Return whether the polyhedron is a simplex.
A simplex is a bounded polyhedron with \(d+1\) vertices, where \(d\) is the dimension.
EXAMPLES:
sage: Polyhedron([(0,0,0), (1,0,0), (0,1,0)]).is_simplex() True sage: polytopes.simplex(3).is_simplex() True sage: polytopes.hypercube(3).is_simplex() False
- is_simplicial()#
Tests if the polytope is simplicial
A polytope is simplicial if every facet is a simplex.
See Wikipedia article Simplicial_polytope
EXAMPLES:
sage: p = polytopes.hypercube(3) sage: p.is_simplicial() False sage: q = polytopes.simplex(5, project=True) sage: q.is_simplicial() True sage: p = Polyhedron([[0,0,0],[1,0,0],[0,1,0],[0,0,1]]) sage: p.is_simplicial() True sage: q = Polyhedron([[1,1,1],[-1,1,1],[1,-1,1],[-1,-1,1],[1,1,-1]]) sage: q.is_simplicial() False sage: P = polytopes.simplex(); P A 3-dimensional polyhedron in ZZ^4 defined as the convex hull of 4 vertices sage: P.is_simplicial() True
The method is not implemented for unbounded polyhedra:
sage: p = Polyhedron(vertices=[(0,0)],rays=[(1,0),(0,1)]) sage: p.is_simplicial() Traceback (most recent call last): ... NotImplementedError: this function is implemented for polytopes only
- join_of_Vrep(*Vrepresentatives)#
Return the smallest face that contains
Vrepresentatives
.INPUT:
Vrepresentatives
– vertices/rays/lines ofself
or indices of such
OUTPUT: a
PolyhedronFace
Note
In the case of unbounded polyhedra, the join of rays etc. may not be well-defined.
EXAMPLES:
sage: P = polytopes.permutahedron(5) sage: P.join_of_Vrep(1) A 0-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 1 vertex sage: P.join_of_Vrep() A -1-dimensional face of a Polyhedron in ZZ^5 sage: P.join_of_Vrep(0,12,13).ambient_V_indices() (0, 12, 13, 68)
The input is flexible:
sage: P.join_of_Vrep(2, P.vertices()[3], P.Vrepresentation(4)) A 2-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 6 vertices
sage: P = polytopes.cube() sage: a, b = P.faces(0)[:2] sage: P.join_of_Vrep(a, b) A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices
In the case of an unbounded polyhedron, the join may not be well-defined:
sage: P = Polyhedron(vertices=[[1,0], [0,1]], rays=[[1,1]]) sage: P.join_of_Vrep(0) A 0-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex sage: P.join_of_Vrep(0,1) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 2 vertices sage: P.join_of_Vrep(0,2) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex and 1 ray sage: P.join_of_Vrep(1,2) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex and 1 ray sage: P.join_of_Vrep(2) Traceback (most recent call last): ... ValueError: the join is not well-defined
The
Vrepresentatives
must be ofself
:sage: P = polytopes.cube(backend='ppl') sage: Q = polytopes.cube(backend='field') sage: v = P.vertices()[0] sage: P.join_of_Vrep(v) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: Q.join_of_Vrep(v) Traceback (most recent call last): ... ValueError: not a Vrepresentative of ``self`` sage: f = P.faces(0)[0] sage: P.join_of_Vrep(v) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: Q.join_of_Vrep(v) Traceback (most recent call last): ... ValueError: not a Vrepresentative of ``self``
- least_common_superface_of_Vrep(*Vrepresentatives)#
Return the smallest face that contains
Vrepresentatives
.INPUT:
Vrepresentatives
– vertices/rays/lines ofself
or indices of such
OUTPUT: a
PolyhedronFace
Note
In the case of unbounded polyhedra, the join of rays etc. may not be well-defined.
EXAMPLES:
sage: P = polytopes.permutahedron(5) sage: P.join_of_Vrep(1) A 0-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 1 vertex sage: P.join_of_Vrep() A -1-dimensional face of a Polyhedron in ZZ^5 sage: P.join_of_Vrep(0,12,13).ambient_V_indices() (0, 12, 13, 68)
The input is flexible:
sage: P.join_of_Vrep(2, P.vertices()[3], P.Vrepresentation(4)) A 2-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 6 vertices
sage: P = polytopes.cube() sage: a, b = P.faces(0)[:2] sage: P.join_of_Vrep(a, b) A 1-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 2 vertices
In the case of an unbounded polyhedron, the join may not be well-defined:
sage: P = Polyhedron(vertices=[[1,0], [0,1]], rays=[[1,1]]) sage: P.join_of_Vrep(0) A 0-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex sage: P.join_of_Vrep(0,1) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 2 vertices sage: P.join_of_Vrep(0,2) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex and 1 ray sage: P.join_of_Vrep(1,2) A 1-dimensional face of a Polyhedron in QQ^2 defined as the convex hull of 1 vertex and 1 ray sage: P.join_of_Vrep(2) Traceback (most recent call last): ... ValueError: the join is not well-defined
The
Vrepresentatives
must be ofself
:sage: P = polytopes.cube(backend='ppl') sage: Q = polytopes.cube(backend='field') sage: v = P.vertices()[0] sage: P.join_of_Vrep(v) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: Q.join_of_Vrep(v) Traceback (most recent call last): ... ValueError: not a Vrepresentative of ``self`` sage: f = P.faces(0)[0] sage: P.join_of_Vrep(v) A 0-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 1 vertex sage: Q.join_of_Vrep(v) Traceback (most recent call last): ... ValueError: not a Vrepresentative of ``self``
- meet_of_Hrep(*Hrepresentatives)#
Return the largest face that is contained in
Hrepresentatives
.INPUT:
Hrepresentatives
– facets or indices of Hrepresentatives; the indices are assumed to be the indices of theHrepresentation()
OUTPUT: a
PolyhedronFace
EXAMPLES:
sage: P = polytopes.permutahedron(5) sage: P.meet_of_Hrep() A 4-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 120 vertices sage: P.meet_of_Hrep(1) A 3-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 24 vertices sage: P.meet_of_Hrep(4) A 3-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 12 vertices sage: P.meet_of_Hrep(1,3,7) A 1-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 2 vertices sage: P.meet_of_Hrep(1,3,7).ambient_H_indices() (0, 1, 3, 7)
The indices are the indices of the
Hrepresentation()
.0
corresponds to an equation and is ignored:sage: P.meet_of_Hrep(0) A 4-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 120 vertices
The input is flexible:
sage: P.meet_of_Hrep(P.facets()[-1], P.inequalities()[2], 7) A 1-dimensional face of a Polyhedron in ZZ^5 defined as the convex hull of 2 vertices
The
Hrepresentatives
must belong toself
:sage: P = polytopes.cube(backend='ppl') sage: Q = polytopes.cube(backend='field') sage: f = P.facets()[0] sage: P.meet_of_Hrep(f) A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: Q.meet_of_Hrep(f) Traceback (most recent call last): ... ValueError: not a facet of ``self`` sage: f = P.inequalities()[0] sage: P.meet_of_Hrep(f) A 2-dimensional face of a Polyhedron in ZZ^3 defined as the convex hull of 4 vertices sage: Q.meet_of_Hrep(f) Traceback (most recent call last): ... ValueError: not a facet of ``self``
- neighborliness()#
Return the largest
k
, such that the polyhedron isk
-neighborly.A polyhedron is \(k\)-neighborly if every set of \(n\) vertices forms a face for \(n\) up to \(k\).
In case of the \(d\)-dimensional simplex, it returns \(d + 1\).
See also
EXAMPLES:
sage: cube = polytopes.cube() sage: cube.neighborliness() 1 sage: P = Polyhedron(); P The empty polyhedron in ZZ^0 sage: P.neighborliness() 0 sage: P = Polyhedron([[0]]); P A 0-dimensional polyhedron in ZZ^1 defined as the convex hull of 1 vertex sage: P.neighborliness() 1 sage: S = polytopes.simplex(5); S A 5-dimensional polyhedron in ZZ^6 defined as the convex hull of 6 vertices sage: S.neighborliness() 6 sage: C = polytopes.cyclic_polytope(7,10); C A 7-dimensional polyhedron in QQ^7 defined as the convex hull of 10 vertices sage: C.neighborliness() 3 sage: C = polytopes.cyclic_polytope(6,11); C A 6-dimensional polyhedron in QQ^6 defined as the convex hull of 11 vertices sage: C.neighborliness() 3 sage: [polytopes.cyclic_polytope(5,n).neighborliness() for n in range(6,10)] [6, 2, 2, 2]
- simpliciality()#
Return the largest integer \(k\) such that the polytope is \(k\)-simplicial.
A polytope is \(k\)-simplicial, if every \(k\)-face is a simplex. If
self
is a simplex, returns its dimension.EXAMPLES:
sage: polytopes.cyclic_polytope(10,4).simpliciality() 3 sage: polytopes.hypersimplex(5,2).simpliciality() # optional - sage.combinat 2 sage: polytopes.cross_polytope(4).simpliciality() 3 sage: polytopes.simplex(3).simpliciality() 3 sage: polytopes.simplex(1).simpliciality() 1
The method is not implemented for unbounded polyhedra:
sage: p = Polyhedron(vertices=[(0,0)],rays=[(1,0),(0,1)]) sage: p.simpliciality() Traceback (most recent call last): ... NotImplementedError: this function is implemented for polytopes only
- simplicity()#
Return the largest integer \(k\) such that the polytope is \(k\)-simple.
A polytope \(P\) is \(k\)-simple, if every \((d-1-k)\)-face is contained in exactly \(k+1\) facets of \(P\) for \(1 \leq k \leq d-1\). Equivalently it is \(k\)-simple if the polar/dual polytope is \(k\)-simplicial. If
self
is a simplex, it returns its dimension.EXAMPLES:
sage: polytopes.hypersimplex(4,2).simplicity() # optional - sage.combinat 1 sage: polytopes.hypersimplex(5,2).simplicity() # optional - sage.combinat 2 sage: polytopes.hypersimplex(6,2).simplicity() # optional - sage.combinat 3 sage: polytopes.simplex(3).simplicity() 3 sage: polytopes.simplex(1).simplicity() 1
The method is not implemented for unbounded polyhedra:
sage: p = Polyhedron(vertices=[(0,0)],rays=[(1,0),(0,1)]) sage: p.simplicity() Traceback (most recent call last): ... NotImplementedError: this function is implemented for polytopes only
- slack_matrix()#
Return the slack matrix.
The entries correspond to the evaluation of the Hrepresentation elements on the Vrepresentation elements.
Note
The columns correspond to inequalities/equations in the order
Hrepresentation()
, the rows correspond to vertices/rays/lines in the orderVrepresentation()
.See also
EXAMPLES:
sage: P = polytopes.cube() sage: P.slack_matrix() [0 2 2 2 0 0] [0 0 2 2 0 2] [0 0 0 2 2 2] [0 2 0 2 2 0] [2 2 0 0 2 0] [2 2 2 0 0 0] [2 0 2 0 0 2] [2 0 0 0 2 2] sage: P = polytopes.cube(intervals='zero_one') sage: P.slack_matrix() [0 1 1 1 0 0] [0 0 1 1 0 1] [0 0 0 1 1 1] [0 1 0 1 1 0] [1 1 0 0 1 0] [1 1 1 0 0 0] [1 0 1 0 0 1] [1 0 0 0 1 1] sage: P = polytopes.dodecahedron().faces(2)[0].as_polyhedron() sage: P.slack_matrix() [1/2*sqrt5 - 1/2 0 0 1 1/2*sqrt5 - 1/2 0] [ 0 0 1/2*sqrt5 - 1/2 1/2*sqrt5 - 1/2 1 0] [ 0 1/2*sqrt5 - 1/2 1 0 1/2*sqrt5 - 1/2 0] [ 1 1/2*sqrt5 - 1/2 0 1/2*sqrt5 - 1/2 0 0] [1/2*sqrt5 - 1/2 1 1/2*sqrt5 - 1/2 0 0 0] sage: P = Polyhedron(rays=[[1, 0], [0, 1]]) sage: P.slack_matrix() [0 0] [0 1] [1 0]
- vertex_adjacency_matrix(algorithm=None)#
Return the binary matrix of vertex adjacencies.
INPUT:
algorithm
– string (optional); specify whether the face generator starts with facets or vertices:'primal'
– start with the facets'dual'
– start with the verticesNone
– choose automatically
EXAMPLES:
sage: polytopes.simplex(4).vertex_adjacency_matrix() [0 1 1 1 1] [1 0 1 1 1] [1 1 0 1 1] [1 1 1 0 1] [1 1 1 1 0]
The rows and columns of the vertex adjacency matrix correspond to the
Vrepresentation()
objects: vertices, rays, and lines. The \((i,j)\) matrix entry equals \(1\) if the \(i\)-th and \(j\)-th V-representation object are adjacent.Two vertices are adjacent if they are the endpoints of an edge, that is, a one-dimensional face. For unbounded polyhedra this clearly needs to be generalized and we define two V-representation objects (see
sage.geometry.polyhedron.constructor
) to be adjacent if they together generate a one-face. There are three possible combinations:Two vertices can bound a finite-length edge.
A vertex and a ray can generate a half-infinite edge starting at the vertex and with the direction given by the ray.
A vertex and a line can generate an infinite edge. The position of the vertex on the line is arbitrary in this case, only its transverse position matters. The direction of the edge is given by the line generator.
For example, take the half-plane:
sage: half_plane = Polyhedron(ieqs=[(0,1,0)]) sage: half_plane.Hrepresentation() (An inequality (1, 0) x + 0 >= 0,)
Its (non-unique) V-representation consists of a vertex, a ray, and a line. The only edge is spanned by the vertex and the line generator, so they are adjacent:
sage: half_plane.Vrepresentation() (A line in the direction (0, 1), A ray in the direction (1, 0), A vertex at (0, 0)) sage: half_plane.vertex_adjacency_matrix() [0 0 1] [0 0 0] [1 0 0]
In one dimension higher, that is for a half-space in 3 dimensions, there is no one-dimensional face. Hence nothing is adjacent:
sage: Polyhedron(ieqs=[(0,1,0,0)]).vertex_adjacency_matrix() [0 0 0 0] [0 0 0 0] [0 0 0 0] [0 0 0 0]
EXAMPLES:
In a bounded polygon, every vertex has precisely two adjacent ones:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 1) A vertex at (0, 1) (1, 0, 1, 0) A vertex at (1, 0) (0, 1, 0, 1) A vertex at (3, 0) (1, 0, 1, 0) A vertex at (4, 1)
If the V-representation of the polygon contains vertices and one ray, then each V-representation object is adjacent to two V-representation objects:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)], ....: rays=[(0,1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 0, 1) A ray in the direction (0, 1) (1, 0, 1, 0, 0) A vertex at (0, 1) (0, 1, 0, 1, 0) A vertex at (1, 0) (0, 0, 1, 0, 1) A vertex at (3, 0) (1, 0, 0, 1, 0) A vertex at (4, 1)
If the V-representation of the polygon contains vertices and two distinct rays, then each vertex is adjacent to two V-representation objects (which can now be vertices or rays). The two rays are not adjacent to each other:
sage: P = Polyhedron(vertices=[(0, 1), (1, 0), (3, 0), (4, 1)], ....: rays=[(0,1), (1,1)]) sage: for v in P.Vrep_generator(): ....: print("{} {}".format(P.adjacency_matrix().row(v.index()), v)) (0, 1, 0, 0, 0) A ray in the direction (0, 1) (1, 0, 1, 0, 0) A vertex at (0, 1) (0, 1, 0, 0, 1) A vertex at (1, 0) (0, 0, 0, 0, 1) A ray in the direction (1, 1) (0, 0, 1, 1, 0) A vertex at (3, 0)
The vertex adjacency matrix has base ring integers. This way one can express various counting questions:
sage: P = polytopes.cube() sage: Q = P.stack(P.faces(2)[0]) sage: M = Q.vertex_adjacency_matrix() sage: sum(M) (4, 4, 3, 3, 4, 4, 4, 3, 3) sage: G = Q.vertex_graph() # optional - sage.graphs sage: G.degree() # optional - sage.graphs [4, 4, 3, 3, 4, 4, 4, 3, 3]