El "unravelling" para bigráficas diferenciales
সংরক্ষণ করুন:
| লেখক: | |
|---|---|
| বিন্যাস: | artículo original |
| বর্তমান অবস্থা: | Versión publicada |
| প্রকাশনার তারিখ: | 1998 |
| বিবরন: | Here are examined the main properties of the algorithm called ¨unravelling¨ for differential bigraphs. This algorithm was originally developed for differential graded categories and was useful in the proof the celebrated ¨tame-wild¨ theorem of ¨Drozd´s. First we describe the algorithm, and then we establish in detail the existence of an equivalence between certain subcategories of representations of the original and the derived bigraphs. We also exhibit the precise behaviour of the norm and the quadratic form under the algorithm. |
| দেশ: | Portal de Revistas UCR |
| প্রতিষ্ঠান: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| ভাষা: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/152 |
| অনলাইন ব্যবহার করুন: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/152 |
| মুখ্য শব্দ: | representation differential bigraphic ‘unravelling’ quadratic form equivalence representación bigráfica diferencial forma cuadrática equivalencia |