Brian Hopkins, Hua Wang Saint Peter's University, Georgia Southern University
{"title":"限制颜色$n$-颜色组合","authors":"Brian Hopkins, Hua Wang Saint Peter's University, Georgia Southern University","doi":"10.4310/JOC.2021.v12.n2.a8","DOIUrl":null,"url":null,"abstract":"Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas for the cases of given allowed colors, given prohibited colors, and colors satisfying modular conditions, we consider several more specific conditions, establishing direct formulas and connections to other combinatorial objects. Proofs are combinatorial, mostly using the notion of spotted tilings introduced by the first named author in 2012.","PeriodicalId":8442,"journal":{"name":"arXiv: Combinatorics","volume":"2014 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Restricted color $n$-color compositions\",\"authors\":\"Brian Hopkins, Hua Wang Saint Peter's University, Georgia Southern University\",\"doi\":\"10.4310/JOC.2021.v12.n2.a8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas for the cases of given allowed colors, given prohibited colors, and colors satisfying modular conditions, we consider several more specific conditions, establishing direct formulas and connections to other combinatorial objects. Proofs are combinatorial, mostly using the notion of spotted tilings introduced by the first named author in 2012.\",\"PeriodicalId\":8442,\"journal\":{\"name\":\"arXiv: Combinatorics\",\"volume\":\"2014 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/JOC.2021.v12.n2.a8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/JOC.2021.v12.n2.a8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas for the cases of given allowed colors, given prohibited colors, and colors satisfying modular conditions, we consider several more specific conditions, establishing direct formulas and connections to other combinatorial objects. Proofs are combinatorial, mostly using the notion of spotted tilings introduced by the first named author in 2012.