Related papers: The structure of low complexity subshifts

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…

Paper withdrawn; will be replaced by revised version containing application to lattice models as well. We study hierarchical properties of Sturmian words. These properties are similar to those of substitution dynamical systems. This…

Induced supersymmetry representations on composite operators are studied. In superspace the ensuing transformation rules (trivially) lead to an effective superfield. On the other hand, an induced representation must exist for non-linear…

We describe a general program for studying the dynamics of surjective endomorphisms of algebraic varieties that are amenable to techniques from the minimal model program. We obtain density results on the pre-periodic points of surjective…

We develop a full 6-functor formalism for $p$-torsion \'etale sheaves in rigid-analytic geometry. More concretely, we use the recently developed condensed mathematics by Clausen--Scholze to associate to every small v-stack (e.g.…

This paper concerns structure learning or discovery of discrete generative models. It focuses on Bayesian model selection and the assimilation of training data or content, with a special emphasis on the order in which data are ingested. A…

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

Statistical learning in high-dimensional spaces is challenging without a strong underlying data structure. Recent advances with foundational models suggest that text and image data contain such hidden structures, which help mitigate the…

This is Part I of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. We prove that every Fraisse structure in a finite relational…

Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…

We explain and restate the results from our recent paper arXiv:1503.08000.v3 in standard language for substitutions and $S$-adic systems in symbolic dynamics. We then produce as rather direct application an $S$-adic system (with finite set…

The nonlinearity of dynamics in systems biology makes it hard to infer them from experimental data. Simple linear models are computationally efficient, but cannot incorporate these important nonlinearities. An adaptive method based on the…

At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove…

In this article we study the automorphism group ${\rm Aut}(X,\sigma)$ of subshifts $(X,\sigma)$ of low word complexity. In particular, we prove that Aut$(X,\sigma)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain…

We study the complexity of $\mathscr{B}$-free subshifts which are proximal and of zero entropy. Such subshifts are generated by Behrend sets. The complexity is shown to achieve any subexponential growth and is estimated for some classical…

We generalize Brudno's theorem of $1$-dimensional shift dynamical system to $\mathbb{Z}^d$ (or $\mathbb{Z}_+^d$) subshifts. That is to say, in $\mathbb{Z}^d$ (or $\mathbb{Z}^d_+$) subshift, the Kolmogorov-Sinai entropy is equivalent to the…

It is shown that any singular Lagrangian theory: 1) can be formulated without the use of constraints by introducing a Clairaut-type version of the Hamiltonian formalism; 2) leads to a special kind of nonabelian gauge theory which is similar…

Understanding the dynamics of feature learning in neural networks (NNs) remains a significant challenge. The work of (Mousavi-Hosseini et al., 2023) analyzes a multiple index teacher-student setting and shows that a two-layer student…

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…