相关论文: Decompositions of factor codes and embeddings betw…
It is well-known that any $\mathbb{Z}$ subshift with the specification property has the property that every factor is intrinsically ergodic, i.e., every factor has a unique factor of maximal entropy. In recent work, other $\mathbb{Z}$…
For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of…
We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…
We compare some recent computations of the entanglement of formation in quantum information theory and of the entropy of a subalgebra in quantum ergodic theory. Both notions require optimization over decompositions of quantum states. We…
The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…
We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the…
We calculate exactly the von Neumann and topological entropies of the toric code as a function of system size and temperature. We do so for systems with infinite energy scale separation between magnetic and electric excitations, so that the…
We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…
Recent observations have revealed the presence of small fibres or sub-filaments within larger filaments. We present a numerical fragmentation study of fibrous filaments investigating the link between cores and sub-filaments using…
Systems of hard shapes crystallize due to entropy. How is entropy distributed among translational and rotational microscopic contributions? We answer this question by decomposing thermal fluctuation of crystals of hard hexagons into…
Motivated by the notion of intermediate dimensions introduced by Falconer et al., we introduce a continuum of topological entropies that are intermediate between the (Bowen) topological entropy and the lower and upper capacity topological…
For a morphism f in a category C with sufficiently many finite limits and colimits, we discuss an elementary construction of a decomposition of f through objects P and N which, if C happens to have a zero object, amounts to the standard…
We show that for any invariant measure $\mu$ on a free group shift system, there are two numbers $h^\flat \leq h^\sharp$ which in some sense are the typical upper and lower sofic entropy values. We also give a condition under which $h^\flat…
The present article studies the finite Zariski tangent spaces to an affine variety X as linear codes, in order to characterize their typical or exceptional properties by global geometric conditions on X. The discussion concerns the generic…
Large alphabet source coding is a basic and well-studied problem in data compression. It has many applications such as compression of natural language text, speech and images. The classic perception of most commonly used methods is that a…
This work constructs codes that are efficiently decodable from a constant fraction of \emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for…
In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the…
The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…
Using follower/predecessor/extender set sequences, we define quantities which we call the follower/predecessor/extender entropies, which can be associated to any shift space. We analyze the behavior of these quantities under conjugacies and…