#13525: PALP/Laurent Normal Form
-------------------------------+--------------------------------------------
Reporter: sjg10 | Owner: mhampton
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.4
Component: geometry | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: sjg10 | Merged in:
Dependencies: | Stopgaps:
-------------------------------+--------------------------------------------
Comment (by trehn):
Replying to [comment:7 sjg10]:
> Secondly it is possible, and such was the intent (though I haven't
personally checked this out, but have been told) that checking if a
permutation corresponds to a GL(n,ZZ) transformation is a more hefty
computation than constructing the face lattice. Doing so (especially as it
is decorated with some lattice polytope invariants) and reducing the
number of permutations to check, over just finding the combinatorial
automorphisms and checking all of these may be quicker.
Sorry, I didn't see the lattice index invariants at first. Of course, my
comment is not relevant if your input is "easy". Because you check all
permutations whether they correspond to GL(n,ZZ)-transformations, trying
to keep this number small seems reasonable.
I think that, depending on the polytope, either the size of the face
lattice or the number of group elements will cause problems if you go to
dimensions beyond the PALP limit.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13525#comment:8>
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.
