I Counting sequences related to set partitions and permutations
Set partitions and permutation cycles.
Generating functions
The Bell polynomials
Unimodality, log concavity and log convexity
The Bernoulli and Cauchy numbers
Ordered partitions
Asymptotics and inequalities
II Generalizations of our counting sequences
Prohibiting elements from being together
Avoidance of big substructures
Prohibiting elements from being together
Avoidance of big substructures
Avoidance of small substructures
III Number theoretical properties
Congurences
Congruences vial finite field methods
Diophantic results
Appendix
Biography
István Mező is a Hungarian mathematician. He obtained his PhD in 2010 at the University of Debrecen. He was working in this institute until 2014. After two years of Prometeo Professorship at the Escuela Politécnica Nacional (Quito, Ecuador) between 2012 and 2014 he moved to Nanjing, China, where he is now a full-time research professor.
