In this paper, we present a method for finding all expansive polynomials with a prescribed
degree n and constant term c 0. Our research is motivated by the fact that expansivity is a …

In this paper the author make a comprehensive comparison of different parallelizations of a
sequential number theoretic algorithm having large memory requirements. Brunotte's …

This paper deals with number system constructions using block diagonal bases. We show
how easy is creating new generalized number systems from the existing ones via …

The notion of simultaneous number systems was introduced by Kátai et al. in [1]. In this
paper simultaneous number systems constructions are investigated in the lattice of …

In [1] number system constructions were analysed using general block diagonal bases. As a
special case simultaneous systems were considered in the lattice of Gaussian integers …

In the usual real numbers case the shortest vector problems (SVP) and the simultaneous
approximation problems (SAP) have the computational complexity, NP-hardness or NP …

This thesis contains algorithmic results in the theory of generalized number systems. Most of
these already appeared in the journal papers [10],[12],[14]. These articles are joint work with …

We investigate the existence and length of canonical expansion of integers in polynomial
bases where the bases are taken from some infinite families of polynomials which we call …

Various authors analysed simultaneous number systems over different lattices. This paper
presents additional characterisations on number expansions over the “triple” Eisenstein …

Number expansions can be constructed in many different ways. One of the most natural way
is to consider a lattice, a linear operator acting on it and a finite digit set describing the …