Related papers: Isomorphism Theorems between Models of Mixed Choic…
The Isomorphism Conjectures are translated into the language of homotopical algebra, where they resemble Thomason's descent theorems.
We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equation-al theories; we establish functional representation theorems; and we show…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…
An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…
We show in section 1 that the Ax-Kochen isomorphism theorem requires the continuum hypothesis. Most of the applications of this theorem are insensitive to set theoretic considerations. (A probable exception is the work of Moloney.) In…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
Extraction of structure, in particular of group symmetries, is increasingly crucial to understanding and building intelligent models. In particular, some information-theoretic models of parsimonious learning have been argued to induce…
We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by…
Understanding the likelihood for an election to be tied is a classical topic in many disciplines including social choice, game theory, political science, and public choice. Despite a large body of literature and the common belief that ties…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
We give in this paper an isomorphism theorem between derived functors over categories of modules.There is a nice class of categories that gives examples in which this theorem applies for a special construction. This leads us to a new…
We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of…
We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…
A new classification theorem for links by the authors and Roger Fenn leads to computable link invariants. As an illustration we distinguish the left and right trefoils and recover the result of Carter et al that the 2-twist-spun trefoil is…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
Methods for combining predictions from different models in a supervised learning setting must somehow estimate/predict the quality of a model's predictions at unknown future inputs. Many of these methods (often implicitly) make the…
This work addresses the problem of conducting valid inference for additive and linear mixed models after model selection. One possible solution to overcome overconfident inference results after model selection is selective inference, which…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…