Related papers: A monotone isomorphism theorem
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…
This is the first part in a series in which sofic entropy theory is generalized to class-bijective extensions of sofic groupoids. Here we define topological and measure entropy and prove invariance. We also establish the variational…
In this paper, we show that under certain conditions on the coefficients and initial values, solutions of two different Bernoulli initial-value problems are symmetric to each other either with respect to the t-axis, or the y-axis, or the…
We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…
Given a quantum system consisting of many parts, we show that symmetry of the system's state, i.e., invariance under swappings of the subsystems, implies that almost all of its parts are virtually identical and independent of each other.…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the…
We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…
Let $G$ be a countable discrete sofic group. We define a concept of uniform mixing for measure-preserving $G$-actions and show that it implies completely positive sofic entropy. When $G$ contains an element of infinite order, we use this to…
Soft theorems can be recast as Ward identities of asymptotic symmetries. We review such relation for the leading and subleading soft graviton theorems in arbitrary even dimensions. While soft theorems are trivially generalized to dimensions…
In this paper we calculate the metric and folding entropies for a family of non-invertible symbolic dynamical systems $(\Sigma_{m_-,m_+}, \sigma_\phi)$ which generalizes the standard bilateral Bernoulli shifts. The space $\Sigma_{m_-,m_+}$…
Let $p$ and $q$ be probability vectors with the same entropy $h$. Denote by $B(p)$ the Bernoulli shift indexed by $\Z$ with marginal distribution $p$. Suppose that $\phi$ is a measure preserving homomorphism from $B(p)$ to $B(q)$. We prove…
A probability measure is a characteristic measure of a topological dynamical system if it is invariant to the automorphism group of the system. We show that zero entropy shifts always admit characteristic measures. We use similar techniques…
We prove that the quantum relative entropy decreases monotonically under the application of any positive trace-preserving linear map, for underlying separable Hilbert spaces. This answers in the affirmative a natural question that has been…
A binary word is symmetric if it is a palindrome or an antipalindrome. We define a new measure of asymmetry of a binary word equal to the minimal number of letters of the word whose deleting from the word yields a symmetric word and obtain…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
The paper makes the observation that all orders of information entropy are equal in signals composed of repeating units of distinct symbols where the units can be classified as a member of a symmetry group. This leads to an improved metric…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…