Related papers: Complexity of the Fibonacci snowflake

Fibonacci word fractals are a class of fractals that have been studied recently, though the word they are generated from is more widely studied in combinatorics. The Fibonacci word can be used to draw a curve which possesses…

In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. Moreover, we associate to this family of words a family of curves, which have fractal properties, in…

We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…

In this paper, we introduce a variation of the factor complexity, called the $N$-factor complexity, which allows us to characterize the complexity of sequences on an infinite alphabet. We evaluate precisely the $N$-factor complexity for the…

Following \cite{Visintin}, we exploit the fractional perimeter of a set to give a definition of fractal dimension for its measure theoretic boundary. We calculate the fractal dimension of sets which can be defined in a recursive way and we…

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

In many problems of classical analysis extremal configurations appear to exhibit complicated fractal structure. This makes it much harder to describe extremals and to attack such problems. Many of these problems are related to the…

The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring…

Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.

We consider the geometry of a class of fractal sets in $\mathbb{R}^{2}$ that generalise the famous Koch curve and Koch snowflake. While the classical Koch curve is defined by an iterative process that divides a line segment into three parts…

The Koch snowflake is one of the first fractals that were mathematically described. It is interesting because it has an infinite perimeter in the limit but its limit area is finite. In this paper, a recently proposed computational…

The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…

In this paper, a class of fractals, called quadrilateral labyrinth fractals, are introduced and studied. They are a special kind of fractals on any quadrilateral on the plane. This type of fractal is motivated by labyrinth fractal on the…

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…

This paper is a sharp and focussed exploration of the Fibonacci substitution and the mathematical entity it gives rise to, the Fibonacci word. Our investigations are both of an algebraic and a geometric nature. Indeed, it is the combination…