相关论文: QRB-Domains and the Probabilistic Powerdomain

The order domains are a class of commutative rings introduced by H{\o}holdt, van Lint, and Pellikaan to simplify the theory of error control codes using ideas from algebraic geometry. The definition is largely motivated by the structures…

Approaching the long-time dynamics of non-Markovian open quantum systems presents a challenging task if the bath is strongly coupled. Recent proposals address this problem through a representation of the so-called process tensor in terms of…

Let $D$ be an integral domain and $X$ an indeterminate over $D$. It is well known that (a) $D$ is quasi-Pr\"ufer (i.e, its integral closure is a Pr\"ufer domain) if and only if each upper to zero $Q$ in $D[X] $ contains a polynomial $g \in…

The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general…

We show that the mode-locking region of the family of quasi-periodically forced Arnold circle maps with a topologically generic forcing function is dense. This gives a rigorous verification of certain numerical observations in \cite{DGO}…

We study the category Cstabm of measurable cones and measurable stable functions, which is a denotational model of an higher-order language with continuous probabilities and full recursion. We look at Cstabm as a model for discrete…

Powerdomains in domain theory plays an important role in modeling the semantics of nondeterministic functional programming languages.\ In this paper,\ we extend the notion of powerdomain to the category of directed spaces,\ which is…

We explore the interplay between omega-categoricity and pseudofiniteness for groups, conjecturing that omega-categorical pseudofinite groups are finite-by-abelian-by-finite. We show that the conjecture reduces to nilpotent p-groups of class…

We develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume…

We present a simple categorical framework for the treatment of probabilistic theories, with the aim of reconciling the fields of Categorical Quantum Mechanics (CQM) and Operational Probabilistic Theories (OPTs). In recent years, both CQM…

We revisit the phenomenon where, for certain domains $D$, if the squeezing function $s_D$ extends continuously to a point $p\in \partial{D}$ with value $1$, then $\partial{D}$ is strongly pseudoconvex around $p$. In $\mathbb{C}^2$, we…

Let $\iota:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $\nu$ of rank 1. That is, we assume given a rank 1 valuation $\nu$ of $K$ and its extension $\nu'$ to…

In recent years, one of the most interesting developments in quantum mechanics has been the construction of new exactly solvable potentials connected with the appearance of families of exceptional orthogonal polynomials (EOP) in…

This paper unites two research lines. The first involves finding categorical models of quantum programming languages and their type systems. The second line concerns the program of quantization of mathematical structures, which amounts to…

Koebe's conjecture asserts that every domain in the Riemann sphere is conformally equivalent to a circle domain. We prove that every domain $\Omega$ satisfying Koebe's conjecture admits an exhaustion, i.e., a sequence of interior…

For a relational Horn theory $\mathbb{T}$, we provide useful sufficient conditions for the exponentiability of objects and morphisms in the category $\mathbb{T}\text{-}\mathsf{Mod}$ of $\mathbb{T}$-models; well-known examples of such…

The following conjecture is due to Shelah-Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non-trivial definable henselian valuation, in the language of rings. We specialise this conjecture to…

Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological…

The paper is devoted to counterexamples involving the triviality of domains of products and/or adjoints of densely defined operators.

We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete…