Related papers: Domain Theory in Constructive and Predicative Univ…
The growth of ballistic aggregates on deterministic fractal substrates is studied by means of numerical simulations. First, we attempt the description of the evolving interface of the aggregates by applying the well-established…
Many learning problems require predicting sets of objects when the number of objects is not known beforehand. Examples include object detection, molecular modeling, and scientific inference tasks such as astrophysical source detection.…
We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order…
Linear scaling density functional theory approaches to electronic structure are often based on the tendency of electrons to localize even in large atomic and molecular systems. However, in many cases of actual interest, for example in…
In a 2005 paper, Casacuberta, Scevenels and Smith construct a homotopy idempotent functor $E$ on the category of simplicial sets with the property that whether it can be expressed as localization with respect to a map $f$ is independent of…
We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…
We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…
Diffusion generative models have recently been applied to domains where the available data can be seen as a discretization of an underlying function, such as audio signals or time series. However, these models operate directly on the…
Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…
We present a simple functional programming language, called Dual PCF, that implements forward mode automatic differentiation using dual numbers in the framework of exact real number computation. The main new feature of this language is the…
We showcase the advantages of orbital-free density-potential functional theory (DPFT), a more flexible variant of Hohenberg-Kohn density functional theory. DPFT resolves the usual trouble with the gradient-expanded kinetic energy functional…
Aspects of parity-preserving, three-dimensional conformal field theories (CFTs) with a global $U(1)$ symmetry in the presence of a background magnetic field are investigated. A local effective action is constructed to four-derivative order,…
Our work is a fundamental study of the notion of approximation in V-categories and in (U,V)-categories, for a quantale V and the ultrafilter monad U. We introduce auxiliary, approximating and Scott-continuous distributors, the way-below…
A subcritical pattern-forming system with nonlinear advection in a bounded domain is recast as a slow-fast system in space and studied using a combination of geometric singular perturbation theory and numerical continuation. Two types of…
We generalise sheaf models of intuitionistic logic to univalent type theory over a small category with a Grothendieck topology. We use in a crucial way that we have constructive models of univalence, that can then be relativized to any…
The discretization of elliptic PDEs leads to large coupled systems of equations. Domain decomposition methods (DDMs) are one approach to the solution of these systems, and can split the problem in a way that allows for parallel computing.…
First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOLDS), or Aczel's and Belo's dependently typed (intuitionistic) first-order logic (DFOL), may be regarded as logic enriched dependent type…
Given functors $F,G:\mathcal C\to\mathcal D$ between small categories, when is it possible to say that $F$ can be "continuously deformed" into $G$ in a manner that is not necessarily reversible? In an attempt to answer this question in…
Domain theory has a long history of applications in theoretical computer science and mathematics. In this article, we explore the relation of domain theory to probability theory and stochastic processes. The goal is to establish a theory in…
Using the moduli space of semiorthogonal decompositions in a smooth projective family, introduced by the second, the third and the fourth author, we propose a novel approach to indecomposability questions for derived categories. Modulo a…