相关论文: Explaining Gabriel-Zisman localization to the comp…

Let M be a manifold carrying the action of a Lie group G, and A a Lie algebroid on M equipped with a compatible infinitesimal G-action. Out of these data we construct an equivariant Lie algebroid cohomology and prove for compact G a related…

This document summarizes different visual explanations methods such as CAM, Grad-CAM, Localization using Multiple Instance Learning - Saliency-based methods, Saliency-driven Class-Impressions, Muting pixels in input image - Adversarial…

Automated proof assistants are a technology pre-empting mistakes in mathematics. In our practice we have seen that reasoning about planar diagrams is difficult to both humans and computers. One example that has led to wrong statements in…

We describe the applications of localization methods, in particular the functorial localization formula, in the proofs of several conjectures from string theory. Functorial localization formula pushes the computations on complicated moduli…

We propose a localization formula for the chiral de Rham complex generalizing the well-known localization procedure in topological theories. Our formula takes into account the contribution due to the massive modes. The key to achieve this…

We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables…

We present a systematic study of symmetries, invariants and moduli spaces of classes of coframes. We introduce a classifying Lie algebroid to give a complete description of the solution to Cartan's realization problem that applies to both…

Verifying the functional correctness of programs with both classical and quantum constructs is a challenging task. The presence of probabilistic behaviour entailed by quantum measurements and unbounded while loops complicate the…

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…

We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using…

This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and…

In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…

We give a purely cubical argument for the localization theorem for the cubical version of higher Chow groups.

We describe a categorification of the cluster algebra structure of multi-homogeneous coordinate rings of partial flag varieties of arbitrary Dynkin type using Cohen-Macaulay modules over orders. This completes the categorification of…

We survey the application of computer algebra in the context of gravitational theories. After some general remarks, we show of how to check the second Bianchi-identity by means of the Reduce package Excalc. Subsequently we list some…

We develop a theory of equivariant factorization algebras on varieties with an action of a connected algebraic group $G$, extending the definitions of Francis-Gaitsgory [FG] and Beilinson-Drinfeld [BD1] to the equivariant setting. We define…

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

In this article, we show that the localization of an extriangulated category by a multiplicative system satisfying mild assumptions can be equipped with a natural, universal structure of an extriangulated category. This construction unifies…

We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…

Approximate Membership Query structures (AMQs) rely on randomisation for time- and space-efficiency, while introducing a possibility of false positive and false negative answers. Correctness proofs of such structures involve subtle…