Related papers: A fractal perspective on optimal antichains and in…
We show that if $E$ is a countable Borel equivalence relation on $\mathbb{R}^n$, then there is a closed subset $A \subset [0,1]^n$ of Hausdorff dimension $n$ so that $E \restriction A$ is smooth. More generally, if $\leq_Q$ is a locally…
A family ${\mathcal A} \subset {\mathcal P} [n]$ is said to be an antichain if $A \not \subset B$ for all distinct $A,B \in {\mathcal A}$. A classic result of Sperner shows that such families satisfy $|{\mathcal A}| \leq \binom {n}{\lfloor…
Aims: Try to prove the $n$-dimensional balanced hypercube $BH_n$ is $(2n-2)$-fault-tolerant-prescribed hamiltonian laceability. Methods: Prove it by induction on $n$. It is known that the assertation holds for $n\in\{1,2\}$. Assume it holds…
We prove that for any nonlinear $f \in C^{1,\alpha}([0,1])$, the union of lines covering its graph has a Hausdorff dimension of at least $1+\alpha$, and this dimension bound is sharp. We then apply these geometric results to mathematical…
It is presented the general properties of N-dimensional multi-component or many-particle systems exhibiting self-similar hierarchical structure. Assuming there exists an optimal coarse-graining scale at which the quality and diversity of…
Two $n$-dimensional vectors $A$ and $B$, $A,B \in \mathbb{R}^n$, are said to be \emph{trivially orthogonal} if in every coordinate $i \in [n]$, at least one of $A(i)$ or $B(i)$ is zero. Given the $n$-dimensional Hamming cube $\{0,1\}^n$, we…
An antichain of subsets is a set of subsets such that no subset in the antichain is a proper subset of any other subset in the antichain. The Dedekind number counts the total number of antichains of subsets of an n-element set. This paper…
We introduce a new concept of dimension for metric spaces, the so-called topological Hausdorff dimension. It is defined by a very natural combination of the definitions of the topological dimension and the Hausdorff dimension. The value of…
Let $f$ be an endomorphism of $\mathbb{CP}^k$ and $\nu$ be an $f$-invariant measure with positive Lyapunov exponents $(\lambda_1,\...,\lambda_k)$. We prove a lower bound for the pointwise dimension of $\nu$ in terms of the degree of $f$,…
A subset $A$ of $\mathbb{Z}^n$ is called a weak antichain if it does not contain two elements $x$ and $y$ satisfying $x_i<y_i$ for all $i$. Engel, Mitsis, Pelekis and Reiher showed that for any weak antichain $A$, the sum of the sizes of…
The hypercube Qn of dimension n is one of the most versatile and powerful interconnection networks. The n-dimensional folded cube denoted as FQn, a variation of the hypercube possesses some embeddable properties that the hypercube does not…
Answering several questions of Duffus, Frankl and R\"odl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii) the numbers of maximal independent sets in the covering…
It is well known that the presence of horseshoes leads to positive entropy. If our goal is to construct a continuous map with infinite entropy, we can consider an infinite sequence of horseshoes, ensuring an unbounded number of legs.…
Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…
We show that an $n$-dimensional surface whose entropy is close to that of an $n$-dimensional plane is close in Hausdorff distance to some $n$-dimensional plane at every scale. Moreover we show that self-expanders of low entropy converge in…
We consider systems of multiple Brownian particles in one dimension that repel mutually via a logarithmic potential on the real line, more specifically the Dyson model. These systems are characterized by a parameter that controls the…
We prove that for any $1 \le k<n$ and $s\le 1$, the union of any nonempty $s$-Hausdorff dimensional family of $k$-dimensional affine subspaces of ${\mathbb R}^n$ has Hausdorff dimension $k+s$. More generally, we show that for any $0 <…
We present an algorithmic framework for computing anti-chains of maximum size in geometric posets. Specifically, posets in which the entities are geometric objects, where comparability of two entities is implicitly defined but can be…
We relate various concepts of fractal dimension of the limiting set C in fractal percolation to the dimensions of the set consisting of connected components larger than one point and its complement in C (the "dust"). In two dimensions, we…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…