Chenqi Mou

Associate Professor
School of Mathematical Sciences, Beihang University, China
  • Address: Office E403-7, School of Mathematical Sciences, Beihang University, Beijing 100191, China
  • Official Email: chenqi.mou[at]buaa.edu.cn
  • Personal Email: chenqi.mou[at]gmail.com
  • Beihang Webpage: Link (in Chinese)

I am currently Associate Professor at School of Mathematical Sciences and Deputy Director of Center for Computer Mathematics in Beihang University, China. The research field of my interest is Symbolic Computation. More precisely, I mainly work on polynomial systems solving with algebraic tools like triangular sets and Gröbner bases and its applications.

Download CV

Events

Upcoming Events


DART XII
Apr. 9-12, 2024
Kassel, Germany

Invited speaker

Computer Mathematics 2024
Jun. 13-16, 2024
Fuzhou, China

PC member / Deadline: April 30, 2024

ISSAC 2024
Jul. 16-19, 2024
Raleigh, NC, USA

Deadline: Jan. 23/30, 2024

FPSAC 2024
Jul. 22-26, 2024
Bochum, Germany

Deadline: Nov. 15, 2023

ICMS 2024
Jul. 22-25, 2024
Durham, United Kingdom

Deadline: Mar. 1/22, 2024

MEGA 2024
Jul. 29-Aug. 2, 2024
Leipzig, Germany

Deadline: April 25, 2024

CASC 2024
Sep. 2-6, 2024
Rennes, France

PC Co-chair / Deadline: April 26, 2024

Education

Education


May 2013
Ph.D. in Applied Mathematics / Computer Science (Double Degrees)
Beihang University, China / Université Pierre et Marie Curie, France

Supervisors: Dongming Wang, Professor / Jean-Charles Faugère, Research Director
Thesis: Solving Polynomial Systems over Finite Fields: Algorithms, Implementation and Applications (Word Cloud)

Jul. 2007
Bachelor of Science in Mathematics and Applied Mathematics
Beihang University, China

Services

Services


Committee Member
Editorial Board Member
Member of Program Committee
Publicity Co-chair
Co-organizer
Member of Local Arrangements
Academic visits

Grants

Grants Awarded


Polynomial System Solving Based on Graph Theory

Principal Investigator, Fund for General Program, National Natural Science Foundation of China
Jan. 2020 – Dec. 2023

Elimination Theory and Methods Based on Connections Between Characteristic Sets and Groebner Bases

Participant, Fund for General Program, National Natural Science Foundation of China
Jan. 2018 – Dec. 2021

Efficient Symbolic Computation Algorithms for Solving Sparse Polynomial Systems

Principal Investigator, Basic Scientific Funding for Central Universities in China
Mar. 2014 – Dec. 2014

Optimization Theory and Efficient Algorithms for Coordinativity of Complex Networks

Participant, Beijing Municipal Natural Science Foundation
Dec. 2018 – Sep. 2022

Triangular Decomposition Methods for Structured Polynomial Systems

Principal Investigator, Fund for Young Scientists, National Natural Science Foundation of China
Jan. 2015 – Dec. 2017

Courses

Courses

I teach Computer Algebra for undergraduate and graduate students at Beihang University.
During the coronavirus outbreak I made public videos (in Chinese) for this course.
Length: 22 lectures, around 1.5 hours each; Textbook: Polynomial Algebra, co-authored by me.

Pictures

Pictures


Talks

Selected Talks

Tiltes and contents may vary for talks in a group.

On the Reduced Gröbner Bases of Blockwise Determinantal Ideals
Polynomial System Solving in a Nutshell
Characteristic Decomposition: Connecting Lexicographic Groebner Bases and Triangular Sets
Sparse Triangular Decomposition Based on Chordal Graphs
Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
Gröbner bases of Schubert determinantal ideals: Yet another connection between combinatorics and symbolic computation
Simple decomposition and simple characteristic decomposition
On the Chordality of Ordinary Differential Triangular Decomposition in Top-down Style
On the Chordality of Simple Decomposition in Top-Down Style
On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms
Graph Structures in Polynomial Systems Solving: from the Viewpoint of Variable Orderings
On W-characteristic Sets of Lexicographic Groebner Bases
Epsilon 1: A Software Library for Triangular Decomposition
Triangular sets over F2 VS satisfiability checking: a potential connection and interaction?
Simple Triangular Decomposition over Finite Fields
Sparse FGLM Algorithms for Solving Polynomial Systems
Reconstructing Chemical Reaction Networks by Solving Boolean Polynomial Systems
Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices

Publications

Publications

Find me in Google Scholar, ResearchGate, MathSciNet, or DBLP Bibliography
Books
Polynomial Algebra (in Chinese) [Cover, TOC, Purchase]

Dongming Wang, Chenqi Mou, Xiaoliang Li, Jing Yang, Meng Jin, and Yanli Huang, Higher Education Press, Beijing, 2011

Preprint
On the Reduced Gröbner Bases of Blockwise Determinantal Ideals [link]

Journal Papers
Sparse triangular decomposition for computing equilibria of biological dynamic systems based on chordal graphs [link]

Chenqi Mou and Wenwen Ju, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2023, 20(3): 1667-1678

Chordal graphs in triangular decomposition in top-down style [link]

Chenqi Mou, Yang Bai, and Jiahua Lai, Journal of Symbolic Computation, 2021, 102: 108–131

Characteristic decomposition of polynomial sets (in Chinese) [link]

Dongming Wang, Chenqi Mou, and Rina Dong, SCIENTIA SINICA Mathematica, 2021, 51(1): 67–86

Decomposition of polynomial sets into characteristic pairs [link]

Dongming Wang, Rina Dong, and Chenqi Mou, Mathematics of Computation, 2020, 89: 1993-2015

Characteristic decomposition: From regular sets to normal sets [link]

Chenqi Mou and Dongming Wang, Journal of Systems Science and Complexity, 2019, 32(1): 37-46

Sparse FGLM algorithms [link]

Jean-Charles Faugère and Chenqi Mou, Journal of Symbolic Computation, 2017, 80(3): 538-569

Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods [link]

Wei Niu, Jian Shi, and Chenqi Mou, Applied Mathematics and Computation, 2016, 273: 934-947

Applying triangular set method to detecting steady states and their numbers for finite biological model (in Chinese) [link]

Chenqi Mou and Wei Niu, Computer Applications and Software, 2014, 31(1): 278-282

Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case [link]

[Chenqi Mou, Dongming Wang, and Xiaoliang Li, Theoretical Computer Science, 2013, 468: 102-113

Design of termination criterion of BMS algorithm for lexicographical ordering (in Chinese) [link]

Chenqi Mou, Journal of Computer Applications, 2012, 32(11): 2977-2980

Stability analysis for discrete biological models using algebraic methods [link]

Xiaoliang Li, Chenqi Mou, Wei Niu, and Dongming Wang, Mathematics in Computer Science, 2011, 5: 247-262

Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case [link]

Xiaoliang Li, Chenqi Mou, and Dongming Wang, Computers & Mathematics with Applications, 2010, 60: 2983-2997

Conference Papers
Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition [link]

Mingyu Dong and Chenqi Mou, CASC 2022, Gebze, Turkey, 2022

Algorithms for testing membership in univariate quadratic modules over the reals [link]

Weifeng Shang, Chenqi Mou, and Deepak Kapur, ISSAC 2022, Lille, France, 2022

Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition [link]

Wenwen Ju and Chenqi Mou, AlCoB 2020 & 2021, Missoula, Montana, USA, 2021

Comprehensive characteristic decomposition of parametric polynomial systems [link]

Rina Dong, Dong Lu, Chenqi Mou and Dongming Wang, ISSAC 2021, Saint Peterburg, Russia, 2021

Game-theoretic analysis on CBDC adoption [link]

Chenqi Mou, Wei-Tek Tsai, Xiaofang Jiang, and Dong Yang, FICC 2020, Qingdao, China, 2020

On the chordality of ordinary differential triangular decomposition in top-down style [link]

Chenqi Mou, ISSAC 2020, Kalamata, Greece, Jul. 2020

On the chordality of simple decomposition in top-down style [link]

Chenqi Mou and Jiahua Lai, MACIS 2019, Gebze-Istanbul, Turkey, Nov. 2019

On Berlekamp–Massey and Berlekamp–Massey–Sakata algorithms [link]

Chenqi Mou and Xiaolin Fan, CASC 2019, Moscow, Russia, Aug. 2019

On characteristic decomposition and quasi-characteristic decomposition [link]

Rina Dong and Chenqi Mou, CASC 2019, Moscow, Russia, Aug. 2019

Game-theoretic analysis on the number of participants in the software crowdsourcing contest [link]

Pengcheng Peng, Chenqi Mou, and Wei-Tek Tsai, AISC 2018, Suzhou, China, Sep. 2018

On the chordality of polynomial sets in triangular decomposition in top-down style [link]

Chenqi Mou and Yang Bai, ISSAC 2018, New York, USA, July, 2018

Symbolic detection of steady states of autonomous differential biological systems by transformation into block triangular form [link]

Chenqi Mou, AlCoB 2018, Hongkong, China, June. 2018

Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets [link]

Rina Dong and Chenqi Mou, CASC 2017, Beijing, China, Sep. 2017

Reconstructing chemical reaction networks by solving Boolean polynomial systems

Chenqi Mou and Wei Niu, MACIS 2013, Naning, China, Dec. 2013

Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices [link]

Jean-Charles Faugère and Chenqi Mou, ISSAC 2011, San Jose, USA, Jun. 2011

Stability analysis for discrete biological models using algebraic methods

Xiaoliang Li, Chenqi Mou, Wei Niu, and Dongming Wang, MACIS 2009, Fukuoka, Japan, Dec. 2009

Mathematics Popularization
World of Mathematics [Purchase]

Chinese Translation of "Cracking Mathematics" by Colin Beveridge, Electronic Industry Press, Beijing, 2019

Crazy STEM: Mathematics (two volumes) [Purchase]

Chinese Translation of "Key Concepts in STEM", Electronic Industry Press, Beijing, 2022