Related papers: Decompositions of factor codes and embeddings betw…
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
State-of-the-art language generation models can degenerate when applied to open-ended generation problems such as text completion, story generation, or dialog modeling. This degeneration usually shows up in the form of incoherence, lack of…
Based on the fact that, for a subfactor $N$ of a II$_1$ factor $M,$ the first non-trivial Jones index is 2 and then $M$ is decomposed as the crossed product of $N$ by an outer action of ${\mathbb{Z}}_2,$ we study pairs $ \{N, uNu^* \}$ from…
We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…
Machine learning has had a major impact on data compression over the last decade and inspired many new, exciting theoretical and applied questions. This paper describes one such direction -- relative entropy coding -- which focuses on…
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.
We study multifractal decompositions based on Birkhoff averages for sequences of functions belonging to certain classes of symbolically continuous functions. We do this for an expanding interval map with countably many branches, which we…
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that…
In this paper, we use entropy functions to characterise the set of rate-capacity tuples achievable with either zero decoding error, or vanishing decoding error, for general network coding problems. We show that when sources are colocated,…
Inverse categories are categories in which every morphism x has a unique pseudo-inverse y in the sense that xyx=x and yxy=y. Persistence modules from topological data analysis and similarly decomposable category representations factor…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…
Subspace codes were introduced by K\"otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component…
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…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
The entanglement entropy of intervals in $1+1$ interface CFTs is modified in two ways compared to a CFT without interface: there is a finite boundary entropy contribution, and, for an interval with an endpoint at the interface, the…
Given a finite-to-one factor code $\pi: X \to Y$ between irreducible sofic shifts and an ergodic $\nu$ on $Y$ with full support, it is known that the fiber $\pi^{-1}_*(\nu)$ has at most $d_\pi$ ergodic measures in it where $d_\pi$ is the…
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
A nonequilibrium system is characterized by a set of thermodynamic forces and fluxes which give rise to entropy production (EP). We show that these forces and fluxes have an information-geometric structure, which allows us to decompose EP…
We consider inference for high-dimensional separately and jointly exchangeable arrays where the dimensions may be much larger than the sample sizes. For both exchangeable arrays, we first derive high-dimensional central limit theorems over…