Related papers: Unambiguously coded shifts
Let X be a subshift satisfy non-uniform structure. In this paper, we give quantitative estimate of the recurrence sets. These results can be applied to a large class of symbolic systems, including beta-shifts, S-gap shifts and their…
We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…
Unbounded complex symmetric weighted shifts are studied. Complex symmetric unilateral weighted shifts whose $C^\infty$ vectors contain the image of the canonical orthonormal basis under the conjugation are shown to be decomposable into an…
The aim of this paper is twofold. In the first part, we consider twisted Rota-Baxter operators on associative algebras that were introduced by Uchino as a noncommutative analogue of twisted Poisson structures. We construct an…
We develop new closed form representations of sums of (n + {\alpha})th shifted harmonic numbers and reciprocal binomial coefficients in terms of {\alpha}th shifted harmonic numbers. Some interesting new consequences and illustrative…
Multidimensional convolutional codes generalize (one dimensional) convolutional codes and they correspond under a natural duality to multidimensional systems widely studied in the systems literature.
We formulate a division problem for a class of overdetermined systems introduced by L. H{\"o}rmander, and establish an effective divisibility criterion. In addition, we prove a coherence theorem which extends Nadel's coherence theorem from…
A formal description of a quantum abacus based encoding system is presented. This way of representing data for processing purposes is based on a quantum algorithm for counting qubits introduced by Lesovik et al. \cite{LesovikEtal2010} and…
Dynamic unary encoding takes unary encoding to the next level. Every n-bit binary string is an encoding of dynamic unary and every n-bit binary string is encodable by dynamic unary. By utilizing both forms of unary code and a single bit of…
Extended variants of the recently introduced spread unary coding are described. These schemes, in which the length of the code word is fixed, allow representation of approximately n^2 numbers for n bits, rather than the n numbers of the…
We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The…
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
The class of strictly singular operators originating from the dual of a separable Banach space is written as an increasing union of $\omega_1$ subclasses which are defined using the Schreier sets. A question of J. Diestel, of whether a…
Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
With the increasing deployment of machine learning systems in practice, transparency and explainability have become serious issues. Contrastive explanations are considered to be useful and intuitive, in particular when it comes to…
We develop a new transmission scheme for additive white Gaussian noisy (AWGN) channels based on Fuchsian groups from rational quaternion algebras. The structure of the proposed Fuchsian codes is nonlinear and nonuniform, hence conventional…
A new and natural description of the category of unstable modules over the Steenrod algebra as a category of comodules over a bialgebra is given; the theory extends and unifies the work of Carlsson, Kuhn, Lannes, Miller, Schwartz, Zarati…
We present shuffle coding, a general method for optimal compression of sequences of unordered objects using bits-back coding. Data structures that can be compressed using shuffle coding include multisets, graphs, hypergraphs, and others. We…