3 research outputs found
An Axiomatic Setup for Algorithmic Homological Algebra and an Alternative Approach to Localization
In this paper we develop an axiomatic setup for algorithmic homological
algebra of Abelian categories. This is done by exhibiting all existential
quantifiers entering the definition of an Abelian category, which for the sake
of computability need to be turned into constructive ones. We do this
explicitly for the often-studied example Abelian category of finitely presented
modules over a so-called computable ring , i.e., a ring with an explicit
algorithm to solve one-sided (in)homogeneous linear systems over . For a
finitely generated maximal ideal in a commutative ring we
show how solving (in)homogeneous linear systems over can be
reduced to solving associated systems over . Hence, the computability of
implies that of . As a corollary we obtain the computability
of the category of finitely presented -modules as an Abelian
category, without the need of a Mora-like algorithm. The reduction also yields,
as a by-product, a complexity estimation for the ideal membership problem over
local polynomial rings. Finally, in the case of localized polynomial rings we
demonstrate the computational advantage of our homologically motivated
alternative approach in comparison to an existing implementation of Mora's
algorithm.Comment: Fixed a typo in the proof of Lemma 4.3 spotted by Sebastian Posu
Homalg: A meta-package for homological algebra
The central notion of this work is that of a functor between categories of
finitely presented modules over so-called computable rings, i.e. rings R where
one can algorithmically solve inhomogeneous linear equations with coefficients
in R. The paper describes a way allowing one to realize such functors, e.g.
Hom, tensor product, Ext, Tor, as a mathematical object in a computer algebra
system. Once this is achieved, one can compose and derive functors and even
iterate this process without the need of any specific knowledge of these
functors. These ideas are realized in the ring independent package homalg. It
is designed to extend any computer algebra software implementing the
arithmetics of a computable ring R, as soon as the latter contains algorithms
to solve inhomogeneous linear equations with coefficients in R. Beside
explaining how this suffices, the paper describes the nature of the extensions
provided by homalg.Comment: clarified some points, added references and more interesting example
Control of 2D behaviors by partial interconnection
Abstract-In this paper we study the stability of two dimensional (2D) behaviors with two types of variables: the variables that we are interested to control (the to-be-controlled variables) and the variables on which we are allowed to enforce restrictions (the control variables). We derive conditions for the stabilization of the to-be-controlled variables by regular partial interconnection, i.e., by imposing non-redundant additional restrictions to the control variables