AbstractGiven a linear recurrence integer sequence U = {un}, un+2 = un+1 + ur, n ⩾ 1, u1 = 1, u2> u1, we prove that the set of positive integers can be partitioned uniquely into two disjoint subsets such that the sum of any two distinct members from any one set can never be in U. We give a graph theoretic interpretation of this result, study related problems and discuss possible generalizations
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
AbstractGiven a linear recurrence integer sequence U = {un}, un+2 = un+1 + ur, n ⩾ 1, u1 = 1, u2> u1...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
AbstractA partition of N is called “admissible” provided some cell has arbitrarily long arithmetic p...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
For a set of nonnegative integers S let RS(n) denote the number of unordered representations of the ...
Abstract. A set S of positive integers is avoidable if there exists a partition of the positive inte...
AbstractIt is easy to deduce from Ramsey's theorem that given positive integers a1,a2,…,am and a fin...
AbstractThe principal result of this paper establishes the validity of a conjecture by Graham and Ro...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
AbstractGiven a linear recurrence integer sequence U = {un}, un+2 = un+1 + ur, n ⩾ 1, u1 = 1, u2> u1...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
Consider any set U = un with elements defined by un+2= un+2 + un, n ⩾ 1, where u1 and u2 are relativ...
Abstract. In this paper we prove that there exist infInitelv many disjoint sets of posItIve integers...
AbstractA partition of N is called “admissible” provided some cell has arbitrarily long arithmetic p...
In this paper we prove that there exist infInitely many disjoint sets of posItIve integers which the...
summary:Let $S$ be a non-empty subset of positive integers. A partition of a positive integer $n$ ...
We characterize all numbers n and S with the following property: Every instance of the partition pro...
For a set of nonnegative integers S let RS(n) denote the number of unordered representations of the ...
Abstract. A set S of positive integers is avoidable if there exists a partition of the positive inte...
AbstractIt is easy to deduce from Ramsey's theorem that given positive integers a1,a2,…,am and a fin...
AbstractThe principal result of this paper establishes the validity of a conjecture by Graham and Ro...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in gen...
DOI
Add to ORKG