📢
Репост из группы
Кафедра математической логики МГУ:
#матлог #наука #лекции
Дорогие коллеги, на следующем заседании семинара
"Алгоритмические вопросы алгебры и логики (семинар С.И. Адяна)"
в ближайший вторник 24.11.2020, 18:30 MSK (UTC+3) состоится доклад:
Alan Logan (Heriot-Watt University, Edinburgh)
The Post Correspondence Problem and Equalisers for Immersions of Free Groups
Abstract: The Post Correspondence Problem (PCP) is a classical decision problem about equalisers of free monoid morphisms.
It is undecidable in general, but decidable in special cases (e.g. for binary alphabets), and is extremely well-studied in computer
science. It even has a Wikipedia page! This talk is about equalisers of free *group* homomorphisms, and the statement of the PCP
generalises to this setting. We prove positive results for immersions of free groups, in the sense of Kapovich:
the PCP is decidable here, and we answer two questions of Stallings for these maps.
Для получения ссылки на зум-конференцию пишите на почту alexey.talambutsa@gmail.com.