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.     

Bounds for moments of cubic and quartic Dirichlet L-functions

We study the $2k$-th moment of central values of the family of primitive cubic and quartic Dirichlet $L$-functions. We establish sharp lower bounds for all real $k\ge 1/2$ unconditionally for the cubic case and under the Lindelöf hypothesis for the quartic case. We also establish sharp lower bounds for all real $0\le k<1/2$ and sharp upper bounds for all real $k\ge 0$ for both the cubic and quartic cases under the generalized Riemann hypothesis (GRH). As an application of our results, we establish quantitative non-vanishing results for the corresponding $L$-values.     

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.     

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.     

On circular–linear one-factorizations of the complete graph

In Korchmáros et al. (2018)one-factorizations of the complete graph $K_n$ are constructed for $n=q+1$ with any odd prime power $q$ such that either $q\equiv 1(mod4)$ or $q=2^h?1$. The arithmetic restriction $n=q+1$ is due to the fact that the vertices of $K_n$ in the construction are the points of a conic $\Omega$ in the finite plane of order $q$. Here we work on the Euclidean plane and describe an analogous construction where the role of $\Omega$ is taken by a regular $n$-gon. This allows us to remove the above constraints and construct one-factorizations of $K_n$ for every even $n\ge 6$.     

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G\left(1\right),\dots ,G\left(k\right)$. It is called an $r$-factorization if every $G\left(i\right)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1\le i\le k$, $G\left(i\right)$ is a subgraph of $H\left(i\right)$.Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\lambda K_n$ to be enclosed in some 2-edge-connected $r$-factorization of $\mu K_m$ for some range of values for the parameters $n$, $m$, $\lambda$, $\mu$, $r$: $r=2$, $\mu >\lambda$ and either $m\ge 2n?1$, or $m=2n?2$ and $\mu =2$ and $\lambda =1$, or $n=3$ and $m=4$. We generalize their result to every $r\ge 2$ and $m\ge 2n?2$. We also give some sufficient conditions for enclosing a given decomposition of $\lambda K_n$ in some 2-edge-connected $r$-factorization of $\mu K_m$ for every $r\ge 3$ and $m>(2?C)n$, where $C$ is a constant that depends only on $r$, $\lambda$ and $\mu$.     

Large blocking sets in PG(2,q2)

Minimal blocking sets in $\mathrm{PG}(2,q^2)$ have size at most $q^3+1$. This result is due to Bruen and Thas and the bound is sharp, sets attaining this bound are called unitals. In this paper, we show that the second largest minimal blocking sets have size at most $q^3+1-(p-3)/2$, if $q=p$, $p\ge 67$, or $q=p^h$, $p>7$, $h>1$. Our proof also works for sets having at least one tangent at each of its points (that is, for tangency sets).     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Construction of symplectic graphs by using 2-dimensional symplectic non-isotropic subspaces over finite fields

In most extant studies, symplectic graphs are defined by 1-dimensional subspaces and their orthogonality. In this paper, the symplectic graph is defined by 2-dimensional non-isotropic subspaces and their intersection. The symplectic graph is shown to be a 4-Deza graph. While the first subconstituent is shown to be a 4-Deza graph when $\nu ⩾3$ and a 3-Deza graph when $\nu =2$, the second subconstituent is not regular, and the third subconstituent is a 4-Deza graph except in the case $\nu =2$, when it is empty.     

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.