Related papers: Fractal dimensions and profinite groups

We prove that if G_P is a finitely constrained group of binary rooted tree automorphisms (a group binary tree subshift of finite type) defined by an essential pattern group P of pattern size d, d>1, and if G_P has maximal Hausdorff…

The Kakeya conjecture is generally formulated as one the following statements: every compact/Borel/arbitrary subset of ${\mathbb R}^n$ that contains a (unit) line segment in every direction has Hausdorff dimension $n$; or, sometimes, that…

This paper contains a comparative study of two families of simple curves drawn in the plane. On the one hand, we have the fractal curves on the unit interval, with self-similar structure, which have associated a Hausdorff dimension. On the…

Let $F$ be a field of characteristic $0$ containing all roots of unity. We construct a functorial compact Hausdorff space $X_F$ whose profinite fundamental group agrees with the absolute Galois group of $F$, i.e. the category of finite…

We prove a "uniform" version of the finite density Halpern-L\"{a}uchli Theorem. Specifically, we say that a tree $T$ is homogeneous if it is uniquely rooted and there is an integer $b\geq 2$, called the branching number of $T$, such that…

A family $\mathcal{F}$ of permutations of the vertices of a hypergraph $H$ is called 'pairwise suitable' for $H$ if, for every pair of disjoint edges in $H$, there exists a permutation in $\mathcal{F}$ in which all the vertices in one edge…

We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realization of a fractal…

In this paper we use the theory of computing to study fractal dimensions of projections in Euclidean spaces. A fundamental result in fractal geometry is Marstrand's projection theorem, which shows that for every analytic set E, for almost…

We discuss the geometry of trees endowed with a causal structure using the conventional framework of equilibrium statistical mechanics. We show how this ensemble is related to popular growing network models. In particular we demonstrate…

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Under mild conditions we show that the affinity dimension of a planar self-affine set is equal to the supremum of the Lyapunov dimensions of self-affine measures supported on self-affine proper subsets of the original set. These self-affine…

We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\V$ be a finite set system defined over an $n$-point set $X$; we view $\V$ as a set of indicator vectors over the…

We quantify the extent to which a supercritical Sobolev mapping can increase the dimension of subsets of its domain, in the setting of metric measure spaces supporting a Poincar\'e inequality. For foliations of a metric space X defined by a…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

We introduce a fractal dimension for a metric space defined in terms of the persistent homology of extremal subsets of that space. We exhibit hypotheses under which this dimension is comparable to the upper box dimension; in particular, the…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

We study adaptive network models in which coupling weights evolve on a fast time scale relative to the phase dynamics of the nodes. Using Geometric Singular Perturbation Theory (GSPT), we prove that, although the microscopic system is…

Let H be a Hilbert space and let F be the family of all countable subsets of an orthonormal basis of H. We show that if F is infinite then F is equipollent with every linear basis of the vector space H. In doing so we also present a short…

We construct a theory of fields living on continuous geometries with fractional Hausdorff and spectral dimensions, focussing on a flat background analogous to Minkowski spacetime. After reviewing the properties of fractional spaces with…