BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Budapest
END:VTIMEZONE
BEGIN:VEVENT
UID:519i6vcb58id28tqq7d38lmqck@google.com
CATEGORIES:{lang hu}Algebra szeminárium{/lang}{lang en}Algebra seminar{/lang}
SUMMARY:Alexander Zakharov (University of Porto): On finitely generated submonoids of free groups
LOCATION:Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:Abstract. Free groups are some of the most basic and important examples of
groups. All subgroups of free groups are free, by a theorem of Nielsen and
Schreier, and finitely generated ones have nice algorithmic properties, sin
ce they can be represented by Stallings automata. However, the structure of
finitely generated submonoids of free groups is much more complicated. In
particular, these include all finitely generated submonoids of free monoids
, which can be even not finitely presented, let alone free. The isomorphism
problem is one of the most natural algorithmic questions about groups or m
onoids. We solve the isomorphism problem for a big class of submonoids of f
ree groups, which can be described in a few different ways. This is a joint
work with Pedro Silva.
DTSTAMP:20220520T035537Z
DTSTART;TZID=Europe/Budapest:20180411T100000
DTEND;TZID=Europe/Budapest:20180411T120000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR