Rizeng Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rizeng Chen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bican Xia
School of Mathematical Sciences, Peking University, Beijing, China
3 shared publications - Haokun Li
Peking University, School of Mathematical Sciences, Beijing, China
1 shared publication - Hoon Hong
Department of Mathematics, North Carolina State University, Raleigh, USA
1 shared publication - Jing Yang
School of Mathematical Sciences, Guangxi Minzu University, Nanning, China
1 shared publication - Tao Zheng
Key Laboratory of Mathematics Mechanization, Mathematics and Systems Science Chinese Academy of Sciences Beijing China
1 shared publication - Tianqi Zhao
Zhongguancun Laboratory
1 shared publication
Latest Publications
- Open Access
Stratifying Discriminant Hypersurface
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on subdiscriminants. The first approach stratifies the discriminant hypersurface by recursively removing all the lowest-order points, while the second one stratifies the discriminant hypersurface by recursively removing all the smooth points. Both approaches rely solely on the discriminant itself instead of using high-order subdiscriminants. These results offer new insights into the intrinsic geometry of the discriminant and its connection to root multiplicity.
Open AccessStratifying Discriminant Hypersurface
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on subdiscriminants. The first approach stratifies the discriminant hypersurface by recursively removing all the lowest-order points, while the second one stratifies the discriminant hypersurface by recursively removing all the smooth points. Both approaches rely solely on the discriminant itself instead of using high-order subdiscriminants. These results offer new insights into the intrinsic geometry of the discriminant and its connection to root multiplicity.
- Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 56-64
Reduction of Transcendental Decision Problems over the Reals
A special class of univariate transcendental decision problems called “trigonometric extension” is studied in this paper. Roughly speaking, a trigonometric extension is a ring of univariate analytic functions obtained by adjoining trigonometric functions to a ring consisting of functions having only finitely many real zeros. It is shown that in this case, the decision problem can be reduced to looking for solutions in a bounded domain. Based on the reduction, several new decidability results are established when Schanuel’s Conjecture is assumed. Furthermore, for the theory of multivariate trigonometric extension, it is proved that, although a small fragment of the theory can be reduced to the univariate case, the general theory is undecidable.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 56-64
Open AccessReduction of Transcendental Decision Problems over the Reals
A special class of univariate transcendental decision problems called “trigonometric extension” is studied in this paper. Roughly speaking, a trigonometric extension is a ring of univariate analytic functions obtained by adjoining trigonometric functions to a ring consisting of functions having only finitely many real zeros. It is shown that in this case, the decision problem can be reduced to looking for solutions in a bounded domain. Based on the reduction, several new decidability results are established when Schanuel’s Conjecture is assumed. Furthermore, for the theory of multivariate trigonometric extension, it is proved that, although a small fragment of the theory can be reduced to the univariate case, the general theory is undecidable.
- Open Access
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 145-154
Deciding first-order formulas involving univariate mixed trigonometric-polynomials
- 24 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 145-154
Open AccessDeciding first-order formulas involving univariate mixed trigonometric-polynomials
- Open Access
Isolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial
Mixed trigonometric-polynomials (MTPs) are functions of the form $f(x,\sin{x}, \cos{x})$ with $f\in\mathbb{Q}[x_1,x_2,x_3]$. In this paper, an algorithm ``isolating" all the real roots of an MTP is provided and implemented. It automatically divides the real roots into two parts: one consists of finitely many ``bounded" roots in an interval $[μ_-,μ_+]$ while the other consists of probably countably many ``periodic" roots in $\mathbb{R}\backslash[μ_-,μ_+]$. For bounded roots, the algorithm returns isolating intervals and corresponding multiplicities while for periodic roots, it returns finitely many mutually disjoint small intervals $I_i\subset[-π,π]$, integers $c_i>0$ and multisets of root multiplicity $\{m_{j,i}\}_{j=1}^{c_i}$ such that any periodic root $t>μ_+$ is in the set $(\sqcup_i\cup_{k\in\mathbb{N}}(I_i+2kπ))$ and any interval $I_i+2kπ\subset(μ_+,\infty)$ contains exactly $c_i$ periodic roots with multiplicities $m_{1,i},...,m_{c_i,i}$, respectively. The effectiveness and efficiency of the algorithm are shown by experiments. %In particular, our results indicate that the ``distributions" of the roots of an MTP in the ``periods" $(-π,π]+2kπ$ sufficiently far from $0$ share a same pattern. Besides, the method used to isolate the roots in $[μ_-,μ_+]$ is applicable to any other bounded interval as well. The algorithm takes advantages of the weak Fourier sequence technique and deals with the intervals period-by-period without scaling the coordinate so to keep the length of the sequence short. The new approaches can easily be modified to decide whether there is any root, or whether there are infinitely many roots in unbounded intervals of the form $(-\infty,a)$ or $(a,\infty)$ with $a\in\mathbb{Q}$.Open AccessIsolating Bounded and Unbounded Real Roots of a Mixed Trigonometric-Polynomial
Mixed trigonometric-polynomials (MTPs) are functions of the form $f(x,\sin{x}, \cos{x})$ with $f\in\mathbb{Q}[x_1,x_2,x_3]$. In this paper, an algorithm ``isolating" all the real roots of an MTP is provided and implemented. It automatically divides the real roots into two parts: one consists of finitely many ``bounded" roots in an interval $[μ_-,μ_+]$ while the other consists of probably countably many ``periodic" roots in $\mathbb{R}\backslash[μ_-,μ_+]$. For bounded roots, the algorithm returns isolating intervals and corresponding multiplicities while for periodic roots, it returns finitely many mutually disjoint small intervals $I_i\subset[-π,π]$, integers $c_i>0$ and multisets of root multiplicity $\{m_{j,i}\}_{j=1}^{c_i}$ such that any periodic root $t>μ_+$ is in the set $(\sqcup_i\cup_{k\in\mathbb{N}}(I_i+2kπ))$ and any interval $I_i+2kπ\subset(μ_+,\infty)$ contains exactly $c_i$ periodic roots with multiplicities $m_{1,i},...,m_{c_i,i}$, respectively. The effectiveness and efficiency of the algorithm are shown by experiments. %In particular, our results indicate that the ``distributions" of the roots of an MTP in the ``periods" $(-π,π]+2kπ$ sufficiently far from $0$ share a same pattern. Besides, the method used to isolate the roots in $[μ_-,μ_+]$ is applicable to any other bounded interval as well. The algorithm takes advantages of the weak Fourier sequence technique and deals with the intervals period-by-period without scaling the coordinate so to keep the length of the sequence short. The new approaches can easily be modified to decide whether there is any root, or whether there are infinitely many roots in unbounded intervals of the form $(-\infty,a)$ or $(a,\infty)$ with $a\in\mathbb{Q}$.