Auslander-Buchweitz approximation theory for triangulated categories

We introduce and develop an analogous of the Auslander-Buchweitz approximation theory (see \cite{AB}) in the context of triangulated categories, by using a version of relative homology in this setting. We also prove several results concerning relative homological algebra in a triangulated category \T, which are based on the behavior of certain subcategories under finiteness of resolutions and vanishing of Hom-spaces. For example: we establish the existence of preenvelopes (and precovers) in certain triangulated subcategories of \T. The results resemble various constructions and results of Auslander and Buchweitz, and are concentrated in exploring the structure of a triangulated category \T equipped with a pair (\X,\omega), where \X is closed under extensions and $\omega$ is a weak-cogenerator in \X, usually under additional conditions. This reduces, among other things, to the existence of distinguished triangles enjoying special properties, and the behavior of (suitably defined) (co)resolutions, projective or injective dimension of objects of \T and the formation of orthogonal subcategories. Finally, some relationships with the Rouquier's dimension in triangulated categories is discussed.Comment: To appear at: Appl. Categor. Struct. (2011); 22 page

Torsion pairs and rigid objects in tubes

We classify the torsion pairs in a tube category and show that they are in bijection with maximal rigid objects in the extension of the tube category containing the Pruefer and adic modules. We show that the annulus geometric model for the tube category can be extended to the larger category and interpret torsion pairs, maximal rigid objects and the bijection between them geometrically. We also give a similar geometric description in the case of the linear orientation of a Dynkin quiver of type A.Comment: 25 pages, 13 figures. Paper shortened. Minor errors correcte

Recollements of Module Categories

We establish a correspondence between recollements of abelian categories up to equivalence and certain TTF-triples. For a module category we show, moreover, a correspondence with idempotent ideals, recovering a theorem of Jans. Furthermore, we show that a recollement whose terms are module categories is equivalent to one induced by an idempotent element, thus answering a question by Kuhn.Comment: Comments are welcom

Gorenstein homological algebra and universal coefficient theorems

We study criteria for a ring—or more generally, for a small category—to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to develop machinery for proving new ones. Among the universal coefficient theorems covered by our methods we find, besides all the classic examples, several exotic examples arising from the KK-theory of C*-algebras and also Neeman’s Brown–Adams representability theorem for compactly generated categories

A stochastic local search algorithm with adaptive acceptance for high-school timetabling

Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers might fail to find a solution for a given instance of the problem. A selection hyper-heuristic can be defined as an easy-to-implement, easy-to-maintain and effective 'heuristic to choose heuristics' to solve such computationally hard problems. This paper describes the approach of the team hyper-heuristic search strategies and timetabling (HySST) to high school timetabling which competed in all three rounds of the third international timetabling competition. HySST generated the best new solutions for three given instances in Round 1 and gained the second place in Rounds 2 and 3. It achieved this by using a fairly standard stochastic search method but significantly enhanced by a selection hyper-heuristic with an adaptive acceptance mechanism. © 2014 Springer Science+Business Media New York