Jiyou Li

activity

20072022

most citedA note on the Borwein conjecture

5 citations · 18 across the 19 of their papers we have counts for

collaborators

Showing math.NTShow all

8 papers · 1 filter

math.NT2021★ 1 cited

Newton Polygons of L-functions Associated to Deligne Polynomials

Jiyou Li

A conjecture of Le says that the Deligne polytope $Δ_{d}$ is generically ordinary if $p \equiv 1 (mod D (Δ_{d}))$ , where $D (Δ_{d})$ is a combinatorial constant determined by $Δ_{d}$ .…

math.NT2020

On sums of coefficients of Borwein type polynomials over arithmetic progressions

Jiyou Li, Xiang Yu

We obtain asymptotic formulas for sums over arithmetic progressions of coefficients of polynomials of the form $j = 1 \prod n k = 1 \prod p - 1 (1 - q^{p j - k})^{s},$ where $p$ is an odd…

math.NT2019★ 2 cited

Distinct coordinate solutions of linear equations over finite fields

Jiyou Li, Xiang Yu

Let $F_{q}$ be the finite field of $q$ elements and $a_{1}, a_{2}, \dots, a_{k}, b \in F_{q}$ . We investigate $N_{F_{q}} (a_{1}, a_{2}, \dots, a_{k}; b)$ , the number of order…

math.NT2018

Distance Distribution to Received Words in Reed-Solomon Codes

Jiyou Li, Daqing Wan

Let $F_{q}$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f (x) \in F_{q} [x]$ of degree $k+…

math.NT2017

On the construction of small subsets containing special elements in a finite field

Jiyou Li

In this note we construct a series of small subsets containing a non-d-th power element in a finite field by applying certain bounds on incomplete character sums. Precisely, let $h…

math.NT2015★ 1 cited

Counting polynomial subset sums

Jiyou Li, Daqing Wan

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f (x) \in R [x]$ be a polynomial of positive degree $d$ . For integer $0 \leq k \leq ∣ D ∣$ , we study the number $…

math.NT2012★ 1 cited

On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields

Jiyou Li

We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let $N_{m}^{*} (k, b)$ be the number of $k$ -subsets $S \subseteq F_{p}^{*}$ such that $\sum_{x \in S} x^{m} = b$ . If $m<p…

math.NT2007

On the subset sum problem over finite fields

Jiyou Li, Daqing Wan

The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the n…