The min-max eigenvalue conjecture for the -Laplacian
The min-max eigenvalue conjecture for the -Laplacian
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.
Sources & referencesView supporting material
Primary source
Jürgen Jost, Raffaella Mulas and Dong Zhang, “p-Laplace Operators for Oriented Hypergraphs”, arXiv:2007.00325 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.