Chunlei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Chunlei Liu has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Haode Yan
School of Science, Harbin Institute of Technology, Shenzhen, China
5 shared publications - Yan Liu
Dept. of Math Shanghai Jiaotong Univ 200240 Shanghai
4 shared publications - Chuanze Niu
Beijing Normal University
3 shared publications - Wenxin Liu
Tianjin Institute of Urban Construction
3 shared publications - Chuanze Niu
School of Mathematical Sciences, Liaocheng University, Liaocheng 252059, China
2 shared publications - Yan Liu
College of Mathematics and Physics, Yancheng Institute of Technology, Yancheng, China
2 shared publications
Latest Publications
- Open Access
Counting the Collatz numbers
The counting function for the numbers satisfying the Collatz conjecture is studied. A related exponential congruence equation is investigated, yielding a method to construct its solutions from free variables, and enabling us to find at least $x^{0.3227}$ Collatz numbers in the interval $[1,x]$. The historical record is 0.84.Open AccessCounting the Collatz numbers
The counting function for the numbers satisfying the Collatz conjecture is studied. A related exponential congruence equation is investigated, yielding a method to construct its solutions from free variables, and enabling us to find at least $x^{0.3227}$ Collatz numbers in the interval $[1,x]$. The historical record is 0.84. - Open Access
An NP-hard generalization of Nim
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
Open AccessAn NP-hard generalization of Nim
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
- Open Access
Codes from Goppa codes
On a Goppa code whose structure polynomial has coefficients in the symbol field, the Frobenius acts. Its fixed codewords form a subcode. Deleting the naturally occurred redundance, we obtain a new code. It is proved that these new codes approach the Gilbert-Varshamov bound. It is also proved that these codes can be decoded within $O(n^2(\logn)^a)$ operations in the symbol field, which is usually much small than the location field, where $n$ is the codeword length, and $a$ a constant determined by the polynomial factorization algorithm.Open AccessCodes from Goppa codes
On a Goppa code whose structure polynomial has coefficients in the symbol field, the Frobenius acts. Its fixed codewords form a subcode. Deleting the naturally occurred redundance, we obtain a new code. It is proved that these new codes approach the Gilbert-Varshamov bound. It is also proved that these codes can be decoded within $O(n^2(\logn)^a)$ operations in the symbol field, which is usually much small than the location field, where $n$ is the codeword length, and $a$ a constant determined by the polynomial factorization algorithm. - Open Access
The $p$-adic Riemann Hypothesis For Expnonential Sums
The $L$-function of exponential sums associated to the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is studied. A polygon called the Frobenius polygon of the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is defined. A $p$-adic Riemann hypothesis is formulated. It asserts that the Newton polygon of the $L$-function coincides with the Frobenius polygon when $p$ is large enough. This $p$-adic Riemann hypothesis is proved when $n=2$ and $p\equiv-1({\rm mod }\ d)$. In general, it is proved that the Newton polygon of the $L$-function lies above the Frobenius polygon with coincide endpoints when $p$ is large enough.Open AccessThe $p$-adic Riemann Hypothesis For Expnonential Sums
The $L$-function of exponential sums associated to the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is studied. A polygon called the Frobenius polygon of the generic polynomial of degree $d$ in $n$ variables over a finite field of characteristic $p$ is defined. A $p$-adic Riemann hypothesis is formulated. It asserts that the Newton polygon of the $L$-function coincides with the Frobenius polygon when $p$ is large enough. This $p$-adic Riemann hypothesis is proved when $n=2$ and $p\equiv-1({\rm mod }\ d)$. In general, it is proved that the Newton polygon of the $L$-function lies above the Frobenius polygon with coincide endpoints when $p$ is large enough. - 1 June 2018
- Published by Elsevier in Journal of Number Theory
- Vol. 187, 27-40
On L -functions of twisted T -adic exponential sums
- 1 June 2018
- Published by Elsevier in Journal of Number Theory
- Vol. 187, 27-40
On L -functions of twisted T -adic exponential sums
- 12 March 2018
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 46 (3) , 707-715
Incidence Matrices of Finite Quadratic Spaces
- 12 March 2018
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 46 (3) , 707-715
Incidence Matrices of Finite Quadratic Spaces
- 1 May 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (5) , 1050-1053
A note on the spectrum of linearized Wenger graphs
- 1 May 2017
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (5) , 1050-1053
A note on the spectrum of linearized Wenger graphs
- 1 September 2016
- Published by Elsevier in Journal of Number Theory
- Vol. 166, 276-297
Generic T-adic exponential sums in one variable
- 1 September 2016
- Published by Elsevier in Journal of Number Theory
- Vol. 166, 276-297
Generic T-adic exponential sums in one variable
- 1 October 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 81 (2) , 225-238
A class of cyclic codes whose duals have five zeros
- 1 October 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 81 (2) , 225-238
A class of cyclic codes whose duals have five zeros
- 8 August 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 81 (1) , 1-9
Two classes of cyclic codes and their weight enumerator
- 8 August 2015
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 81 (1) , 1-9
Two classes of cyclic codes and their weight enumerator