#10148: Automorphism group of a Polyhedron
----------------------------------+-----------------------------------------
Reporter: vbraun | Owner: mhampton
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-feature
Component: geometry | Keywords:
Author: Volker Braun | Upstream: N/A
Reviewer: Andrey Novoseltsev | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Changes (by vbraun):
* status: needs_work => needs_review
Comment:
I'm planning to make `_is_zero`, `_is_nonneg` and `_is_positive` into
overloaded methods when I split up `Polyhedron` into different backends.
But first I wanted to commit the outstanding patches I have.
I'm not sure that labeling the edges with the number of lattice points
restricts to the lattice Euclidean group automatically. Can't you still
map a minimal 2-d triangle, say, to one with an interior point (but no
lattice point on the edges)? Thats of course not a counterexample, but its
not clear to me that that might not happen on faces of higher-dimensional
polyhedra...
Updated patch for 1. and 3. is attached. I've also added a
`combinatorial_automorphism_group()` method to compare with.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10148#comment:12>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
