-categories
The aim of this short survey is to give a quick introduction to the Salvetti complex as a tool for the study of the cohomology of Artin groups. In particular we show how a spectral sequence induced by a filtration on the complex provides a very natural and useful method to study recursively the cohomology of Artin groups, simplifying many computations. In the last section some examples of applications are presented.
We introduce the structure of a nearness on a -frame and construct the coreflection of the category of nearness -frames to the category of compact regular -frames. This description of the Samuel compactification of a nearness -frame is in analogy to the construction by Baboolal and Ori for nearness frames in [1] and that of Walters for uniform -frames in [11]. We also construct the uniform coreflection of a nearness -frame, that is, the coreflection of the category of to the category...
We develop the representation theory of selfinjective algebras which admit Galois coverings by the repetitive algebras of algebras whose derived category of bounded complexes of finite-dimensional modules is equivalent to the derived category of coherent sheaves on a weighted projective line with virtual genus greater than one.
Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell’s IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper, we...
Monads have been employed in programming languages for modeling various language features, most importantly those that involve side effects. In particular, Haskell's IO monad provides access to I/O operations and mutable variables, without compromising referential transparency. Cyclic definitions that involve monadic computations give rise to the concept of value-recursion, where the fixed-point computation takes place only over the values, without repeating or losing effects. In this paper,...
We define and investigate a generalization of the notion of convex compacta. Namely, for semiconvex combination in a semiconvex compactum we allow the existence of non-trivial loops connecting a point with itself. It is proved that any semiconvex compactum contains two non-empty convex compacta, the center and the weak center. The center is the largest compactum such that semiconvex combination induces a convex structure on it. The convex structure on the weak center does not necessarily coincide...