Answers are grounded in this paper and cite their sources.
In 2008, Bodin provided an alternative approach for bounding the total reducibility order of a non-composite rational function. His proof used some properties of jacobian derivation. In this note, we revisit this proof and eliminate the jacobian derivation aspect. The new ingredient in our presentation is a version of Lüroth's theorem.
No takes yet. Share an insight, caveat, or question.
Benelmekki et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: