Generalized traveling-wave solutions of nonlinear reaction–diffusion equations with delay and variable coefficients

The paper presents a number of new exact solutions to nonlinear reaction–diffusion equations with delay of the form $c\left(x\right)u_t={\left[a\left(x\right)u_x\right]}_x+b\left(x\right)F(u,w),w=u(x,t-\tau ),$where $\tau >0$ is the delay time, and $F(u,w)$ is an arbitrary function of two arguments. Solutions are sought in the form of a generalized traveling-wave, $u=U\left(z\right)$ with $z=t+\theta \left(x\right)$. It is shown that one of the two functional coefficients $a\left(x\right)$ and $b\left(x\right)$ of the equation considered can be specified arbitrarily. Examples of delay reaction–diffusion equations and their solutions are given. New exact solutions of few other nonlinear delay PDEs are also obtained.     

Daisy cubes and distance cube polynomial

Let $X\subseteq {\{0,1\}}^n$. The daisy cube $Q_n\left(X\right)$ is introduced as the subgraph of $Q_n$ induced by the union of the intervals $I(x,0^n)$ over all $x\in X$. Daisy cubes are partial cubes that include Fibonacci cubes, Lucas cubes, and bipartite wheels. If $u$ is a vertex of a graph $G$, then the distance cube polynomial $D_{G,u}(x,y)$ is introduced as the bivariate polynomial that counts the number of induced subgraphs isomorphic to $Q_k$ at a given distance from the vertex $u$. It is proved that if $G$ is a daisy cube, then $D_{G,0^n}(x,y)=C_G(x+y-1)$, where $C_G\left(x\right)$ is the previously investigated cube polynomial of $G$. It is also proved that if $G$ is a daisy cube, then $D_{G,u}(x,-x)=1$ holds for every vertex $u$ in $G$.     

Fractional chromatic numbers of tensor products of three graphs

The tensor product $(G_1,G_2,G_3)$ of graphs $G_1$, $G_2$ and $G_3$ is defined by $V(G_1,G_2,G_3)=V\left(G_1\right)\times V\left(G_2\right)\times V\left(G_3\right)$and $E(G_1,G_2,G_3)=\left\{\left((u_1,u_2,u_3),(v_1,v_2,v_3)\right):\left|\{i:(u_i,v_i)\in E\left(G_i\right)\}\right|\ge 2\right\}.$Let ${\chi }_f\left(G\right)$ be the fractional chromatic number of a graph $G$. In this paper, we prove that if one of the three graphs $G_1$, $G_2$ and $G_3$ is a circular clique, ${\chi }_f(G_1,G_2,G_3)=min\{{\chi }_f\left(G_1\right){\chi }_f\left(G_2\right),{\chi }_f\left(G_1\right){\chi }_f\left(G_3\right),{\chi }_f\left(G_2\right){\chi }_f\left(G_3\right)\}.$     

Sharp non-asymptotic concentration inequalities for the approximation of the invariant distribution of a diffusion

Let ${\left(Y_t\right)}_{t\ge 0}$ be an ergodic diffusion with invariant distribution $\nu$. Consider the empirical measure ${\nu }_n≔{\left({\sum }_{k=1}^n{\gamma }_k\right)}^{-1}{\sum }_{k=1}^n{\gamma }_k{\delta }_{X_{k-1}}$ where ${\left(X_k\right)}_{k\ge 0}$ is an Euler scheme with decreasing steps ${\left({\gamma }_k\right)}_{k\ge 0}$ which approximates ${\left(Y_t\right)}_{t\ge 0}$. Given a test function $f$, we obtain sharp concentration inequalities for ${\nu }_n\left(f\right)-\nu \left(f\right)$ which improve the results in Honoré et al. (2019). Our hypotheses on the test function $f$ cover many real applications: either $f$ is supposed to be a coboundary of the infinitesimal generator of the diffusion, or $f$ is supposed to be Lipschitz.     

Relating broadcast independence and independence

An independent broadcast on a connected graph $G$ is a function $f:V\left(G\right)\to {\mathbb{N}}_0$ such that, for every vertex $x$ of $G$, the value $f\left(x\right)$ is at most the eccentricity of $x$ in $G$, and $f\left(x\right)>0$ implies that $f\left(y\right)=0$ for every vertex $y$ of $G$ within distance at most $f\left(x\right)$ from $x$. The broadcast independence number ${\alpha }_b\left(G\right)$ of $G$ is the largest weight $\sum _{x\in V\left(G\right)}f\left(x\right)$ of an independent broadcast $f$ on $G$. Clearly, ${\alpha }_b\left(G\right)$ is at least the independence number $\alpha \left(G\right)$ for every connected graph $G$. Our main result implies ${\alpha }_b\left(G\right)\le 4\alpha \left(G\right)$. We prove a tight inequality and characterize all extremal graphs.     

Limit theorems for a class of critical superprocesses with stable branching

We consider a critical superprocess $\{X;{\mathbf{P}}_{\mu }\}$ with general spatial motion and spatially dependent stable branching mechanism with lowest stable index ${\gamma }_0>1$. We first show that, under some conditions, ${\mathbf{P}}_{\mu }(\left|X_t\right|\ne 0)$ converges to 0 as $t\to \infty$ and is regularly varying with index ${({\gamma }_0-1)}^{-1}$. Then we show that, for a large class of non-negative testing functions $f$, the distribution of $\{X_t\left(f\right);{\mathbf{P}}_{\mu }\left(\cdot \right|6X_{t}6\ne 0)\}$, after appropriate rescaling, converges weakly to a positive random variable ${\mathbf{z}}^{({\gamma }_0-1)}$ with Laplace transform $E\left[e^{-u{\mathbf{z}}^{({\gamma }_0-1)}}\right]=1-{(1+u^{-({\gamma }_0-1)})}^{-1∕({\gamma }_0-1)}.$     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

Stability of attractors for the Kirchhoff wave equation with strong damping and critical nonlinearities

The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: $u_{tt}?(1+?{\Vert \mathrm{?}u\Vert }^2)\mathrm{\Delta }u?\mathrm{\Delta }{u}_t+h(u_t)+g(u)=f(x)$, with $?\in [0,1]$. The well-posedness and the existence of global and exponential attractors are established, and the stability of the attractors on the perturbation parameter ? is proved for the IBVP of the equation provided that both nonlinearities $h(s)$ and $g(s)$ are of critical growth.     

Irreducible polynomials from a cubic transformation

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field ${\mathbb{F}}_q$. We count the irreducible polynomials in ${\mathbb{F}}_q[x]$, of a given degree, that have the form $h{(x)}^{\mathrm{deg}f}\cdot f(R(x))$ for some $f(x)\in {\mathbb{F}}_q[x]$. As an example of application of our results, we recover the number of irreducible transformation shift registers of order three, which were computed by Jiang and Yang in 2017.