Since the rank of the iterates grows less dramatically during the orthogonalization step compared to what happens after the multiplication with A, we allow 2∥Ek∥ to grow in accordance with Theorem 3.1, while ‖F1,kF2,kT‖ is maintained sufficiently small. Indeed, the matrix [V¯1,V1,1...
7.2. Bound on the Feng–Rao Numbers To prove the new bound, we first need the next lemma, whose proof can be found in [6], and then we can state the theorem with the bound. The proof of the theorem uses that δ r ( m ) counts the number of elements of a numerical semigroup ...
7.2. Bound on the Feng–Rao Numbers To prove the new bound, we first need the next lemma, whose proof can be found in [6], and then we can state the theorem with the bound. The proof of the theorem uses that δ r ( m ) counts the number of elements of a numerical semigroup ...