-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgeneric-initial-ideal
80 lines (57 loc) · 3.08 KB
/
generic-initial-ideal
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
-*- M2 -*-
Title: Generic Initial Ideals
Description:
See Eisenbud's book on Commutative Algebra for the definition, and for
many of the very useful properties of generic initial ideals.
See also:
Green, Mark; Stillman, Michael A tutorial on generic initial ideals. Gröbner
bases and applications (Linz, 1998), 90--108, London Math. Soc. Lecture Note
Ser., 251, Cambridge Univ. Press, Cambridge, 1998.
Bermejo, Isabel; Gimenez, Philippe; Morales, Marcel Castelnuovo-Mumford
regularity of projective monomial varieties of codimension two. J. Symbolic
Comput. 41 (2006), no. 10, 1105-1124.
This is a good "getting started" project. One way to
probabilisitically compute the generic initial ideal of an ideal (with
respect to a term order) is to make a random change of coordinates,
and take the lead term ideal of the resulting ideal.
This is only probabilistic: it could give the wrong answer. One way
around this is to do the above several times, and take a consensus.
The choice of how many times to do it should probably be an optional
argument.
An interesting research project would be to find a method to certify
that one has found the generic initial ideal. One way is to add n^2
variables (if the original polynomial ring has n variables), and to
make the "generic" change of coordinates. Unfortunately, this is often
computationally prohibitive.
There is a rough template for this package already, at
M2/Macaulay2/packages/GenericInitialIdeals.m2,
but it has not been written yet.
Many people would like to see this in M2!
-- remarks from David Eisenbud:
Giulio Caviglia <caviglia@math.berkeley.edu> had some interesting ideas on
implementing generic initial ideals (or was it initial ideals with the same
useful properties?) by "generalizing" one variable at a time, and using a test
for a given one to be general enough -- I'm afraid I don't now remember the
details. Giulio, please fill us in!
If I give you an ideal and assert that the (revlex, say) initial ideal in the
given coords is generic, is there any test to say whether this is so? This
would be a good research project, if not!
A related set of ideas is in an old paper of mine with Bernd Sturmfels: we were
looking for sparse Noether Normalizations -- very similar to looking for sparse
changes of coordinates that would lead to generic, or sufficiently generic,
initial ideals. The reference, for what it's worth, is
MR1282836 (95i:13020) Eisenbud, David ; Sturmfels, Bernd . Finding sparse
systems of parameters. J. Pure Appl. Algebra 94 (1994), no. 2, 143-15.
=============================================================================
Proposed by: Mike Stillman <mike@math.cornell.edu>
Potential Advisor: Mike Stillman <mike@math.cornell.edu>
Project assigned to:
Nathaniel Stapleton <nat.j.stapleton@gmail.com>
and
Alexandra Seceleanu <asecele2@math.uiuc.edu>
Current status:
done: code has been written,
the package GenericInitialIdeal is done, is part of the M2
source code.
=============================================================================
Progress log: