[see also: computation]
The calculation of $M(f)$ is usually no harder than the calculation of $N(f)$.
A short calculation shows that ......
These upper bounds are too large to be useful in computer calculations in general, but the ideas in the proofs will surely contribute to better bounds in the future.
We can do a heuristic calculation to see what the generator of $x_t$ must be.
These calculations can be performed entirely in terms of the generators of $G$.
By detailed numerical calculation one may show that ......
Go to the list of words starting with: a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
y
z