Related papers: Fractal squares with finitely many connected compo…
Ad-hoc networks are often deployed in regions with complicated boundaries. We show that if the boundary is modeled as a fractal, a network requiring line of sight connections has the counterintuitive property that increasing the number of…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
In this paper, we give a review of fractal calculus which is an expansion of standard calculus. Fractal calculus is applied for functions which are not differentiable or integrable on totally disconnected fractal sets such as middle-$\mu$…
Fractured metal fragments with rough and irregular surfaces are often found at crime scenes. Current forensic practice visually inspects the complex jagged trajectory of fractured surfaces to recognize a ``match'' using comparative…
We consider the morphology of two dimensional cracks observed in experimental results obtained from paper samples and compare these results with the numerical simulations of the random fuse model (RFM). We demonstrate that the data obey…
This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…
Analysis on fractals is a growing field, with hints of potential for widespread applicability across all of STEM. One of the most heavily researched type of fractals are the nested fractals, fractal shapes defined by virtue of being made of…
The relation between critical exponents, characterizing a continuous phase transition, and the fractal structure of physical lines, proliferating at the critical point, is established by considering the two-dimensional O($N$) spin model for…
The tree of decomposition of a $k$-connected graph by a set $\mathfrak S$ of pairwise independent $k$-vertex cutsets is defined as follows. The vertices of this tree are cutsets of $\mathfrak S$ and parts of decomposition of the graph by…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
We study the formation of fractal structure in one-dimensional many-body systems with attractive power-law potentials. Numerical analysis shows that the range of the index of the power for which fractal structure emerges is limited.…
We find that with uniform mesh, the numerical schemes derived from finite element method can keep a preserved symplectic structure in one-dimensional case and a preserved multisymplectic structure in two-dimentional case in certain discrete…
Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and…
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing process. Recently, there have been some attempts to analyze the…
We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of…
We investigate the iterative construction of discrete Laplacians on 2D square lattices, revealing emergent fractal-like patterns shaped by modular arithmetic. While classical 2222-style iterations reproduce known structures such as the…
Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…
This article investigates the complex symplectic geometry of the deformation space of complex projective structures on a closed oriented surface of genus at least 2. The cotangent symplectic structure given by the Schwarzian parametrization…
We determine a lower bound for the number of edges of a 2-connected maximal nontraceable graph, and present a construction of an infinite family of maximal nontraceable graphs that realize this bound.
We consider two models (A and B) which can describe both two dimensional fragmentation and stochastic fractals. Model A exhibits multifractality on a unique support when describing a fragmentation process and on one of infinitely many…