In mathematical Set Theory, a collection of distinct sets is called a Sunflower (a.k.a. a Δ-system) if the intersection of any pair of sets equals the common intersection of all the sets.
In the 1960s, mathematicians Erdős and Rado (and others) investigated the minimum number of sets of size r needed to guarantee the existence of a sunflower of a given size. - but could not formulate an answer.
The problem remains open, despite the fact that Sunflowers are fundamental objects in external set theory, and have relations and applications to many other areas of mathematics and theoretical computer science.
A 2021 paper published in arXiv, noted :
Despite a lot of recent attention including a polymath project and some amazing breakthroughs, even the asymptotic answer remains unknown.“
Source : arXiv:2110.11319 (math)
Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.