I was wondering if there is an efficient implementation of an algorithm to find all bistellar flips of a given triangulation of a polytope in polymake.
The polytope I have in mind is an empty lattice polytope.
Is there a way to check if two fans have the same support?
The fans I am interested are pure and full-dimensional.
One could take a common refinement, and then check if both fans are subdivisions of the common refinement. But I don't know how to check if one fan is a subdivision of another ...
I guess my question is: Is there a way to give the "det" function in polymake an alias so that I can call it, even though "det" in pdl has the same name?
That said, here is (the relevant pieces) of my code. First I have a function that computes multiplicity using polymake's "det" function
I have written a script that uses pdl to do some linear algebra computations. In the same script, I'm trying to do a linear algebra computation using the matrix class in polymake.
The issue I'm encountering is that when I apply det to a polymake matrix, it does the pdl det and gives an error ...
If I have a (in my case unbounded) polytope, then I can compute the normal fan using normal_fan. Then there is an inclusion-reversing correspondence between the cones of the normal fan and the faces of the polytope.
Given a cone of the normal fan, I would like to find the corresponding face of the ...
In case this helps anyone else, I think the issue was that for some reason the homebrew installation of ninja wasn't working properly. After I manually installed it, everything compiled without a problem.