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).     

On coloring numbers of graph powers

The weak $r$-coloring numbers ${\mathrm{wcol}}_r\left(G\right)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $\mathrm{col}\left(G\right)$, and have since found interesting theoretical and algorithmic applications. This has motivated researchers to establish strong bounds on these parameters for various classes of graphs.Let $G^p$ denote the $p$th power of $G$. We show that, all integers $p>0$ and $\Delta \ge 3$ and graphs $G$ with $\Delta \left(G\right)\le \Delta$ satisfy $\mathrm{col}\left(G^p\right)\in O\left(p\cdot {\mathrm{wcol}}_{\lceil p∕2\rceil }\left(G\right){(\Delta -1)}^{\lfloor p∕2\rfloor }\right)$; for fixed tree width or fixed genus the ratio between this upper bound and worst case lower bounds is polynomial in $p$. For the square of graphs $G$, we also show that, if the maximum average degree $2k-2<\mathrm{mad}\left(G\right)\le 2k$, then $\mathrm{col}\left(G^2\right)\le (2k-1)\Delta \left(G\right)+2k+1$.     

Stabilization in three-dimensional chemotaxis-growth model with indirect attractant production

This paper deals with the chemotaxis-growth system: $u_t=\mathrm{\Delta }u?\mathrm{?}?(u\mathrm{?}v)+\mu u(1?u)$, $v_t=\mathrm{\Delta }v?v+w$, $\tau w_t+\delta w=u$ in a smooth bounded domain $\mathrm{\Omega }?{\mathbb{R}}^3$ with zero-flux boundary conditions, where μ, δ, and τ are given positive parameters. It is shown that the solution $(u,v,w)$ exponentially stabilizes to the constant stationary solution $(1,\frac{1}{\delta },\frac{1}{\delta })$ in the norm of $L^{\infty }(\mathrm{\Omega })$ as $t\to \infty$ provided that $\mu >0$ and any given nonnegative and suitably smooth initial data $(u_0,v_0,w_0)$ fulfills $u_0?0$, which extends the condition $\mu >\frac{1}{8{\delta }^2}$ in [8].     

The discriminant problem for Artin-Schreier extensions: Explicit results

Given a global function field K of characteristic p, for all effective divisors $\mathfrak{D}$ in the divisor group of K we count the number of cyclic extensions $F\supset K$ of degree p where the relative discriminant ${\mathrm{\text{Disc}}}_K(F)=(p-1)\mathfrak{D}$.     

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.     

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$.     

R+ˆ is surprisingly an integral domain

It is shown that if $(R,\mathfrak{m},k)$ is a complete local domain with $\mathrm{char}k=p>0$ and $R^{+}$ is its integral closure in an algebraic closure of the quotient field, then both the $\mathfrak{m}$-adic and p-adic completions of $R^{+}$ are integral domains. More generally, this theorem remains true if the completeness assumption is relaxed to allow R to be an analytically irreducible Henselian local ring. It is also shown that these rings, which are Cohen-Macaulay R-modules (even balanced in the $\mathfrak{m}$-adic case), will have dimension larger than the dimension of R unless $\dim ?R\le 1$.