Related papers: Modularity and Combination of Associative Commutat…

We define abelian extensions of algebras in congruence-modular varieties. The theory is sufficiently general that it includes, in a natural way, extensions of R-modules for a ring R. We also define a cohomology theory, which we call clone…

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of concept combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC TR, whose semantics is based on the…

A formalism for the study of highly interacting electronic systems is presented. The proposed scheme is based on two key concepts: composite operators and algebra constraints. Composite field operators, that naturally appear as a…

We study closedness of the range, adjointability and generalized invertibility of modular operators between Hilbert modules over locally C*-algebras of coefficients. Our investigations and the recent results of M. Frank [Characterizing…

We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…

It has been hypothesized that some form of "modular" structure in artificial neural networks should be useful for learning, compositionality, and generalization. However, defining and quantifying modularity remains an open problem. We cast…

We introduce a new function on the set of pairs of cluster variables via $f$-vectors, which we call it the compatibility degree (of cluster complexes). The compatibility degree is a natural generalization of the classical compatibility…

Combinatorial problems stated as Constraint Satisfaction Problems (CSP) are examined. It is shown by example that any algorithm designed for the original CSP, and involving the AllDifferent constraint, has at least the same level of…

Recently dilogarithm identities have made their appearance in the physics literature. These identities seem to allow to calculate structure constants like, in particular, the effective central charge of certain conformal field theories from…

In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…

In his proof of Fermat's Last Theorem, Wiles deployed a commutative algebra technique, namely a numerical criterion for detecting isomorphisms of rings. In our recent work we pick up on Wiles' work and generalize the numerical criterion to…

In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality…

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…

This article is a survey of closure operations on ideals in commutative rings, with an emphasis on structural properties and on using tools from one part of the field to analyze structures in another part. The survey is broad enough to…

We provide a theoretical justification for the construction of adaptive composite solvers based on a sequence of AMG (algebraic multigrid) $\mu$-cycle methods that exploit error components that the current solver cannot damp efficiently.…

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…

While transformer models have been highly successful, they are computationally inefficient. We observe that for each layer, the full width of the layer may be needed only for a small subset of tokens inside a batch and that the "effective"…

In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…