Related papers: Univoque graphs and multiple expansions

We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…

We consider expanding maps such that the unit interval can be represented as a full symbolic shift space with bounded distortion. There are already theorems about the Hausdorff dimension for sets defined by the set of accumulation points…

An independent set of size $k$ in a finite undirected graph $G$ is a set of $k$ vertices of the graph, no two of which are connected by an edge. Let $x_{k}(G)$ be the number of independent sets of size $k$ in the graph $G$ and let…

The number of distinct symbols appearing in digit expansions generated by full-branch affine countable iterated function systems is studied whose branch weights are regularly varying. The Hausdorff dimensions of the exceptional sets in…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

Let $\beta_1,\beta_2>1$ and $T_i(x,y) = \bigl(\frac{x+i}{\beta_1}, \frac{y+i}{\beta_2}\bigr),\ i\in\{\pm1\}$. Let $A := A_{\beta_1, \beta_2}$ be the unique compact set satisfying $A = T_{1}(A) \cup T_{-1}(A)$. In this paper we give a…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We study the structure of $r$-uniform hypergraphs containing no Berge cycles of length at least $k$ for $k \leq r$, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such…

We present a detailed Hausdorff dimension analysis of the set of real numbers where the product of consecutive partial quotients in their continued fraction expansion grow at a certain rate but the growth of the single partial quotient is…

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…

Confirming a conjecture of Ne\v{s}et\v{r}il, we show that up to isomorphism there is only a finite number of finite minimal asymmetric undirected graphs. In fact, there are exactly 18 such graphs. We also show that these graphs are exactly…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to…

In 1964, Golod and Shafarevich found that, provided that the number of relations of each degree satisfy some bounds, there exist infinitely dimensional algebras satisfying the relations. These algebras are called Golod-Shafarevich algebras.…

The digits of the Pierce expansion satisfy the law of large numbers. It is known that the Hausdorff dimension of the set of exceptions to the law of large numbers is 1. We provide an elementary proof of this fact by adapting Jun Wu's…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

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…