Waring-Hilbert problem on Cantor sets

Analogs of Waring–Hilbert problem on Cantor sets are explored. The focus of this paper is on the Cantor ternary set $C$. It is shown that, for each $m\ge 3$, every real number in the unit interval $[0,1]$ is the sum $x_1^m+x_2^m+?+x_n^m$ with each $x_j$ in $C$ and some $n\le 6^m$. Furthermore, every real number $x$ in the interval $[0,8]$ can be written as $x=x_1^3+x_2^3+?+x_8^3$, the sum of eight cubic powers with each $x_j$ in $C$. Another Cantor set $C\times C$ is also considered. More specifically, when $C\times C$ is embedded into the complex plane $?$, the Waring–Hilbert problem on $C\times C$ has a positive answer for powers less than or equal to 4.     

Permutation trinomials over Fq3

We consider four classes of polynomials over the fields ${\mathbb{F}}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+A{x}^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+A{x}^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+A{x}^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+A{x}^q-Bx$, where $A,B\in {\mathbb{F}}_q$. We find sufficient conditions on the pairs $(A,B)$ for which these polynomials permute ${\mathbb{F}}_{q^3}$ and we give lower bounds on the number of such pairs.     

Intersections between the norm-trace curve and some low degree curves

In this paper we analyze the intersection between the norm-trace curve over ${\mathbb{F}}_{q^3}$ and the curves of the form $y=a{x}^3+b{x}^2+cx+d$, giving a complete characterization of the intersection between the curve and the parabolas (a=0), as well as sharp bounds for the other cases. This information is used for the determination of the weight distribution of some one-point AG codes arising from the curve.     

Extension of Laguerre polynomials with negative arguments

We consider the irreducibility of polynomial $L_n^{\left(\alpha \right)}\left(x\right)$ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{\left(\alpha \right)}\left(x\right)$ vanishes if and only if $n\ge \left|\alpha \right|=?\alpha$. Therefore we assume that $\alpha =?n?s?1$ where $s$ is a non-negative integer. Let $g\left(x\right)={(?1)}^n{L}_n^{(?n?s?1)}\left(x\right)=\sum _{j=0}^n{a}_j\frac{x^j}{j!}$ and more general polynomial, let $G\left(x\right)=\sum _{j=0}^n{a}_j{b}_j\frac{x^j}{j!}$ where $b_j$ with $0\le j\le n$ are integers such that $\left|b_0\right|=\left|b_n\right|=1$. Schur was the first to prove the irreducibility of $g\left(x\right)$ for $s=0$. It has been proved that $g\left(x\right)$ is irreducible for $0\le s\le 60$. In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either $G\left(x\right)$ is irreducible or $G\left(x\right)$ is linear factor times irreducible polynomial. This is a consequence of the estimate $s>1.9k$ whenever $G\left(x\right)$ has a factor of degree $k\ge 2$ and $(n,k,s)\ne (10,5,4)$. This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey.     

Dynamical behavior of solutions of a reaction–diffusion model in river network

In this paper, we study the long-time behavior of solutions of a reaction–diffusion model in a one-dimensional river network, where the river network has two branches, and the water flow speeds in each branch are the same constant $\beta$. We show the existence of two critical values $c_0$ and 2 with $0<c_0<2$, and prove that when $-c_0\le \beta <2$, the population density in every branch of the river goes to 1 as time goes to infinity; when $-2<\beta <-c_0$, then, as time goes to infinity, the population density in every river branch converges to a positive steady state strictly below 1; when $\left|\beta \right|\ge 2$, the species will be washed down the stream, and so locally the population density converges to 0. Our result indicates that only if the water-flow speed is suitably small (i.e., $\left|\beta \right|<2$), the species will survive in the long run.     

Two solutions for a singular elliptic equation with critical growth at infinity

We look for positive solutions for the singular equation $-\Delta u-\frac{1}{2}\left(x\cdot \nabla u\right)=\mu h\left(x\right)u^{q-1}+\lambda u+u^{(N+2)/(N-2)},\text{in }{\mathbb{R}}^N,$ where $N\ge 3$, $\lambda >0$, $\mu >0$ is a parameter, $0<q<1$ and $h$ has some summability properties. By using a perturbation method and critical point theory, we obtain two solutions when $max\{1,N/4\}<\lambda <N/2$ and the parameter $\mu >0$ is small.     

Some new results on dimension and Bose distance for various classes of BCH codes

In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over ${\mathbb{F}}_q$ with designed distance $\delta =a{q}^{m-1}-1(\text{resp. }\delta =a\frac{q^m-1}{q-1})$ for all $1\le a\le q-1$, where q is a prime power and $m>1$ is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range $[a\frac{q^m-1}{q-1},a\frac{q^m-1}{q-1}+T]$ for $0\le a\le q-2$, where $T=q^{\frac{m+1}{2}}-1$ if m is odd, and $T=2q^{\frac{m}{2}}-1$ if m is even.     

Classification of some quadrinomials over finite fields of odd characteristic

In this paper, we completely determine all necessary and sufficient conditions such that the polynomial $f(x)=x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $a,b,c\in {\mathbb{F}}_q^{⁎}$, is a permutation quadrinomial of ${\mathbb{F}}_{q^2}$ over any finite field of odd characteristic. This quadrinomial has been studied first in [25] by Tu, Zeng and Helleseth, later in [24] Tu, Liu and Zeng revisited these quadrinomials and they proposed a more comprehensive characterization of the coefficients that results with new permutation quadrinomials, where $char({\mathbb{F}}_q)=2$ and finally, in [16], Li, Qu, Li and Chen proved that the sufficient condition given in [24] is also necessary and thus completed the solution in even characteristic case. In [6] Gupta studied the permutation properties of the polynomial $x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $char({\mathbb{F}}_q)=3,5$ and $a,b,c\in {\mathbb{F}}_q^{⁎}$ and proposed some new classes of permutation quadrinomials of ${\mathbb{F}}_{q^2}$.In particular, in this paper we classify all permutation polynomials of ${\mathbb{F}}_{q^2}$ of the form $f(x)=x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $a,b,c\in {\mathbb{F}}_q^{⁎}$, over all finite fields of odd characteristic and obtain several new classes of such permutation quadrinomials.     

On the Newton polygons of twisted L-functions of binomials

Let χ be an order c multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and T-adic Newton polygons of f. When $p>(d-e)(2d-1)$, we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on $p\mathrm{mod}cd$.We conjecture that this condition holds if p is large enough with respect to $c,d$ by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for $e=d-1$.     

Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r-1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r-1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D-C_1-\dots -C_{i-1}$ for $1\le i\le r$.     

Remarks on the distribution of colors in Gallai colorings

A Gallai coloring of a complete graph $K_n$ is an edge coloring without triangles colored with three different colors. A sequence $e_1\ge \cdots \ge e_k$ of positive integers is an $(n,k)$-sequence if ${\sum }_{i=1}^k{e}_i=\left(\genfrac{}{}{0ex}{}{n}{2}\right)$. An $(n,k)$-sequence is a G-sequence if there is a Gallai coloring of $K_n$ with $k$ colors such that there are $e_i$ edges of color $i$ for all $i,1\le i\le k$. Gyárfás, Pálvölgyi, Patkós and Wales proved that for any integer $k\ge 3$ there exists an integer $g\left(k\right)$ such that every $(n,k)$-sequence is a G-sequence if and only if $n\ge g\left(k\right)$. They showed that $g\left(3\right)=5,g\left(4\right)=8$ and $2k-2\le g\left(k\right)\le 8k^2+1$.We show that $g\left(5\right)=10$ and give almost matching lower and upper bounds for $g\left(k\right)$ by showing that with suitable constants $\alpha ,\beta >0$, $\frac{\alpha k^{1.5}}{lnk}\le g\left(k\right)\le \beta k^{1.5}$ for all sufficiently large $k$.