On multiplicative independence of rational function iterates

DOI10.1007/S00605-020-01393-9zbMATH Open1442.11166arXiv1708.00944OpenAlexW3007163443MaRDI QIDQ2173236FDOQ2173236

Authors: Marley Young 

Publication date: 22 April 2020

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

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.

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

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

zbMATH Keywords

iterationrational functionmultiplicative dependence

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)