Related papers: Optimal number representations in negative base

We study arithmetical aspects of Ito-Sadahiro number systems with negative base. We show that the bases $-\beta<-1$, where $\beta$ is zero of $x^3-mx^2-mx-m,\ m\in\mathbb N,$ possess the so-called finiteness property. For the Tribonacci…

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

Let $\alpha, \beta$ be two relatively prime algebraic integers in a number field $K$ and $N$ be a positive integer. We show that the number of $n\in\{1,2,\dots,N\}$ such that the $\beta$-adic expansion of $\alpha^n$ omits a given digit is…

In this paper we present an alternative approach to a problem dealt with by Rosales et al. In particular, once a base $b$ for the representation of the integers is fixed, we describe a procedure for constructing the smallest multiplicative…

A route to evaluate exact sums represented by Dirichlet eta and beta functions, both of which are alternating and divergent at negative integer arguments, is advocated. It rests on precise polynomial extrapolations and stands as a…

The $(-\beta)$-integers are natural generalisations of the $\beta$-integers, and thus of the integers, for negative real bases. When $\beta$ is the analogue of a Parry number, we describe the structure of the set of $(-\beta)$-integers by a…

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 study the negative beta transformations $T_{-\beta}:=-\beta x +\lfloor\beta x\rfloor+1$ for $x\in(0,1]$ and $\beta>1$. We present a complete characterization of pairs of dstinct non-integers with the same $T_{-\beta}$-invariant measure:…

Much has been written about expansions of real numbers in noninteger bases. Particularly, for a finite alphabet $\{0,1,\dots,\alpha\}$ and a real number (base) $1<\beta<\alpha+1$, the so-called {\em univoque set} of numbers which have a…

Fix a positive integer $N$ and a real number $0< \beta < 1/(N+1)$. Let $\Gamma$ be the homogeneous symmetric Cantor set generated by the IFS $$ \Big\{ \phi_i(x)=\beta x + i \frac{1-\beta}{N}: i=0,1,\cdots, N \Big\}. $$ For…

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…

For a congruence subgroup $\Gamma$, we define the notion of $\Gamma$-equivalence on binary quadratic forms which is the same as proper equivalence if $\Gamma = \mathrm{SL}_2(\mathbb Z)$. We develop a theory on $\Gamma$-equivalence such as…

We are looking for an optimal convex domain on which the boundary value problem $$\left\{\begin{array}{cc}(-\Delta)^2 u_\gamma-\gamma\Delta u_\gamma = f,& \mbox{ in }\Omega\\ u_\gamma=\partial_\nu u_\gamma=0,& \mbox{ on…

This paper extends those of Glendinning and Sidorov [3] and of Hare and Sidorov [6] from the case of the doubling map to the more general $\beta$-transformation. Let $\beta \in (1,2)$ and consider the $\beta$-transformation…

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…

Revisiting an approach by Conway and Sloane we investigate a collection of optimal non-linear binary codes and represent them as (non-linear) codes over Z4. The Fourier transform will be used in order to analyze these codes, which leads to…

Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series,…

For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…

We have computed all zeros $\beta+i\gamma$ of $\mathop{\mathcal R }(s)$ with $0<\gamma<215946.3$. A total of 162215 zeros with 25 correct decimal digits. In this paper we offer some statistic based on this set of zeros. Perhaps the main…