For s ≥ 2, the set of iterated differences associated with the prescribed integers a(s, j), 1 ≤ j ≤ s, is the set {a(i, j): 1 ≤ j ≤ i ≤ s} where a(i - 1, j) = |a(i, j) - a(i, j + 1)|, 1 ≤ j 8. We find here that the problem is more challenging in the case where the sets have different valencies
AbstractA set {b1,b2,…,bi} ⊂ {1,2,…,N} is said to be a difference intersector set if {a1,a2,…,as} ⊂ ...
AbstractLet m and t be positive integers with t⩾2. An (m,t)-splitting system is a pair (X,B) where |...
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...
AbstractFors≥2, a set {a(i,j):1 ≤j≤s+1 −i≤s} wherea(1,j), 1≤ j≤s, are some prescribed integers anda(...
AbstractAn (m, n; u, v; c)-system is a collection of components, m of valency u−1 and n of valency v...
AbstractAn (m, n;u, v;c)-system is a collection of components, m of valency u – 1 and n of valency v...
AbstractLet m,n1,n2,…,nm and c be positive integers. Let A = {A1, A2, … Am} be a system of sequences...
AbstractThe number of components m in regular (m, 5, c)-systems is given in the literature to date b...
AbstractA perfect system of difference sets with threshold c is a partition of a consecutive run of ...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
AbstractIn this paper, we show that given any finite set, D = {D1, D2, … , Dn}, of positive integers...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
We investigate behavior of solutions of the following systems of rational difference equations: xn+1...
Abstract In a recent paper several periodic systems of difference equations have been presented. We ...
AbstractA set {b1,b2,…,bi} ⊂ {1,2,…,N} is said to be a difference intersector set if {a1,a2,…,as} ⊂ ...
AbstractLet m and t be positive integers with t⩾2. An (m,t)-splitting system is a pair (X,B) where |...
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...
AbstractFors≥2, a set {a(i,j):1 ≤j≤s+1 −i≤s} wherea(1,j), 1≤ j≤s, are some prescribed integers anda(...
AbstractAn (m, n; u, v; c)-system is a collection of components, m of valency u−1 and n of valency v...
AbstractAn (m, n;u, v;c)-system is a collection of components, m of valency u – 1 and n of valency v...
AbstractLet m,n1,n2,…,nm and c be positive integers. Let A = {A1, A2, … Am} be a system of sequences...
AbstractThe number of components m in regular (m, 5, c)-systems is given in the literature to date b...
AbstractA perfect system of difference sets with threshold c is a partition of a consecutive run of ...
Difference systems of sets (DSS) are combinatorial configurations that arise in connection with code...
AbstractIn this paper, we show that given any finite set, D = {D1, D2, … , Dn}, of positive integers...
AbstractA perfect (v,{ki∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint ki-...
AbstractDifference systems of sets (DSS) are combinatorial configurations that arise in connection w...
We investigate behavior of solutions of the following systems of rational difference equations: xn+1...
Abstract In a recent paper several periodic systems of difference equations have been presented. We ...
AbstractA set {b1,b2,…,bi} ⊂ {1,2,…,N} is said to be a difference intersector set if {a1,a2,…,as} ⊂ ...
AbstractLet m and t be positive integers with t⩾2. An (m,t)-splitting system is a pair (X,B) where |...
Qualified difference sets are a class of combinatorial configuration. The sets are related to the r...