On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
From MaRDI portal
Publication:1343780
DOI10.1016/0012-365X(93)E0162-WzbMath0849.11028MaRDI QIDQ1343780
Publication date: 12 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Polynomials in number theory (11C08) Special sequences and polynomials (11B83) Representation functions (11B34)
Related Items (16)
On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\) ⋮ Congruence preservation and polynomial functions from \(\mathbb{Z}_n\) to \(\mathbb{Z}_m\) ⋮ Bhargava’s Early Work: The Genesis of <em>P</em>-Orderings ⋮ Fast and Simple Modular Interpolation Using Factorial Representation ⋮ Arithmetical Congruence Preservation: From Finite to Infinite ⋮ On polynomial functions Modulo \(p^e\) and faster bootstrapping for homomorphic encryption ⋮ Polyfunctions over commutative rings ⋮ Polynomial functions over dual numbers of several variables ⋮ Polynomial analogue of the Smarandache function ⋮ Permutation polynomials and their differential properties over residue class rings ⋮ Unnamed Item ⋮ Congruence preserving functions in the residue class rings of polynomials over finite fields ⋮ Polynomial functions in the residue class rings of Dedekind domains ⋮ A survey on fixed divisors ⋮ A faster algorithm for testing polynomial representability of functions over finite integer rings ⋮ The ring of polyfunctions over Z/nZ
Cites Work
- Isomorphisms of cyclic combinatorial objects
- Lifting Hamilton cycles of quotient graphs
- The Hamiltonian property of generalized de Bruijn digraphs
- A-cordial graphs
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Isomorphism of circulant graphs and digraphs
- Sur les systèmes cycliques de triples de Steiner différents pour \(N\) premier (ou puissance de nombre premier) de la forme \(6n+1\). VI
- Isomorphism problem for relational structures with a cyclic automorphism
- On polynomial functions (mod m)
- Counting polynomial functions \(\pmod{p^ n}\)
- Algebraisch-zahlentheoretische Betrachtungen über Ringe. II
- Design to Minimize Diameter on Building-Block Network
- On Additive Bases and Harmonious Graphs
- Functions and polynomials ($mod p^n$)
This page was built for publication: On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)