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
|
// FILE APLIST.CC: program for listing ap
//////////////////////////////////////////////////////////////////////////
//
// 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 <fstream>
#include <iomanip>
#include <eclib/arith.h>
#include <eclib/moddata.h> // for nf_filename
#define BOOKORDER // if defined, sorts newforms & curves into order
// in the Book (relevant up to 500 only)
#include <eclib/curvesort.h>
int main()
{
string filename;
cout<<"Enter output filename: ";
cin>>filename;
ofstream output(filename.c_str());
int n1,n2; short temp;
cout<<"Enter first and last values of n: ";
cin>>n1>>n2;
for (int n=n1; n<=n2; n++)
{
string data = nf_filename(n,'x');
ifstream datafile(data.c_str());
if (!datafile) cout<<"No file "<<data<<" exists!"<<endl;
else
{
int i,ic,xic,ip,jp,p,iq,nnf,naq,nap,nx;
int nbigprimes = 5; // max no. of primes over 100
short temp_short;
int temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of newforms
nnf=temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of bad primes
naq=temp_int;
datafile.read((char*)&temp_int,sizeof(int)); // = number of eigs
nap=temp_int;
if(nnf==0) continue;
// skip over extra data for each newform
long ntotal = 16*nnf;
int* batch_i = new int[ntotal];
datafile.read((char*)batch_i,ntotal*sizeof(int));
delete batch_i;
// read and store aq for each newform
ntotal = naq*nnf;
short* batch = new short[ntotal];
datafile.read((char*)batch,ntotal*sizeof(short));
short* batchptr = batch;
vector< vector<long> > aqtable;
for(ic=0; ic<nnf; ic++) aqtable.push_back(vector<long>(naq));
for (iq=0; iq<naq; iq++)
for (ic=0; ic<nnf; ic++) aqtable[ic][iq]=*batchptr++;
// read and store ap for each newform
ntotal = 25*nnf;
delete batch;
batch = new short[ntotal];
datafile.read((char*)batch,ntotal*sizeof(short));
batchptr = batch;
vector< vector<long> > aptable;
vector<long> bigptable;
for(ic=0; ic<nnf; ic++)
aptable.push_back(vector<long>(25+nbigprimes));
for (ip=0; ip<25; ip++)
for (ic=0; ic<nnf; ic++)
aptable[ic][ip]=*batchptr++;
// deal with big bad primes (>100) if any:
int nn=n;
ip=25; // index into aptable
jp=26; // current prime being considered
p=prime_number(jp);
for (ip=0; ip<25; ip++)
{
int p = prime_number(ip+1);
while (nn%p==0) nn/=p;
}
while (nn>1) // then there are primes>100 dividing n
{
while (nn%p!=0) // skip over data for p & increment p
{
datafile.read((char*)batch,nnf*sizeof(short));
p=prime_number(++jp);
}
// now p is a "large" prime divisor of n
bigptable.push_back(p);
while (nn%p==0) nn/=p;
datafile.read((char*)batch,nnf*sizeof(short));
batchptr=batch;
for(ic=0; ic<nnf; ic++) aptable[ic][ip]=*batchptr++;
ip++;
}
delete batch;
datafile.close();
// cout<<"finished reading eigs, closed data file."<<endl;
for (xic=0; xic<nnf; xic++)
{ output<<setw(3)<<n;
ic=xic;
output<<" "<<codeletter(xic);
#ifdef BOOKORDER
ic=booknumber0(n,ic);
#endif
iq=0;
for (int jp=0; jp<25; jp++)
{ int p = prime_number(jp+1);
int ap = aptable[ic][jp];
if (n%p==0) // W_q-eig
{
ap=aqtable[ic][iq++];
if(jp>8) output<<" ";
if(ap==1) output<<" +"; else output<<" -";
}
else // T_p-eig
{
if (jp>8) output<<setw(4)<<ap;
else output<<setw(3)<<ap;
}
}
for(i=0; i<bigptable.size(); i++)
{
if (aqtable[ic][iq++]==1) output<<" +"; else output<<" -";
output<<"("<<bigptable[i]<<")";
}
output<<endl;
} // end of xic/ic output loop
} // end of if(!data) ... else ...
} // end of main n loop
} // end of main()
|
