Pooya Daneshmand, Kamyar Mirzavaziri, M. Mirzavaziri
{"title":"双错乱排列","authors":"Pooya Daneshmand, Kamyar Mirzavaziri, M. Mirzavaziri","doi":"10.4236/OJDM.2016.62010","DOIUrl":null,"url":null,"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 \npermutation a is a double \nderangement with respect to x and y if and for each . In this paper, we give an explicit formula for , the number of double \nderangements with respect to x and y. \nLet and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, \nwe show that if and z is a permutation such that for and for , then where .","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"06 1","pages":"99-104"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Double Derangement Permutations\",\"authors\":\"Pooya Daneshmand, Kamyar Mirzavaziri, M. Mirzavaziri\",\"doi\":\"10.4236/OJDM.2016.62010\",\"DOIUrl\":null,\"url\":null,\"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 \\npermutation a is a double \\nderangement with respect to x and y if and for each . In this paper, we give an explicit formula for , the number of double \\nderangements with respect to x and y. \\nLet and let and be two subsets of with and . Suppose that denotes the number of derangements x such that . As the main result, \\nwe show that if and z is a permutation such that for and for , then where .\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":\"06 1\",\"pages\":\"99-104\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/OJDM.2016.62010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2016.62010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 formula 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 .