SearcharxivSearch

arXiv subjects

Min Sha

Publications and source records attributed to Min Sha.

At least 19 recordsLinked to original sources

Multiplicative dependence modulo subsets

In this paper, we show that if the non-constant rational functions $f_1, \ldots, f_n\in K(x)$ over a number field $K$ cannot multiplicatively generate a power of a linear fractional function, then there are only finitely many elements $\alpha \in K$ such that $f_1(\alpha),\ldots,f_n(\alpha)$ are multiplicatively dependent modulo some subset `close' (with respect to the Weil height) to the division group of a finitely generated multiplicative subgroup of $K$. This improves some previous results.

math.NT

Complete weight enumerators and weight hierarchies for linear codes from quadratic forms

In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four nonzero weights. These codes are derived from quadratic forms through a bivariate construction. We completely determine their complete weight enumerators and weight hierarchies by employing exponential sums. Most of these codes are minimal and some are optimal in the sense that they meet the Griesmer bound. Furthermore, we also establish the weight hierarchies of $\mathcal{C}_{Q,N}$ and $\mathcal{C}_{Q,N}'$, which are the descended codes of $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$.

cs.IT

Constacyclic codes with best-known parameters

In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.

cs.IT

Counting integer polynomials with several roots of maximal modulus

In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include lower and upper bounds in terms of $H$ for fixed $k$ and $n$. We also count reducible and irreducible polynomials in that set separately. Our results imply, for instance, that the number of monic integer irreducible polynomials of degree $n$ and height at most $H$ whose all $n$ roots have equal moduli is approximately $2H$ for odd $n$, while for even $n$ there are more than $H^{n/8}$ of such polynomials.

math.NT

On Euler's totient function of polynomials over finite fields

In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as Carmichael's conjecture, Sierpi\'{n}ski's conjecture, and Erd\"{o}s' conjecture.

math.NT

Explicit bounds for the solutions of superelliptic equations over number fields

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the well-known LeVeque condition, we give fully explicit upper bounds in terms of $K, S, f, m$ and the $S$-norm of $b$ for the heights of the solutions $x$ of the equation $( \star)$. Further, we give an explicit bound $C$ in terms of $K, S, f$ and the $S$-norm of $b$ such that if $m > C$ the equation $(\star)$ has only solutions with $y = 0$ or a root of unity. Our results are more detailed versions of work of Trelina, Brindza, Shorey and Tijdeman, Voutier and Bugeaud, and extend earlier results of B\'erczes, Evertse, and Gy\H{o}ry to polynomials with multiple roots. In contrast with the previous results, our bounds depend on the $S$-norm of $b$ instead of its height.

math.NT

Euclidean minima of algebraic number fields

In this paper, we use some of our previous results to improve an upper bound of Bayer-Fluckiger, Borello and Jossen on the Euclidean minima of algebraic number fields. Our bound depends on the degree $n$ of the field, its signature, discriminant and the Hermite constant in dimension $n$.

math.NT

On the generalized Fibonacci sequence of polynomials over finite fields

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute them, and we also obtain some properties about the quotient of the period and the rank. We find that the polynomial case is much more complicated than the integer case.

math.NT

Functional graphs of families of quadratic polynomials

We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs generated by three polynomials, we relate the distribution of leaves to the Sato-Tate distribution of Frobenius traces of elliptic curves. We also present extensive numerical results which we hope may shed some light on the distribution of leaves for larger families of polynomials.

math.NT

Multiplicative dependence of rational values modulo approximate finitely generated groups

In this paper, we establish some finiteness results about the multiplicative dependence of rational values modulo sets which are `close' (with respect to the Weil height) to division groups of finitely generated multiplicative groups of a number field $K$. For example, we show that under some conditions on rational functions $f_1, \ldots, f_n\in K(X)$, there are only finitely many elements $\alpha \in K$ such that $f_1(\alpha),\ldots,f_n(\alpha)$ are multiplicatively dependent modulo such sets.

math.NT

Multiplicative and linear dependence in finite fields and on elliptic curves modulo primes

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on elliptic curves in reduction modulo primes. One of our main results shows that, given non-zero rational functions $\varphi_1,\ldots,\varphi_m, \varrho_1,\ldots,\varrho_n\in\mathbb{Q}(X)$ and an elliptic curve $E$ defined over the integers $\mathbb{Z}$, for any sufficiently large prime $p$, for all but finitely many $\alpha\in\overline{\mathbb{F}}_p$, at most one of the following two can happen: $\varphi_1(\alpha),\ldots,\varphi_m(\alpha)$ are $K$-multiplicatively dependent or the points $(\varrho_1(\alpha),\cdot), \ldots,(\varrho_n(\alpha),\cdot)$ are $L$-linearly dependent on the reduction of $E$ modulo $p$. As one of our main tools, we prove a general statement about the intersection of an irreducible curve in the split semiabelian variety $\mathbb{G}_{\mathrm{m}}^m \times E^n$ with the algebraic subgroups of codimension at least $2$. As an application of our results, we improve a result of M. C. Chang and extend a result of J. F. Voloch about elements of large order in finite fields in some special cases.

math.NT

On the Lucas and Lehmer sequences in Dedekind domains

In this paper, we first obtain the strong divisibility property for the Lucas and Lehmer sequences in Dedekind domains, and then establish analogues of Zsigmondy's theorem and the primitive divisor results for such sequences in function fields.

math.NT

On the properties of Northcott and Narkiewicz for elliptic curves

In this paper, for an elliptic curve $E$ defined over the algebraic numbers and for any subfield $F$ of algebraic numbers, we say that $E$ has the Northcott property over $F$ if there are at most finitely many $F$-rational points on $E$ of uniformly bounded height, and we say that $E$ has the property (P) over $F$ if for any infinite subset $S$ of $F$-rational points on $E$, $f(S) = S$ for an $F$-endomorphism $f$ of $E$ implies that $f$ is an automorphism. We establish some criteria for both properties and provide typical examples. We also show that the Northcott property implies the property (P).

math.NT

M\"obius Randomness Law for Frobenius Traces

Recently E. Bombieri and N. M. Katz (2010) have demonstrated that several well-known results about the distribution of values of linear recurrence sequences lead to interesting statements for Frobenius traces of algebraic curves. Here we continue this line of study and establish the M\"obius randomness law quantitatively for the normalised form of Frobenius traces.

math.NT

A proof of Sondow's conjecture on the Smarandache function

The Smarandache function of a positive integer $n$, denoted by $S(n)$, is defined to be the smallest positive integer $j$ such that $n$ divides the factorial $j!$. In this note, we prove that for any fixed number $k > 1$, the inequality $n^k < S(n)!$ holds for almost all positive integers $n$. This confirms Sondow's conjecture which asserts that the inequality $n^2 < S(n)!$ holds for almost all positive integers $n$.

math.NT

On the equational graphs over finite fields

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in $\mathbb{F}_q$ as vertices and drawing an edge from $x$ to $y$ if and only if $E(x,y)=0$. We call this graph as equational graph. In this paper, we study the equational graphs when choosing $E(X,Y) = (Y^2 - f(X))(\lambda Y^2 - f(X))$ with $f(X)$ a polynomial over $\mathbb{F}_q$ and $\lambda$ a non-square element in $\mathbb{F}_q$. We show that if $f$ is a permutation polynomial over $\mathbb{F}_q$, then every connected component of the graph has a Hamiltonian cycle. Moreover, these Hamiltonian cycles can be used to construct balancing binary sequences. By making computations for permutation polynomials $f$ of low degree, it appears that almost all these graphs are strongly connected, and there are many Hamiltonian cycles in such a graph if it is connected.

math.CO