On polynomial functions (mod m)

DOI10.1016/0022-314X(74)90031-6MaRDI QIDQ1845778zbMATH OpenFDO

Authors David Singmaster

Publication date 1974

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-314X(74)90031-6

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Polynomials in number theory (11C08) Polynomials over finite fields (11T06)

Cites work

• A Generalization of Fermat's Theorem
• A Maximal Generalization of Fermat's Theorem
• Algebraisch-zahlentheoretische Betrachtungen über Ringe. II
• Counting polynomial functions \(\pmod{p^ n}\)
• scientific article; zbMATH DE number 3181273 (Why is no real title available?)

Cited in

(30)

• Polynomial transformations of finite commutative local principal ideal rings
• Functions and polynomials over Galois rings
• The modular n-queen problem
• On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
• On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\)
• Closed classes of polynomials modulo p^2
• On the structure of digraphs of polynomial transformations over finite commutative rings with unity
• On the number of functions of k-valued logic which are polynomials modulo composite k
• Polynomial functions on rings of dual numbers over residue class rings of the integers
• A survey on fixed divisors
• Algebraic-integer valued polynomials
• A faster algorithm for testing polynomial representability of functions over finite integer rings
• Permutation polynomials and their differential properties over residue class rings
• Finite rings with applications.
• Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
• Anneau de fonctions polynömes d′un anneau commutatif unitaire
• Bhargava's early work: the genesis of \(P\)-orderings
• Fast and simple modular interpolation using factorial representation
• Polynomial functions in the residue class rings of Dedekind domains
• The ring of polyfunctions over Z/nZ
• On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption
• Polyfunctions over commutative rings
• Polynomial functions over dual numbers of several variables
• Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato}
• On the group of unit-valued polynomial functions
• The Gröbner basis of the ideal of vanishing polynomials
• Checking the polynomiality of single-variable functions of \({k}\)-valued logic composite modulo \({k}\)
• Value sets of non-permutation polynomials over the residue class rings of integers
• On the polynomial Szemerédi theorem in finite commutative rings

This page was built for publication: On polynomial functions (mod m)

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