International Conference «Mathematical and Informational Technologies, MIT-2011»
(IX Conference «Computational and Informational Technologies for Science,
Engineering and Education»)

Vrnjacka Banja, Serbia, August, 27–31, 2011

Budva, Montenegro, August, 31 – September, 5, 2011

Baltić V.  

Različiti pristupi prebrojavanju permutacija sa ograničenjima

We will give a survey of techniques for counting the number of restricted permutations satisfying the conditions -k ≤ p(i)-i ≤ r (for arbitrary natural numbers k and r) and p(i)-i I (for an arbitrary set I). We will introduce pure expanding of the permanent, Stanley's Transfer-matrix method, Factorization in Free Monoids, counting based on the finite state automata and our technique for generating a system of linear recurrence equations that enumerate the number of restricted permutations. We will demonstrate all approaches on two examples and we will establish the connections with other combinatorial structures as compositions and subsets with some additional restrictions.

To reports list

© 1996-2019, Institute of computational technologies of SB RAS, Novosibirsk