Recent content by grigor

I have faced the following problem recently: We have a sequence A of M consecutive integers, beginning at A[1] = 1: 1,2,...M (example: M = 8 , A = 1,2,3,4,5,6,7,8 ) We have the set T consisting of all possible subsequences made from L_T consecutive terms of A, which do not overlap. (example...

Yes in mathematical terms the problem sounds exactly the way you described it. Actually you are right the problem has a practical nature and it comes from the other field. However this field is not well investigated yet and there was no previous work yet. I cannot reveal more details due to...

It is my fault I didn't explain what I mean by group. I didn't find more suitable term to call it the other way. So in my case group is the set of ordered k-tuples of integers {g1, g2,... gk} (just as you have mentioned), but tuples consist of sequential numbers, i.e., g1>0; g2=g1+1; g3=g2+1...

Here is the problem I have faced recently that I cannot deal with yet and I need some help: Given is the - list of elements (numbered): e.g. [1,2,3,4,6,7,8] - the count and size of groups, which can be used to cover the given set of numbers, e.g. groups with group size 2. - I need to find...