Related papers: Smallest bases of expansions with multiple digits

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any…

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\epsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if x=\sum_{i=1}^{\infty}\epsilon_iq^{-i}. Let…

Let $q\in(1,2)$. A $q$-expansion of a number $x$ in $[0,\frac{1}{q-1}]$ is a sequence $(\delta_i)_{i=1}^\infty\in\{0,1\}^{\mathbb{N}}$ satisfying $$ x=\sum_{i=1}^\infty\frac{\delta_i}{q^i}.$$ Let $\mathcal{B}_{\aleph_0}$ denote the set of…

For a positive integer $m$ let $\Omega _m=\{0,1, \cdots , m\}$ and \begin{align*} \mathcal B_2(m)=&\left \{q\in(1,m+1]: \text{$\exists\; x\in [0, m/(q-1)]$ has exactly }\right. \\ &\left. \text{two different $q$-expansions w.r.t. $\Omega…

Let $q\in(1,2)$; it is known that each $x\in[0,1/(q-1)]$ has an expansion of the form $x=\sum_{n=1}^\infty a_nq^{-n}$ with $a_n\in\{0,1\}$. It was shown in \cite{EJK} that if $q<(\sqrt5+1)/2$, then each $x\in(0,1/(q-1))$ has a continuum of…

In this paper we answer several questions raised by Sidorov on the set $\mathcal B_2$ of bases in which there exist numbers with exactly two expansions. In particular, we prove that the set $\mathcal B_2$ is closed, and it contains both…

For $q>1$ we consider expansions in base $q$ over the alphabet $\{0,1,q\}$. Let $\mathcal{U}_q$ be the set of $x$ which have a unique $q$-expansions. For $k=2, 3,\cdots,\aleph_0$ let $\mathcal{B}_k$ be the set of bases $q$ for which there…

Given a positive real number $x$, we consider the smallest base $q_s(x)\in(1,2)$ for which there exists a unique sequence $(d_i)$ of zeros and ones such that \[ x=\sum_{i=1}^\infty\frac{d_i}{(q_s(x))^i}. \] In this paper we give complete…

For a real number $q\in(1,2)$ and $x\in[0,1/(q-1)]$, the infinite sequence $(d_i)$ is called a \emph{$q$-expansion} of $x$ if $$ x=\sum_{i=1}^\infty\frac{d_i}{q^i},\quad d_i\in\{0,1\}\quad\textrm{for all}~ i\ge 1. $$ For $m=1, 2, \cdots$ or…

We study the problem of finding the smallest $m$ such that every element of an exponential family can be written as a mixture of $m$ elements of another exponential family. We propose an approach based on coverings and packings of the face…

Let $q > 1$ be a real number and let $m=m(q)$ be the largest integer smaller than $q$. It is well known that each number $x \in J_q:=[0, \sum_{i=1}^{\infty} m q^{-i}]$ can be written as $x=\sum_{i=1}^{\infty}{c_i}q^{-i}$ with integer…

In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…

A positive integer $N$ is \emph{palindromic in the base $b$} when $N = \sum_{i=0}^{k} c_i b^i$, $c_k\neq 0$,and $c_i=c_{k-i},\; i=0,1,2,...,k$, Focusing on powers of 2, we investigate the smallest base $b$ when $N=2^n$ is palindromic in the…

Given a real number $x>0$, we determine $q_s(x):=\inf\mathscr{U}(x)$, where $\mathscr{U}(x)$ is the set of all bases $q\in(1,2]$ for which $x$ has a unique expansion of $0$'s and $1$'s. We give an explicit description of $q_s(x)$ for…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

We investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the…

A set of non-negative integers A is an additive 2-basis with range n, if its sumset A+A contains 0, 1, ..., n but not n+1. Explicit bases are known with arbitrarily large size |A|=k and $n/k^2 \ge 2/7 > 0.2857$. We present a more general…

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

A double-base representation of an integer n is an expression n = n_1 + ... + n_r, where the n_i are (positive or negative) integers that are divisible by no primes other than 2 or 3; the length of the representation is the number r of…

The bipartite Ramsey number $BR(H_1,H_2,\ldots,H_k)$, is the smallest positive integer $b$, such that each $k$-decomposition of $E(K_{b,b})$ contains $H_i$ in the $i$-th class for some $i, 1\leq i\leq k$. As another view of bipartite Ramsey…