Related papers: The dimension spectrum of graph directed Markov sy…
We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
Graph minors are a primary tool in understanding the structure of undirected graphs, with many conceptual and algorithmic implications. We propose new variants of \emph{directed graph minors} and \emph{directed graph embeddings}, by…
We consider deterministic Markov decision processes (MDPs) and apply max-plus algebra tools to approximate the value iteration algorithm by a smaller-dimensional iteration based on a representation on dictionaries of value functions. The…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
We introduce two families of infinite iterated function systems (IFSs) $\mathcal{F}(\mathbf{d}, T)$ and $\mathcal{G}(\mathbf{d}, T)$, parametrized by a sequence of positive real numbers $\mathbf{d}$ and a natural number $T$, and investigate…
The number of distinct symbols appearing in digit expansions generated by full-branch affine countable iterated function systems is studied whose branch weights are regularly varying. The Hausdorff dimensions of the exceptional sets in…
In this paper, we consider subsets of an attractor of an iterated function system in which each point is associated with an allowable word from an $S$-gap shift. The main result shows that bounds for the box dimension and Hausdorff…
This paper is devoted to the study of some connections between coadjoint orbits in infinite dimensional Lie algebras, isospectral deformations and linearization of dynamical systems. We explain how results from deformation theory,…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
We study the set of irregular points for topologically mixing subshifts of finite type. It is well known that despite the irregular set having zero measure for every invariant measure, it has full topological entropy and full Hausdorff…
It is well-known that the dynamical spectrum of an ergodic measure dynamical system is related to the diffraction measure of a typical element of the system. This situation includes ergodic subshifts from symbolic dynamics as well as…
This paper addresses questions regarding controllability for `generic parameter' dynamical systems, i.e. the question whether a dynamical system is `structurally controllable'. Unlike conventional methods that deal with structural…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
In this note we prove two extensions of a recent combinatorial characterization due to Li, Qiao, Wigderson, Wigderson and Zhang (arXiv:2206.04815) of the maximal dimension of bounded rank subspaces of the graphical matrix space associated…
Finding the correct encoding for a generic dynamical system's trajectory is a complicated task: the symbolic sequence needs to preserve the invariant properties from the system's trajectory. In theory, the solution to this problem is found…
For a positive measure set of nonuniformly expanding quadratic maps on the interval we effect a multifractal formalism, i.e., decompose the phase space into level sets of time averages of a given observable and consider the associated {\it…
We study the large-population limit of interacting particle systems evolving on adaptive dynamical networks, motivated in particular by models of opinion dynamics. In such systems, agents interact through weighted graphs whose structure…
A representation of frequency of strings of length K in complete genomes of many organisms in a square has led to seemingly self-similar patterns when K increases. These patterns are caused by under-represented strings with a certain…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…