Related papers: A new version of Toom's proof
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an…
We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…
We prove twisted homological stability with polynomial coefficients for automorphism groups of free nilpotent groups of any given class. These groups interpolate between two extremes for which homological stability was known before, the…
The existence, uniqueness, and asymptotic stability of modulo periodic Poisson stable solutions of dynamic equations on a periodic time scale are investigated. The model under investigation involves a term which is constructed via a Poisson…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
The stability rule for belief, advocated by Leitgeb [Annals of Pure and Applied Logic 164, 2013], is a rule for rational acceptance that captures categorical belief in terms of $\textit{probabilistically stable propositions}$: propositions…
The purpose of this short note is to present a simplified proof of Serre's modularity conjecture using the strong modularity lifting results currently available. This second version includes extra details on definitions and proofs than the…
We present new short proofs to both the exact and the stability results of two extremal problems. The first one is the extension of Tur\'{a}n's theorem in hypergraphs, which was firstly studied by Mubayi $\cite{MU06}$. The second one is…
In this paper we investigate the action of self-consistent transfer operators (STOs) on Birkhoff cones and give sufficient conditions for stability of their fixed points. Our approach relies on the order preservation properties of STOs that…
We consider a Hamiltonian chain of weakly coupled anharmonic oscillators. It is well known that if the coupling is weak enough then the system admits families of periodic solutions exponentially localized in space (breathers). In this paper…
We give computational results to study the accuracy of several quasicontinuum methods for two benchmark problems - the stability of a Lomer dislocation pair under shear and the stability of a lattice to plastic slip under tensile loading.…
Test-time evolution of agent memory serves as a pivotal paradigm for achieving AGI by bolstering complex reasoning through experience accumulation. However, even during benign task evolution, agent safety alignment remains vulnerable-a…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris et al. The main theorem can be used to…
This paper is concerned with the dynamical stability of the $m$-solitons of the Benjamin-Ono (BO) equation. This extends the work of Neves and Lopes [41], which was restricted to $m=2$ the double solitons case. By constructing a suitable…