> I presume you can enumerate vertices and facets, >
Unsure on how easy it will be to do this for my use case. > or remove redundant inequalities in a more direct way. > On a case-by-case basis, in principle, yes, this is the approach taken in the particular literature I'm looking at. However, what I really want is the Ehrhart quasi-polynomials for these things, and it would be "best" to automate it completely from the original inequalities, which take a very predictable form. Maybe it will be easiest to use non-strict inequalities, and then subtract off (as Matthias implies) the lower-dimensional equalities. Thanks! -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/217a12f1-88df-401e-9c98-397394110808n%40googlegroups.com.
