相关论文: Universal finitary codes with exponential tails

A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubi\v{c}ka, Long and Ne\v{s}et\v{r}il showed that every interval in the homomorphism order of graphs is universal, with the only…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Universal fixed-to-variable lossless source coding for memoryless sources is studied in the finite blocklength and higher-order asymptotics regimes. Optimal third-order coding rates are derived for general fixed-to-variable codes and for…

In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…

For an open and dense subset of elliptic ${\rm SL}(2,\mathbb R)$ matrix cocycles, we construct a family of loosely Bernoulli ergodic measures with zero top Lyapunov exponent. This provides a counterpart to a classical result by Furstenberg.…

Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

In this paper, we investigate several types of low complexity of finite partitions, including precompactness, zero maximal pattern entropy, bounded mean complexity and mean equicontinuity. We first show that a collection of finite…

We consider character sequences evolving on a phylogenetic tree under the TKF91 model. We show that as the sequence lengths tend to infinity the the topology of the phylogenetic tree and the edge lengths are determined by any one of (a) the…

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

For a branching random walk that drifts to infinity, consider its Malthusian martingale, i.e.~the additive martingale with parameter $\theta$ being the smallest root of the characteristic equation. When particles are killed below the…

Local and category-theoretical entropies associated with an endomorphism of finite length (i.e., with zero-dimensional closed fiber) of a commutative Noetherian local ring are compared. Local entropy is shown to be less than or equal to…

Let $K\subset \mathbb{R}$ be a self-similar set generated by some iterated function system. In this paper we prove, under some assumptions, that $K$ can be identified with a subshift of finite type. With this identification, we can…

Let $f$ be an holomorphic endomorphism of $\mathbb{P}^k$ and $\mu$ be its measure of maximal entropy. We prove an Almost Sure Invariance Principle for the systems $(\mathbb{P}^k,f,\mu)$. Our class $\cal{U}$ of observables includes the…

It is shown that the nonparametric maximum likelihood estimator of a univariate log-concave probability density satisfies desirable consistency properties in the tail regions. Specifically, let $P$ and $f$ denote the true underlying…

The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We extend…

This paper investigates what can be inferred about an arbitrary continuous probability distribution from a finite sample of $N$ observations drawn from it. The central finding is that the $N$ sorted sample points partition the real line…

Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…

Enumeration of hypermaps is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. However, it is challenging and explicit…