The third meeting of the LambdaComb project will be was held on the Jussieu campus of Sorbonne Université, located at:
4 place jussieu 75005 paris
A map of campus is available here. Although the event will be in-person, we will attempt to broadcast talks online to allow for limited hybrid participation. (Barring wifi connection issues. A link will be provided in due time.)External participants are welcome, but it would be appreciated if you send us an email to let us know you would like to join in-person / online.
The talks and open sessions take place in different buildings on the Jussieu campus — please note the first component of the room numbers below. All times below are in CET. (Lunch is unorganized but there are many places to eat in the area.)
Date | Time | Room | Description | |||
---|---|---|---|---|---|---|
22/01 (mon) | 1400-1445 | 56.66.112 | talk by Lionel Vaux Auclair | |||
1500-1545 | 56.66.112 | talk by Peter Hines | ||||
1600-1800 | 56.66.112 | open session | ||||
23/01 (tue) | 1000-1045 | 24.34.112 | talk by Cameron Calk | |||
1100-1145 | 24.34.112 | talk by Gilles Schaeffer | ||||
1200-1345 | lunch | |||||
1400-1445 | 55.65.105 | talk by Luigi Santocanale | ||||
1500-1800 | 55.65.105 | open session | ||||
24/01 (wed) | 1000-1045 | 24.34.312 | talk by Noam Zeilberger | |||
1100-1145 | 24.34.312 | talk by Alexandros Singh | ||||
1200-1345 | lunch | |||||
1400-1445 | 24.34.312 | talk by Mehdi Naima | ||||
1500-1800 | 24.34.312 | open session |
Dealing with such ‘canonical isomorphisms’ may be appear to be a significant complication. In practice, categorical logicians and category theorists simply appeal to MacLane’s ‘strictification procedure’, which demonstrates a categorical equivalence with the ‘strict’ case, where associativity is exact, and all canonical isomorphisms are simply identity arrows.
Doing so is of course entirely valid, but nevertheless raises an interesting point : many structures of interest to both mathematicians and computer scientists may be identified as canonical isomorphisms. We wish to know how their structure arises from the categorical notion of ‘coherence’, and – when appropriate -- how they interact with ‘strictification’.
We concentrate on the untyped, or single-object, case. Here, it has long been folklore that the canonical isomorphisms for associativity form a group – Richard Thompson’s iconic group F. This is equally of interest to pure mathematicians (from its origins as a potential counterexample to a conjecture of J. Von Neumann), theoretical computer scientists (due to its close connection with the minimum rotation distance problem, Ladner’s theorem, and the NPI compexity class, as studied by P. Dehornoy), and practical computer scientists (based on its proposed use as a platform for non-commutative cryptography by V. Shpilrain and A. Ushakov). More recently, it has been shown to have close connections to the ‘special Frobenius algebras’ of categorical quantum mechanics.
The structure of the canonical isomorphisms for coherence becomes yet more interesting when we consider the `unbiased’ setting. The definition of a monoidal tensor has a significant bias towards the binary case – trivially, a tensor is a binary operation. The ‘unbiased’ setting instead requires a family of operations, one of each arity. We thus have a family of functors, indexed by the natural numbers, and related by families of canonical isomorphisms. However, the strict case is identical to MacLane’s definition of a strict monoidal tensor.
Non-strict unbiased tensors are even less well-studied than non-strict associativity, and seemingly for good reasons! T. Leinster demonstrated an equivalence with the usual binary case of MacLane – Kelly, and thus with the strict setting, via MacLane’s strictification procedure.
From a purely categorical point of view, strictification reduces an excessively complicated setting to a significantly simpler one!
Despite this, when we consider the untyped, or monoid-theoretic, case we again see a wide range of structures from pure mathematics, and theoretical & practical computer science. We give a selection of these, with particular emphasis on those relating to number theory & combinatorics, combined with a series of conjectures & open questions on how they relate to the pure category theory.