EUVIMEDEUVIMED entdecken
Crossref

On the number of nodal domains of homogeneous caloric polynomials

Matthew Badger, Cole Jeznach

Annales Henri Lebesgue · 06.05.2026 · 9 · 261-298

DOI: 10.5802/ahl.266 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Annales Henri Lebesgue, online erschienen am 06.05.2026. Verfasst von Matthew Badger und 1 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We investigate the minimum and maximum number of nodal domains across all time-dependent homogeneous caloric polynomials of degree d in ℝ n × ℝ (space × time), i.e., polynomial solutions of the heat equation satisfying ∂ t p ¬ ≡ 0 and p λ x , λ 2 t = λ d p ( x , t ) for all x ∈ ℝ n , t ∈ ℝ , and λ > 0 . When n = 1 , it is classically known that the number of nodal domains is precisely 2 ⌈ d / 2 ⌉ . When n = 2 , we prove that the minimum number of nodal domains is 2 if d ¬ ≡ 0 ( mod 4 ) and is 3 if d ≡ 0 ( mod 4 ) . When n ≥ 3 , we prove that the minimum number of nodal domains is 2 for all d . Finally, we show that the maximum number of nodal domains is Θ ( d n ) as d → ∞ and lies between ⌊ d n ⌋ n and n + d n for all n and d . As an application and motivation for counting nodal domains, we confirm existence of the singular strata in Mourgoglou and Puliatti’s two-phase free boundary regularity theorem for caloric measure.

Zitieren

APA

Badger, M., & Jeznach, C. (2026). On the number of nodal domains of homogeneous caloric polynomials. Annales Henri Lebesgue, 9, 261-298. https://doi.org/10.5802/ahl.266

Vancouver

Badger M, Jeznach C. On the number of nodal domains of homogeneous caloric polynomials. Annales Henri Lebesgue. 2026;9:261-298. doi:10.5802/ahl.266

BibTeX
@article{Badger2026,
  author = {Badger, Matthew and Jeznach, Cole},
  title = {On the number of nodal domains of homogeneous caloric polynomials},
  journal = {Annales Henri Lebesgue},
  year = {2026},
  volume = {9},
  pages = {261--298},
  doi = {10.5802/ahl.266}
}
Kostenlos starten →