Research ArticleOpen AccessGoogle Scholar indexed
Double Derangement Permutations
Ferdowsi University of Mashhad, International Campus, Mashhad, Iran
National Organization for Development of Exceptional Talents (NODET) I, Mashhad, Iran
Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
- 1 Ferdowsi University of Mashhad, International Campus, Mashhad, Iran
- 2 National Organization for Development of Exceptional Talents (NODET) I, Mashhad, Iran
- 3 Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
Open Journal of Discrete Mathematics·Volume 06 (2016)·Pages 99–104·Published 31 March 2016·DOI10.4236/ojdm.2016.62010
Copy link · social · email
Abstract
Let n be a positive integer. A permutation a of the symmetric group of permutations of is called a derangement if for each . Suppose that x and y are two arbitrary permutations of . We say that a permutation a is a double derangement with respect to x and y if and for each . In this paper , we give an explicit for mula for , the number of double derangements with respect to x and y . Let and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, we show that if and z is a permutation such that for and for , then where .
KeywordsSymmetric Group of PermutationsDerangementDouble Derangement
- Graham, R.L., Knuth, D.E. and Patashnik, O. (1988) Concrete Mathematics. Addison-Wesley, Reading.
- Pitman, J. (1997) Some Probabilistic Aspects of Set Partitions. American Mathematical Monthly, 104, 201-209. http://dx.doi.org/10.2307/2974785
- Knopfmacher, A., Mansour, T. and Wagner, S. (2010) Records in Set Partitions. The Electronic Journal of Combinatorics, 17, R109.