Functional decomposition using principal subfields

DOI10.1145/3087604.3087608MaRDI QIDQ5119970zbMATH OpenOpenAlexFDO

Authors Luiz Emilio Allem, Juliane Capaverde, Mark van Hoeij, Jonas Szutkoski

Publication date 9 September 2020

Published in Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.03529

zbMATH Keywords

partitionsrational function decompositionsubfield lattice

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Symbolic computation and algebraic computation (68W30)

Abstract: Let $finK(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $gcirch$, with $g,hinK(t)$, corresponds to a non-trivial subfield $K(f(t))subsetneqLsubsetneqK(t)$ and vice-versa. In this paper we use the idea of principal subfields and fast subfield-intersection techniques to compute the subfield lattice of $K(t)/K(f(t))$. This yields a Las Vegas type algorithm with improved complexity and better run times for finding all non-equivalent complete decompositions of $f$.

Recommendations

• Decomposition of algebraic functions
• Functional decomposition of polynomials: the wild case
• On the decomposition of rational functions
• A rational function decomposition algorithm by near-separated polynomials
• Algorithms for Function Fields

Cited in

(4)

• Function Decomposition in Main and Lesser Peaks
• Algorithms for Function Fields
• Computing pullback function of second order differential operators by using their semi-invariants
• An approximate decomposition of a multivariate polynomial and its application

This page was built for publication: Functional decomposition using principal subfields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119970)