Related papers: Binary intersection formalized
We investigate a signed version of the Hammersley process, a discrete process on words related to a property of integer sequences called heapability (Byers et al., ANALCO 2011). The specific version that we investigate corresponds to a…
We define a variant of intersection space theory that applies to many compact complex and real analytic spaces $X$, including all complex projective varieties; this is a significant extension to a theory which has so far only been shown to…
Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…
We present several approaches to equivariant intersection cohomology. We show that for a complete algebraic variety acted by a connected algebraic group $G$ it is a free module over $H^*(BG)$. The result follows from the decomposition…
We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Lor\'ia-S\'aenz.
We discuss various bifurcation problems in which two isolated periodic orbits exchange periodic ``bridge'' orbit(s) between two successive bifurcations. We propose normal forms which locally describe the corresponding fixed point scenarios…
Given subvarieties $X, Y$ of a complex algebraic variety $S$ of complementary dimension, must they intersect? When $S$ is projective space, this is a consequence of the classical B\'ezout theorem, and an analogue for simple abelian…
If a closed orientable manifold (resp. rational Poincar\'e duality space) $X$ receives a map $Y \to X$ from a formal manifold (resp. space) $Y$ that hits a fundamental class, then $X$ is formal. The main technical ingredient in the proof…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
In this paper, we introduce the notion of crossed homomorphisms between Lie-Yamaguti algebras and establish the cohomology theory of crossed homomorphisms via the Yamaguti cohomology. Consequently, we use this cohomology to characterize…
Let X be a complex analytic manifold. Given a closed subspace $Y\subset X$ of pure codimension p>0, we consider the sheaf of local algebraic cohomology $H^p_{[Y]}({\cal O}_X)$, and ${\cal L}(Y,X)\subset H^p_{[Y]}({\cal O}_X)$ the…
Formalised libraries of combinatorial mathematics have rapidly expanded over the last five years, but few use one of the most important tools: probability. How can often intuitive probabilistic arguments on the existence of combinatorial…
We formalise and mechanise a construtive, proof theoretic proof of Craig's Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal…
Intersection and union types denote conjunctions and disjunctions of properties. Using bidirectional typechecking, intersection types are relatively straightforward, but union types present challenges. For union types, we can case-analyze a…
We present a new and formal coinductive proof of confluence and normalisation of B\"ohm reduction in infinitary lambda calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not…
We present an Isabelle/HOL formalization of an earlier result by Suzuki, Middeldorp, and Ida; namely that a certain class of conditional rewrite systems is level-confluent. Our formalization is basically along the lines of the original…
The classical logical antinomy known as Richard-Berry paradox is combined with plausible assumptions about the size i.e. the descriptional complexity of Turing machines formalizing certain sentences, to show that formalization of language…
The Bitableax correspondence isomorphism/Koszul map Theorem (BCK Theorem, for short, Theorem 6.5 below) describes a relevant pair of mutually inverse vector space isomorphisms, the Koszul map K : U(gl(n))-> Sym(gl(n)) and the bitableaux…
We present a constructive formalization of Abstract Rewriting Systems (ARS) in the Agda proof assistant, focusing on standard results in term rewriting. We define a taxonomy of concepts related to termination and confluence and investigate…
It is well-known that intersection type assignment systems can be used to characterize strong normalization (SN). Typical proofs that typable lambda-terms are SN in these systems rely on semantical techniques. In this work, we study…