Related papers: Elementary fractal geometry. 5. Weak separation is…
For any self-similar measure $\mu$ in $\mathbb{R}$, we show that the distribution of $\mu$ is controlled by products of non-negative matrices governed by a finite or countable graph depending only on the IFS. This generalizes the net…
Let $\{S_1, S_2, \dots, S_n\}$ be an iterated function system on $\mathbb{R}$ with attractor $K$. It is known that if the iterated function system satisfies the weak separation property and $K = [0,1]$ then the iterated function system also…
This study is about the Iterated Function System (IFS) of similarities on $\mathbb R$ that satisfies Weak Separation property (WSP). We explore if this implies Finite type property. We look into the most simple case with condition that…
We study sets of local dimensions for self-similar measures in $\mathbb{R}$ satisfying the finite neighbour condition, which is formally stronger than the weak separation condition but satisfied in all known examples. Under a mild technical…
A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…
Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…
The bounded gaps property of the prime numbers, as proven by Yitang Zhang, is considered for sequences of lengths of closed geodesics, which by the theory of Selberg zeta functions are the geometric analogue of the prime numbers. It turns…
In the present article, the main attention is given to fractal sets whose elements have certain restrictions on using digits or combinations of digits in own nega-P-representation. Topological, metric, and fractal properties of images of…
Call a hereditary family $\mathcal{F}$ of graphs strongly persistent if there exists a graphon $W$ such that in all subgraphons $W'$ of $W$, $\mathcal{F}$ is precisely the class of finite graphs that have positive density in $W'$. Our first…
In this paper it is shown that every non-periodic ergodic system has two topologically weakly mixing, fully supported models: one is non-minimal but has a dense set of minimal points; and the other one is proximal. Also for independent…
We introduce the so-called weak Pinsker dynamical filtrations, whose existence in any ergodic system follows from the universality of the weak Pinsker property, recently proved by Austin. These dynamical filtrations appear as a potential…
These are the lecture notes for a course at the Summer School on "Applied Analysis" at the Technical University Chemnitz in September 2011. We start with the definition of a fractal algebra and show that the fractal property is enormously…
A strongly separating path system in a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that, for every two edges $e$ and $f$ of $G$, there is a paths in $\mathcal{P}$ with $e$ and not $f$, and vice-versa. The minimum number of…
In this note we show that a semisimplicial set with the weak Kan condition admits a simplicial structure, provided any object allows an idempotent self-equivalence. Moreover, any two choices of simplicial structures give rise to equivalent…
In this paper, we prove some divisibility results for the Fourier coefficients of reduced modular forms of sign vectors. More precisely, we generalize a divisibility result of Siegel on constant terms when the weight is non-positive, which…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…