{"docId":3220,"paperId":1522,"url":"https:\/\/dmtcs.episciences.org\/1522","doi":"10.23638\/DMTCS-19-1-9","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":303,"name":"Vol. 19 no. 1"}],"section":[{"sid":6,"title":"Combinatorics","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1606.07915","repositoryVersion":3,"repositoryLink":"https:\/\/arxiv.org\/abs\/1606.07915v3","dateSubmitted":"2017-03-28 09:47:04","dateAccepted":"2017-03-28 10:23:43","datePublished":"2017-03-28 10:24:04","titles":["S-Restricted Compositions Revisited"],"authors":["Zolfaghari, Behrouz","Fallah, Mehran S.","Sedighi, Mehdi"],"abstracts":["An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years. This paper is an attempt at finding a closed- form formula for the number of S-restricted compositions of n. To do so, we reduce the problem to finding solutions to corresponding so-called interpreters which are linear homogeneous recurrence relations with constant coefficients. Then, we reduce interpreters to Diophantine equations. Such equations are not in general solvable. Thus, we restrict our attention to those S-restricted composition problems whose interpreters have a small number of coefficients, thereby leading to solvable Diophantine equations. The formalism developed is then used to study the integer sequences related to some well-known cases of the S-restricted composition problem."],"keywords":["Mathematics - Combinatorics"]}