Related papers: Subshifts with sparse traces
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…
The microscopic and macroscopic dynamics of random networks is investigated in the strong-dilution limit (i.e. for sparse networks). By simulating chaotic maps, Stuart-Landau oscillators, and leaky integrate-and-fire neurons, we show that a…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…
In this article we study orbits of proximal pairs in almost automorphic subshifts. The corresponding orbits in the maximal equicontinuous factor are precisely those orbits that intersect the boundary of the subshift's separating cover. We…
High-dimensional real-world systems can often be well characterized by a small number of simultaneous low-complexity interactions. The analysis of variance (ANOVA) decomposition and the anchored decomposition are typical techniques to find…
In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…
We give a necessary and sufficient condition on a positive compact operator $T$ for the existence of a singular trace (i.e. a trace vanishing on the finite rank operators) which takes a finite non-zero value on $T$. This generalizes…
We introduced in a previous paper a general notion of asymptotic morphism of a given local net of observables, which allows to describe the sectors of a corresponding scaling limit net. Here, as an application, we illustrate the general…
We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
The family of symmetric one sided subshifts in two symbols given by a sequence $a$ is studied. We analyse some of their topological properties such as transitivity, the specification property and intrinsic ergodicity. It is shown that…
We study operators defined on a Hilbert space defined by a self-affine Delone set $\Lambda$ and show that the usual trace of a restriction of the operator to finite-dimensional subspaces satisfies a certain $\limsup$ law controlled by…
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…
Sparse Subspace Clustering (SSC) is a popular unsupervised machine learning method for clustering data lying close to an unknown union of low-dimensional linear subspaces; a problem with numerous applications in pattern recognition and…
Many modern applications require detecting change points in complex sequential data. Most existing methods for change point detection are unsupervised and, as a consequence, lack any information regarding what kind of changes we want to…
We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…
The $N=2$ minimal superconformal model can be twisted yielding an example of topological conformal field theory. In this article we investigate a Lie theoretic extension of this process.
We characterize inverse limits of nilsystems in topological dynamics, via a structure theorem for topological dynamical systems that is an analog of the structure theorem for measure preserving systems. We provide two applications of the…
Stability and dependence are model-theoretic notions that have recently proved highly effective in the study of structural and algorithmic properties of hereditary graph classes, and are considered key notions for generalizing to hereditary…