human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Dynamic matrix rank"
  Abstract: We consider maintaining information about the rank of a matrix under changes of the entries. For nxn matrices, we show an upper bound of O(n^1^.^5^7^5) arithmetic operations and a lower bound of @W(n) arithmetic operations per element change. The upper bound is valid when changing up to O(n^0^.^5^7^5) entries in a single column of the matrix. We also give an algorithm that maintains the rank using O(n^2) arithmetic operations per rank one update. These bounds appear to be the first nontrivial bounds for the problem. The upper bounds are valid for arbitrary fields, whereas the lower bound is valid for algebraically closed fields. The upper bound for element updates uses fast rectangular matrix multiplication, and the lower bound involves further development of an earlier technique for proving lower bounds for dynamic computation of rational functions.

Connected through hyperedge HE-1 (induced by source paper "Dynamic Matrix Rank with Partial Lookahead"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics