UPDATE (4-Sep-2009):
Fixed a bug in 'format' (a procedure in the 'interpolate' file).
This bug could be exposed only for Z-expressions in which the
term q^-d * Z[f,g,...] maximizing the value of d+nops(indets(f,g,..))
has the form q^-d * Z[]. Thanks to Oliver Schnetz for spotting this.

Also fixed: a few compatibility issues related to the concatenation
operator so that this code will run in recent Maple versions.

                    ------------------------------

Maple programs for counting points on varieties over F_q
related to a conjecture of Kontsevich. 

You should have the following files:

kc_test      programs for testing the Kontsevich conjecture and
             related conjectures.

reduce       a general program for reducing "Z-expressions"--can be
             used to count points on (special) varieties over F_q.

interpolate  a general program for counting points on varieties and
             evaluating Z-expressions over F_q the old-fashioned way
             (one at a time), for specific q. Also uses interpolation
             to fit the data to polynomials, where possible.

All of the above are heavily commented and documented.

kgraphs      lists of candidate graphs for the Kontsevich conjecture.

agraphs      lists of candidate graphs for the symmetric determinant
             version of the Kontsevich conjecture (the apex case).

bigraphs     lists of candidate graphs for the non-symmetric determinant
             analogue of the Kontsevich conjecture. There's a known
             counterexample in here.

blocks       lists of 2-connected graphs (known as blocks).

John Stembridge
22-Nov-1998
Updated 27-Nov-1998, 4-Sep-2009.
jrs@umich.edu