Yu Zou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yu Zou has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Yongsheng Rao
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
2 shared publications - Hao Guan
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
1 shared publication - Jianguo Jiang
School of Mathematics, Liaoning Normal University, Dalian 116029, China
1 shared publication - Siran Lei
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
1 shared publication - Xing Huang
Department of Mathematics, Changzhou Institute of Technology, Changzhou 213022, China
1 shared publication - Ying Wang
Department of network technology, South China Institute of Software Engineering, Guangzhou 510990, China
1 shared publication
Latest Publications
- Open Access
- 18 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (12) , 2757
A Machine Proof System of Point Geometry Based on Coq
An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution’s procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields.
- 18 June 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (12) , 2757
Open AccessA Machine Proof System of Point Geometry Based on Coq
An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution’s procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields.
- Open Access
- 17 May 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (5) , 440
Construction of Fair Dice Pairs
An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice pairs and their 8 equivalence classes in a four-person game, identifying what we call the mandarin duck property of fair dice pairs.
- 17 May 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (5) , 440
Open AccessConstruction of Fair Dice Pairs
An interesting and challenging problem in mathematics is how to construct fair dice pairs. In this paper, by means of decomposing polynomials in a residue class ring and applying the Discrete Fourier Transformation, we present all the 2000 fair dice pairs and their 8 equivalence classes in a four-person game, identifying what we call the mandarin duck property of fair dice pairs.