OFFSET
3,2
COMMENTS
An n-breakable vector is a vector v=(v(1),v(2),...,v(n-2)) such that each v(i) is a nonnegative integer and SUM i*v(i) == 1 (mod n-1).
Extreme n-breakable vectors form the set of n-breakable vectors such that every n-breakable vector component-wise dominates some vector from this set, but no two distinct vectors from this set dominate one another.
Number of vectors from the Hilbert basis in A141347 with the first coordinate equal 1.
LINKS
Max A. Alekseyev and Pavel A. Pevzner, "Multi-Break Rearrangements and Chromosomal Evolution". Theoretical Computer Science 395(2-3) (2008), pp. 193-202.
EXAMPLE
The set of extreme 6-breakable vectors is { (1,0,0,0), (0,0,2,0), (0,1,0,1), (0,0,1,2), (0,3,0,0), (0,0,0,4) }.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Max Alekseyev, Jun 27 2008
EXTENSIONS
a(21)-a(32) from Max Alekseyev, Sep 16 2011
STATUS
approved