Skip to content

Sign Patterns

danerman edited this page Apr 12, 2018 · 2 revisions

Project Description: We define the sign pattern of a vector in R^n as a sequence of n entries from {+,-,0}. For instance, the sign pattern of (3,4,0,-1) if (+,+,0,-). Given a set of vectors, the goal is to compute the set of all possible sign patterns in the span of the given vectors. Other projects involve combining this with standard operations on vector spaces, like sums and intersections.

Project Goals:

Project Group:

  • Polly Yu (Leader)
  • Derek Francour
  • Jacob Zoromski

References: