Meistaravörn við tölvunarfræðideild: Arnar Bjarni Arnarson

Substitution decomposition for permutation classes with infinitely many simple permutations

  • 4.6.2019, 13:00 - 14:00

Student: Arnar Bjarni Arnarson
Title: Substitution decomposition for permutation classes with infinitely many simple permutations
Date and Location: June 4th 2019 at 13:00 in room M105
Supervisor: Henning Úlfarsson, assistant professor and Christian Bean, postdoctoral researcher, Department of Computer Science, Reykjavík University

Abstract: We present an automatic method, using the substitution decomposition (Albert et.al, Bassino et al.) and the CombSpecSearcher (Bean) algorithm, to enumerate classes containing infinitely many simple permutations.To accomplish this we use tilings, but allow ourselves to make assumptions about certain cells. The method for enumerating the sum and skew decomposable permutations in the class remains the same as in previous work. We introduce new strategies to find a combinatorial specification for the (possibly infinite) set of simple permutations in a permutation class. Our approach simultaneously performs the inflations.This method has been able to enumerate many permutation classes with infinitely many simple permutations, for example Av(1324, 2431) and Av(1324, 2413).



Vinsamlegast athugið að á viðburðum Háskólans í Reykjavík (HR) eru teknar ljósmyndir og myndbönd sem notuð eru í markaðsstarfi HR. Hægt er að nálgast frekari upplýsingar á ru.is eða með því að senda tölvupóst á netfangið: personuvernd@ru.is
//
Please note that at events hosted at Reykjavik University (RU), photographs and videos are taken which might be used for RU marketing purposes. Read more about this on our ru.is or send an e-mail: personuvernd@ru.is