Searcharxiv⌕ Search

arXiv subjects

Hongjian Li

Publications and source records attributed to Hongjian Li.

12 recordsLinked to original sources
arXiv2026

The Matrix Pythagorean Equation over $\mathrm{GL}_2(\mathbb{Z})$

In this paper, we study the ordered solutions of the matrix Pythagorean equation $X^2+Y^2=Z^2$ over $\mathrm{GL}_2(\mathbb{Z})$ . Exploiting the independent sign symmetry of the equation, we first reduce the full solution set to the trace-nonnegative subset $\mathcal M$, consisting of those solutions for which all three traces are nonnegative. We then determine a canonical decomposition of $\mathcal M$ into orbits under simultaneous integral conjugacy.

math.NT↗
arXiv2026

A Multiplicative Fourier Proof of the Length-Four Index Conjecture

Let $C_n$ be a cyclic group of order $n$. We prove that if $(n,6)=1$, then every minimal zero-sum sequence of length four over $C_n$ has index one, thereby resolving the length-four index conjecture. After the gcd reduction, the nonunit case follows from the theorem of Shen-Xia-Li, and the remaining unit case is solved by a new multiplicative Fourier argument. The index-two residue identity yields a character-moment relation, and the odd characters with vanishing first moment form an exceptional spectrum of size at most $157\varphi(n)/1440<\varphi(n)/9$. A finite-group uncertainty principle then forces the four-term multiset to be invariant under negation, contradicting minimality. Apart from standard facts about primitive Dirichlet $L$-functions, the remaining argument is finite and requires neither asymptotic estimates nor computational verification.

math.NT↗
arXiv2025

Fermat's and Catalan's equations over $M_2(\mathbb{Z})$

Let $A=\begin{pmatrix} a & b \\ c & d \end{pmatrix}\in M_2\left(\mathbb{Z}\right)$ be a given matrix such that $bc\neq0$ and let $C(A)=\{B\in M_2(\mathbb{Z}): AB=BA\}$. In this paper, we give a necessary and sufficient condition for the solvability of the matrix equation $uX^i+vY^j=wZ^k,\, i,\, j,\, k\in\mathbb{N},\, X, \,Y,\, Z\in C(A)$, where $u,\, v,\, w$ are given nonzero integers such that $\gcd\left(u,\, v,\, w\right)=1$. From this, we get a necessary and sufficient condition for the solvability of the Fermat's matrix equation in $C(A)$. Moreover, we show that the solvability of the Catalan's matrix equation in $M_2\left(\mathbb{Z}\right)$ can be reduced to the solvability of the Catalan's matrix equation in $C(A)$, and finally to the solvability of the Catalan's equation in quadratic fields.

math.NT↗
arXiv2025

Some permutation polynomials via linear translators

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many scholars constructed some classes of permutation polynomials. Motivated by previous works, we first naturally extend the notion of linear translators and then construct some permutation polynomials.

math.NT↗
arXiv2025

Faithful Decomposition of Rationals

If an irreducible fraction $\frac mn>0$ can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than $\frac mn$ in fractional ideal $\frac 1n\mathbb Z$ can not be obtained by replacing some numerator with smaller non-negative integers, then the decomposition is said to be faithful. For $t\in\mathbb Z$, we prove that the length of faithful decomposition of an irreducible fraction $\frac mn$ with $2\le t\le\frac mn<t+1$ is at least $t+2$. In addition, we show a faithful decomposition of rationals consisting only of unit fractions except for one term. And we write $\frac 4n$ as a faithful decomposition with three fractions at most one non-unit fraction.

math.NT↗
arXiv2025

The order of appearance of the product of the first and second Lucas numbers

Let $a$ and $b$ be relatively prime integers. Then the first Lucas sequence $\left(U_n\right)_{n\geq0}$ and the second Lucas sequence $\left(V_n\right)_{n\geq0}$ are defined respectively by $U_{n+2}=aU_{n+1}+bU_{n},\, U_0=0,\,U_1=1$ and $V_{n+2}=aV_{n+1}+bV_{n},\, V_0=2,\,V_1=a$, where $n\geq0$. Let $m$ be an integer with $\gcd(m,\,b)=1$. Then the smallest positive integer $k$ satisfying $m\mid U_k$ is called the order of appearance of $m$ in the first Lucas sequence $(U_n)_{n\geq0}$, denoted by $\tau(m)$, i.e., $\tau(m):=\min\{k\geq1:m\mid U_k\}$. When $a>0$ and $\Delta=a^2+4b>0$, we give explicit formulae for $\tau(U_m V_n), \tau(U_m U_n)$, $\tau(V_m V_n)$ and $\tau(U_nU_{n+p}U_{n+2p})$, thus generalizing the results of Irmak and Ray.

math.NT↗
arXiv2025

On the representation of rational numbers via Euler's totient function

Let $b>1$ be an odd positive integer and $k, l \in \mathbb{N}$. In this paper, we show that every positive rational number can be written as $\varphi(m^{2})/(\varphi(n^{2}))^{b}$ and $\varphi(k(m^{2}-1))/\varphi(ln^{2})$, where $m, n\in \mathbb{N}$ and $\varphi$ is the Euler's totient function. At the end, some further results are discussed.

math.NT↗
arXiv2025

On the Elementary Symmetric Functions of $\{1,1/2,\dots,1/n\}\backslash\{1/i\}$

In 1946, P. Erd\H{o}s and I. Niven proved that there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1,1 / 2$, $\cdots, 1 / n$ are integers. In 2012, Y. Chen and M. Tang proved that if $n \geqslant 4$, then none of the elementary symmetric functions of $1,1 / 2, \cdots, 1 / n$ are integers. In this paper, we prove that if $n \geqslant 5$, then none of the elementary symmetric functions of $\{1,1 / 2, \cdots, 1 / n\} \backslash\{1 / i\}$ are integers except for $n=i=2$ and $n=i=4$.

math.NT↗
arXiv2025

$(G,F)$-points on $\mathbb{Q}$-algebraic varieties

Let $G\in \mathbb{Q}[x,y,z]$ be a polynomial, and let $V(G)$ be the $\mathbb{Q}$-algebraic variety corresponding to $G$, i.e., $V(G)=\{P\in\mathbb{Q}^3~|~G(P)=0\}$. Let \[\begin{split} F:\quad &\mathbb{Q}^3\rightarrow \mathbb{Q}^3,\\ &(x,y,z)\mapsto (f(x),f(y),f(z)) \end{split}\] be a vector function, where $f\in \mathbb{Q}[x]$. It is easy to know that the function obtained by the composition of $G$ and $F$, denoted as $G\circ F$, is still in $\mathbb{Q}[x,y,z]$. Moreover, let $V(G\circ F)$ be the $\mathbb{Q}$-algebraic variety corresponding to $G\circ F$, i.e., $V(G\circ F)=\{P\in\mathbb{Q}^3~|~G\circ F(P)=0\}$. A rational point $P$ is called a $(G,F)$-point on $V(G)$ if $P$ belongs to the intersection of $V(G)$ and $V(G\circ F)$, that is $P\in V(G)\cap V(G\circ F)$. Denote $\langle G,F\rangle$ as the set consisting of all $(G,F)$-points on $V(G)$. Obviously, $\langle G,F\rangle$ is a $\mathbb{Q}$-algebraic variety. In this paper, we consider the algebraic variety $\langle G,F\rangle$ for some specific functions $G$ and $F$. For these specific functions $G$ and $F$, we prove that $\langle G,F\rangle$ will be isomorphic to a certain elliptic curve. We also analyze some properties of these elliptic curves.

math.NT↗
arXiv2022

The matrix equation $aX^m+bY^n=cI$ over $M_2(\mathbb{Z})$

Let $\mathbb{N}$ be the set of all positive integers and let $a,\, b,\, c$ be nonzero integers such that $\gcd\left(a,\, b,\, c\right)=1$. In this paper, we prove the following three results: (1) the solvability of the matrix equation $aX^m+bY^n=cI,\,X,\,Y\in M_2(\mathbb{Z}),\, m,\, n\in\mathbb{N}$ can be reduced to the solvability of the corresponding Diophantine equation if $XY\neq YX$ and the solvability of the equation $ax^m+by^n=c,\, m,\, n\in\mathbb{N}$ in quadratic fields if $XY=YX$; (2) we determine all non-commutative solutions of the matrix equation $X^n+Y^n=c^nI,\,X,\,Y\in M_2(\mathbb{Z}),\,n\in\mathbb{N},\,n\geq3$, and the solvability of this matrix equation can be reduced to the solvability of the equation $x^n+y^n=c^n,\, n\in\mathbb{N},\,n\geq3$ in quadratic fields if $XY=YX$; (3) we determine all solutions of the matrix equation $aX^2+bY^2=cI,\,X,\,Y\in M_2(\mathbb{Z})$.

math.NT↗
arXiv2022

Positive rational number of the form $φ(km^{a})/φ(ln^{b})$

Let $k, l, a$ and $b$ be positive integers with $\max\{a, \, b\}\ge2$. In this paper, we show that every positive rational number can be written as the form $φ(km^{a})/φ(ln^{b})$, where $m, \, n\in\mathbb{N}$ if and only if $\gcd(a, \,b)=1$ or $(a, b, k, l)=(2,2, 1, 1)$. Moreover, if $\gcd(a, b)>1$, then the proper representation of such representation is unique.

math.NT↗