Related papers: Univoque graphs and multiple expansions

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 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…

Let $M$ be a positive integer and $q\in (1, M+1]$. A $q$-expansion of a real number $x$ is a sequence $(c_i)=c_1c_2\cdots$ with $c_i\in \{0,1,\ldots, M\}$ such that $x=\sum_{i=1}^{\infty}c_iq^{-i}$. In this paper we study the set…

An undirected graph is said to have \emph{unique neighborhoods} if any two distinct nodes have also distinct sets of neighbors. In this way, the connections of a node to other nodes can characterize a node like an "identity", irrespectively…

Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…

Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every…

Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…

Let $M$ be a positive integer and $q \in(1,M+1].$ We consider expansions of real numbers in base $q$ over the alphabet $\{0,\ldots, M\}$. In particular, we study the set $\mathcal{U}_{q}$ of real numbers with a unique $q$-expansion, and 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…

We prove that for every polynomial of one complex variable of degree at least 2 and Julia set not being totally disconnected nor a circle, nor interval, Hausdorff dimension of this Julia set is larger than 1. Till now this was known only in…

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…

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…

Glendinning and Sidorov discovered an important feature of the Komornik-Loreti constant $q'\approx1.78723$ in non-integer base expansions on two-letter alphabets: in bases $1<q<q'$ only countably numbers have unique expansions, while for…

We introduce and study non-uniform expansions of real numbers, given by two non-integer bases.

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

A folklore conjecture in number theory states that the only integers whose expansions in base $3,4$ and $5$ contain solely binary digits are $0, 1$ and $82000$. In this paper, we present the first progress on this conjecture. Furthermore,…

Given $x\in(0, 1]$, let $\mathcal U(x)$ be the set of bases $q\in(1,2]$ for which there exists a unique sequence $(d_i)$ of zeros and ones such that $x=\sum_{i=1}^\infty d_i/q^i$. L\"{u}, Tan and Wu (2014) proved that $\mathcal U(x)$ is a…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…