Related papers: Module Theorem for The General Theory of Stable Mo…
In this note, we give a new simple system of global parameters on the moduli space of rational functions, and clarify the relation to the parameters indicating location of fixed points and the indices at them. As a byproduct, we solve a…
This is a survey on the usage of the module theoretic notion of a "retractable module" in the study of algebras with actions. We explain how classical results can be interpreted using module theory and end the paper with some open…
In this paper, we generalize the fundamental theorems of functional analysis to the framework of bicomplex topological modules.
This paper studies the homotopy theory of the Grothendieck construction using model categories and semi-model categories, provides a unifying framework for the homotopy theory of operads and their algebras and modules, and uses this…
This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…
Hybrid Answer Set Programming (Hybrid ASP) is an extension of Answer Set Programming (ASP) that allows ASP-like rules to interact with outside sources. The Splitting Set Theorem is an important and extensively used result for ASP. The paper…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a…
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
Robustness is a basic property of any control system. In the context of linear output regulation, it was proved that embedding an internal model of the exogenous signals is necessary and sufficient to achieve tracking of the desired…
We give a general theory of generalised inverses and we explain the link with the theory of finitely generated projective modules. All the paper is written in constrctive mathematics in Bishop style. So all results do have a clear…
Although neural module networks have an architectural bias towards compositionality, they require gold standard layouts to generalize systematically in practice. When instead learning layouts and modules jointly, compositionality does not…
This paper proposes a Satisfiability Modulo Theory based formulation for floorplanning in VLSI circuits. The proposed approach allows a number of fixed blocks to be placed within a layout region without overlapping and at the same time…
A stable model category is a setting for homotopy theory where the suspension functor is invertible. The prototypical examples are the category of spectra in the sense of stable homotopy theory and the category of unbounded chain complexes…
We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection…
Solutions to a class of differential systems that generalize the Halphen system are determined in terms of automorphic functions whose groups are commensurable with the modular group. These functions all uniformize Riemann surfaces of genus…
In this paper, we study the combinatorics of congruence subgroups of the modular group by generalizing results obtained in the non-modular case. For this, we define a notion of irreducible solutions from which we can build all the…
Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…
Answering complex questions that require multi-step multi-type reasoning over raw text is challenging, especially when conducting numerical reasoning. Neural Module Networks(NMNs), follow the programmer-interpreter framework and design…