Related papers: Arithmetics in number systems with cubic base
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…
We consider cubic number fields ordered by their discriminants, and show that there exist arbitrarily long sequences that contain only fields with class numbers greater than a given bound.
We examine a bias towards the zero residue class for the integers represented by binary quadratic forms. In many cases, we are able to prove that the bias comes from a secondary term in the associated asymptotic expansion (unlike…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
Our number system is a magnificent tool. But it is far from perfect. Can it be improved? In this paper some possibilities are discussed, including the use of a different base or directed (negative as well as positive) numerals. We also put…
Floating point arithmetic allows us to use a finite machine, the digital computer, to reach conclusions about models based on continuous mathematics. In this article we work in the other direction, that is, we present examples in which…
More precise estimation of the greedy algorithm complexity for a special case of the set cover problem is given in this paper.
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
We investigate integers whose base $g$ expansion omits a fixed digit and which can be represented as a sum of two prime squares. In the first part of the paper, we apply the Hardy--Littlewood circle method to obtain asymptotic formulas for…
We study rational numbers with purely periodic R\'enyi $\beta$-expansions. For bases $\beta$ satisfying $\beta^2=a\beta+b$ with $b$ dividing $a$, we give a necessary and sufficient condition for $\gamma(\beta)=1$, i.e., that all rational…
We study arithmetic constraints arising from the three faces meeting along the space diagonal of a rectangular cuboid. Using a propagation mechanism along this diagonal, based on the appearance of a minimal odd prime in certain triangular…
We study geometric structures arising from Hermitian forms on linear spaces over real algebras beyond the division ones. Our focus is on the dual numbers, the split-complex numbers, and the split-quaternions. The corresponding geometric…
In this article, we develop new methods for counting integral orbits having bounded invariants that lie inside the cusps of fundamental domains for coregular representations. We illustrate these methods for a representation of cardinal…
We develop a heuristic for the density of integer points on affine cubic surfaces. Our heuristic applies to smooth surfaces defined by cubic polynomials that are log K3, but it can also be adjusted to handle singular cubic surfaces. We…
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…
We examine what integers are representable as sums of three cubes. We also provide formulas for the number of representations of $x^3+y^3+z^3=n$ under the condition $x+y+z=t$. Also we show how the problem of three cubes is related to…
We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…