{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-5681"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-5681","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"A Study of Permutation Polynomials over Finite Fields","abstract":"Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, and 4 of this dissertation, we present many new families of permutation polynomials in the form of gn,q. The permutation behavior of gn,q is becoming increasingly more interesting and challenging. As we further explore the permutation behavior of gn,q, there is a clear indication that gn,q is a plenteous source of permutation polynomials. We also describe a piecewise construction of permutation polynomials over a finite field Fq which uses a subgroup of Fq*, a “selection” function, and several “case” functions. Chapter 5 of this dissertation is devoted to this piecewise construction which generalizes several recently discovered families of permutation polynomials.","abstract_html":"Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, and 4 of this dissertation, we present many new families of permutation polynomials in the form of gn,q. The permutation behavior of gn,q is becoming increasingly more interesting and challenging. As we further explore the permutation behavior of gn,q, there is a clear indication that gn,q is a plenteous source of permutation polynomials. We also describe a piecewise construction of permutation polynomials over a finite field Fq which uses a subgroup of Fq*, a “selection” function, and several “case” functions. Chapter 5 of this dissertation is devoted to this piecewise construction which generalizes several recently discovered families of permutation polynomials.","abstract_has_math":false,"creators":["Fernando, Neranga"],"institution":"University of South Florida","degree_name":null,"degree_level":"Dissertation","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Xiang-dong Hou"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-01-01T08:00:00Z","date_published":"2013-01-01T08:00:00Z","updated_at":"2026-11-19T08:40:10Z","subjects":["Dickson polynomial","Finite field","Normal basis","Permutation polynomial","Reversed Dickson polynomial","Mathematics"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/4484","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/4484","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-5681","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Xiang-dong Hou"]},{"key":"dc:creator","label":"Author","values":["Fernando, Neranga"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2013-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","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":["Dickson polynomial","Finite field","Normal basis","Permutation polynomial","Reversed Dickson polynomial","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"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/4484"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, and 4 of this dissertation, we present many new families of permutation polynomials in the form of gn,q. The permutation behavior of gn,q is becoming increasingly more interesting and challenging. As we further explore the permutation behavior of gn,q, there is a clear indication that gn,q is a plenteous source of permutation polynomials. We also describe a piecewise construction of permutation polynomials over a finite field Fq which uses a subgroup of Fq*, a “selection” function, and several “case” functions. Chapter 5 of this dissertation is devoted to this piecewise construction which generalizes several recently discovered families of permutation polynomials."]},{"key":"dc:title","label":"Title","values":["A Study of Permutation Polynomials over Finite Fields"]}]}],"canonical_facts":{"dc:contributor":["Xiang-dong Hou"],"dc:creator":["Fernando, Neranga"],"dc:date":["2013-01-01T08:00:00Z"],"dc:description":["Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigmaa isin Fq (x+a)n = gn,q(xq- x) gives rise to many permutation polynomials over finite fields. We are interested in triples (n,e;q) for which gn,q is a permutation polynomial of Fqe. In Chapters 2, 3, and 4 of this dissertation, we present many new families of permutation polynomials in the form of gn,q. The permutation behavior of gn,q is becoming increasingly more interesting and challenging. As we further explore the permutation behavior of gn,q, there is a clear indication that gn,q is a plenteous source of permutation polynomials. We also describe a piecewise construction of permutation polynomials over a finite field Fq which uses a subgroup of Fq*, a “selection” function, and several “case” functions. Chapter 5 of this dissertation is devoted to this piecewise construction which generalizes several recently discovered families of permutation polynomials."],"dc:identifier":["https://digitalcommons.usf.edu/etd/4484"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["Dickson polynomial","Finite field","Normal basis","Permutation polynomial","Reversed Dickson polynomial","Mathematics"],"dc:title":["A Study of Permutation Polynomials over Finite Fields"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation","Ph.D."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:40:10Z"}