Related papers: Coding Polish spaces
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We give, for each level of complexity L, a Hurewicz-like characterization of the Borel subsets with countable sections of a product of two Polish spaces that cannot become in L by changing the two Polish topologies.
These informal notes were prepared in connection with a lecture at a high school mathematics tournament, and provide an overview of some examples of metric spaces and a few of their basic properties.
Pairs of metrics in a two-dimensional linear vector space are considered, one of which is a Minkowski type metric. Their simultaneous diagonalizability is studied and canonical presentations for them are suggested.
In this paper we further develop the theory of canonical approximations of Polishable subgroups of Polish groups, building on previous work of Solecki and Farah--Solecki. In particular, we obtain a characterization of such canonical…
We introduce and study (metrically) quarter-stratifiable spaces and then apply them to generalize Rudin and Kuratowski-Montgomery theorems about the Baire and Borel complexity of separately continuous functions.
Subspace codes are the $q$-analog of binary block codes in the Hamming metric. Here the codewords are vector spaces over a finite field. They have e.g. applications in random linear network coding, distributed storage, and cryptography. In…
We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable…
Given a completely metrizable space $X$, let $\mathfrak{par}(X)$ denote the smallest possible size of a partition of $X$ into Polish spaces, and $\mathfrak{cov}(X)$ the smallest possible size of a covering of $X$ with Polish spaces. Observe…
The space of unitary $C_{0}$-semigroups on separable infinite dimensional Hilbert space, when viewed under the topology of uniform weak convergence on compact subsets of $\mathbb{R}_{+}$, is known to admit various interesting residual…
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced…
In this paper, we define notions of $P_{Z}(S)$-metric and $P_{Z}(S)$-metric space and we show that every $P_{Z}(S)$-metric Space, analogous to an ordinary metric space and generally, a $\Lambda$-metric space, is a topological space, and in…
We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…
In this article, we introduce the concept of lexicographic metric space and, after discussing some basic properties of these metric spaces, such as completeness, boundedness, compactness and separability, we obtain a formula for the metric…
Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel…
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
Participation of mathematicians in the implementation of economic projects in Poland, in which mathematics-based methods played an important role, happened sporadically in the past. Usually methods known from publications and verified were…
A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…