Conjugating Polynomials on Finite Rings

Author

Matt Insall, Missouri University of Science and TechnologyFollow
Lenore Mullin
Ralph W. Wilkerson, Missouri University of Science and TechnologyFollow

Abstract

Let R be a finite commutative ring, and let f : R ~ R. We call f a polynomial of degree n if there are a O, a t. a 2 ..... a~ ~ R, an ~ 0, such that for all t ~ R, we have f(t) = a 0 +air+ a2 t2 +...+ a~tt n. Such polynomials play an important role in coding theory, the logic of switching circuits (in case R is a Boolean ring), and classical number theory. We consider computational aspects of the following and related problems:

Recommended Citation

M. Insall et al., "Conjugating Polynomials on Finite Rings," Symposium on Applied Computing Proceedings, University of Missouri--Rolla, Jan 1994.

The definitive version is available at https://doi.org/10.1145/326619.326746

Meeting Name

1994 ACM Symposium on Applied Computing

Department(s)

Mathematics and Statistics

Second Department

Computer Science

Keywords and Phrases

ring; polynomials; multidimensional arrays

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 1994 University of Missouri--Rolla, All rights reserved.

Publication Date

01 Jan 1994