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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// tsat3.cc -- test for saturate.h/cc reading from gens files directly
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2 of the License, or (at your
// option) any later version.
//
// eclib is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License
// along with eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
//
#include <eclib/interface.h>
#include <eclib/method.h>
#include <eclib/curve.h>
#include <eclib/points.h>
#include <eclib/cperiods.h>
#include <eclib/polys.h>
#include <eclib/curvemod.h>
#include <eclib/pointsmod.h>
#include <eclib/saturate.h>
#include <eclib/elog.h>
#include <eclib/sieve_search.h>
#include <eclib/mwprocs.h>
#include <eclib/curvesort.h>
#define USE_EGR
#define SAT_BND 100000 // saturation bound: use -1 for global default
#ifdef USE_EGR
const int use_egr=1;
#else
const int use_egr=0;
#endif
#define INPUT_CLASS_IS_LETTER // we only use letters now!
// Utility function for parsing input of lists of integers such as [], [2], [2,2]
vector<int> input_list(istream & is);
int main()
{
#ifdef MPFP
// set_precision("Enter precision in bits");
set_precision(350);
#endif
initprimes("PRIMES",0);
int verbose = 0;
// cout<<"verbose (0/1)? "; cin >>verbose;
int j, npts;
long N, ncurve, nclass;
string code;
Curve E;
while(!(feof(stdin))) {
// Input the curve's ID and the curve:
cin >> N; if(N==0) break;
#ifdef INPUT_CLASS_IS_LETTER
cin >> code;
#else
cin >> nclass;
code = codeletter(nclass-1);
#endif
cin >> ncurve;
cin >> E;
Curvedata C(E);
cout<<endl;
cout << N<<code<<ncurve<<" = "<< E << endl;
// Input the rank:
Point P(C);
cin >> npts;
cout<<"rank = "<<npts<<endl;
// Input the torsion structure:
vector<int> torsion_group = input_list(cin);
int trank = torsion_group.size();
cout<<"torsion group structure = "<<torsion_group<<" (torsion rank "<<trank<<")"<<endl;
// Input the points of infinite order (if any):
vector<Point> points; points.reserve(npts);
j=0;
while(j<npts)
{
cin >> P;
if ( !P.isvalid() )
{
cout<<"point "<<P<<" not on curve.\n"<<endl;
}
points.push_back(P);
j++;
}
cout<<"Input non-torsion points: "<<points<<endl;
// Input the points of finite order (if any):
vector<Point> tpoints; points.reserve(trank);
j=0;
while(j<trank)
{
cin >> P;
if ( !P.isvalid() )
{
cout<<"point "<<P<<" not on curve.\n"<<endl;
}
tpoints.push_back(P);
j++;
}
cout<<"Input torsion points: "<<tpoints<<endl;
bigint index = BIGINT(1);
vector<long> unsatprimes;
int success = 1;
if (npts)
{
success = saturate_points(C, points, index, unsatprimes, SAT_BND, use_egr, (verbose));
}
if(success)
{
cout<<"Saturation complete --";
if(index==1)
cout<<"input points were saturated"<<endl;
else
{
cout<<"input points had index "<<index
<<" in their saturation."<<endl;
cout<<"Basis for saturation:\t"<<points<<endl;
}
}
else
cout<<"Saturation failed at "<<unsatprimes<<endl;
for (int i=0; i<npts; i++)
{
Point P = points[i];
cout << "Generator "<<(i+1)<<" is "<<P<<"; ";
cout << "height "<<height(P);
if(!P.isvalid()) cout<<" --warning: NOT on curve!";
cout<<endl;
}
cout<<endl;
cout << "Regulator = "<<regulator(points)<<endl<<endl;
// Finally output a line similar to the input line:
#ifdef INPUT_CLASS_IS_LETTER
cout<<N<<"\t"<<code<<"\t"<<ncurve<<"\t"<<E<<"\t"<<npts;
#else
cout<<N<<"\t"<<nclass<<"\t"<<ncurve<<"\t"<<E<<"\t"<<npts;
#endif
for(j=0; j<npts; j++) cout<<"\t"<<points[j];
cout<<endl;
cout<<"=============================================================="<<endl;
}
}
// Utility function for parsing input of lists of integers such as [], [2], [2,2]
vector<int> input_list(istream & is)
{
char c; int a; vector<int> ai;
is>>c; // swallow first [
is>>ws>>c;
if (c==']') return ai;
is.unget();
while (c!=']')
{
is >> a >> c; // c is a comma or ]
ai.push_back(a);
}
return ai;
}
//end of file tsat3.cc
|
