This project contains the source code for replicating the numerical evidence showcased in the author's paper "Even-carry polynomials and cohomology of the incidence correspondence in positive characteristic" (see arxiv:2404.04166). It contains the following files:
-
print.m2: Helper code for formatting pictures of symmetric polynomials. -
S.m2: Basic methods for symmetric polynomials. -
h0.m2: Computes$K(d,e)$ by the method given in Proposition 2.2. -
prim.m2: Computes primitive cohomology$K(d,e)^{\mathrm{prim}}$ as described in Section 4.1. -
tiles.m2: Explores tiles and produces the tables in Section 4.2. -
general.m2: Explores the questions asked in Section 4.3.
Each of these files automatically loads all the preceding ones, except that the last two are independent. So you can launch M2 in the directory where you downloaded this project and run:
load("tiles.m2")
load("general.m2")
Some examples of usage follow.
To display a particular
graph kappa(2,5)
To display all
allKappa(emax => 10)
To compute an individual coefficient of
h0b(2,5,{1,2,3})
H0b(2,5,{1,2,3})
Note: The values of S.m2. By default, S.m2, or use the updatenp routine, e.g.
n = 4
p = 2
updatenp()
To separate
graph kappa(3,4)
graph nonprim(3,4)
graph primChar(3,4)
To print a table of primitive characters (like Table 1):
primTable(dif => 1, mmax => 10)
To print a table of conjectured primitive characters, assuming certain structural hypotheses that are weakened versions of Conjectures 4.7 and 4.9:
primGuessTable(dif => 1, mmax => 10)
To check that these guesses are correct:
primTestAll(dif => 1, mmax => 10)
To find tiles (as in Tables 2, 3, 4):
mineTiles(nmin => 3, nmax => 4, pmax => 7, mmax => 15)
The contents of this file are more more speculative. To guess
testAll(emax => 15)
testEdge(emax => 30)
If you use jEdit to edit code, please check out my syntax highlighting modes for MAGMA and Macaulay2.
Written with StackEdit.