#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2010

2017

- This year (3)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jean-Charles Faugère, Chenqi Mou
- ISSAC
- 2011

Let <i>I</i> in K[x1,...,x<sub><i>n</i></sub>] be a 0-dimensional ideal of degree <i>D</i> where K is a field. It is well-known that obtaining efficient algorithms for change of ordering of Gröbner bases of I is crucial in polynomial system solving. Through the algorithm FGLM, this task is classically tackled by linear algebra operations in… (More)

- Jean-Charles Faugère, Chenqi Mou
- J. Symb. Comput.
- 2017

Given a zero-dimensional ideal I ⊂ K[x1, . . . ,xn] of degree D, the transformation of the ordering of its Gröbner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving process. Thus it is of crucial importance to design efficient algorithms to perform the change of ordering. The main… (More)

- Chenqi Mou
- 2013

- Xiaoliang Li, Chenqi Mou, Dongming Wang
- Computers & Mathematics with Applications
- 2010

- Chenqi Mou, Dongming Wang, Xiaoliang Li
- Theor. Comput. Sci.
- 2013

- Xiaoliang Li, Chenqi Mou, Wei Niu, Dongming Wang
- Mathematics in Computer Science
- 2011

This paper is concerned with stability analysis of biological networks modeled as discrete and finite dynamical systems. We show how to use algebraic methods based on quantifier elimination, real solution classification and discriminant varieties to detect steady states and to analyze their stability and bifurcations for discrete dynamical systems. For… (More)

- Wei Niu, Jian Shi, Chenqi Mou
- Applied Mathematics and Computation
- 2016

- Rina Dong, Chenqi Mou
- CASC
- 2017

- Dongming Wang, Rina Dong, Chenqi Mou
- ArXiv
- 2017

A characteristic pair is a pair (G, C) of polynomial sets in which G is a reduced lexicographic Gröbner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be decomposed algorithmically into finitely many characteristic pairs with associated zero relations, which provide… (More)

- ‹
- 1
- ›