Related papers: A Three-Dimensional SFT with Sparse Columns
We introduce a new class of two dimensional conformal field theories by extending Wess-Zumino-Witten (WZW) models to chiral algebras with matrix-valued levels. The new CFTs are based on holomorphic currents with an operator product…
In this paper, we prove that almost every translation of $\mathbb{T}^2$ admits a symbolic coding which has linear complexity $2n+1$. The partitions are constructed with Rauzy fractals associated with sequences of substitutions, which are…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
This paper proposes a subspace decomposition method based on an over-complete dictionary in sparse representation, called "Sparse Signal Subspace Decomposition" (or 3SD) method. This method makes use of a novel criterion based on the…
We study fractional exclusion statistics for quantum systems with SU(2) symmetry (arbitrary spin $S$), by generalizing the thermodynamic equations with squeezed strings proposed by Ha and Haldane. The bare hole distributions as well as the…
We define a morphic subshift as a subshift generated by the image of a substitution subshift by another substitution. In other words, it is the subshift associated with a ultimately periodic directive sequence. We present an efficient…
Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…
We study the one-dimensional complex conformal manifold that controls the infrared dynamics of a three-dimensional $\mathcal{N}=2$ supersymmetric theory of three chiral superfields with a cubic superpotential. Two special points on this…
We introduce methods for discovering and applying sparse feature circuits. These are causally implicated subnetworks of human-interpretable features for explaining language model behaviors. Circuits identified in prior work consist of…
Many dynamical systems can be naturally represented as `Bratteli-Vershik' (or `adic') systems, which provide an appealing combinatorial description of their dynamics. If an adic system X satisfies two technical conditions (`focus' and…
The main object of this work is to present a powerful method of construction of subshifts which we use chiefly to construct WAP systems with various properties. Among many other applications of this so called labeled subshifts, we obtain…
We propose a new variant of nonnegative matrix factorization (NMF), combining separability and sparsity assumptions. Separability requires that the columns of the first NMF factor are equal to columns of the input matrix, while sparsity…
We extend non-invertible duality concepts from one-dimensional systems to two spatial dimensions by constructing a web of non-invertible dualities for lattice models with subsystem symmetries. For the $\mathbb{Z}_2 \times \mathbb{Z}_2$…
Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. A double stranded DNA molecule contains two strands, each having a 5' and a 3' end, and these two strands together form the molecule with the…
Interfaces in two-dimensional systems exhibit unexpected complex dynamical behaviors, the dynamics of a border connecting a stripe pattern and a uniform state is studied. Numerical simulations of a prototype isotropic model, the subcritical…
We view a design $\mathcal{D}$ as a set of $k$-subsets of a fixed set $X$ of $v$ points. A $k$-subset of $X$ is at distance $i$ from $\mathcal{D}$ if it intersects some $k$-set in $\mathcal{D}$ in $k-i$ points, and no subset in more than…
We study the dynamics of an 'electric' $\mathcal{N}=1$ 3D $U(N_c)_{k,k+\frac{N_c}{2}}$ SQCD theory. By embedding the theory in string theory, we propose that the theory admits a 'magnetic' dual and analyse the low energy dynamics of the…
We study the dynamics near infinity of polynomial mappings $f$ in $\mathbb{C}^2$. We assume that $f$ has indeterminacy points and is non constant on the line at infinity $L_\infty$. If $L_\infty$ is $f$-attracting, we decompose the Green…
We consider the task of classification in the high dimensional setting where the number of features of the given data is significantly greater than the number of observations. To accomplish this task, we propose a heuristic, called sparse…
The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime…