Related papers: Reducible Iterated Graph Systems: multiscale-freen…
We extend classical basis constructions from Fourier analysis to attractors for affine iterated function systems (IFSs). This is of interest since these attractors have fractal features, e.g., measures with fractal scaling dimension.…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…
The fractal nature of graphs has traditionally been investigated by using the nodes of networks as the basic units. Here, instead, we propose to concentrate on the graph edges, and introduce a practical and computationally not demanding…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
We introduce a duality for Affine Iterated Function Systems (AIFS) which is naturally motivated by group duality in the context of traditional harmonic analysis. Our affine systems yield fractals defined by iteration of contractive affine…
Iterated function systems (IFS) provide a powerful method for constructing fractals and modeling complex structures. This paper develops the notion of a dynamical system of IFS to study how an initial IFS evolves over time. We construct a…
Recent advancements in photo-realistic novel view synthesis have been significantly driven by Gaussian Splatting (3DGS). Nevertheless, the explicit nature of 3DGS data entails considerable storage requirements, highlighting a pressing need…
An independent set $I$ in a graph $G$ is maximal if $I$ is not properly contained in any other independent set of $G$. The study of maximal independent sets (MIS's) in various graphs is well-established, often focusing upon enumeration of…
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs…
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…
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…
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set $S$ of nodes of a prescribed cardinality, we add a new node that is adjacent to…
Self-similar sets with open set condition, the linear objects of fractal geometry, have been considered mainly for crystallographic data. Here we introduce new symmetry classes in the plane, based on rotation by irrational angles. Examples…
Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
We provide a general framework to construct fractal interpolation surfaces (FISs) for a prescribed countably infinite data set on a rectangular grid. Using this as a crucial tool, we obtain a parameterized family of bivariate fractal…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
Graph is a ubiquitous structure in many domains. The rapidly increasing data volume calls for efficient and scalable graph data processing. In recent years, designing distributed graph processing systems has been an increasingly important…