Timeline for How to recognize a finite dimensional algebra is Koszul or quadratic?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2011 at 18:41 | history | edited | Benjamin Steinberg | CC BY-SA 3.0 |
deleted 166 characters in body
|
| Jul 21, 2011 at 20:54 | comment | added | Mariano Suárez-Álvarez | Can you share a typical example of your algebras? | |
| Jul 21, 2011 at 19:31 | history | edited | Benjamin Steinberg | CC BY-SA 3.0 |
added 166 characters in body
|
| Jul 21, 2011 at 1:34 | comment | added | Benjamin Steinberg | I am looking for a grading. I was hoping to use the grading coming from path length. I compute the Ext^n using classifying spaces. My algebras are monoid algebras. We can show that Ext between simple modules can be computed as the cohomology of certain submonoids with coefficients in some nice module. This in turns out to be the cohomology of a certain finite category with coefficients in the field. This we compute by using Quillen's theorem A to get to a nice simplicial complex. So basically we have no nice resolution. If anything we are implicitly using bar resolutions. | |
| Jul 20, 2011 at 18:40 | answer | added | Ben Webster♦ | timeline score: 4 | |
| Jul 20, 2011 at 18:38 | comment | added | Ben Webster♦ | I think this is honestly too vague to get useful answers. How are you computing Ext^n of all the simples without finding minimal projective resolutions? Are your algebras graded, or are you looking for a grading that makes things Koszul? | |
| Jul 20, 2011 at 18:05 | history | edited | Benjamin Steinberg |
edited tags
|
|
| Jul 14, 2011 at 13:21 | history | asked | Benjamin Steinberg | CC BY-SA 3.0 |