Related papers: Minimal digit sets for parallel addition in non-st…
Bit addition arises virtually everywhere in digital circuits: arithmetic operations, increment/decrement operators, computing addresses and table indices, and so on. Since bit addition is such a basic task in Boolean circuit synthesis, a…
We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…
We study periodic expansions in positional number systems with a base $\beta\in\C,\ |\beta|>1$, and with coefficients in a finite set of digits $\A\subset\C.$ We are interested in determining those algebraic bases for which there exists…
Let the base $\beta$ be a complex number, $|\beta|>1$, and let $A \subset \C$ be a finite alphabet of digits. The \emph{$A$-spectrum} of $\beta$ is the set $S_{A}(\beta) = \{\sum_{k=0}^n a_k\beta^k \mid n \in \mathbb{N}, \ a_k \in {A}\}$.…
In this paper we study the expansions of real numbers in positive and negative real base as introduced by R\'enyi, and Ito & Sadahiro, respectively. In particular, we compare the sets $\mathbb{Z}_\beta^+$ and $\mathbb{Z}_{-\beta}$ of…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…
Let $A$ be a $d \times d$ matrix with rational entries which has no eigenvalue $\lambda \in \mathbb{C}$ of absolute value $|\lambda| < 1$ and let $\mathbb{Z}^d[A]$ be the smallest nontrivial $A$-invariant $\mathbb{Z}$-module. We lay down a…
For $\beta > 1$ a real algebraic integer ({\it the base}), the finite alphabets $\mathcal{A} \subset \mathbb{Z}$ which realize the identity $\mathbb{Q}(\beta) = {\rm Per}_{\mathcal{A}}(\beta)$, where ${\rm Per}_{\mathcal{A}}(\beta)$ is the…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
This paper presents efficient algorithms, designed to leverage SIMD for performing Montgomery reductions and additions on integers larger than 512 bits. The existing algorithms encounter inefficiencies when parallelized using SIMD due to…
In this paper we study digit frequencies in the setting of expansions in non-integer bases, and self-affine sets with non-empty interior. Within expansions in non-integer bases we show that if $\beta\in(1,1.787\ldots)$ then every…
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…
This paper explores practical aspects of using a high-level functional language for GPU-based arithmetic on ``midsize'' integers. By this we mean integers of up to about a quarter million bits, which is sufficient for most practical…
Many emerging computer applications require the processing of large numbers, larger than what a CPU can handle. In fact, the top of the line PCs can only manipulate numbers not longer than 32 bits or 64 bits. This is due to the size of the…
A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…
We study non-standard number systems with negative base $-\beta$. Instead of the Ito-Sadahiro definition, based on the transformation $T_{-\beta}$ of the interval $\big[-\frac{\beta}{\beta+1},\frac{1}{\beta+1}\big)$ into itself, we suggest…
The minimal sets within a collection of sets are defined as the ones which do not have a proper subset within the collection, and the maximal sets are the ones which do not have a proper superset within the collection. Identifying extremal…
We present efficient circuits for the addition of binary numbers. We assume that we are given arrival times for all input bits and optimize the delay of the circuits, i.e.\ the time when the last output bit is computed. This contains the…
In this paper we study the set of digit frequencies that are realised by elements of the set of $\beta$-expansions. The main result of this paper demonstrates that as $\beta$ approaches $1,$ the set of digit frequencies that occur amongst…