Ze Gu

Ze Gu

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2016 in Journal of Algebra
Verified
Journal Article
Closed access
ZGZe Gu
Ze Gu
XTXilin Tang
Xilin Tang

1 July 2018 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
WZWei Zhao
Wei Zhao
XTXilin Tang
Xilin Tang
ZGZe Gu
Ze Gu

14 August 2020 in Discrete Mathematics and Applications
Verified
Journal Article
Closed access
PDF file
ZGZe Gu
Ze Gu
Let b, n be two positive integers such that b ≥ 2, and S(b, n) be the numerical semigroup generated by $\begin{array}{} \{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\} \end{array}$ . Applying two order relations, we give formulas for computing the embedding dimension, the Frobenius number, the type and the genus of S(b, n).

1 June 2016 in Journal of Number Theory
Verified
Journal Article
Closed access
ZGZe Gu
Ze Gu
XTXilin Tang
Xilin Tang

1 January 2023 in Journal of Applied Analysis & Computation
Verified
Journal Article
Closed access
PDF file
XFXiming Fang
Ximing Fang
ZGZe Gu
Ze Gu
ZQZhijun Qiao
Zhijun Qiao
In this paper, we discuss the convergence of the two-point modulus-based matrix splitting iteration method for solving the linear complementarity problem. Some convergence conditions are presented from the spectral radius and the matrix norm when the system matrix is a P-matrix. Besides, the quasi-optimal cases of the method are studied. Numerical experiments are provided to show the presented results.

1 January 2022 in Journal of Mathematics
Verified
Journal Article
Open access
ZGZe Gu
Ze Gu
DLDonglin Li
Donglin Li
YHYucong Huang
Yucong Huang
Let k, n be two positive integers such that 2 ≤ k ≤ 2n and m be an odd number with 1 ≤ m < 2k−1. Denote by T(k, m, n) a numerical semigroup generated by {(2k − m) · 2n+i − 1|i ∈ ℕ}. In this paper, we give the formula for the embedding dimension of T(k, m, n). In particular, the formulas for computing the Frobenius number and the genus of T(k, 2t + 1, n) with 2 ≤ t < k − 1 are given.