FrobeniusSolver fbSolver = new FrobeniusSolver(lowCounts, upCounts);
//processing combinations
int u, l;
int[] combination;
while((combination = fbSolver.take()) != null) {
LinkedList<Tensor> tCombination = new LinkedList<>();
u = 0;
l = 0;
for (i = 0; i < combination.length; ++i)