Related papers: Fractal dual substitution tilings
The present work proposes the development of a novel method to provide descriptors for colored texture images. The method consists in two steps. In the first, we apply a linear transform in the color space of the image aiming at…
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 short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases,…
Aperiodic tiling --- a form of complex global geometric structure arising through locally checkable, constant-time matching rules --- has long been closely tied to a wide range of physical, information-theoretic, and foundational…
Perfect fractals are mathematical objects that, because they are generated by recursive processes, have self-similarity and infinite complexity. In particular, they also have a fractional dimension. Although several proposals for the study…
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and…
Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…
In a previous paper by the first two authors, a tube formula for fractal sprays was obtained which also applies to a certain class of self-similar fractals. The proof of this formula uses distributional techniques and requires fairly strong…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
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…
This paper proposes a new method to analyze the spatial structure of urban systems using ideas from fractals. Regarding a system of cities as a set of "particles" distributed randomly on a triangular lattice, we construct a spatial…
Three-dimensional topological insulators support gapless Dirac fermion surface states whose rich topological properties result from the interplay of symmetries and dimensionality. Their topological properties have been extensively studied…
We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch…
Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
Recently Taylor and Socolar introduced an aperiodic mono-tile. The associated tiling can be viewed as a substitution tiling. We use the substitution rule for this tiling and apply the algorithm of \cite{AL} to check overlap coincidence. It…