Upper bound for palindromic and factor complexity of rich words

A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 is attained, the word w is called rich. An infinite word w is called rich if every finite factor of w is rich. Let w be a word (finite or infinite) over an alphabet with q > 1 letters, let Facw(n) be the set of factors of length n of the word w, and let Palw(n) ⊆ Facw(n) be the set of palindromic factors of length n of the word w. We present several upper bounds for |Facw(n)| and |Palw(n)|, where w is a rich word. Let δ = [see formula in PDF]. In particular we show that |Facw(n)| ≤ (4q2n)δ ln 2n+2. In 2007, Baláži, Masáková, and Pelantová showed that |Palw(n)|+|Palw(n+1)| ≤ |Facw(n+1)|-|Facw(n)|+2, where w is an infinite word whose set of factors is closed under reversal. We prove this inequality for every finite word v with |v| ≥ n + 1 and v(n + 1) closed under reversal.

The Unruh effect interpreted as a quantum noise channel

We make use of the tools of quantum information theory to shed light on the Unruh effect. A modal qubit appears as if subjected to quantum noise that degrades quantum information, as observed in the accelerated reference frame. The Unruh effect experienced by a mode of a free Dirac field, as seen by a relativistically accelerated observer, is treated as a noise channel, which we term the Unruh channel. We characterize this channel by providing its operator-sum representation, and study various facets of quantum correlations, such as, Bell inequality violations, entanglement, teleportation and measurement-induced decoherence under the effect. We compare and contrast this channel from conventional noise due to environmental decoherence. We show that the Unruh effect produces an amplitude-damping-like channel, associated with zero temperature, even though the Unruh effect is associated with a non-zero temperature. Asymptotically, the Bloch sphere subjected to the channel does not converge to a point, as would be expected by fluctuation-dissipation arguments, but contracts by a finite factor. We construct for the Unruh effect the inverse channel, a non-completely-positive map, that formally reverses the effect, and offer some physical interpretation.

Local rigidity for actions of Kazhdan groups on noncommutative Lp-spaces

Let Γ be a discrete group and 𝒩 a finite factor, and assume that both have Kazhdan's Property (T). For p ∈ [1, +∞), p ≠ 2, let π : Γ →O(Lp(𝒩)) be a homomorphism to the group O(Lp(𝒩)) of linear bijective isometries of the Lp-space of 𝒩. There are two actions πl and πr of a finite index subgroup Γ+ of Γ by automorphisms of 𝒩 associated to π and given by πl(g)x = (π(g) 1)*π(g)(x) and πr(g)x = π(g)(x)(π(g) 1)* for g ∈ Γ+ and x ∈ 𝒩. Assume that πl and πr are ergodic. We prove that π is locally rigid, that is, the orbit of π under O(Lp(𝒩)) is open in Hom (Γ, O(Lp(𝒩))). As a corollary, we obtain that, if moreover Γ is an ICC group, then the embedding g ↦ Ad (λ(g)) is locally rigid in O(Lp(𝒩(Γ))), where 𝒩(Γ) is the von Neumann algebra generated by the left regular representation λ of Γ.

Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs

A labeling of a graph is a function from the vertices of the graph to some finite set. In 1996, Albertson and Collins defined distinguishing labelings of undirected graphs. Their definition easily extends to directed graphs. Let $G$ be a directed graph associated to the $k$-block presentation of a Bernoulli scheme $X$. We determine the automorphism group of $G$, and thus the distinguishing labelings of $G$. A labeling of $G$ defines a finite factor of $X$. We define demarcating labelings and prove that demarcating labelings define finitarily Markovian finite factors of $X$. We use the Bell numbers to find a lower bound for the number of finitarily Markovian finite factors of a Bernoulli scheme. We show that demarcating labelings of $G$ are distinguishing.

CELLULAR AUTOMATA OVER SEMI-DIRECT PRODUCT GROUPS: REDUCTION AND INVERTIBILITY RESULTS

Cellular automata are transformations of configuration spaces over finitely generated groups, such that the next state in a point only depends on the current state of a finite neighborhood of the point itself. Many questions arise about retrieving global properties from such local descriptions, and finding algorithms to perform these tasks. We consider the case when the group is a semi-direct product of two finitely generated groups, and show that a finite factor (whatever it is) can be thought of as part of the alphabet instead of the group, preserving both the dynamics and some "finiteness" properties. We also show that, under reasonable hypotheses, this reduction is computable: this leads to some reduction theorems related to the invertibility problem.