scholarly journals Number systems and tilings over Laurent series

Author(s):  
TOBIAS BECK ◽  
HORST BRUNOTTE ◽  
KLAUS SCHEICHER ◽  
JÖRG M. THUSWALDNER

AbstractLet be a field and [x, y] the ring of polynomials in two variables over . Let f ∈ [x, y] and consider the residue class ring R := [x, y]/f[x, y]. Our first aim is to study digit representations in R, i.e., we ask for which f each element of R admits a digit representation of the form d0 + d1x + ⋅ ⋅ ⋅ + dℓxℓ with digits di ∈ [y] satisfying degy(di) < degy(f). These digit systems are motivated by the well-known notion of canonical number systems. Next we enlarge the ring in order to allow representations including negative powers of the “base” x. In particular, we define and characterize digit representations for the ring S := ((x−1, y−1))/f((x−1, y−1)) and give easy to handle criteria for finiteness and periodicity of such representations. Finally, we attach fundamental domains to our digit systems. The fundamental domain of a digit system is the set of all elements having only negative powers of x in their “x-ary” representation. The translates of the fundamental domain induce a tiling of S. Interestingly, the fundamental domains of our digit systems turn out to be unions of boxes. If we choose =q to be a finite field, these unions become finite.

1968 ◽  
Vol 8 (3) ◽  
pp. 523-543 ◽  
Author(s):  
G. E. Wall

Let Fq denote the finite field with q elements, Zm the residue class ring Z/mZ. It is known that the projective linear groups G = PSL2(Fq) and PGL2(Fq) (q a prime-power ≥ 4) are characterised among finite insoluble groups by the property that, if two cyclic subgroups of G of even order intersect non-trivially, they generate a cyclic subgroup (cf. Brauer, Suzuki, Wall [2], Gorenstein, Walter [3]). In this paper, we give a similar characterisation of the groups G = PSL2 (Zþt+1) and PGL2 (Zþt+1) (p a prime ≥ 5, t ≥ 1).


2014 ◽  
Vol 10 (06) ◽  
pp. 1459-1483 ◽  
Author(s):  
Klaus Scheicher ◽  
Paul Surer ◽  
Jörg M. Thuswaldner ◽  
Christiaan E. Van de Woestijne

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be a polynomial. In the present paper we consider digit representations in the residue class ring [Formula: see text]. In particular, we are interested in the question whether each [Formula: see text] can be represented modulo P in the form e0 + e1x + ⋯ + ehxh, where the [Formula: see text] are taken from a fixed finite set of digits. This general concept generalizes both canonical number systems and digit systems over finite fields. Due to the fact that we do not assume that 0 is an element of the digit set and that P need not be monic, several new phenomena occur in this context.


2017 ◽  
Vol 174 ◽  
pp. 14-25 ◽  
Author(s):  
Xin Zhang ◽  
Chun-Gang Ji

1999 ◽  
Vol 42 (3) ◽  
pp. 621-640 ◽  
Author(s):  
Laurent Rigal

Let Kq[X] = Oq(M(m, n)) be the quantization of the ring of regular functions on m × n matrices and Iq (X) be the ideal generated by the 2 × 2 quantum minors of the matrix X=(Xij)l≤i≤m, I≤j≤n of generators of Kq[X]. The residue class ring Rq(X) = Kq[X]/Iq(X) (a quantum analogue of determinantal rings) is shown to be an integral domain and a maximal order in its divisionring of fractions. For the proof we use a general lemma concerning maximalorders that we first establish. This lemma actually applies widely to prime factors of quantum algebras. We also prove that, if the parameter isnot a root of unity, all the prime factors of the uniparameter quantum space are maximal orders in their division ring of fractions.


1961 ◽  
Vol 57 (3) ◽  
pp. 483-488
Author(s):  
D. G. Northcott

Let Λ be a commutative ring with an identity element and c an element of Λ which is not a zero divisor Denote by Ω the residue class ring Λ/Λc. If now M is a Λ-module for which c is not a zero divisor, and A is an Ω-module, then a theorem of Rees (2) asserts that, for every non-negative integer n, we have a Λ-isomorphismThis reduction theorem has found a number of useful and interesting applications.


Information ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 193
Author(s):  
Jiang Ma ◽  
Wei Zhao ◽  
Yanguo Jia ◽  
Haiyang Jiang

Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength. Pseudo-random Sequences with a large linear complexity property are of importance in many domains. In this paper, based on the theory of inverse Gray mapping, two classes of new generalized cyclotomic quaternary sequences with period pq are constructed, where pq is a product of two large distinct primes. In addition, we give the linear complexity over the residue class ring Z4 via the Hamming weights of their Fourier spectral sequence. The results show that these two kinds of sequences have large linear complexity.


Author(s):  
H. K. Kaiser ◽  
W. Nöbauer

AbstractThe concept of a permutation polynomial function over a commutative ring with 1 can be generalized to multiplace functions in two different ways, yielding the notion of a k-ary permutation polynomial function (k > 1, k ∈ N) and the notion of a strict k-ary permutation polynomial function respectively. It is shown that in the case of a residue class ring Zm of the integers these two notions coincide if and only if m is squarefree.


Sign in / Sign up

Export Citation Format

Share Document