Related papers: Applications of Metric Coinduction
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…
We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…
One recurring problem in program development is that of understanding how to re-use code developed by a third party. In the context of (constraint) logic programming, part of this problem reduces to figuring out how to query a program. If…
A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
Contraction analysis uses a local criterion to prove the long-term behaviour of a dynamical system. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions contracts. If adjacent solutions…
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…
Invertibility is an important concept in category theory. In higher category theory, it becomes less obvious what the correct notion of invertibility is, as extra coherence conditions can become necessary for invertible structures to have…
Measuring comodules are defined and shown to provide a useful generalization of the set of maps between modules with a broad range of applications. Three applications are described. Connections on bundles are described in terms of measuring…
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…
Moment closure methods appear in myriad scientific disciplines in the modelling of complex systems. The goal is to achieve a closed form of a large, usually even infinite, set of coupled differential (or difference) equations. Each equation…
Mathematical proofs are a cornerstone of control theory, and it is important to get them right. Deduction systems can help with this by mechanically checking the proofs. However, the structure and level of detail at which a proof is…
Quantum metrology is a general term for methods to precisely estimate the value of an unknown parameter by actively using quantum resources. In particular, some classes of entangled states can be used to significantly suppress the…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Learning the embedding space, where semantically similar objects are located close together and dissimilar objects far apart, is a cornerstone of many computer vision applications. Existing approaches usually learn a single metric in the…
Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…