GENERIC CONFIGURATIONS IN 2D STRONGLY COMPETING SYSTEMS

We study a problem modelling segregation of an arbitrary number of competing species in planar domains. The solutions give rise to a well known free boundary problem with the domain partitioning itself into subdomains occupied by different species. Several subdomains can coexist in a neighborhood of any point. However, we show that generically (in the sense of Baire category) only triple junctions appear, meaning that at most three subdomains meet at their common free boundary. Our main tools are the use of the formalism of harmonic maps into singular spaces and the introduction of a complex structure via the Hopf differential.