Related papers: Fractal Images as Number Sequences I An Introducti…
This paper introduces the concept of Fractal Frenet equations, a set of differential equations used to describe the behavior of vectors along fractal curves. The study explores the analogue of arc length for fractal curves, providing a…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
Fractals are geometric shapes that can display complex and self-similar patterns found in nature (e.g., clouds and plants). Recent works in visual recognition have leveraged this property to create random fractal images for model…
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…
Formerly the geometry was based on shapes, but since the last centuries this founding mathematical science deals with transformations, projections and mappings. Projective geometry identifies a line with a single point, like the perspective…
In this paper, we observe graph fractaloids, which are the graph groupoids with fractal property. In particular, we classify them in terms of the spectral data of certain Hilbert space operators, called the radial operators. Based on these…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…
Modularization is a cornerstone of computer science, abstracting complex functions into atomic building blocks. In this paper, we introduce a new level of modularization by abstracting generative models into atomic generative modules.…
A fractal function is a function whose graph is the attractor of an iterated function system. This paper generalizes analytic continuation of an analytic function to continuation of a fractal function.
Spectral Clustering is one of the most traditional methods to solve segmentation problems. Based on Normalized Cuts, it aims at partitioning an image using an objective function defined by a graph. Despite their mathematical attractiveness,…
As nature is ascribed as quantum, the fractals also pose some intriguing appearance which is found in many micro and macro observable entities or phenomena. Fractals show self-similarity across sizes; structures that resemble the entire are…
Cracks on a painting is not a defect but an inimitable signature of an artwork which can be used for origin examination, aging monitoring, damage identification, and even forgery detection. This work presents the development of a new…
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…
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…
This paper is a survey, with few proofs, of ideas and notions related to self-similarity of groups, semi-groups and their actions. It attempts to relate these concepts to more familiar ones, such as fractals, self-similar sets, and…
Given an integer $n\geq 2$ and a digit set ${\mathcal D}\subsetneq {0,1,...,n-1}^2$, there is a self-similar set $F \subset {\Bbb R}^2$ satisfying the set equation: $F=(F+{\mathcal D})/n$. We call such $F$ a fractal square. By studying a…