flâneur

Xuecen Summer Wang

0 followers · 3 following · 243 views

on the atlas — 5

highlights — 2

  • we give a polynomial-time algorithm to find a minimum-length closed walk (representing a threading of string) that induces a connected graph of string at every junction. The algorithm is based on a surprising reduction to minimum-weight perfect matching. Along the way, we give tight worst-case bounds on the length of the optimal threading and on the maximum number of times this threading can visit a single edge. We also give more efficient solutions to two special cases: cubic graphs and the case when each edge can be visited at most twice.
    [2309.10122] Graph Threading
  • The fern grew quickly by fixing its own nitrogen through a symbiotic relationship with cyanobacteria, enabling the plant to convert carbon dioxide into sugars and double its biomass every 2.5 days. As the plants died and sank to the ocean floor, they sequestered massive amounts of carbon. Over approximately 8,000 years, this “Azolla Event” helped reduce atmospheric carbon dioxide to 400 parts per million.
    SBU Researchers Test Ancient Fern as Carbon Offset Solution