Related papers: On the Mathematical Validity of the Higuchi Method
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…
A simple method of calculating the Hausdorff-Besicovitch dimension of the Kronecker Product based fractals is presented together with a compact R script realizing it. The proposed new formula is based on traditionally used values of the…
A method is described for calculating the approximate fractal dimension from a set of N values y sampled from a waveform between time zero and t. The waveform was subjected to a double linear transformation that maps it into a unit square.
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary. The complexity of this algorithm…
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…
This work presents a detailed analytical and geometrical investigation of the (2+1)-dimensional Boiti-Leon-Pempinelli system, a nonlinear dispersive model arising in the context of fluid and plasma dynamics. By employing a projective…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
We consider fractal graphs invariant by a skew product $F:\mathbb{T}^k\times \mathbb{R}\rightarrow \mathbb{T}^k\times \mathbb{R}$ of the form $F(x,y)=(Ax, \lambda y+p(x))$ where $0<\lambda<1$, $p\colon\mathbb{T}^k\to\mathbb{R}$ is a…
We propose an iterative method for nonlinear semidefinite programs with box constraints. The search direction in the proposed method utilizes the distance from the current point to the boundary of a feasible set. The computation of the…
In this paper I explore a nonstandard formulation of Hausdorff dimension. By considering an adapted form of the counting measure formulation of Lebesgue measure, I prove a nonstandard version of Frostman's lemma and show that Hausdorff…
The goal of this article is to study the box dimension of the mixed Katugampola fractional integral of two-dimensional continuous functions on [0; 1]X[0; 1]. We prove that the box dimension of the mixed Katugampola fractional integral…
Fractal dimension (D) is an effective parameter to represent the irregularity and fragmental property of a self-affine surface, which is common in physical vapor deposited thin films. D could be evaluated through the scaling performance of…
In the framework of the Hough transform technique to detect curves in images, we provide a bound for the number of Hough transforms to be considered for a successful optimization of the accumulator function in the recognition algorithm.…
We have developed a simulation technique that uses non-linear finite element analysis and elastic fracture mechanics to compute physically plausible motion for three-dimensional, solid objects as they break, crack, or tear. When these…
We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…
Let $f$ be a generalized affine fractal interpolation function with vertical scaling functions. In this paper, we prove the monotonicity of spectral radii of vertical scaling matrices without additional assumptions. We also obtain the…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…
In this manuscript, we provide a concise review of the concept of metric dimension for both deterministic as well as random graphs. Algorithms to approximate this quantity, as well as potential applications, are also reviewed. This work has…