Related papers: Tilings from Graph Directed Iterated Function Syst…
We propose a new simple construction of an aperiodic tile set based on self-referential (fixed point) argument. People often say about some discovery that it appeared "ahead of time", meaning that it could be fully understood only in the…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…
Fractal structures emerge from statistical and hierarchical processes in urban development or network evolution. In a class of efficient and robust geographical networks, we derive the size distribution of layered areas, and estimate the…
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function.…
We study enumerations of Dyck and ballot tilings, which are tilings of a region determined by two Dyck or ballot paths. We give bijective proofs to two formulae of enumerations of Dyck tilings through Hermite histories. We show that one of…
We briefly review the standard methods used to construct quasiperiodic tilings, such as the projection, the inflation, and the grid method. A number of sample Mathematica programs, implementing the different approaches for one- and…
We use the self-similar tilings constructed by the second author in "Canonical self-affine tilings by iterated function systems" to define a generating function for the geometry of a self-similar set in Euclidean space. This tubular zeta…
We consider infinite measure-preserving non-primitive self-similar tiling systems in Euclidean space $\mathbb R^d$. We establish the second-order ergodic theorem for such systems, with exponent equal to the Hausdorff dimension of a…
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field.…
Crystallographic tilings of the Euclidean space $\mathbb{E}^n$ are defined as simple tilings whose group of isometric automorphisms is crystallographic. To classify crystallographic tilings by their automorphism groups it is necessary to…
We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
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…
Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…
It is proved that every pseudo-self-affine tiling in R^d is mutually locally derivable with a self-affine tiling. A characterization of pseudo-self-similar tilings in terms of derived Voronoi tessellations is a corollary. Previously, these…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
New tilings of certain subsets of $\mathbb{R}^{M}$ are studied, tilings associated with fractal blow-ups of certain similitude iterated function systems (IFS). For each such IFS with attractor satisfying the open set condition, our…