{"title":"奇偶交替排列和序列","authors":"Augustine O. Munagi","doi":"10.2478/s11533-014-0421-2","DOIUrl":null,"url":null,"abstract":"The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions — adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular permutations.","PeriodicalId":50988,"journal":{"name":"Central European Journal of Mathematics","volume":"14 1","pages":"1390-1402"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Parity-alternating permutations and successions\",\"authors\":\"Augustine O. Munagi\",\"doi\":\"10.2478/s11533-014-0421-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions — adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular permutations.\",\"PeriodicalId\":50988,\"journal\":{\"name\":\"Central European Journal of Mathematics\",\"volume\":\"14 1\",\"pages\":\"1390-1402\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Central European Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/s11533-014-0421-2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Central European Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/s11533-014-0421-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions — adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular permutations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
