Full cross-diffusion limit in the stationary Shigesada-Kawasaki-Teramoto model

This paper studies the asymptotic behavior of coexistence steady-states of the Shigesada-Kawasaki-Teramoto model as both cross-diffusion coefficients tend to infinity at the same rate. In the case when either one of two cross-diffusion coefficients tends to infinity, Lou and Ni [18] derived a couple of limiting systems, which characterize the asymptotic behavior of coexistence steady-states. Recently, a formal observation by Kan-on [10] implied the existence of a limiting system including the nonstationary problem as both cross-diffusion coefficients tend to infinity at the same rate. This paper gives a rigorous proof of his observation as far as the stationary problem. As a key ingredient of the proof, we establish a uniform $L^{\infty }$ estimate for all steady-states. Thanks to this a priori estimate, we show that the asymptotic profile of coexistence steady-states can be characterized by a solution of the limiting system.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.