This is ``poly.x'': computing data of a polytope P Usage: poly.x [-] [in-file [out-file]] Options (concatenate any number of them into ): h print this information | n do not complete polytope or f use as filter | calculate Hodge numbers g general output: | i incidence information P reflexive: numbers of (dual) | s check for span property points/vertices, Hodge numbers | (only if P from CWS) P not reflexive: numbers of | I check for IP property points, vertices, equations | S number of symmetries p points of P | T upper triangular form v vertices of P | N normal form e equations of P/vertices of P-dual | t traced normal form computation m pairing matrix between vertices | V IP simplices among vertices of P* and equations | P IP simplices among points of P* d points of P-dual | (with 1<=codim<=# when # is set) (only if P reflexive) | Z lattice quotients for IP simplices a all of the above except h,f | # #=1,2,3 fibers spanned by IP l LG-`Hodge numbers' from single | simplices with codim<=# weight input | ## ##=11,22,33,(12,23): all (fibered) r ignore non-reflexive input | fibers with specified codim(s) D dual polytope as input (ref only) | when combined: ### = (##)# Input: degrees and weights `d1 w11 w12 ... d2 w21 w22 ...' or `d np' or `np d' (d=Dimension, np=#[points]) and (after newline) np*d coordinates Output: as specified by options