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
Bug in the ppl backend of polyhedron #27840
Comments
comment:1
Interesting. Here the heuristic that guesses the parent and base ring goes wrong. If one passes |
comment:2
What should be done? Set Do you have any idea why PPL prefers a presentation with vertices with non-trivial denominators? |
Author: Matthias Koeppe |
Commit: |
New commits:
|
Reviewer: Vincent Delecroix |
comment:5
Failures in
(see patchbot report) I believe that when the polytope is a cone (namely with a unique vertex at 0) then everything should be fine. No? Don't we want Also, the constructor should be tested when the user enforces |
comment:8
I like more this less intrusive version. Though it is a pity that the second commit cancels some edits of the first... |
comment:10
Replying to @videlec:
I've squashed the two commits. |
comment:11
Nice Thx. |
Changed branch from u/mkoeppe/bug_in_the_ppl_backend_of_polyhedron to |
The following line throws a conversion error only with the (default) backend
ppl
:Replacing the backend by any other goes through without problems.
CC: @mkoeppe @videlec @tscrim
Component: geometry
Keywords: polytopes, ppl
Author: Matthias Koeppe
Branch/Commit:
17895a6
Reviewer: Vincent Delecroix
Issue created by migration from https://trac.sagemath.org/ticket/27840
The text was updated successfully, but these errors were encountered: