On Canonical Representatives of Small Integers
نویسنده
چکیده
Some elementary facts on canonical representations of small rational integers are listed and a reformulation of a characterization of a certain class of CNS polynomials is presented. Furthermore, several examples in support of a conjecture of S. Akiyama on the canonical representative of −1 are provided.
منابع مشابه
Equivalence classes and representatives of Golay sequences
We introduce the notion of canonical form for Golay sequences such that every equivalence class contains exactly one member having the canonical form. Golay and Turyn have shown how to multiply Golay sequences of length m with Golay sequences of length n in order to construct Golay sequences of length mn. We say that Golay sequences of length n are constructible if they can be manufactured from...
متن کاملRings of Singularities
This paper is a slightly revised version of an introduction into singularity theory corresponding to a series of lectures given at the ``Advanced School and Conference on homological and geometrical methods in representation theory'' at the International Centre for Theoretical Physics (ICTP), Miramare - Trieste, Italy, 11-29 January 2010. We show how to associate to a triple of posit...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملOn a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کامل