Related papers: Connectedness through decidable quotients
We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.
This paper gives methods for understanding invariants of symplectic quotients. The symplectic quotients considered here are compact symplectic manifolds (or more generally orbifolds), which arise as the symplectic quotients of a symplectic…
We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…
It is well-known in universal algebra that adding structure and equational axioms generates forgetful functors between varieties, and such functors all have left adjoints. The category of elementary doctrines provides a natural framework…
We compare two possible ways of defining a category of 1-combs, the first intensionally as coend optics and the second extensionally as a quotient by the operational behaviour of 1-combs on lower-order maps. We show that there is a full and…
We introduce and study the Scott adjunction, relating accessible categories with directed colimits to topoi. Our focus is twofold, we study both its applications to formal model theory and its geometric interpretation. From the geometric…
The notion of 'slope rational connectedness' is introduced in the context of smooth orbifold pairs. The main result parallels the characterization of the rational connectedness of projective manifolds in terms of either the non-existence of…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…
We introduce a relative version of the spherical objects of Seidel and Thomas. Define an object E in the derived category D(Z x X) to be spherical over Z if the corresponding functor from D(Z) to D(X) gives rise to autoequivalences of D(Z)…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
The elementary quotient completion of an elementary doctrine in the sense of Lawvere was introduced in previous work by the first and third authors. It generalises the exact completion of a category with finite products and weak equalisers.…
We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known…
We consider the quotients $X = V/G$ of a symplectic complex vector space $V$ by a finite subgroup $G \subset Sp(V)$ which admit a smooth crepant resolution $Y \to X$. For such quotients, we prove the homological McKay correspondence…
Entanglement is fundamental inasmuch because it rephrases the quest for the classical-quantum demarcation line, and it also has potentially enormous practical applications in modern information technology. In this work, employing the…
Hyland's effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates Church's Thesis. It also contains a boolean full sub-quasitopos of "assemblies" where…
A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the…
We extend the criterion of Kawatani and Okawa for indecomposability of the derived category of a smooth projective variety to arbitrary schemes. For relative schemes, we also give a criterion for the nonexistence of semiorthogonal…
We study varieties with a term-definable poset structure, "po-groupoids". It is known that connected posets have the "strict refinement property" (SRP). In [arXiv:0808.1860v1 [math.LO]] it is proved that semidegenerate varieties with the…