Page 1 Next

Displaying 1 – 20 of 274

Showing per page

S -categories

Miroslav Hušek (1964)

Commentationes Mathematicae Universitatis Carolinae

Salvetti complex, spectral sequences and cohomology of Artin groups

Filippo Callegaro (2014)

Annales de la faculté des sciences de Toulouse Mathématiques

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.

Samuel compactification and uniform coreflection of nearness σ -frames

Inderasan Naidoo (2006)

Czechoslovak Mathematical Journal

We introduce the structure of a nearness on a σ -frame and construct the coreflection of the category 𝐍 σ F r m of nearness σ -frames to the category 𝐊 R e g σ F r m 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 𝐍 σ F r m to the category...

Selfinjective algebras of wild canonical type

Helmut Lenzing, Andrzej Skowroński (2003)

Colloquium Mathematicae

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.

Semantics of value recursion for monadic input/output

Levent Erkök, John Launchbury, Andrew Moran (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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...

Semantics of value recursion for Monadic Input/Output

Levent Erkök, John Launchbury, Andrew Moran (2010)

RAIRO - Theoretical Informatics and Applications

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,...

Semiconvex compacta

Oleh R. Nykyforchyn (1997)

Commentationes Mathematicae Universitatis Carolinae

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...

Currently displaying 1 – 20 of 274

Page 1 Next