Timeline for Eriksson's thesis "Strongly convergent games and Coxeter groups"
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 10, 2022 at 0:48 | comment | added | darij grinberg | @IraGessel: Nice! One of my examples (perhaps the simplest) is the uniqueness of the $k$-core of a graph (i.e., if you successively delete vertices of degree $\leq k$, the result at the end will not depend on your choices). This looks similar but more advanced. | |
| Dec 9, 2022 at 18:48 | comment | added | Ira Gessel | An application of the diamond lemma to enumeration can be found in the proof of Theorem 4.4 in my paper with Ji Li, Enumeration of point-determining graphs, J. Combin. Theory Ser. A 118 (2011), 591–612, doi.org/10.1016/j.jcta.2010.03.009. | |
| Dec 5, 2022 at 2:28 | history | edited | Martin Sleziak |
Removing the tag (thesis) - as suggested by the moderators: https://chat.stackexchange.com/rooms/10243/conversation/the-tag-thesis and https://chat.stackexchange.com/rooms/10243/conversation/removal-of-thesis
|
|
| Sep 9, 2022 at 12:57 | vote | accept | darij grinberg | ||
| Sep 9, 2022 at 12:57 | answer | added | darij grinberg | timeline score: 2 | |
| Jun 29, 2022 at 23:07 | comment | added | darij grinberg | @Carl-FredrikNybergBrodda: Thanks for the suggestions! I have the bicyclic monoid in my plan (actually in a slightly stronger form, saying that parenthesis matching is confluent even if you don't remove the matched parenthesis but merely "freeze" them; this is how it is used all over combinatorics). For some reason, I had forgotten about the free group. I probably have enough easy examples now, though I sure wouldn't mind more. | |
| Jun 29, 2022 at 22:53 | comment | added | Carl-Fredrik Nyberg Brodda | Also, if you want nice and simple applications of the diamond lemma, it is used all the time in string rewriting systems and combinatorial (semi)group theory. The easiest application is to show that the bicyclic monoid has decidable word problem; or that free groups are well-defined as the group of all freely reduced words with multiplication given by concatenation, followed by reducing. | |
| Jun 29, 2022 at 22:47 | comment | added | Carl-Fredrik Nyberg Brodda | Have you tried writing to Kimmo? I'm sure that if anyone has a copy, it's him. (As an aside, Kimmo's father Henrik did a PhD in 1994, also at KTH and on a similar topic, and this thesis is available here). | |
| Jun 29, 2022 at 16:39 | comment | added | darij grinberg | @SamHopkins: I'm hoping for more elementary applications to use in my lecture :) | |
| Jun 29, 2022 at 16:31 | comment | added | Sam Hopkins | Is there a particular result you're interested in that you believe is contained in this thesis? | |
| Jun 29, 2022 at 16:22 | history | edited | darij grinberg | CC BY-SA 4.0 |
added 66 characters in body
|
| Jun 29, 2022 at 16:09 | history | asked | darij grinberg | CC BY-SA 4.0 |