Debian Codegraph @

doc/bergman1.0.man/toplevel.tex

raw
1
2
3 % \section{WHAT IS THIS CHAPTER ABOUT?}
4 % There are three top--of-the--top level procedures for
5 % calculating Gr\"{o}bner basis in the
6 % different situations. They are
7
8 % \begin{itemize} {\bf
9 % \item simple
10 % \item ncpbhgroebner
11 % \item modulehseries }
12 % \end{itemize}
13
14 % In every of them you have some choices. You can switch between
15 % \begin{itemize}
16 % \item commutative and noncommutative case
17 % \item zero or prime characteristic
18 % \item screen or file input (output)
19 % \end{itemize}
20
21 % Besides that you may select
22 % \begin{itemize}
23 % \item type of information about series,
24 % \item form of input (output),
25 % \item ordering,
26 % \item weights.
27 % \end{itemize}
28
29
30 % There are three different mechanisms to do your choices:
31 % either you call appropriate procedure, or you assign
32 % some value to appropriate global variable or switch
33 % a corresponding flag.
34 % \begin{exm} For example \end{exm}
35 % \begin{itemize}
36 % \item the call of procedure
37
38 % {\bf (noncommify)}
39
40 % selects noncommutativity
41
42 % \item the assignment
43
44 % {\bf (setq algoutmode 'alg)}
45
46 % selects algebraic form as output
47
48 % \item the flag switching
49
50 % {\bf (on modlogarithms)}
51
52 % selects a strategy of the calculations in the prime characteristic
53 % using "logarithms tables."
54 % \end{itemize}
55
56
57 % The following sections should explain user how to use main procedures,
58 % variables and flags. First we explain main part of them by the examples
59 % on the conceptual level, and then give a complete list in the
60 % alphabetical order.
61
62 \section{The top--of--the--top level procedures}\label{procsimple}
63 \subsection {Procedure {\bf simple}}
64
65 Procedure \index{simple} {\bf simple} is already familiar to reader.
66 It can be applied both in the commutative and noncommutative
67 case. By default {\bf bergman} works in the commutative mode. To
68 turn off commutativity one need to call
69 \index{noncommify}
70
71 {\bf (noncommify)}
72
73 To return to the commutative case it is sufficient to call \index{commify}
74
75 {\bf (commify)}
76
77 {\bf Simple} is called as a procedure with 0, 1, or 2 file names as
78 arguments (file names be given
79 in explicit form.) If you give no argument, the procedure assumes
80 that you want to give input in ''algebraic form'' (see below subsection
81 \ref{inputform}) and prompts
82 you for this. If you give arguments, and the first argument is the
83 name of an existing file, this is read, and it is assumed that it
84 (inter alia) contains the input (in one or another form). If file
85 does not exists, procedure works as if there were 0 names. Note,
86 that if input file contains {\bf (noncommify)} or {\bf (commify),}
87 the procedure
88 will work in the corresponding mode (and save it after returning).
89
90 If there
91 is a second argument, the output is put there. However, if there is
92 an existing file with this name, it is NOT overwritten and the
93 procedure inform you about its existence and finish its work
94 without doing something else.
95
96 {\bf Stagsimple} \index{stagsimple} works similarly, but calls on the Staggered linear basis
97 Algorithm With Substance (SAWS). It thus may only be used in the
98 commutative case. It takes 0, 1, 2, or 3 arguments; the last two
99 are for output of the s.a.w.s. deduced Gr\"{o}bner basis and for the
100 reduced Gr\"{o}bner basis, respectively. In some cases it works
101 more efficient than {\bf simple}.
102 %(see Chapter \ref{SAWS} about
103 %more details).
104
105 \subsection{Procedure {\bf ncpbhgroebner}}
106 {\bf Ncpbhgroebner} \index{ncpbhgroebner} always takes 4 arguments, which should evaluate to
107 file
108 names.
109 The first file is the input file (which must exist).
110 The second one will be the Gr\"{o}bner basis output file. It must {\bf not
111 exist} before the call to {\bf ncpbhgroebner.}
112 On the third and fourth files the double \index{Poincar\'{e} series}
113 Poincar\'{e}-Betti series and
114 the \index{Hilbert series} Hilbert series of the associated monomial ring will be output.
115 Existing files are overwritten. The output will be done degree by
116 degree, whence you may read partial results while the calculations
117 continue (and interrupt the calculations without losing the lower
118 degree results). Note that the ring and its associated monomial
119 ring have the same Hilbert series, while the double Poincar\'{e}-Betti
120 series only fulfill a termwise inequality; due to the existence of
121 a certain spectral sequence, the coefficients in the P.-B. series
122 of the associated ring can never be less than the corresponding
123 coefficients for the `true' ring
124 %(read more in the Chapter
125 %\ref{MATH-APP} about mathematical details).
126
127 Note that default output mode is Lisp--mode, so do not forget to
128 change it if you don't like it using, for example
129
130 {\bf (setq algoutmode 'alg)}
131
132
133 \subsection{Procedure {\bf modulehseries}} \index{modulehseries}
134
135 {\bf Modulehseries} deals with Gr\"{o}bner basis and Hilbert series calculations
136 for non-commutative modules. It should be loaded by\\
137 {\bf (load hseries)}. \index{hseries}\\
138 It is made as a top level procedure based
139 on some other top level procedures: {\bf degreeoutprepare, groebnerinit,
140 groebnerkernel, groebnerfinish} \index{degreeoutprepare} \index{groebnerinit}
141 \index{groebnerkernel} \index{groebnerfinish} etc. It is called as a procedure with
142 0, 2, 3 or 4 file names as arguments. (It is a FEXPR, which means that
143 the file names be given in explicit form.) If you give no argument, the
144 procedure assumes that you want to give input in ''algebraic form'' and prompts
145 you for this. If you give two arguments, both of them should be names
146 of existing files. It is assumed that they contain the input. The first
147 argument is to contain the value of maximal degree (indicated by
148 {\bf setmaxdeg degree}), the number of module generators (giving by
149 \index{nmodgen} {\bf setq nmodgen number}), both ring and module generators and ring relations
150 only. The second argument contains module relations.
151 If there is a third file it will be the Gr\"{o}bner basis output file.
152 On the fourth file the Hilbert series will be output. Existing files are
153 overwritten.
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250