The Experts below are selected from a list of 41175 Experts worldwide ranked by ideXlab platform
Frederic Deglise - One of the best experts on this subject based on the ideXlab platform.
-
local and stable homological algebra in grothendieck abelian categories
Homology Homotopy and Applications, 2009Co-Authors: Denischarles Cisinski, Frederic DegliseAbstract:We define model category structures on the category of chain complexes over a Grothendieck abelian category depending on the choice of a Generating Family, and we study their behaviour with respect to tensor products and stabilization. This gives convenient tools to construct and understand triangulated categories of motives.
-
Local and stable homological algebra in Grothendieck abelian categories
Homology Homotopy and Applications(HHA), 2009Co-Authors: Denischarles Cisinski, Frederic DegliseAbstract:We define model category structures on the category of chain complexes over a Grothendieck abelian category depending on the choice of a Generating Family, and we study their behaviour with respect to tensor products and stabilization. This gives convenient tools to construct and understand triangulated categories of motives and we consider here the case of mixed motives over a regular base scheme.
Denischarles Cisinski - One of the best experts on this subject based on the ideXlab platform.
-
local and stable homological algebra in grothendieck abelian categories
Homology Homotopy and Applications, 2009Co-Authors: Denischarles Cisinski, Frederic DegliseAbstract:We define model category structures on the category of chain complexes over a Grothendieck abelian category depending on the choice of a Generating Family, and we study their behaviour with respect to tensor products and stabilization. This gives convenient tools to construct and understand triangulated categories of motives.
-
Local and stable homological algebra in Grothendieck abelian categories
Homology Homotopy and Applications(HHA), 2009Co-Authors: Denischarles Cisinski, Frederic DegliseAbstract:We define model category structures on the category of chain complexes over a Grothendieck abelian category depending on the choice of a Generating Family, and we study their behaviour with respect to tensor products and stabilization. This gives convenient tools to construct and understand triangulated categories of motives and we consider here the case of mixed motives over a regular base scheme.
Ephrem Menassie - One of the best experts on this subject based on the ideXlab platform.
-
On Labeled Graph $C^*$-algebras
2020Co-Authors: Banjade, Debendra P, Ephrem MenassieAbstract:Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal Generating Family of partial isometries and projections. In this paper, we work on ideals for a labeled graph $C^*$-algebra when the graph contains sinks. Using some of the tools we build, we compute $C^*(E, \mathcal{L}, \mathcal{B})$ when $E$ is a finite graph.Comment: The Rocky Mountain Journal of Mathematics, to appear. arXiv admin note: text overlap with arXiv:1907.0616
Menassie Ephrem - One of the best experts on this subject based on the ideXlab platform.
-
primitive ideals of labelled graph c algebras
arXiv: Operator Algebras, 2019Co-Authors: Menassie EphremAbstract:Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labelled graph $C^*$-algebra by taking a weakly left--resolving labelled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal Generating Family of partial isometries and projections. In this paper we provide characterization for primitive ideals of labelled graph $C^*$-algebras.
Jose Manuel Colom - One of the best experts on this subject based on the ideXlab platform.
-
on the computation of the minimal siphons of s 4 pr nets from a Generating Family of siphons
Emerging Technologies and Factory Automation, 2010Co-Authors: Elia Cano, Carlos Rovetto, Jose Manuel ColomAbstract:Minimal siphons in the class of S4PR nets have become a conceptual and practical central tool to deal with deadlocks caused by the sharing of resources in Flexible Manufacturing Systems. The availability of efficient algorithms to compute these structural objects is very important. In this paper we take advantage from the particular properties of the siphons in S4PR to obtain an efficient algorithm. These properties allow to compute the minimal siphons from a Generating Family of minimal siphons. This Family is composed by the minimal siphons containing only one resource. The computation of the minimal siphons is based in the maximal strongly connected components of a graph representing the relations between the siphons of the Generating Family. The algorithm is very economic in memory in all intermediate steps with respect to the classical algorithms.