Related papers: The Dimensions of Individual Strings and Sequences
Recently there has been considerable interest in studying the length and the depth of finite groups, algebraic groups and Lie groups. In this paper we introduce and study similar notions for algebras. Let $k$ be a field and let $A$ be an…
Let $m_1 \geq m_2 \geq 2$ be integers. We consider subsets of the product symbolic sequence space $(\{0,\cdots,m_1-1\} \times \{0,\cdots,m_2-1\})^{\mathbb{N}^*}$ that are invariant under the action of the semigroup of multiplicative…
The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory, as well as applications to a wide variety of topics…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
Two-dimensional string theory is known to contain the set of discrete states that are the SU(2) multiplets generated by the lowering operator of the SU(2) current algebra.Their structure constants are defined by the area preserving…
The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…
We extract verified algorithms for exact real number computation from constructive proofs. To this end we use a coinductive representation of reals as streams of binary signed digits. The main objective of this paper is the formalisation of…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…
In this paper, we investigate the Hausdorff dimension of naturally occurring sets of inhomogeneous well-approximable points with a sequence of real invertible matrices $\mathcal{A}=(A_n)_{n\in\mathbb{N}}$. Specifically, for a given point…
The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…
We investigate the Hausdorff dimension of level sets defined by digit growth rates in $\theta$-expansions, a generalization of regular continued fractions. For any $\alpha \geq 0$, we prove that the set \[ E_\theta(\alpha) = \left\{ x \in…
We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity…
Let $k$ be a natural number. We consider $k$-times continuously-differentiable real-valued functions $f:E\to\mathbb{R}$, where $E$ is some interval on the line having positive length. For $0<\alpha<1$ let $I_\alpha(f)$ denote the set of…
A string in four dimensions is constructed by supplementing it with forty four Majorana fermions. The central charge is 26. The fermions are grouped in such a way that the resulting action is supersymmetric. The super-Virasoro algebra is…
We compute the Hausdorff dimension of any random statistically self-affine Sierpinski sponge $K\subset \mathbb{R}^k$ ($k\ge 2$) obtained by using some percolation process in $[0,1]^k$. To do so, we first exhibit a Ledrappier-Young type…
Considerable attention has been given to the study of the arithmetic sum of two planar sets. We focus on understanding the measure and dimension of $A+\Gamma:=\left\{a+v:a\in A, v\in \Gamma \right\}$ when $A\subset \mathbb{R}^2$ and…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
For an infinite iterated function system $\mathbf{f}$ on $[0,1]$ with an attractor $\Lambda(\mathbf{f})$ and for an infinite subset $D\subseteq \mathbb{N}$, consider the set \[ \mathbb E(\mathbf{f},D)= \{ x \in \Lambda(\mathbf{f}):…
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…