DOIAbstract
AbstractWe introduce a new counting method to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)⩽6N+1
AbstractWe introduce a new counting method to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)⩽6N+1
AbstractIn the paper two combinatorial problems for the set Fnq of sequences of length n over the al...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractWe present a simple, novel and efficient algorithm for the determination of a longest increa...
Abstract. We introduce a new counting method to deal with B2[2] sequences, get-ting a new upper boun...
AbstractWe show that the maximum size of a B2-sequence of binary n-vectors for large enough n is at ...
AbstractWe introduce a new counting method to deal with B2[2] sequences, getting a new upper bound f...
AbstractWe give a non-trivial upper bound for Fh(g,N), the size of a Bh[g] subset of {1,…,N}, when g...
AbstractSuppose g is a fixed positive integer. For N⩾2, a set A⊂Z∩[1,N] is called a B2[g] set if eve...
AbstractA new upper bound for the cardinality of finite B2[2] sets is obtained, namely F2(N, 2)<2.36...
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
AbstractA set A of nonnegative integers is called a Bh-sequence if all sums x1 + · · · + xh with xi ...
International audienceSidon sets are those sets such that the sums of two of its elements never coin...
AbstractA new family of increasing sequences of positive integers is proposed. The integers n for wh...
summary:We investigate the extremal function $f(u,n)$ which, for a given finite sequence $u$ over $k...
Dedicated to Prof. R. Ahlswede on the occasion of his 60-th birthday Abstract: A new asymptotic uppe...
AbstractIn the paper two combinatorial problems for the set Fnq of sequences of length n over the al...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractWe present a simple, novel and efficient algorithm for the determination of a longest increa...
Abstract. We introduce a new counting method to deal with B2[2] sequences, get-ting a new upper boun...
AbstractWe show that the maximum size of a B2-sequence of binary n-vectors for large enough n is at ...
AbstractWe introduce a new counting method to deal with B2[2] sequences, getting a new upper bound f...
AbstractWe give a non-trivial upper bound for Fh(g,N), the size of a Bh[g] subset of {1,…,N}, when g...
AbstractSuppose g is a fixed positive integer. For N⩾2, a set A⊂Z∩[1,N] is called a B2[g] set if eve...
AbstractA new upper bound for the cardinality of finite B2[2] sets is obtained, namely F2(N, 2)<2.36...
AbstractLet Fh(N) be the maximum number of elements that can be selected from the set {1, …, N} such...
AbstractA set A of nonnegative integers is called a Bh-sequence if all sums x1 + · · · + xh with xi ...
International audienceSidon sets are those sets such that the sums of two of its elements never coin...
AbstractA new family of increasing sequences of positive integers is proposed. The integers n for wh...
summary:We investigate the extremal function $f(u,n)$ which, for a given finite sequence $u$ over $k...
Dedicated to Prof. R. Ahlswede on the occasion of his 60-th birthday Abstract: A new asymptotic uppe...
AbstractIn the paper two combinatorial problems for the set Fnq of sequences of length n over the al...
AbstractLetn = (a1.a2 … aN) denote a sequence of integers ai={1.2.…n}. A rise is a part ai.ai+1 with...
AbstractWe present a simple, novel and efficient algorithm for the determination of a longest increa...
Add to ORKG