Ioannis Michos holds a B.Sc. (with distinction) in Mathematics from University of Ioannina, Greece; a M.Sc. and a Ph.D. in Pure Mathematics (Algebra) from the University of Manchester, England. He had been a post-doctoral fellow at LIAFA (Laboratoire d’ Informatique: Fondements et Applications) (today’s IRIF: Institut de Recherche en Informatique Fondamentale) at the University of Paris VII in France working on the 5th European TMR project ALAPEDES (Algebraic Approach to Performance Evaluation of Discrete Event Systems).
He has taught in various universities in Greece and Cyprus: as a visiting assistant professor at the University of Crete, University of Ioannina, University of Cyprus, Frederick University and European University, Cyprus from 2003 to 2014. He currently holds a permanent position as an assistant professor of Mathematics in the Department of Computer Science and Engineering at European University, Cyprus. He has taught several mathematics courses related to algebra, combinatorics and discrete mathematics such as Linear Algebra, Graph Theory, Combinatorics, Coding Theory, Group Theory and Number Theory.
His research area spans from Algebra and Combinatorics to Discrete Mathematics and their applications to Theoretical Computer Science and Computational Biology. More precisely: combinatorics of free Lie algebras (with relations to the theory of formal languages and automata), free partially commutative (trace) monoids (average parallelism and applications to parallel and discrete event systems), Representations of finite groups (modular representation theory, invariant theory and relatively free algebras), Combinatorics and Graph theory (combinatorics on words, Patterns in permutations and words, Spectral graph theory), Combinatorial and Computational Biology (combinatorial structure of RNA).
His scientific results have been published in several journals of worldwide recognition such as Discrete Mathematics, Journal of Algebraic Combinatorics and Discete Mathematics and Theoretical Computer Science. He has also published his work in numerous well known conference proceedings such as the Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2001), the Symposium on Theoretical Aspects of Computer Science (STACS 2002) and Permutation Patterns (PP2018, PP2019). He is a reviewer in the journal Discrete Mathematics and Theoretical Computer Science and of the American Mathematical Society.
- PhD degree, Department of Mathematics, University of Manchester Institute of Science and Technology (UMIST, nowadays a part of University of Manchester), England (1999)
- Master of Science, Department of Mathematics, University of Manchester Institute of Science and Technology (UMIST, nowadays a part of University of Manchester), England (1994)
- Bachelor of Science, Department of Mathematics, University of Ioannina, Greece (1991).
“Enumeration of the super-strong Wilf equivalence classes of permutations in the generalized factor order”. (with Christina Savvidou), Discrete Math. Theor. Comput. Sci. 21 no. 2 Permutation Patterns 2018 (2019), #3. arXiv: 1803.008818v5
“On super-strong Wilf equivalence classes of permutations”. (with Christina Savvidou and Demetris Hadjiloucas), The Electronic Journal of Combinatorics 25 (2) (2018), #P2.54
“On twin and anti-twin words in the support of the free Lie algebra”, Journal of Algebraic Combinatorics 36 (2012), no. 3, 355-388.
“On the support of the free Lie algebra: the Schutzenberger problems”, Discrete Math. Theor. Comput. Sci. 12 (2010), no. 3, 1-28.
“Computing the average parallelism in trace monoids”. (with Daniel Krob and Jean Mairesse). Discrete Mathematics 273 (2003), Issue no. 1 – 3 (COMB’ 01), 132 – 161.
“Lie powers of free modules for certain groups of prime power order”. (with R.M. Bryant). Special issue on group theory. J. Austral. Math. Soc. (Ser. A) 71 (2001), no. 2, 149 – 158.
“Integral Lie powers of a lattice for the cyclic group of order 2”. Arch. Math. (Basel) 75 (2000), no. 3, 188 – 194.
Refereed conference Proceedings
“Enumeration of super-strong Wilf equivalence classes of permutations”. Joint work with Christina Savvidou. Talk at the PP 2018 (Permutation Patterns), Dartmouth College, USA, July 2018. Special Issue: To appear in Discrete Mathematics and Theoretical Computer Science,
”On super-strong Wilf equivalence classes of permutations”. Joined work with Christina Savvidou and Demetris Hadjiloucas. Poster Presentation at the PP 2017 (Permutation Patterns), Reykjavik University, Iceland, July 2017. Special Issue: To appear in Discrete Mathematics and Theoretical Computer Science,
“On twin and anti-twin words in the support of the free Lie algebra”. 20 minutes talk in the 8th French Combinatorial Conference, University of Paris XI, France, June 2010.
“Free partially commutative monoids and concurrent systems”. A talk given to the 7th Pancyprian Congress of Mathematical Education and Science, Ayia Napa, Cyprus, February 2005.
“On the average parallelism in trace monoids”. (with Daniel Krob and Jean Mairesse).
Lecture Notes in Computer Science 2285, 477 – 488. H. Alt and A. Ferreira, editors : Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science: STACS ’02, Antibes-Juan les Pins, France, March 2002.
“On the average Cartier-Foata height of traces”. (with Daniel Krob and Jean Mairese).
Electronic Notes on Discrete Mathematics, vol. 10. Proceedings of EUROCOMB’ 01 : Euroconference on Combinatorics, Graph Theory and Applications, Centre de Recerca Matematica, Barcelona, Spain, September 2001.
“On the Cartier-Foata height of traces”. Communication at the 8emes Journees Montoises d’ Informatique Theorique, Universite´ de Marne-la-Vallee, France, March 2000.