Difference between revisions of "Public:Seminar"
m |
m |
||
| Line 22: | Line 22: | ||
Inspired by recent results which establish conditions under which no distributive laws can exist between pairs of monads, we present a family of no-go theorems for the existence of mixed distributive laws between a comonad and a monad. --> |
Inspired by recent results which establish conditions under which no distributive laws can exist between pairs of monads, we present a family of no-go theorems for the existence of mixed distributive laws between a comonad and a monad. --> |
||
* 8 June 2022: '''Samson Abramsky''' gave a talk titled "From Kochen-Specker to Feder-Vardi" (Joint work with Adam Ó Conghaile and Anuj Dawar) |
* 8 June 2022: '''Samson Abramsky''' gave a talk titled "From Kochen-Specker to Feder-Vardi" (Joint work with Adam Ó Conghaile and Anuj Dawar), had a large overlap with [https://arxiv.org/abs/2206.12156 arXiv:2206.12156] |
||
* 1 June 2022: '''Achim Blumensath''' gave a tutorial on the composition method |
* 1 June 2022: '''Achim Blumensath''' gave a tutorial on the composition method |
||
* 25 May 2022: [https://elenadilavore.github.io/ Elena di Lavore] will talk about Monoidal Width '''[https://kam.mff.cuni.cz/~jaklt/comonadwiki/images/custom/2022-05-25-Di_Lavore_-_Monoidal_Width.pdf (slides)]''' <!-- Abstract: We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. By instantiating monoidal width and two variations a suitable category of cospans of graphs, we capture existing notions, namely branch width, tree width and path width. By changing the category of graphs, we are also able to capture rank width. Through these and other examples, we propose that monoidal width: (i) is a promising concept that, while capturing known measures, can similarly be instantiated in other settings, avoiding the need for ad-hoc domain-specific definitions and (ii) comes with a general, formal algebraic notion of decomposition using the language of monoidal categories. --> |
* 25 May 2022: [https://elenadilavore.github.io/ Elena di Lavore] will talk about Monoidal Width '''[https://kam.mff.cuni.cz/~jaklt/comonadwiki/images/custom/2022-05-25-Di_Lavore_-_Monoidal_Width.pdf (slides)]''' <!-- Abstract: We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. By instantiating monoidal width and two variations a suitable category of cospans of graphs, we capture existing notions, namely branch width, tree width and path width. By changing the category of graphs, we are also able to capture rank width. Through these and other examples, we propose that monoidal width: (i) is a promising concept that, while capturing known measures, can similarly be instantiated in other settings, avoiding the need for ad-hoc domain-specific definitions and (ii) comes with a general, formal algebraic notion of decomposition using the language of monoidal categories. --> |
||
Revision as of 15:32, 30 June 2022
Contents
Upcoming
- No seminar in the week 4-8 July but on 4 July 2022 there will be the Structure Meets Power 2022 workshop. Ask Dan or Tomas for a Zoom link if you want to join!
And at some point in the future, we will also have the talks
- Dan will talk about bialgebraic semantics
- Tomas will talk about Adjunctions and a comonad in the Wonderland of (P)CSPs
- Tomas will spark a discussion about adding a layer of quantifiers
Previous
(also includes workshops and meet-ups)
2022
- 29 June 2022: Alexandre Goy talked about Weakening distributive laws using string diagrams
- 22 June 2022: Nihil Shah (slides) spoke about Linear modal comonad and arboreal categories (joint with Samson and Yoàv)
- 15 June 2022: Amin Karamlou will talk about No-Go Theorems For Mixed Distributive Laws: Containers over Non-determinism
- 8 June 2022: Samson Abramsky gave a talk titled "From Kochen-Specker to Feder-Vardi" (Joint work with Adam Ó Conghaile and Anuj Dawar), had a large overlap with arXiv:2206.12156
- 1 June 2022: Achim Blumensath gave a tutorial on the composition method
- 25 May 2022: Elena di Lavore will talk about Monoidal Width (slides)
- 11 May 2022: Rafal Stefanski talked about single-use Automata for Infinite Alphabets
- 4 May 2022: we had a general discussion regarding the future of the project, led by Tomas Jakl
- 27 April 2022: Dan Marsden talked about bimorphisms and FVM theorems
- 20 April 2022: Luca Reggio talked about arboreal categories and homomorphism preservation theorems (slides)
- 13 April 2022: Tomas Jakl led a discussion on comonadic tools in Twin-Width I
- 15-16 March 2022: Project Meetings
2021
- 9 December 2021: Tomas Jakl talked about A game comonads' perspective on Courcelle and Feferman-Vaught-Mostowski theorems, (slides)
- 25 November 2021: Algorithms Discussion II
- 11 November 2021: Algorithms Discussion
- 21 October 2021: Luca Reggio talked about Polyadic sets and homomorphism counting
- 21 October 2021: Samson Abramsky talked about Cohomology for Everyone
- 16-17 September 2021: Project Meeting
- 27-28 June 2021: Structure meets Power Workshop
- 22 April 2021: Tomas Jakl talked about Discrete density comonads (and combinatorial properties), (slides)
- 25 March 2021: Luca Reggio continued with an Introduction to Arboreal Categories (part II)
- 18 March 2021: Samson Abramsky gave an Introduction to Arboreal Categories (part I)
- 11 March 2021: Nihil Shah talked about Metrics on the homomorphism order
- 4 March 2021: Anuj Dawar talked about Invertible Map Games and Linear Algebraic Quantifiers, (slides)
2020
- 3 December 2020: Nihil Shah talked about progress on pebble-relation comonad
- 12 November 2020: Dan Marsden talked about acyclicity in finite Kripke structures
- 22 October 2020: Samson Abramsky talked about his recent work on open span bisimulation
- 15 October 2020: Luca Reggio talked about (locally) finitely presentable categories
- 8 October 2020: Tom Paine talked about Courcelle’s theorem, covering the regular approach, a game theoretic approach, and how it's related to Comonads
- 24 September 2020: Adam Ó Conghaile talked about Brambles, havens, shelters, and other obstructions to nice decompositions: where do they fit in the world of game comonads?
- 17 September 2020: Tomas Jakl talked about 3 new Lovasz-type results
- 3 September 2020: Louis Parlant from the UCL talked about his recent PhD work on general methods for composing monads via distributive laws
- 13 August 2020: Dan Marsden talked about some simple observations relating to modal logics and model constructions within our setting (early work in progress)
- 30 July 2020: Nihil Shah talked about the loosely guarded fragment and hypertree width, (notes)
- 23 July 2020: Samson Abramsky talked about comonadic semantics for guarded fragments
- 16 July 2020: Rui Soares Barbosa talked about the Quantum monad
- 2 July 2020: Tom Paine talked about game comonads and locality
- 25 June 2020: Luca Reggio talked about some of his recent work on results à la Lovász
- 18 June 2020: Alexis Toumi, a DPhil in Oxford, gave a speculative talk about applications of game comonads for work in linguistics and cognition being conducted in our group
- 11 June 2020: Tomas Jakl talked about "retractions" of comonads
- 28 May 2020: Samson Abramsky talked about some of the new material in the extended journal version of his CSL paper with Nihil, (slides)
- 14 May 2020: Luca Reggio talked about the Rossman homomorphism theorem
- 7 May 2020: Dan Marsden talked about string diagrams
- 30 April 2020: Nihil Shah talked about CSP
- 23 April 2020: Tom Paine talked about Interpreting comonads as adjunctions into modal logic
- 9 April 2020: Adam Ó Conghaile talked about Game comonads and generalised quantifiers
- 26 March 2020: Online Workshop on Resources and Co-Resources
