Related papers: On Matched Metric and Channel Problem
Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems. It shows how to use this matrix representation to get the full set of valid satisfying…
Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…
The aim of this article is to establish basic results in a conditional measure theory. The results are applied to prove that arbitrary kernels and conditional distributions are represented by measures in a conditional set theory. In…
This paper is devoted to three topics. First, proving a measurability theorem for multifunctions with values in non-metrizable spaces, which is required to show that solutions to stochastic wave equations with interval parameters are random…
Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…
Necessary and sufficient conditions for a Riemannian product to be conformally equivalent to an Einstein manifold are given. Such spaces which are complete are characterized.
Similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
We study the set of curvature functions which a given compact manifold with boundary can possess. First, we prove that the sign demanded by the Gauss-Bonnet Theorem is a necessary and sufficient condition for a given function to be the…
A topological space $Y$ is said to have (AEEP) if the following condition is fulfilled. Whenever $(X,\mathfrak{M})$ is a measurable space and $f, g: X \to Y$ are two measurable functions, then the set $\Delta(f,g) = \{x \in X:\ f(x) =…
The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes of…
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In…
Polarization phenomenon over any finite field $\mathbb{F}_{q}$ with size $q$ being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arikan for the binary field, as well…
In this short paper we present a survey of some results concerning the random SAT problems. To elaborate, the Boolean Satisfiability (SAT) Problem refers to the problem of determining whether a given set of $m$ Boolean constraints over $n$…
Consider a point-to-point communication system in which the transmitter holds a binary message of length $m$ and transmits a corresponding codeword of length $n$. The receiver's goal is to recover a Boolean function of that message, where…
We give an answer to the following question: for which metric in an abstract lattice the completion as a metric space coincides with the completion as a lattice. We obtain the answer for inductive limits of lattices which are complete in…
On metric spaces equipped with doubling measures, we prove that a differentiability theorem holds for Lipschitz functions if and only if the space supports nontrivial (metric) derivations in the sense of Weaver that satisfy an additional…
In the setting of a metric space equipped with a doubling measure that supports a Poincar\'e inequality, we show that any set of finite perimeter can be approximated in the BV norm by a set whose topological and measure theoretic boundaries…
Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
A space X is finite dimensional, locally compact and separable metrizable if and only if X has a finite basic family: continuous functions Phi_1,...,Phi_n of X to the reals, R, such that for all continuous f from X to R there are g_1,...,…