Related papers: Complexity of the Fibonacci snowflake
The fine curve complex of a surface is a simplicial complex whose vertices are essential simple closed curves and whose $k$-simplices are collections of $k+1$ disjoint curves. We prove that the fine curve complex is homotopy equivalent to…
A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…
We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than…
A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length $n$. The famous conjecture…
A closed curve in the plane is weakly simple if it is the limit (in the Fr\'echet metric) of a sequence of simple closed curves. We describe an algorithm to determine whether a closed walk of length n in a simple plane graph is weakly…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
Perfect fractals are mathematical objects that, because they are generated by recursive processes, have self-similarity and infinite complexity. In particular, they also have a fractional dimension. Although several proposals for the study…
The Lorentz lattice gas is studied from the perspective of computational complexity theory. It is shown that using massive parallelism, particle trajectories can be simulated in a time that scales logarithmically in the length of the…
Given a closed manifold N and a self-indexing Morse function f: N --> R with up to four distinct Morse indices, we construct a symplectic Lefschetz fibration pi: E --> C which models the complexification of f on the disk cotangent bundle,…
Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the…
We generalize the concept of complexity near horizons to all nondegenerate black holes. For Schwarzschild black holes, we show that Rindler observers see a complexity change of $S$ during proper time $1/\kappa$ which corresponds to the…
Given an integer $n\geq 2$ and a digit set ${\mathcal D}\subsetneq {0,1,...,n-1}^2$, there is a self-similar set $F \subset {\Bbb R}^2$ satisfying the set equation: $F=(F+{\mathcal D})/n$. We call such $F$ a fractal square. By studying a…
Let $F_{n}$ be the $n$-th Fibonacci number. Put $\varphi=\frac{1+\sqrt5}{2}$. We prove that the following inequalities hold for any real $\alpha$: 1) $\inf_{n \in \mathbb N} ||F_n\alpha||\le\frac{\varphi-1}{\varphi+2}$, 2) $\liminf_{n\to…
We introduce snowballs, which are compact sets in $\R^3$ homeomorphic to the unit ball. They are 3-dimensional analogs of domains in the plane bounded by snowflake curves. For each snowball $B$ a quasiconformal map $f\colon \R^3\to \R^3$ is…
The nature of concept learning is a core question in cognitive science. Theories must account for the relative difficulty of acquiring different concepts by supervised learners. For a canonical set of six category types, two distinct…
Percolation on a one-dimensional lattice and fractals such as the Sierpinski gasket is typically considered to be trivial because they percolate only at full bond density. By dressing up such lattices with small-world bonds, a novel…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
Shape complexity is a hard-to-quantify quality, mainly due to its relative nature. Biased by Euclidean thinking, circles are commonly considered as the simplest. However, their constructions as digital images are only approximations to the…