Currently, the areas of active research in the Department of Combinatorics and Optimization are: Algebraic and Enumerative Combinatorics. Classical and bijective methods; additive number theory, asymptotic analysis; combinatorial aspects of algebraic geometry, finite reflection groups, symmetric functions; random matrix models. Continuous Optimization. Linear and quadratic programming, convex analysis, duality theory, optimization in abstract spaces, matrix eigenvalue problems, interior-point methods, semi-definite programming problems; applications in finance, combinatorial optimization and many engineering disciplines. Cryptography. Finite fields, elliptic curves, design and analysis of public key systems. Discrete Optimization. Polyhedral combinatorics, approximation algorithms for NP-hard problems, semi-definite relaxations, extensions of matching and network flow theory, and matroids and generalizations. Graph Theory. Algebraic graph theory (association schemes, knot polynomials, eigenvalues), algorithmic graph theory, asymptotic enumeration of graphs, random graph theory, probabilistic methods, topological graph theory, extremal graph theory, matching theory, minimax theorems, and Ramsey theory. Quantum Information. Quantum computer algorithms and implementations, quantum cryptography, discrete logarithms.
复变函数应用概率论微分方程抽象代数微积分算法与编程偏微分方程定量分析高等代数数理统计数学分析
对于想学习该专业的高中生来说,需要具备出色的逻辑推理能力,数学天赋毋庸置疑非常重要,还需要有坚毅的品质和坚强的性格。大部该专业研究生院课程的申请者都来自数学相关专业。
热门的升学方向有:统计学、金融数学或金融工程、保险或精算、计算科学、计算机科学、逻辑学等等。