The min-max eigenvalue conjecture for the p-Laplacian
Statement
Let , and let denote the -Laplacian of the oriented hypergraph under consideration. An eigenvalue is called a min-max eigenvalue if it is expressible in the min-max Rayleigh quotient form introduced above. Min-max eigenvalue conjecture. For , all eigenvalues of are min-max eigenvalues. The claim is known for the eigenvalues constructed by the stated min-max procedure, but it remains open whether these comprise all eigenvalues of the -Laplacian; the analogous question is also open for graphs, domains, and manifolds.
Record
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.