Related papers: Complexity of the Fibonacci snowflake
We study a percolation model on the square lattice, where clusters "freeze" (stop growing) as soon as their volume (i.e. the number of sites they contain) gets larger than N, the parameter of the model. A model where clusters freeze when…
We consider an oscillatory obstacle problem where the coincidence set and free boundary are also highly oscillatory. We establish a rate of convergence for a regularized notion of free boundary to the free boundary of a corresponding…
Complex fractal dimensions, defined as poles of appropriate fractal zeta functions, describe the geometric oscillations in fractal sets. In this work, we show that the same possible complex dimensions in the geometric setting also govern…
We consider zigzags in thin complexes. The main result states that the sum of the lengths of all zigzags in an $n$-complexe is equal to the sum of the lengths of all zigzags in all $(n-1)$-faces of this complex, and this sum also is the…
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…
We give a forbidden pattern characterization for the class of generalized definite languages, show that the corresponding problem is NL-complete and can be solved in quadratic time. We also show that their syntactic complexity coincides…
Consider the Fourier restriction operator associated to a curve in $R^d$, $d\ge 3$. We prove for various classes of curves the endpoint restricted strong type estimate with respect to affine arclength measure on the curve. An essential…
We consider the six-vertex model with Domain Wall Boundary Conditions on a $N\times N$ square lattice. Our main interest is the study of the fluctuations of the extremal lattice path about the arctic curves. We address the problem through…
Call a smooth knot (or smooth link) in the unit sphere in $\mathbb{C}^2$ analytic (respectively, smoothly analytic) if it bounds a complex curve (respectively, a smooth complex curve) in the complex ball. Let $K$ be a smoothly analytic…
Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc…
Complexity measures are designed to capture complex behavior and quantify *how* complex, according to that measure, that particular behavior is. It can be expected that different complexity measures from possibly entirely different fields…
We give a metric characterization of snowflakes of Euclidean spaces. Namely, a metric space is isometric to $\mathbb R^n$ equipped with a distance $(d_{\rm E})^\epsilon$, for some $n\in \mathbb N_0$ and $\epsilon\in (0,1]$, where $d_{\rm…
In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.
The theory of complex dimensions of fractal strings developed by Lapidus and van Frankenhuijsen has proven to be a powerful tool for the study of Minkowski measurability of fractal subsets of the real line. In a very general setting, the…
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
Multifractals are inhomogeneous measures (or functions) which are typically described by a full spectrum of real dimensions, as opposed to a single real dimension. Results from the study of fractal strings in the analysis of their geometry,…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
If D is a rational polygon, then the associated rational billiard table is given by \Omega(D). Such a billiard table is well understood. If F is a closed fractal curve approximated by a sequence of rational polygons, then the corresponding…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
We study Nielsen complexity and Fubini-Study complexity for a class of exactly solvable one dimensional spin systems. Our examples include the transverse XY spin chain and its natural extensions, the quantum compass model with and without…