{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-7489"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-7489","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Some Results Concerning Permutation Polynomials over Finite Fields","abstract":"Let p be a prime, p a power of p and 𝔽q the finite field with q elements. Any function φ: 𝔽q → 𝔽q can be unqiuely represented by a polynomial, 𝔽φ of degree < q. If the map x ↦ Fφ(x) induces a permutation on the underlying field we say Fφ is a permutation polynomial. Permutation polynomials have applications in many diverse fields of mathematics. In this dissertation we are generally concerned with the following question: Given a polynomial f, when does the map x ↦ F(x) induce a permutation on 𝔽q. In the second chapter we are concerned the permutation behavior of the polynomial gn,q, a q-ary version of the reversed Dickson polynomial, when the integer n is of the form n = qa - qb - 1. This leads to the third chapter where we consider binomials and trinomials taking special forms. In this case we are able to give explicit conditions that guarantee the given binomial or trinomial is a permutation polynomial. In the fourth chapter we are concerned with permutation polynomials of 𝔽q, where q is even, that can be represented as the sum of a power function and a linearized polynomial. These types of permutation polynomials have applications in cryptography. Lastly, chapter five is concerned with a conjecture on monomial graphs that can be formulated in terms of polynomials over finite fields.","abstract_html":"Let p be a prime, p a power of p and 𝔽q the finite field with q elements. Any function φ: 𝔽q → 𝔽q can be unqiuely represented by a polynomial, 𝔽φ of degree &lt; q. If the map x ↦ Fφ(x) induces a permutation on the underlying field we say Fφ is a permutation polynomial. Permutation polynomials have applications in many diverse fields of mathematics. In this dissertation we are generally concerned with the following question: Given a polynomial f, when does the map x ↦ F(x) induce a permutation on 𝔽q. In the second chapter we are concerned the permutation behavior of the polynomial gn,q, a q-ary version of the reversed Dickson polynomial, when the integer n is of the form n = qa - qb - 1. This leads to the third chapter where we consider binomials and trinomials taking special forms. In this case we are able to give explicit conditions that guarantee the given binomial or trinomial is a permutation polynomial. In the fourth chapter we are concerned with permutation polynomials of 𝔽q, where q is even, that can be represented as the sum of a power function and a linearized polynomial. These types of permutation polynomials have applications in cryptography. Lastly, chapter five is concerned with a conjecture on monomial graphs that can be formulated in terms of polynomials over finite fields.","abstract_has_math":false,"creators":["Lappano, Stephen"],"institution":"University of South Florida","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Thesis","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Xiang-dong Hou, Ph.D.","Brian Curtin, Ph.D.","Mohamed Elhamdadi, Ph.D.","Dymtro Savchuk, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-06-27T07:00:00Z","date_published":"2016-06-27T07:00:00Z","updated_at":"2026-11-19T08:41:53Z","subjects":["Binomial","Finite Fields","Monomial Graph","Permutation Polynomial","Trinomial","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/6293","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/6293","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-7489","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Xiang-dong Hou, Ph.D.","Brian Curtin, Ph.D.","Mohamed Elhamdadi, Ph.D.","Dymtro Savchuk, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Lappano, Stephen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016-06-27T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","Ph.D."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Binomial","Finite Fields","Monomial Graph","Permutation Polynomial","Trinomial","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/6293"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Let p be a prime, p a power of p and 𝔽q the finite field with q elements. Any function φ: 𝔽q → 𝔽q can be unqiuely represented by a polynomial, 𝔽φ of degree < q. If the map x ↦ Fφ(x) induces a permutation on the underlying field we say Fφ is a permutation polynomial. Permutation polynomials have applications in many diverse fields of mathematics. In this dissertation we are generally concerned with the following question: Given a polynomial f, when does the map x ↦ F(x) induce a permutation on 𝔽q. In the second chapter we are concerned the permutation behavior of the polynomial gn,q, a q-ary version of the reversed Dickson polynomial, when the integer n is of the form n = qa - qb - 1. This leads to the third chapter where we consider binomials and trinomials taking special forms. In this case we are able to give explicit conditions that guarantee the given binomial or trinomial is a permutation polynomial. In the fourth chapter we are concerned with permutation polynomials of 𝔽q, where q is even, that can be represented as the sum of a power function and a linearized polynomial. These types of permutation polynomials have applications in cryptography. Lastly, chapter five is concerned with a conjecture on monomial graphs that can be formulated in terms of polynomials over finite fields."]},{"key":"dc:title","label":"Title","values":["Some Results Concerning Permutation Polynomials over Finite Fields"]}]}],"canonical_facts":{"dc:contributor":["Xiang-dong Hou, Ph.D.","Brian Curtin, Ph.D.","Mohamed Elhamdadi, Ph.D.","Dymtro Savchuk, Ph.D."],"dc:creator":["Lappano, Stephen"],"dc:date":["2016-06-27T07:00:00Z"],"dc:description":["Let p be a prime, p a power of p and 𝔽q the finite field with q elements. Any function φ: 𝔽q → 𝔽q can be unqiuely represented by a polynomial, 𝔽φ of degree < q. If the map x ↦ Fφ(x) induces a permutation on the underlying field we say Fφ is a permutation polynomial. Permutation polynomials have applications in many diverse fields of mathematics. In this dissertation we are generally concerned with the following question: Given a polynomial f, when does the map x ↦ F(x) induce a permutation on 𝔽q. In the second chapter we are concerned the permutation behavior of the polynomial gn,q, a q-ary version of the reversed Dickson polynomial, when the integer n is of the form n = qa - qb - 1. This leads to the third chapter where we consider binomials and trinomials taking special forms. In this case we are able to give explicit conditions that guarantee the given binomial or trinomial is a permutation polynomial. In the fourth chapter we are concerned with permutation polynomials of 𝔽q, where q is even, that can be represented as the sum of a power function and a linearized polynomial. These types of permutation polynomials have applications in cryptography. Lastly, chapter five is concerned with a conjecture on monomial graphs that can be formulated in terms of polynomials over finite fields."],"dc:identifier":["https://digitalcommons.usf.edu/etd/6293"],"dc:rights.license":["default"],"dc:subject":["Binomial","Finite Fields","Monomial Graph","Permutation Polynomial","Trinomial","Mathematics"],"dc:title":["Some Results Concerning Permutation Polynomials over Finite Fields"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Thesis","Ph.D."],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:41:53Z"}