On completion of a linearly independent set to a basis with shifts of a fixed vector

Abstract

Let F be an infinite field. Let n be a positive integer and let 1≤ d≤ n. Let f1, f2, …, fd-1 ∈ Fn be d-1 linearly independent vectors. Let x=(x1,x2,…,xd,0,0,…,0)∈Fn, with n-d zeros at the end. Let R: Fn n be the cyclic shift operator to the right, e.g. R\,x = (0,x1,x2,…,xd,0,0,…,0). Is there a vector x ∈ Fn, such that the n-d+1 vectors x,Rx, … ,Rn-dx complete the set \fj\j=1d-1 to a basis of Fn? The answer is in the affirmative for every linearly independent set of fj, j=1,2,…,d-1. In order to prove this fact, we prove that the (n-d+1)×(n-d+1) minors of the (n-d+1)×(n-d+1) circulant matrix. bmatrix x, R x, …, Rn-d x bmatrix∫ercal form a Gr\"obner basis with respect to the graded reverse lexicographic order (grevlex).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…