Institut für Algorithmen und Kognitive Systeme, Arbeitsgruppe Computeralgebra, Fakultät für Informatik, Universität Karlsruhe, Germany
Abstract: A method for deciding linear disjointness and freeness of finitely generated extension fields is given. The techniques used are based on a classical description of linear disjointness and on the Chow form. The required Gröbner basis techniques do not depend on tag variables. Finally, the solution obtained can also be used to solve the implicitization problem without involving tag variables.
Full text of the article: