Related papers: Linear Logic and the Hilbert Scheme
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
We advocates here the use of (mathematical) logic for systems biology, as a unified framework well suited for both modeling the dynamic behaviour of biological systems, expressing properties of them, and verifying these properties. The…
Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…
It is a well established fact, that any projective algebraic variety is a moduli space of representations over some finite dimensional algebra. This algebra can be chosen in several ways. The counterpart in algebraic geometry is…
We prove that the Hilbert scheme of points on a normal quasi-projective surface with at worst rational double point singularities is irreducible.
We prove weak convergence in a separable Hilbert space for estimators of high-dimensional regression coefficients, which yields asymptotic normality and enables direct use of standard asymptotic tools such as the continuous mapping theorem.…
This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…
We prove a functional identity between the Hilbert metric and the visual angle metric in the unit disk. The proof utilizes the Poincar\'e hyperbolic metric in terms of which both metrics can be expressed. This identity then yields sharp…
The Hilbert scheme $X^{[3]}$ of length-$3$ subschemes of a smooth projective variety $X$ is known to be smooth and projective. We investigate whether the property of having a multiplicative Chow-Kuenneth decomposition is stable under taking…
The aim of this article is to explore in all remaining aspects the spectral theory of locally normal operators. In a previous article we proved the spectral theorem in terms of locally spectral measures. Here we prove the spectral theorem…
We introduce proof nets for PiL, an extension of first-order multiplicative additive linear logic with new operators allowing a shallow encoding of processes in the {\pi}-calculus as formulas. We provide correctness criterion,…
We develop a rigorous mathematical framework for the weak formulation of cracked beams and shallow arches problems. First, we discuss the crack modeling by means of massless rotational springs. Then we introduce Hilbert spaces, which are…
Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic. These proof nets are defined by means of cographs (graphs representing formulas) equipped with a vertices partition satisfying simple topological…
Hilbert schemes of suitable smooth, projective manifolds of low degree which are 3-fold scrolls over the Hirzebruch surface F_1 are studied. An irreducible component of the Hilbert scheme parametrizing such varieties is shown to be…
By exploiting the correlation between the structure and the solution of Mixed-Integer Linear Programming (MILP), Machine Learning (ML) has become a promising method for solving large-scale MILP problems. Existing ML-based MILP solvers…
The logarithmic Hilbert scheme of a logarithmic curve parametrizes subschemes on the expanded degenerations of the curve that are transverse to the boundary. We prove that the logarithmic Hilbert scheme of points on a smooth pointed curve…
Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of…
An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs,…
We investigate the modal logic of stepwise removal of objects, both for its intrinsic interest as a logic of quantification without replacement, and as a pilot study to better understand the complexity jumps between dynamic epistemic logics…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…