{"id":51,"date":"2016-10-19T10:52:12","date_gmt":"2016-10-19T07:52:12","guid":{"rendered":"http:\/\/math.utu.fi\/rufidim2017\/?page_id=51"},"modified":"2017-08-03T12:23:19","modified_gmt":"2017-08-03T09:23:19","slug":"conference-program","status":"publish","type":"page","link":"https:\/\/math.utu.fi\/rufidim2017\/conference-program\/","title":{"rendered":"Conference program"},"content":{"rendered":"

Proceedings<\/h2>\n

Printed proceedings were distributed to each participant.<\/p>\n

The electronic proceedings<\/Strong> of the symposium have been published, please see http:\/\/www.doria.fi\/handle\/10024\/143322<\/a>.<\/p>\n

Program<\/h2>\n

The conference is held at The university of Turku, in building Quantum. The building is located at the top of the so-called “university hill”. The talks are held in the Quantum auditorium, except on Wednesday, when talks are in lecture room XVI in the first floor of Quantum building.<\/p>\n

The address of the building is “Quantum, Vesilinnantie 5, 20500 Turku”. Please see the map under the section “Useful Info” to get an idea of the campus.<\/p>\n\n\n\n<\/colgroup>\n\n\n\n
Monday 15th<\/th>\n<\/tr>\n
18:00 – 21:00<\/td>\nGet-together and registration<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n<\/colgroup>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Tuesday 16th<\/th>\n<\/tr>\n
8:30 –<\/td>\nRegistration<\/td>\n<\/tr>\n
8:50 – 9:00<\/td>\nOpening words: Rector Kalervo V\u00e4\u00e4n\u00e4nen<\/td>\n<\/tr>\n
9:00 – 10:00<\/td>\nInvited talk:<\/strong>
Alexandr Kostochka
\n– Recent results on disjoint and longest cycles in graphs<\/em><\/td>\n<\/tr>\n
10:00 – 10:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
10:30 – 11:00<\/td>\nDanila Cherkashin, Fedor Petrovy
\n– On small n-uniform hypergraphs with positive discrepancy<\/em><\/td>\n<\/tr>\n
11:00 – 11:30<\/td>\nVille Junnila, Tero Laihonen, Gabrielle Paris
\n– Location in circulant graphs<\/em><\/td>\n<\/tr>\n
11:30 – 12:00<\/td>\nA.V. Pastor
\n– On critically 3-connected graphs with exactly two vertices of degree 3<\/em><\/td>\n<\/tr>\n
12:00 – 13:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30 – 14:30<\/td>\nInvited talk:<\/strong>
Volker Diekert
\n– Solving equations in free partially commutative monoids: developments over\u00a0the past 20 years<\/em><\/td>\n<\/tr>\n
14:30 – 15:00<\/td>\nEsa Sahla
\n– A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem<\/em><\/td>\n<\/tr>\n
15:00 – 15:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
15:30 – 16:00<\/td>\nMarina Maslennikova, Emanuele Rodaro
\n– Trim Strongly Connected Synchronizing Automata and Ideal Languages<\/em><\/td>\n<\/tr>\n
16:00 – 16:30<\/td>\nAndrew Ryzhikov, Anton Shemyakov
\n– Subset Synchronization in Monotonic Automata<\/em><\/td>\n<\/tr>\n
16:30 – 17:00<\/td>\nVladimir V. Gusev, Elena Pribavkina, Marek Szykula
\n– Around the Road Coloring Theorem<\/em><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n\n\n\n<\/colgroup>\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Wednesday 17th – LECTURE ROOM XVI<\/th>\n<\/tr>\n
9:00 – 10:00<\/td>\nInvited talk:
<\/strong> V\u00e4\u00e4n\u00e4nen
– On the logic of dependence and independence<\/em><\/td>\n<\/tr>\n
10:00 – 10:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
10:30 – 11:00<\/td>\nAntti Valmari, Lauri Hella
\n– The Logics Taught and Used at High schools Are Not the Same<\/em><\/td>\n<\/tr>\n
11:00 – 11:30<\/td>\nYaroslav Salii
\n– Order-theoretic characteristics and dynamic programming for precedence constrained TSP<\/em><\/td>\n<\/tr>\n
11:30 – 12:00<\/td>\nIlia Ponomarenko
– Testing Isomorphism of Central Cayley Graphs Over Almost Simple Groups in Polynomial Time<\/em><\/td>\n<\/tr>\n
12:00 – 13:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30 – 14:30<\/td>\n Invited talk:
<\/strong> Aleksi Saarela
\n– Studying word equations by geometric and algebraic methods<\/em><\/td>\n<\/tr>\n
14:30 – 15:00<\/td>\nAleksei Yu. Kondratev, Vladimir V. Mazalov
\n– Nucleolus as Tournament Solution<\/em><\/td>\n<\/tr>\n
15:00 – 15:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
15:30 – 16:00<\/td>\nVladimir D. Matveenko, Alexei V. Korolev
\n– Network analysis based on a typology of nodes<\/em><\/td>\n<\/tr>\n
16:00 – 16:30<\/td>\nKamil Khadiev, Rishat Ibrahimov
\n– Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test<\/em><\/td>\n<\/tr>\n
16:30 – 17:00<\/td>\nElena Bozhenkova, Irina Virbitskaite
\n– Some Space-Time Characteristics of Relational Structures<\/em><\/td>\n<\/tr>\n<\/table>\n\n\n\n<\/colgroup>\n\n\n\n\n\n\n\n\n\n\n\n\n
Thursday 18th<\/th>\n<\/tr>\n
9:00 – 10:00<\/td>\nInvited talk:<\/strong>
Alexei Miasnikov
\n– Non-commutative discrete optimization: geometry, compression, and complexity<\/em><\/td>\n<\/tr>\n
10:00 – 10:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
10:30 – 11:00<\/td>\nDmitri V. Karpov
\n– Large contractible subgraphs of a 3-connected graph<\/em><\/td>\n<\/tr>\n
11:00 – 11:30<\/td>\nVille Junnila, Tero Laihonen, Tuomo Lehtil\u00e4
\n– Two New Classes of Locating-Dominating Codes<\/em><\/td>\n<\/tr>\n
11:30 – 12:00<\/td>\nVladimir Edemskiy, Nikita Sokolovskiy, Aleksandra Tsurina
\n– Notes about the linear complexity of cyclotomic sequences of order six and appropriate cyclic codes<\/em><\/td>\n<\/tr>\n
12:00 – 13:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30 – 14:00<\/td>\nSergey Afonin
\n– Decision Problems and Application of Rational Sets of Regular Languages<\/em><\/td>\n<\/tr>\n
14:00 – 14:30<\/td>\nAnni Hakanen, Tero Laihonen
\n– On resolving several objects in the king grid<\/em><\/td>\n<\/tr>\n
14:30 – 15:00<\/td>\nSpare time<\/td>\n<\/tr>\n
15:00 – 19:00<\/td>\nCity Excursion<\/td>\n<\/tr>\n
19:00 – <\/td>\nSymposium Dinner<\/td>\n<\/tr>\n<\/table>\n\n\n\n<\/colgroup>\n\n\n\n\n\n\n\n\n\n\n\n\n
Friday 19th<\/th>\n<\/tr>\n
9:00 – 10:00<\/td>\nInvited talk:<\/strong>
Igor Potapov
\n– Decision problems in matrix semigroups: limitations and algorithms<\/em><\/td>\n<\/tr>\n
10:00 – 10:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
10:30 – 11:00<\/td>\nA.E. Guterman, A.M. Maksaev
\n– On the scrambling index of non-negative matrices<\/em><\/td>\n<\/tr>\n
11:00 – 11:30<\/td>\nJarkko Peltom\u00e4ki, Ville Salo
\n– On winning shifts of generalized Thue-Morse substitutions<\/em><\/td>\n<\/tr>\n
11:30 – 12:00<\/td>\nAnna Rettieva
\n– Cooperation in Dynamic Multicriteria Games with Random Horizons<\/em><\/td>\n<\/tr>\n
12:00 – 13:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30 – 14:00<\/td>\nYana Teplitskaya
\n– Regularity of the maximal distance minimizers<\/em><\/td>\n<\/tr>\n
14:00 – 14:30<\/td>\nIrina Cheplyukova, Yuri Pavlov
\n– On the dynamics of a confguration graph with random vertex degrees and bounded number of edges<\/em><\/td>\n<\/tr>\n
14:30 – 15:00<\/td>\nMarina Leri, Yuri Pavlov
\n– On robustness of configuration graphs in random environment<\/em><\/td>\n<\/tr>\n
15:00 – 15:30<\/td>\nCoffee break<\/td>\n<\/tr>\n
15:30 –<\/td>\nEnd of Symposium<\/td>\n<\/tr>\n<\/table>\n
<\/div>\n

<\/path><\/svg><\/i> \"Loading\"<\/p>\n

<\/div>\n","protected":false},"excerpt":{"rendered":"

Proceedings Printed proceedings were distributed to each participant. The electronic proceedings of the symposium have been published, please see http:\/\/www.doria.fi\/handle\/10024\/143322. Program The conference is held at The university of Turku, in building Quantum. The building is located at the top of the so-called “university hill”. The talks are held in the Quantum auditorium, except on … Continue reading Conference program<\/span><\/a><\/p>\n

<\/div>\n

<\/path><\/svg><\/i> \"Loading\"<\/p>\n

<\/div>\n","protected":false},"author":14,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-51","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/pages\/51","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/comments?post=51"}],"version-history":[{"count":22,"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/pages\/51\/revisions"}],"predecessor-version":[{"id":533,"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/pages\/51\/revisions\/533"}],"wp:attachment":[{"href":"https:\/\/math.utu.fi\/rufidim2017\/wp-json\/wp\/v2\/media?parent=51"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}