2000 character limit reached
On Pleijel's nodal domain theorem
Published 20 Aug 2013 in math.SP | (1308.4422v1)
Abstract: A slight improvement of Pleijel's estimate on the number of nodal domains is obtained, exploiting a refinement of the Faber-Krahn inequality and packing density of discs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.