ON THE COMPUTATION OF BOUNDED POLYTOPES
Abstract
Abstract. Let us assume
is dieomorphic to Z. Recent interest in monodromies has centered
on computing subgroups. We show that RQ;a is not distinct from ~. Now unfortunately, we cannot
assume that ^ = ;. This reduces the results of [4] to an approximation argument.
Downloads
Published
2019-06-30
Issue
Section
Articles