arXiv subjects

Mohamed Barakat

Publications and source records attributed to Mohamed Barakat.

24 records · Page 2Linked to original sources

arXiv2010

Coxeter and crystallographic arrangements are inductively free

Using the classification of finite Weyl groupoids we prove that crystallographic arrangements, a large subclass of the class of simplicial arrangements which was recently defined, are hereditarily inductively free. In particular, all crystallographic reflection arrangements are hereditarily inductively free, among them the arrangement of type $E_8$. With little extra work we prove that also all Coxeter arrangements are inductively free.

math.CO↗

arXiv2009

Spectral Filtrations via Generalized Morphisms

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the complex is of finite type, its filtration is finite, and the underlying ring is computable. So-called generalized maps play a decisive role in simplifying and streamlining all involved algorithms.

math.KT↗

arXiv2008

Higher Extension Modules and the Yoneda Product

A chain of c submodules E =: E_0 >= E_1 >= ... >= E_c >= E_{c+1} := 0 gives rise to c composable 1-cocycles in Ext^1(E_{i-1}/E_i,E_i/E_{i+1}), i=1,...,c. In this paper we follow the converse question: When are c composable 1-cocycles induced by a module E together with a chain of submodules as above? We call such modules c-extension modules. The case c=1 is the classical correspondence between 1-extensions and 1-cocycles. For c=2 we prove an existence theorem stating that a 2-extension module exists for two composable 1-cocycles eta^M_L in Ext^1(M,L) and eta^L_N in Ext^1(L,N), if and only if their Yoneda product eta^M_L o eta^L_N in Ext^2(M,N) vanishes. We further prove a modelling theorem for c=2: In case the set of all such 2-extension modules is non-empty it is an affine space modelled over the abelian group that we call the first extension group of 1-cocycles, Ext^1(eta^M_L,eta^L_N) := Ext^1(M,N)/(Hom(M,L) o eta^L_N + eta^M_L o Hom(L,N)).

math.KT↗

arXiv2007

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.

math.AC↗

arXiv2007

The Existence of Cartan Connections and Geometrizable Principal Bundles

The aim of this article is to proof a necessary and sufficient condition for the existence of a Cartan connection on a principal bundle. After collecting the essentially well known facts to fix the terminology, soldering forms and geometrizable principal bundles are defined to finally prove the existence criterion.

math.DG↗

arXiv2007

Conley: Computing connection matrices in Maple

In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition and for the computation of such matrices. We introduce the notion of triangles that suffices to state the definition of (C)-connection matrices. The notion of octahedra, which is equivalent to that of braids is also introduced.

math.DS↗