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: "An invariance principle for polytopes"
  Abstract: Let X be randomly chosen from {-1,1} n , and let Y be randomly chosen from the standard spherical Gaussian on R n . For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr[X ∈ P] - Pr[Y ∈ P]| ≤ log 8/5 k • Δ, where Δ is a parameter that is small for polytopes formed by the intersection of "regular" halfspaces (i.e., halfspaces with low influence). The novelty of our invariance principle is the polylogarithmic dependence on k. Previously, only bounds that were at least linear in k were known.   We give two important applications of our main result: A bound of log O(1) k • e 1/6  on the Boolean noise sensitivity of intersections of k "regular" halfspaces (previous work gave bounds linear in k). This gives a corresponding agnostic learning algorithm for intersections of regular halfspaces. A pseudorandom generator (PRG) with seed length O(log n, poly(log k,1/Δ)) that Δ-fools  all  polytopes with k faces with respect to the Gaussian distribution.   We also obtain PRGs with similar parameters that fool polytopes formed by intersection of regular halfspaces over the hypercube. Using our PRG constructions, we obtain the first deterministic quasi-polynomial time algorithms for approximately counting the number of solutions to a broad class of integer programs, including dense covering problems and contingency tables.

Connected through hyperedge HE-1 (induced by source paper "Learning Functions of Halfspaces Using Prefix Covers"):
  with members:
    (none)

Connected through hyperedge HE-2 (induced by source paper "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming"):
  with members:
    - "Mechanism Design via Differential Privacy"
    - "On metaheuristic algorithms for combinatorial optimization problems"
    - "Approximate graph coloring by semidefinite programming"
    - "Free bits, PCPs and non-approximability-towards tight results"
    - "A global continuation algorithm for solving binary quadratic programming problems"
    - "How good is the Goemans-Williamson MAX CUT algorithm?"
    - "Some geometric results in semidefinite programming"
    - "Large margin hidden Markov models for speech recognition"

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