Uniform spectral asymptotics for semiclassical wells on phase space loops

We consider semiclassical self-adjoint operators whose symbol, defined on a two-dimensional symplectic manifold, reaches a non-degenerate minimum $b_0$ on a closed curve. We derive a classical and quantum normal form which gives uniform eigenvalue asymptotics in a window $(-\infty ,b_0+ϵ)$ for $ϵ>0$ independent on the semiclassical parameter. These asymptotics are obtained in two complementary settings: either an approximate invariance of the system under translation along the curve, which produces oscillating eigenvalues, or a Morse hypothesis reminiscent of Helffer–Sjöstrand’s “miniwell” situation.     

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

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.     

Projective well orders and coanalytic witnesses

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable P-points, definable tight MAD families and definable selective independent families. As a result, we obtain a model in which $\mathfrak{a}=\mathfrak{u}=\mathfrak{i}={\mathrm{?}}_1<2^{{\mathrm{?}}_0}={\mathrm{?}}_2$, each of $\mathfrak{a}$, $\mathfrak{u}$, $\mathfrak{i}$ has a ${\mathrm{\Pi }}_1^1$ witness and there is a ${\mathrm{\Delta }}_3^1$ well-order of the reals. Note that both the complexity of the witnesses of the above combinatorial cardinal characteristics, as well as the complexity of the well-order are optimal. In addition, we show that the existence of a ${\mathrm{\Delta }}_3^1$ well-order of the reals is consistent with $\mathfrak{c}={\mathrm{?}}_2$ and each of the following: $\mathfrak{a}=\mathfrak{u}<\mathfrak{i}$, $\mathfrak{a}=\mathfrak{i}<\mathfrak{u}$, $\mathfrak{a}<\mathfrak{u}=\mathfrak{i}$, where the smaller cardinal characteristics have co-analytic witnesses.Our methods allow the preservation of only sufficiently definable witnesses, which significantly differs from other preservation results of this type.     

Approximating the multiple-depot multiple-terminal Hamiltonian path problem

In this paper, we study a multiple-terminal extension of the classic Hamiltonian path problem where $m$ salesmen are initially located at different depots and finally stopped at different terminals. To the best of our knowledge, only 2-approximation algorithm is available in the literature. For arbitrary $m⩾2$, we first present a Christofides-like heuristic with a tight approximation ratio of $2-\frac{1}{2m+1}$. Besides, we also develop a $(\frac{5}{3}+ϵ)$-approximation algorithm by divide-and-conquer technique. The $(\frac{5}{3}+ϵ)$-approximation algorithm runs in polynomial time for fixed $m$ and $ϵ$.     

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.     

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

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

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.     

Boundary layers for a fluid–particle interaction system with density-dependent viscosity and cylindrical symmetry

In this paper, we study the initial boundary value problem for a cylindrical symmetry fluid–particle interaction system in three dimensions. The boundary layer phenomena is investigated when the shear viscosity $\mu =\kappa {\rho }^{\beta }$ goes to zero. Furthermore, we establish the boundary layer thickness of the order $O\left({\kappa }^{\alpha }\right)$ for more general initial data when $0<\alpha <\frac{1}{2}$ and give the optimal boundary-layer thickness for the system with more general initial data. As a byproduct, this work improves the corresponding results in Yao et al. (2011) for isentropic compressible Navier–Stokes equations where $0<\alpha <\frac{1}{4}$.     

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.     

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

Erdős matching conjecture for almost perfect matchings

In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)k?n<(s+1)(k+\frac{1}{100k})$.     

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