12 problems
Let be a bounded domain in , and let denote the infimum of the maximal first Dirichlet eigenvalue over all -partitions of …
Loose-versus-non-exhaustive partition conjecture. The infimum over non-exhaustive rigid -partitions satisfies
Let be a metric graph and let . A rigid -partition is a partition of of the type considered in the paper, and is called interna…
Let be a finite, compact, connected metric graph. An exhaustive rigid -partition of is a partition w…
Let be a domain, let be a positive integer, let be the optimal -norm energy of a -partition, and let denote th…
Let be a disk, a square, or an equilateral triangle, let be the number of cells, and let denote the optimal -norm energy of a -partit…
Let be a sequence of Laplace eigenfunctions, and let denote the number of nodal domains of . Let be the square of area , with first eigen…
Hexagonal conjecture for Pleijel.
Let be a bounded planar domain of area , let denote the minimal energy of a -partition of , and let be the regular h…
Minimal-energy equality conjecture. The three inequalities in Proposition 1 are equalities.
Let be the sphere and consider the problem of minimizing the sum of the first Dirichlet eigenvalues over partitions of into three parts. A Y-partition is the part…
Hexagonal boundary-length conjecture. The normalized boundary length satisfies