Words in Linear Groups, Random Walks, Automata and P-Recursiveness

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of Kontsevich.Comment: 10 pages, 1 figur

Recursive quantum convolutional encoders are catastrophic: A simple proof

Poulin, Tillich, and Ollivier discovered an important separation between the classical and quantum theories of convolutional coding, by proving that a quantum convolutional encoder cannot be both non-catastrophic and recursive. Non-catastrophicity is desirable so that an iterative decoding algorithm converges when decoding a quantum turbo code whose constituents are quantum convolutional codes, and recursiveness is as well so that a quantum turbo code has a minimum distance growing nearly linearly with the length of the code, respectively. Their proof of the aforementioned theorem was admittedly "rather involved," and as such, it has been desirable since their result to find a simpler proof. In this paper, we furnish a proof that is arguably simpler. Our approach is group-theoretic---we show that the subgroup of memory states that are part of a zero physical-weight cycle of a quantum convolutional encoder is equivalent to the centralizer of its "finite-memory" subgroup (the subgroup of memory states which eventually reach the identity memory state by identity operator inputs for the information qubits and identity or Pauli-Z operator inputs for the ancilla qubits). After proving that this symmetry holds for any quantum convolutional encoder, it easily follows that an encoder is non-recursive if it is non-catastrophic. Our proof also illuminates why this no-go theorem does not apply to entanglement-assisted quantum convolutional encoders---the introduction of shared entanglement as a resource allows the above symmetry to be broken.Comment: 15 pages, 1 figure. v2: accepted into IEEE Transactions on Information Theory with minor modifications. arXiv admin note: text overlap with arXiv:1105.064

Presentations of Topological Full Groups by Generators and Relations

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.Comment: Some typos fixe

Why Numbers Are Sets

I follow standard mathematical practice and theory to argue that the natural numbers are the finite von Neumann ordinals. I present the reasons standardly given for identifying the natural numbers with the finite von Neumann's. I give a detailed mathematical demonstration that 0 is {} and for every natural number n, n is the set of all natural numbers less than n. Natural numbers are sets. They are the finite von Neumann ordinals