Convention audit and connected linear-multiplicity obstructions
Statement
Second Eigenvalue Multiplicity
Let be a graph with maximum degree bounded by . For the following choices of Hermitian matrix associated with , what is the maximum multiplicity of the second largest eigenvalue of ? For the following choices of Hermitian matrix associated with , what is the maximum multiplicity of the second largest eigenvalue of ? \begin{enumerate} \item The adjacency matrix: in this case a sublinear upper bound was proved by \cite{JTYZZ21}, with an improvement in the case of regular graphs provided by \cite{MRS21} and also for the normalized adjacency matrix of general bounded degree graphs. Constructions of graphs establishing lower bounds were given by \cite{HSZZ21}. \item The Laplacian matrix. \item Schr"{o}dinger operators: any matrix of the form where is the adjacency matrix and is an arbitrary diagonal matrix. \item Weighted adjacency matrices: any Hermitian matrix such that if . \end{enumerate}
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.