Related papers: Complexity of the Fibonacci snowflake
We present a theoretical framework for understanding the wavefunctions and spectrum of an extensively studied paradigm for quasiperiodic systems, namely the Fibonacci chain. Our analytical results, which are obtained in the limit of strong…
This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
The state complexity of a regular language is the number of states in the minimal deterministic automaton accepting the language. The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…
Let $H$ be a composition of an $\mathbb{R}$-linear planar mapping and $z\mapsto z^n$. We classify the dynamics of $H$ in terms of the parameters of the $\mathbb{R}$-linear mapping and the degree by associating a certain finite Blaschke…
Using off-lattice noise reduction it is possible to estimate the asymptotic properties of diffusion-limited aggregation clusters grown in three dimensions with greater accuracy than would otherwise be possible. The fractal dimension of…
The "quantum complexity" of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical…
We are interested in the algebraic properties of groups of local biholomorphisms and their consequences. A natural question is whether the complexity of solvable groups is bounded by the dimension of the ambient space. In this spirit we…
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
We study dimensional properties of visible parts of fractal percolation in the plane. Provided that the dimension of the fractal percolation is at least 1, we show that, conditioned on non-extinction, almost surely all visible parts from…
Let $\mathfrak{g}=\mathfrak{g}_{\bar{0}}\oplus \mathfrak{g}_{\bar{1}}$ be a classical Lie superalgebra and $\mathcal{F}$ be the category of finite dimensional $\mathfrak{g}$-supermodules which are completely reducible over the reductive Lie…
We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of…
Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…
We determine the order of magnitude of the variance of the Fibonacci partition function. The answer is different to the most naive guess. The proof involves a diophantine system and an inhomogeneous linear recurrence.
Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…
The Fibonacci cube $\Gamma_n$ is obtained from the $n$-cube $Q_n$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube $\Lambda_n$ is obtained. The…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as…