{"id":2533,"date":"2022-12-28T10:38:22","date_gmt":"2022-12-28T08:38:22","guid":{"rendered":"https:\/\/mathematics.haifa.ac.il\/?p=2533"},"modified":"2023-01-10T20:30:26","modified_gmt":"2023-01-10T18:30:26","slug":"colloquium-tuesday-january-3-2023-speaker-arseny-shur-ural-federal-university-title-words-separation-problem-and-short-identities-in-semigroups-and-groups","status":"publish","type":"post","link":"https:\/\/mathematics.haifa.ac.il\/?p=2533","title":{"rendered":"Colloquium: Tuesday January 3, 2023. Speaker: Arseny Shur (Ural Federal University). Title: &#8220;Words separation problem and short identities in semigroups and groups&#8221;."},"content":{"rendered":"\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Our next Math&nbsp;colloquium&nbsp;talk will be&nbsp;<strong>in person<\/strong>&nbsp;next week on the 3rd of January, in room 614, Science &amp; Education building.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">A zoom link for our meetings is:<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><a href=\"https:\/\/us02web.zoom.us\/j\/83337601824\">https:\/\/us02web.zoom.us\/j\/83337601824<\/a><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Speaker :&nbsp;<strong>Arseny Shur (Ural Federal University)<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Date :&nbsp;<strong>Tuesday, 3rd of January, 2023.<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Time :&nbsp;<strong>14:00<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Title:&nbsp;<\/strong>Words separation problem and short identities in semigroups and groups.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:&nbsp;<\/strong>Consider a very simple algorithmic problem: given two distinct words&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=u\" alt=\"u\">&nbsp;and&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=v\" alt=\"v\">&nbsp;in advance, decide whether the input word is&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=u\" alt=\"u\">&nbsp;or&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=v\" alt=\"v\">. Suppose that the decision procedure should also be simple: acceptance\/rejection by a deterministic finite automaton. We say that the automaton separates&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=u\" alt=\"u\">&nbsp;and&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=v\" alt=\"v\">&nbsp;if it accepts exactly one of them. What is the minimum size&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"58\" height=\"16\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=sep(u,v)\" alt=\"sep(u,v)\">&nbsp;of a DFA separating&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=u\" alt=\"u\">&nbsp;and&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=v\" alt=\"v\">? What is the mnimum size&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"74\" height=\"16\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=k%09=%09sep(n)\" alt=\"k = sep(n)\">&nbsp;such that any two words of length at most&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=n\" alt=\"n\">&nbsp;are separated by an automaton with at most&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"11\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=k\" alt=\"k\">&nbsp;states? We will focus on the exact values (for small&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"8\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=n\" alt=\"n\">) and the asymptotics of the function&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"43\" height=\"16\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=sep(n)\" alt=\"sep(n)\">. This problem can be easily reformulated as finding the minimum length of an identity of the full transformation semigroup on&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"11\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=k\" alt=\"k\">&nbsp;elements. Most of the time we will speak about important particular case where the DFA must be invertible, that is, each letter must act as a permutation of the set of states. This case corresponds to finding short identities of the form&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"38\" height=\"7\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=u%09=%09v\" alt=\"u = v\">, with no inverses, in the symmetric group on&nbsp;<img loading=\"lazy\" decoding=\"async\" width=\"7\" height=\"11\" src=\"https:\/\/s0.wp.com\/latex.php?zoom=3&amp;bg=ffffff&amp;fg=000000&amp;s=0&amp;latex=k\" alt=\"k\">&nbsp;elements.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Our next Math&nbsp;colloquium&nbsp;talk will be&nbsp;in person&nbsp;next week on the 3rd of January, in room 614, Science &amp; Education building. A zoom link for our meetings is: https:\/\/us02web.zoom.us\/j\/83337601824 Speaker :&nbsp;Arseny Shur (Ural Federal University) Date :&nbsp;Tuesday, 3rd of January, 2023. Time&#8230;<br \/><a class=\"read-more-button\" href=\"https:\/\/mathematics.haifa.ac.il\/?p=2533\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[],"class_list":["post-2533","post","type-post","status-publish","format-standard","hentry","category-colloquium"],"_links":{"self":[{"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/posts\/2533","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2533"}],"version-history":[{"count":2,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/posts\/2533\/revisions"}],"predecessor-version":[{"id":2544,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=\/wp\/v2\/posts\/2533\/revisions\/2544"}],"wp:attachment":[{"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2533"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2533"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mathematics.haifa.ac.il\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2533"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}