On multiplicative independence of rational function iterates

DOI10.1007/S00605-020-01393-9MaRDI QIDQ2173236zbMATH OpenOpenAlexFDO

Authors Marley Young

Publication date 22 April 2020

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

iterationrational functionmultiplicative dependence

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of algebraic function fields (11R58)

Abstract: We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a generalisation of Gao's method for constructing elements in the finite field $mathbb{F}_{q^n}$ whose orders are larger than any polynomial in $n$ when $n$ becomes large. Additionally, we discuss the finiteness of polynomials which translate a given finite set of polynomials to become multiplicatively dependent.

Recommendations

• Multiplicative Dependence Among Iterated Values of Rational Functions Modulo Finitely Generated Groups
• Subgroups generated by rational functions in finite fields
• On multiplicative dependence of values of rational functions and a generalization of the Northcott theorem
• scientific article; zbMATH DE number 1588463
• On construction of high order elements in arbitrary finite fields

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3845662 (Why is no real title available?)
• scientific article; zbMATH DE number 2010176 (Why is no real title available?)
• scientific article; zbMATH DE number 1402564 (Why is no real title available?)
• scientific article; zbMATH DE number 2247920 (Why is no real title available?)
• A new bound for an extension of Mason's theorem for functions of several variables
• Bounds on the Number of Feasible Solutions to a Knapsack Problem
• Composite rational functions expressible with few terms
• Composite rational functions having a bounded number of zeros and poles
• Elements of provable high orders in finite fields
• Finite orbits for rational functions
• Finite polynomial orbits in quadratic rings
• Multiplicative dependence of the translations of algebraic numbers
• On elements of high order in general finite fields
• On multiplicative dependence of values of rational functions and a generalization of the Northcott theorem
• On the number of terms of a composite polynomial
• POLYNOMIAL IDENTITIES AND HAUPTMODULN
• Polynomial cycles in certain local domains
• Polynomial cycles in certain rings of rationals
• Polynomial cycles in cubic fields of negative discriminant
• Rational functions with a polynomial iterate
• The S-unit equation over function fields
• The Probability of Relatively Prime Polynomials

Cited in

(4)

• On multiplicative dependence of values of rational functions and a generalization of the Northcott theorem
• Using basis computation to determine pseudo-multiplicative independence
• Multiplicative dependence of rational values modulo approximate finitely generated groups
• Multiplicative Dependence Among Iterated Values of Rational Functions Modulo Finitely Generated Groups

This page was built for publication: On multiplicative independence of rational function iterates

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