Related papers: On sets of indefinitely desubstitutable words
A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note…
Recently a new class of critical points, termed as {\sl perpetual points}, where acceleration becomes zero but the velocity remains non-zero, is observed in nonlinear dynamical systems. In this work we show whether a transformation also…
Large Language Models are built on the so-called distributional semantic approach to linguistic meaning that has the distributional hypothesis at its core. The distributional hypothesis involves a holistic conception of word meaning: the…
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…
Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the…
By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in…
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
The notion of stability in a structured argumentation setup characterizes situations where the acceptance status associated with a given literal will not be impacted by any future evolution of this setup. In this paper, we abstract away…
This paper offers a comprehensive treatment of the question as to whether a binary relation can be consistent (transitive) without being decisive (complete), or decisive without being consistent, or simultaneously inconsistent or…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
The stability of stationary solutions of first-order systems of PDE's are considered. They may include some singular geometric terms, leading to discontinuous flux and non-conservative products. Based on several examples in Fluid Mechanics,…
The main result of this paper is that every non-trivial Hamiltonian diffeomorphism of a closed oriented surface of genus at least one has periodic points of arbitrarily high period. The same result is true for S^2 provided the…
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…
We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…
The study of word equations (or the existential theory of equations over free monoids) is a central topic in mathematics and theoretical computer science. The problem of deciding whether a given word equation has a solution was shown to be…
We introduce and consider the notion of stable degeneracies of translation invariant energy functions for finite Ising models. By this term we mean the lack of injectivity that cannot be lifted by changing the interaction. We show that…
Let $M(A,I)$ be a free partially commutative monoid with involution and $G(A,I)$ be its quotient group, e.g. a right-angled Artin or Coxeter group. Given a system of word equations over $M(A,I)$ with recognizable constraints with input size…
In finite-dimensional dynamical systems, stochastic stability provides the selection of physical relevant measures from the myriad invariant measures of conservative systems. That this might also apply to infinite-dimensional systems is the…
This paper proposes several definitions of robust stability for logic dynamical systems (LDSs) with uncertain switching, including robust/uniform robust set stability and asymptotical (or infinitely convergent)/finite-time set stability…