Related papers: Construction of a specification from its singleton…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
We describe the fundamental constructions and properties of determinantal probability measures and point processes, giving streamlined proofs. We illustrate these with some important examples. We pose several general questions and…
We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles,…
We address the problem of characterising the compatible tuples of measurements that admit a unique joint measurement. We derive a uniqueness criterion based on the method of perturbations and apply it to show that extremal points of the set…
The main result of this paper is that every naturally reductive space can be explicitly constructed from the construction in \cite{Storm2018}. This gives us a general formula for any naturally reductive space and from this we prove…
We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…
We study finitely additive extensions of the asymptotic density to all the subsets of natural numbers. Such measures are called density measures. We consider a class of density measures constructed from free ultrafilters on $\mathbb{N}$ and…
This article defines a complement of a function and conditions for existence of such a complement function and presents few algorithms to construct a complement.
We prove two generalizations of results proved by Bruhat and Tits involving metrical completeness and R-buildings. Firstly, we give a generalization of the Bruhat-Tits fixed point theorem also valid for non-complete R-buildings, but with…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
In program synthesis, we transform a specification into a program that is guaranteed to satisfy the specification. In synthesis of reactive systems, the environment in which the program operates may behave nondeterministically, e.g., by…
In economics and social choice single-peakedness is one of the most important and commonly studied models for preferences. It is well known that single-peaked consistency for total orders is in P. However in practice a preference profile is…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.
Component-based systems evolve as a new component is added or an existing one is replaced by a newer version. Hence, it is appealing to assure the new system still preserves its safety properties. However, instead of inspecting the new…
In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…
We consider the uniqueness of equilibrium states for dynamical systems that satisfy certain weak, non-uniform versions of specification, expansivity, and the Bowen property at a fixed scale. Following Climenhaga-Thompson's approach which…