3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices

Let $g(k,t)$ be the minimum integer such that every plane graph with girth g at least $g(k,t)$, minimum degree $\delta =2$ and no $(k+1)$-paths consisting of vertices of degree 2, where $k\ge 1$, has a 3-vertex with at least t neighbors of degree 2, where $1\le t\le 3$.In 2015, Jendrol' and Maceková proved $g(1,1)\le 7$. Later on, Hudák et al. established $g(1,3)=10$, Jendrol', Maceková, Montassier, and Soták proved $g(1,1)\ge 7$, $g(1,2)=8$ and $g(2,2)\ge 11$, and we recently proved that $g(2,2)=11$ and $g(2,3)=14$.Thus $g(k,t)$ is already known for $k=1$ and all t. In this paper, we prove that $g(k,1)=3k+4$, $g(k,2)=3k+5$, and $g(k,3)=3k+8$ whenever $k\ge 2$.     

Large induced subgraphs with three repeated degrees

For any positive integer k, let $C(k)$ denote the least integer such that any n-vertex graph has an induced subgraph with at least $n?C(k)$ vertices, in which at least $\min ?\{k,n?C(k)\}$ vertices are of the same degree. Caro, Shapira and Yuster initially studied this parameter and showed that $\mathrm{\Omega }(k\log ?k)\le C(k)\le {(8k)}^k$. For the first nontrivial case, the authors proved that $3\le C(3)\le 6$, and the exact value was left as an open problem. In this paper, we first show that $3\le C(3)\le 4$, improving the former result as well as a recent result of Kogan. For special families of graphs, we prove that $C(3)=3$ for $K_5$-free graphs, and $C(3)=1$ for large $C_{2s+1}$-free graphs. In addition, extending a result of Erd?s, Fajtlowicz and Staton, we assert that every $K_r$-free graph is an induced subgraph of a $K_r$-free graph in which no degree occurs more than three times.     

Gradient estimates for Stokes systems with Dini mean oscillation coefficients

We study the stationary Stokes system in divergence form. The coefficients are assumed to be merely measurable in one direction and have Dini mean oscillations in the other directions. We prove that if $(u,p)$ is a weak solution of the system, then $(Du,p)$ is bounded and its certain linear combinations are continuous. We also prove a weak type-$(1,1)$ estimate for $(Du,p)$ under a stronger assumption on the $L^1$-mean oscillation of the coefficients. The corresponding results up to the boundary on a half ball are also established. These results are new even for elliptic equations and systems.     

Long-time solutions of scalar nonlinear hyperbolic reaction equations incorporating relaxation I. The reaction function is a bistable cubic polynomial

We consider an initial-value problem based on a class of scalar nonlinear hyperbolic reaction–diffusion equations of the general form

$u_{\tau \tau }+u_{\tau }=u_{xx}+\epsilon (F(u)+F{(u)}_{\tau }),$

in which x and τ represent dimensionless distance and time respectively and $\epsilon >0$ is a parameter related to the relaxation time. Furthermore the reaction function, $F(u)$, is given by the bistable cubic polynomial,

$F(u)=u(1?u)(u?\mu ),$

in which $0<\mu <1/2$ is a parameter. The initial data is given by a simple step function with $u(x,0)=1$ for $x\le 0$ and $u(x,0)=0$ for $x>0$. It is established, via the method of matched asymptotic expansions, that the large-time structure of the solution to the initial-value problem involves the evolution of a propagating wave front which is either of reaction–diffusion or of reaction–relaxation type. The one exception to this occurs when $\mu =\frac{1}{2}$ in which case the large time attractor for the solution of the initial-value problem is a stationary state solution of kink type centred at the origin.     

Classification of homogeneous holomorphic two-spheres in complex Grassmann manifolds

In this paper we completely classify the linearly full homogeneous holomorphic two-spheres in the complex Grassmann manifolds $G(2,N)$ and $G(3,N)$. We also obtain the Gauss equation for the holomorphic immersions from a Riemann surface into $G(k,N)$. By using which, we give explicit expressions of the Gaussian curvature and the square of the length of the second fundamental form of these homogeneous holomorphic two-spheres in $G(2,N)$ and $G(3,N)$.     

Finite computable dimension and degrees of categoricity

We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below ${\mathbf{0}}^{″}$, and not above ${\mathbf{0}}^{\prime }$. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form $[{\mathbf{0}}^{(\alpha )},{\mathbf{0}}^{(\alpha +1)}]$ for any computable ordinal α. We then extend the technique to produce a rigid structure of computable dimension 3 such that if ${\mathbf{d}}_0$, ${\mathbf{d}}_1$, and ${\mathbf{d}}_2$ are the degrees of isomorphisms between distinct representatives of the three computable equivalence classes, then each ${\mathbf{d}}_i<{\mathbf{d}}_0\oplus {\mathbf{d}}_1\oplus {\mathbf{d}}_2$. The resulting structure is an example of a structure that has a degree of categoricity, but not strongly.     

The space of lines in cyclic covers of projective space

Take positive integers m, n and d. Let Y be an m-fold cyclic cover of ${\mathbb{P}}^n$ ramified over a general hypersurface $X\subset P^n$ of degree md. In this paper we study the space $F(Y)$ of lines in Y and show that it is smooth of dimension $2(n-1)-d(m-1)$ if $md>2n-3$ and $2(n-1)-d(m-1)\ge 0$. When $2(n-1)=d(m-1)$, our result gives a formula on the number of m-contact order lines of X (see Definition 1.2).     

Subgroup regular sets in Cayley graphs

Let Γ be a graph with vertex set V, and let a and b be nonnegative integers. A subset C of V is called an $(a,b)$-regular set in Γ if every vertex in C has exactly a neighbors in C and every vertex in $V?C$ has exactly b neighbors in C. In particular, $(0,1)$-regular sets and $(1,1)$-regular sets in Γ are called perfect codes and total perfect codes in Γ, respectively. A subset C of a group G is said to be an $(a,b)$-regular set of G if there exists a Cayley graph of G which admits C as an $(a,b)$-regular set. In this paper we prove that, for any generalized dihedral group G or any group G of order 4p or pq for some primes p and q, if a nontrivial subgroup H of G is a $(0,1)$-regular set of G, then it must also be an $(a,b)$-regular set of G for any $0?a?|H|?1$ and $0?b?|H|$ such that a is even when $|H|$ is odd. A similar result involving $(1,1)$-regular sets of such groups is also obtained in the paper.     

Approximation of norms on Banach spaces

Relatively recently it was proved that if Γ is an arbitrary set, then any equivalent norm on $c_0(\mathrm{\Gamma })$ can be approximated uniformly on bounded sets by polyhedral norms and $C^{\infty }$ smooth norms, with arbitrary precision. We extend this result to more classes of spaces having uncountable symmetric bases, such as preduals of the ‘discrete’ Lorentz spaces $d(w,1,\mathrm{\Gamma })$, and certain symmetric Nakano spaces and Orlicz spaces. We also show that, given an arbitrary ordinal number α, there exists a scattered compact space K having Cantor–Bendixson height at least α, such that every equivalent norm on $C(K)$ can be approximated as above.