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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// Copyright 2005 Michael E. Stillman
#include "points.hpp"
#include "error.h"
#include "mat.hpp"
#include "matrix-con.hpp"
#include "dmat.hpp"
#include "polyring.hpp"
#include "monideal.hpp"
#include "aring-zzp.hpp"
M2_bool rawIdealOfPoints(const Ring *R,
const MutableMatrix *Pts,
Matrix /* or null */ **result_GB,
Matrix /* or null */ **result_std_monoms)
{
// Branch depending on the type of K, the ring of Pts.
// If Pts is not a DMatrix, make it one.
// First: check that coeff ring of R is the same as ring of Pts
// Now branch depending on this type
const Ring *K = Pts->get_ring();
const PolynomialRing *P = R->cast_to_PolynomialRing();
if (P == 0 || K != P->getCoefficients())
{
ERROR("expected polynomial ring with same coefficient ring");
return false;
}
const Z_mod *KZZp = K->cast_to_Z_mod();
if (KZZp != 0)
{
DMat<M2::ARingZZp> *Pts1 = 0;
*result_GB = PointsComputation<M2::ARingZZp>::points(
P, KZZp, Pts1, *result_std_monoms);
return true;
}
ERROR("not implemented yet");
return false;
}
class monom_int_list
{
public:
monom_int_list(const PolynomialRing *R) {}
~monom_int_list() {}
void add(int old, int x, int *vp) { /* TO BE WRITTEN */}
bool remove(int &old, int &x, int *&vp) { /* TO BE WRITTEN */ return false; }
};
template <typename CoeffRing>
Matrix *PointsComputation<CoeffRing>::points(
const PolynomialRing *R,
const typename CoeffRing::ring_type *K,
const DMat<CoeffRing> *Pts,
Matrix *&result_std_monoms)
{
// Declare and initialize our variables
// int nvars = R->n_vars();
// int npoints = Pts->n_cols();
// MatrixConstructor gbG(R->make_FreeModule(1), 0);
// DMat<CoeffRing> *P = new DMat<CoeffRing>(K, npoints, npoints+1);
// DMat<CoeffRing> *PLU = new DMat<CoeffRing>(K, npoints, npoints+1);
// MonomialIdeal *inG = new MonomialIdeal(R);
// VECTOR(monomial) stdG;
// monom_int_list monoms_todo(R);
// int next_col = 0;
// MES Place the monomials [0,0,vp], ..., [0,nvars-1,vp] onto monom list
// MES Make the first column of P, PLU all ones.
// The main loop
#if 0
// while (monoms_todo.remove(old,x,vp))
// {
// // First, see if this monomial is in inG, if so, continue.
//
// // Place this monomial as the 'next_col' column of P, PLU.
//
// // LU1
//
// //
// }
#endif
// THIS STILL NEEDS TO BE WRITTEN!!
return 0;
}
template class PointsComputation<M2::ARingZZp>;
//#include "coeffrings.hpp"
// template class PointsComputation<CoefficientRingZZp>;
// Local Variables:
// compile-command: "make -C $M2BUILDDIR/Macaulay2/e "
// indent-tabs-mode: nil
// End:
|
