Related papers: Module Theorem for The General Theory of Stable Mo…
In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and nonmonotonicity of…
The theory of resurgence uniquely associates a factorially divergent formal power series with a collection of exponentially small non-perturbative corrections paired with a set of complex numbers known as Stokes constants. When the Borel…
Persistence modules serve as the algebraic foundation for topological data analysis, typically studied as representations of posets over a field. This article extends the structural and decomposition theory of persistence modules to the…
Answer set programming (ASP) is a paradigm for declarative problem solving where problems are first formalized as rule sets, i.e., answer-set programs, in a uniform way and then solved by computing answer sets for programs. The…
We further develop the theoretical framework of proof mining, a program in mathematical logic that seeks to quantify and extract computational information from prima facie `non-computational' proofs from the mainstream mathematical…
For any ring R we construct two triangulated categories, each admitting a functor from R-modules that sends projective and injective modules to 0. When R is a quasi-Frobenius or Gorenstein ring, these triangulated categories agree with each…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
The minimal Quillen model is a free Lie model for rational spaces proposed by Quillen. Meanwhile, persistence modules are theoretical abstractions of persistent homology. In this paper, we integrate the ideas of rational homotopy theory and…
Transformers achieve great performance on Visual Question Answering (VQA). However, their systematic generalization capabilities, i.e., handling novel combinations of known concepts, is unclear. We reveal that Neural Module Networks (NMNs),…
We prove a generalization of Gotzmann's persistence theorem in the case of modules with constant Hilbert polynomial. As a consequence, we show that the defining equations that give the embedding of a Quot scheme of points into a…
The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m-1$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \mod m $, and to report such a…
We derive finite rational formulas for the traces of cycle integrals of certain meromorphic modular forms. Moreover, we prove the modularity of a completion of the generating function of such traces. The theoretical framework for these…
In this paper we consider a construction in an arbitrary triangulated category T which resembles the notion of a Moore spectrum in algebraic topology. Namely, given a compact object C of T satisfying some finite tilting assumptions, we…
The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…
A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…
In complex inferential tasks like question answering, machine learning models must confront two challenges: the need to implement a compositional reasoning process, and, in many applications, the need for this reasoning process to be…
Primary decomposition is a very important tool of commutative algebra and geometry. In this paper we generalized some of the existing algorithms of primary decomposition developed by Eisenbud et al. (cf. [EHV]) for free modules and also…
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…