SearcharxivSearch

arXiv subjects

Andrew Vince

Publications and source records attributed to Andrew Vince.

At least 19 recordsLinked to original sources

Transition Phenomena for the Attractor of an Iterated Function System

Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity of the functions in the IFS has been central to the theory of iterated functions systems. If the functions in the IFS are contractions, then the IFS is guaranteed to have a unique attractor. Recently, however, there has been an interest in what occurs to the attractor at the boundary between contractvity and expansion of the IFS. That is the subject of this paper. For a family $F_t$ of IFSs depending on a real parameter $t>0$, the existence and properties of two types of transition attractors, called the lower transition attractor $A_{\bullet}$ and the upper transition attractor $A^{\bullet}$, are investigated. A main theorem states that, for a wide class of IFS families, there is a threshold $t_0$ such that the IFS $F_t$ has a unique attractor $A_t$ for $t t_0$. At the threshold $t_0$, there is an $F_{t_0}$-invariant set $A^{\bullet}$ such that $A^{\bullet} = \lim_{t\rightarrow t_0} A_t$.

math.DS

Distortion Reversal in Aperiodic Tilings

It is proved that homeomorphic images of certain two-dimensional aperiodic tilings, such as Ammann-A2 tilings, are recognizable, in both mathematical and practical senses. One implication of the results is that it is possible to search for distorted aperiodic structures in nature, where they may be hiding in plain sight.

math.DS

The Average Size of a Connected Vertex Set of a $k$-connected Graph

The topic is the average order $A(G)$ of a connected induced subgraph of a graph $G$. This generalizes, to graphs in general, the average order of a subtree of a tree. In 1984, Jamison proved that the average order, over all trees of order $n$, is minimized by the path $P_n$, the average being $A(P_n)=(n+2)/3$. In 2018, Kroeker, Mol, and Oellermann conjectured that $P_n$ minimizes the average order over all connected graphs $G$ - a conjecture that was recently proved. In this short note we show that this lower bound can be improved if the connectivity of $G$ is known. If $G$ is $k$-connected, then \[A(G) \geq \frac{n}2 \Bigg (1- \frac{1}{2^k+1} \Bigg ).\]

math.CO

The Maximum Matroid of a Graph

The ground set for all matroids in this paper is the set of all edges of a complete graph. The notion of a {\it maximum matroid for a graph} $G$ is introduced, and the existence and uniqueness of the maximum matroid for any graph $G$ is proved. The maximum matroid for $K_3$ is shown to be the cycle (or graphic) matroid. This result is pursued in two directions - to determine the maximum matroid for the $m$-cycle $C_m$ and to determine the maximum matroid for the complete graph $K_m$. The maximum matroid for $K_4$ is the matroid whose bases are the Laman graphs, related to structural rigidity of frameworks in the plane. The maximum matroid for $K_5$ is related to a famous 153 year old open problem of J. C. Maxwell.

math.CO

A Lower Bound on the Average Size of a Connected Vertex Set of a Graph

The topic is the average order of a connected induced subgraph of a graph. This generalizes, to graphs in general, the average order of a subtree of a tree. In 1984, Jamison proved that the average order, over all trees of order $n$, is minimized by the path $P_n$. In 2018, Kroeker, Mol, and Oellermann conjectured that $P_n$ minimizes the average order over all connected graphs. The main result of this paper confirms this conjecture.

math.CO

Tiling Iterated Function Systems

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be fractals and the tiled set may be a complicated unbounded subset of $\mathbb{R}^{M}$.

math.DS

Thresholds for One-Parameter Families of Affine Iterated Function Systems

This paper examines thresholds for certain properties of the attractor of a general one-parameter affine family of iterated functions systems. As the parameter increases, the iterated function system becomes less contractive, and the attractor evolves. Thresholds are studied for the following properties: the existence of an attractor, the connectivity of the attractor, and the existence of non-empty interior of the attractor. Also discussed are transition phenomena between existence and non-existence of an attractor.

math.MG

Tilings from Graph Directed Iterated Function Systems

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 balanced, the resulting tilings have a finite set of prototiles, are quasiperiodic but not periodic, and are self-similar. A necessary and sufficient condition for two balanced tilings to be congruent is provided.

math.MG

Tiling iterated function systems and Anderson-Putnam theory

The theory of fractal tilings of fractal blow-ups is extended to graph-directed iterated function systems, resulting in generalizations and extensions of some of the theory of Anderson and Putnam and of Bellisard et al. regarding self-similar tilings.

math.DS

Embedding the symbolic dynamics of Lorenz maps

Necessary and sufficient conditions for the symbolic dynamics of a Lorenz map to be fully embedded in the symbolic dynamics of a piecewise continuous interval map are given. As an application of this result, we describe a new algorithm for calculating the topological entropy of a Lorenz map.

math.DS

Self-Similar Tilings of Fractal Blow-Ups

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 construction produces a usually infinite family of tilings that satisfy the following properties: (1) the prototile set is finite; (2) the tilings are repetitive (quasiperiodic); (3) each family contains self-similartilings, usually infinitely many; and (4) when the IFS is rigid in an appropriate sense, the tiling has no non-trivial symmetry; in particular the tiling is non-periodic.

math.DS

Self-Similar Polygonal Tiling

The purpose of this paper is to give the flavor of the subject of self-similar tilings in a relatively elementary setting, and to provide a novel method for the construction of such polygonal tilings.

math.MG

Symmetry in Sphere-based Assembly Configuration Spaces

Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly processes. Since spheres within bunches could be identical and bunches could be identical as well, the underlying symmetry groups could be of large order that grows with the number of participating spheres and bunches. Thus, understanding symmetries and associated isomorphism classes of microstates correspond to various types of macrostates can significantly reduce the complexity of computing entropy and free energy, as well as paths and kinetics, in high dimensional configuration spaces. In addition, a precise understanding of symmetries is crucial for giving provable guarantees of algorithmic accuracy and efficiency in such computations. In particular, this may aid in predicting crucial assembly-driving interactions. This is a primarily expository paper that develops a novel, original framework for dealing with symmetries in configuration spaces of assembling spheres with the following goals. (1) We give new, formal definitions of various concepts relevant to sphere-based assembly that occur in previous work, and in turn, formal definitions of their relevant symmetry groups leading to the main theorem concerning their symmetries. These previously developed concepts include, for example, (a) assembly configuration spaces, (b) stratification of assembly configuration space into regions defined by active constraint graphs, (c) paths through the configurational regions, and (d) coarse assembly pathways. (2) We demonstrate the new symmetry concepts to compute sizes and numbers of orbits in two example settings appearing in previous work. (3) We give formal statements of a variety of open problems and challenges using the new conceptual definitions.

math.CO

Fast Basins and Branched Fractal Manifolds of Attractors of Iterated Function Systems

The fast basin of an attractor of an iterated function system (IFS) is the set of points in the domain of the IFS whose orbits under the associated semigroup intersect the attractor. Fast basins can have non-integer dimension and comprise a class of deterministic fractal sets. The relationship between the basin and the fast basin of a point-fibred attractor is analyzed. To better understand the topology and geometry of fast basins, and because of analogies with analytic continuation, branched fractal manifolds are introduced. A branched fractal manifold is a metric space constructed from the extended code space of a point-fibred attractor, by identifying some addresses. Typically, a branched fractal manifold is a union of a nondenumerable collection of nonhomeomorphic objects, isometric copies of generalized fractal blowups of the attractor.

math.DS

Conjugacies provided by fractal transformations I : Conjugate measures, Hilbert spaces, orthogonal expansions, and flows, on self-referential spaces

Theorems and explicit examples are used to show how transformations between self-similar sets (general sense) may be continuous almost everywhere with respect to stationary measures on the sets and may be used to carry well known flows and spectral analysis over from familiar settings to new ones. The focus of this work is on a number of surprising applications including (i) what we call fractal Fourier analysis, in which the graphs of the basis functions are Cantor sets, being discontinuous at a countable dense set of points, yet have very good approximation properties; (ii) Lebesgue measure-preserving flows, on polygonal laminas, whose wave-fronts are fractals. The key idea is to exploit fractal transformations to provide unitary transformations between Hilbert spaces defined on attractors of iterated function systems. Some of the examples relate to work of Oxtoby and Ulam concerning ergodic flows on regions bounded by polygons.

math.DS

A Combinatorial Characterization of the Critical Itineraries of a Uniform Dynamical System

For a function from the unit interval to itself with constant slope and one discontinuity, the itineraries of the point of discontinuity are called the critical itineraries. These critical itineraries play a significant role in the study of $β$-expansions (with positive or negative $β$) and fractal transformations. A combinatorial characterization of the critical itineraries of such functions is provided.

math.DS

Fractal Tiling

A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be constructed by this method. These tilings can be used to extend a fractal transformation defined on the attractor of a contractive IFS to a fractal transformation on the entire space upon which the IFS acts.

math.MG

A Combinatorial Approach to Positional Number Systems

Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits 0 and 1. Our combinatorial approach is to construct infinitely many binary radix systems, each one from a single pair of binary strings. Every binary radix system that satisfies even a minimal set of conditions that would be expected of a positional number system can be constructed in this way.

math.CO