-
-
Notifications
You must be signed in to change notification settings - Fork 480
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Migrate neighborly to combinatorial polyhedron #29565
Comments
Commit: |
Branch: public/29565 |
New commits:
|
comment:2
- - ``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 |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed branch from public/29565 to public/29565-reb |
Reviewer: Jean-Philippe Labbé |
comment:6
Small coding style: + @cached_method
+ def neighborliness(self):
+ r"""
- Returns the largest ``k``, such that the polyhedron is ``k``-neighborly.
+ Return the largest ``k``, such that the polyhedron is ``k``-neighborly. You can put this on positive review on my behalf once this is fixed. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed reviewer from Jean-Philippe Labbé to Jean-Philippe Labbé, Laith Rastanawi |
Changed branch from public/29565-reb to |
We migrate
is_neighborly
andneighborliness
toCombinatorialPolyhedron
.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
toCombinatorialPolyhedron
and cache the methodsf_vector
andn_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
The text was updated successfully, but these errors were encountered: