some problem writeupz: dejongproblems11.pdf

Fixed! The following script lists the distinct lines in P3 over Z/pZ for any p, although it is extremely slow. The case p=2 takes a few seconds to enumerate but p=3 took almost half an hour. There is also code that utilizes this to hunt for cubics with 27 lines over Z/pZ…I'll let this run overnight and see how this goes. Thanks to Rankeya as I recycled his code that enumerated parameterizations of lines in P3. I added code that checked whether lines were equivalent modulo an action of GL2(Z/pZ) and a brute force algorithm to list distinct lines under this relation: findlinescubic1.gp

john.txt · Last modified: 2012/06/15 01:25 by john
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki