Support Mastodon: https://www.patreon.com/mastodon
Today we're sending the first black person & the first woman to the moon.
But I know that Dr. Mae Jemison was the first black woman to travel into space when she served as a mission specialist aboard the Space Shuttle Endeavour in 1992.
https://en.wikipedia.org/wiki/Mae_Jemison
Also, Jemison became the first real-life astronaut to appear on #StarTrek
Here's Jemison as Lt. Palmer in #StarTrekTNG episode Second Chances talking to Nichelle Nichols, Star Trek's Lt. Uhura, outside the set.
#Artemis #Artemis2

We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT). Technically speaking, we show the following significant generalization of the 4CT: every planar triangulation contains linearly many pairwise non-touching reducible configurations or pairwise non-crossing obstructing cycles of length at most 5 (which all allow for making effective 4-coloring reductions). The known proofs of the 4CT only show the existence of a single reducible configuration or obstructing cycle in the above statement. The existence is proved using the discharging method based on combinatorial curvature. It identifies reducible configurations in parts where the local neighborhood has positive combinatorial curvature. Our result significantly strengthens the known proofs of 4CT, showing that we can also find reductions in large ``flat" parts where the curvature is zero, and moreover, we can make reductions almost anywhere in a given planar graph. An interesting aspect of this is that such large flat parts are also found in large triangulations of any fixed surface. From a computational perspective, the old proofs allowed us to apply induction on a problem that is smaller by some additive constant. The inductive step took linear time, resulting in a quadratic total time. With our linear number of reducible configurations or obstructing cycles, we can reduce the problem size by a constant factor. Our inductive step takes $O(n\log n)$ time, yielding a 4-coloring in $O(n\log n)$ total time. In order to efficiently handle a linear number of reducible configurations, we need them to have certain robustness that could also be useful in other applications. All our reducible configurations are what is known as D-reducible.
PSA:
1. If you are not silly, it is vital you become silly
2. If you are silly, you must stay silly
2. If you used to be silly but have stopped, you must make all efforts to return to silliness
Happy Trans Day of Visibility! 🏳️⚧️ The mere act of existing and being visible shouldn’t be as fraught as it is today. Let’s keep fighting to set things right.
https://en.wikipedia.org/wiki/International_Transgender_Day_of_Visibility

Happy Trans Day of Visibility 🏳️⚧️
https://en.wikipedia.org/wiki/International_Transgender_Day_of_Visibility
Let's all come together as a community and help @siracusa through this difficult time.
https://9to5mac.com/2026/03/26/apple-discontinues-the-mac-pro/