Geometry and complexity via linear categories with applications to groups
 
 
Description: 

Linear categories elegantly axiomatise an interplay between linear and nonlinear maps recurring across logic and mathematics, and an initial dependent linear category serves as a refined foundation of mathematics, alternative to set theory and classical logic. I recently proved that an initial (dependent) linear category canonically assigns, to (almost) all mathematical structures and proofs, hidden geometric and higher-order functional data through string diagrams and game semantics (which are two sides of the same coin). In this talk, I illustrate a use of this generic result by applying it to geometric group theory, extending its interplay between algebra, geometry and computational complexity to groups not finitely presentable, even to those of cardinality greater than the continuum. While I am currently exploring various directions, this talk focuses on one of them: my approach generalises automatic groups, inheriting their algorithmic properties and geometric characterisation, and yields new rigidity theorems. It thus addresses a fundamental bottleneck in the field open for 40 years. This is the beginning of a research programme that applies my new foundational framework to various topics in algebra, geometry and analysis.

Date:  2026-12-15
Start Time:   14:30
Speaker:  Norihiro Yamada (CMUC, Univ. Coimbra)
Institution:  CMUC
Place:  Sala 5.5, DMUC
Research Groups: -Algebra, Logic and Topology
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Financiado total ou parcialmente pela FCT, Fundação para a Ciência e a Tecnologia, I.P., sob o Financiamento de:
UID/00324/2025 Projeto Estratégico com a referência DOI https://doi.org/10.54499/UID/00324/2025.
https://doi.org/10.54499/UID/PRR/00324/2025     UID/PRR/00324/2025   https://doi.org/10.54499/UID/PRR2/00324/2025   UID/PRR2/00324/2025
Powered by: rdOnWeb v1.4 | technical support