Traveling Wave Solutions of a Reaction-Diffusion Equation with State-Dependent Delay

This paper is concerned with the traveling wave solutions of a reaction-diffusion equation with state-dependent delay. When the birth function is monotone, the existence and nonexistence of monotone traveling wave solutions are established. When the birth function is not monotone, the minimal wave speed of nontrivial traveling wave solutions is obtained. The results are proved by the construction of upper and lower solutions and application of the fixed point theorem

Direct Measurement of Piezoelectric Response around Ferroelectric Domain Walls in Crystals with Engineered Domain Configuration

We report the first investigation of the piezoelectric response on a nanoscale in the poled ferroelectric crystals with engineered configuration of domains. Piezoresponse force microscopy of tetragonal 0.63PMN-0.37PT relaxor-based ferroelectric crystals reviled that the d33 piezoelectric coefficient is significantly reduced within the distance of about 1 um from the uncharged engineered domain wall. This finding is essential for understanding the mechanisms of the giant piezoresponse in relaxor-based crystals and for designing new piezoelectric materials

On the α\alpha-spectral radius of hypergraphs

For real $\alpha\in [0,1)$ and a hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest eigenvalue of the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ is the adjacency matrix of $G$, which is a symmetric matrix with zero diagonal such that for distinct vertices $u,v$ of $G$, the $(u,v)$-entry of $A(G)$ is exactly the number of edges containing both $u$ and $v$, and $D(G)$ is the diagonal matrix of row sums of $A(G)$. We study the $\alpha$-spectral radius of a hypergraph that is uniform or not necessarily uniform. We propose some local grafting operations that increase or decrease the $\alpha$-spectral radius of a hypergraph. We determine the unique hypergraphs with maximum $\alpha$-spectral radius among $k$-uniform hypertrees, among $k$-uniform unicyclic hypergraphs, and among $k$-uniform hypergraphs with fixed number of pendant edges. We also determine the unique hypertrees with maximum $\alpha$-spectral radius among hypertrees with given number of vertices and edges, the unique hypertrees with the first three largest (two smallest, respectively) $\alpha$-spectral radii among hypertrees with given number of vertices, the unique hypertrees with minimum $\alpha$-spectral radius among the hypertrees that are not $2$-uniform, the unique hypergraphs with the first two largest (smallest, respectively) $\alpha$-spectral radii among unicyclic hypergraphs with given number of vertices, and the unique hypergraphs with maximum $\alpha$-spectral radius among hypergraphs with fixed number of pendant edges