English
Related papers

Related papers: Multiple partial rigidity rates in low complexity …

200 papers

We develop a model-theoretic framework for the study of distal factors of strongly ergodic, measure-preserving dynamical systems of countable groups. Our main result is that all such factors are contained in the (existential) algebraic…

Dynamical Systems · Mathematics 2019-12-16 Tomás Ibarlucía , Todor Tsankov

Motivated by quantum thermodynamics we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action…

Quantum Physics · Physics 2023-08-24 Frederik vom Ende

For a continuous semicascade on a metrizable compact set $\Omega $, we consider the weak$^{*}$ convergence of generalized operator ergodic means in ${\rm End}\, \, C^{*} (\Omega)$. We discuss conditions on the dynamical system under which…

Dynamical Systems · Mathematics 2015-12-30 A. V. Romanov

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

Combinatorics · Mathematics 2026-03-10 Igor Dolinka , D. G. FitzGerald , James D. Mitchell

Stability is a fundamental concept that refers to a system's ability to return close to its original state after disturbances. The minimal conditions for stability when system parameters vary in time, though common in physics, have been…

Chaotic Dynamics · Physics 2026-05-22 Arnaud Lazarus , Emmanuel Trélat

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

The focus of this paper is to better understand the coexistence of rigidity, weak mixing, and recurrence by constructing thin sets in the product of countably many copies of the finite cyclic group of order q. A Kronecker-type set K is a…

Dynamical Systems · Mathematics 2024-07-02 Cash Cherry

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

Dynamical Systems · Mathematics 2023-06-22 Ronnie Pavlov

We prove results about subshifts with linear (word) complexity, meaning that $\limsup \frac{p(n)}{n} < \infty$, where for every $n$, $p(n)$ is the number of $n$-letter words appearing in sequences in the subshift. Denoting this limsup by…

Dynamical Systems · Mathematics 2023-09-15 Darren Creutz , Ronnie Pavlov

Given pseudo-random binary sequence of length $L$, assuming it consists of $k$ sub-sequences of length $N$. We estimate how $k$ scales with growing $N$ to obtain a {\it limiting} ergodic behaviour, to fulfill the basic definition of…

Statistical Mechanics · Physics 2009-04-22 M. Süzen

Nearly-elastic model systems with one or two degrees of freedom are considered: the system is undergoing a small loss of energy in each collision with the "wall". We show that instabilities in this purely deterministic system lead to…

Probability · Mathematics 2012-08-31 Mark Freidlin , Wenqing Hu

Let $\F$ be a collection of subsets of $\Z_+$ and $(X,T)$ be a dynamical system. $x\in X$ is $\F$-recurrent if for each neighborhood $U$ of $x$, $\{n\in\Z_+:T^n x\in U\}\in \F$. $x$ is $\F$-product recurrent if $(x,y)$ is recurrent for any…

Dynamical Systems · Mathematics 2010-01-22 Pandeng Dong , Song Shao , Xiangdong Ye

We consider the dynamics of an arbitrary quantum system coupled to a large arbitrary and fully quantum mechanical environment through a random interaction. We establish analytically and check numerically the typicality of this dynamics, in…

Quantum Physics · Physics 2017-07-26 Grégoire Ithier , Florent Benaych-Georges

Let $S_{T}(k)$ denote the set of distinct substrings of length $k$ in a string $T$, then the $k$-th substring complexity is defined by its cardinality $|S_{T}(k)|$. Recently, $\delta = \max \{ |S_{T}(k)| / k : k \ge 1 \}$ is shown to be a…

Data Structures and Algorithms · Computer Science 2022-05-26 Akiyoshi Kawamoto , Tomohiro I

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…

Dynamical Systems · Mathematics 2026-04-15 Mao Shinoda , Hiroki Takahasi , Kenichiro Yamamoto

J. Elton proved that every normalized weakly null sequence in a Banach space admits a subsequence that is nearly unconditional which is a weak form of unconditionality. The notion of near-unconditionality is quantified by a constant…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , E. Odell , Th. Schlumprecht , A. Zsak

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

We define variational properties for dynamical systems with subexponential complexity, and study these properties in certain specific examples. By computing the value of slow entropy directly, we show that some subshifts are not…

Dynamical Systems · Mathematics 2024-10-22 Minhua Cheng , Carlos Ospina , Kurt Vinhage , Yibo Zhai

We study the asymptotic behaviour of contractive operators and strongly continuous semigroups on separable Hilbert spaces using the notion of rigidity. In particular, we show that a "typical" contraction $T$ contains the unit circle times…

Functional Analysis · Mathematics 2014-05-01 Tanja Eisner

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…

Discrete Mathematics · Computer Science 2017-06-27 Bruno Durand , Andrei Romashchenko