Tootfinder

Statistics of maximal independent sets in grid-like graphs
Levi Axelrod, Nathan Bickel, Anastasia Halfpap, Luke Hawranick, Alex Parker, Cole Swain
https://arxiv.org/abs/2506.22317

Statistics of maximal independent sets in grid-like graphs
An independent set $I$ in a graph $G$ is maximal if $I$ is not properly contained in any other independent set of $G$. The study of maximal independent sets (MIS's) in various graphs is well-established, often focusing upon enumeration of the set of MIS's. For an arbitrary graph $G$, it is typically quite difficult to understand the number and structure of MIS's in $G$; however, when $G$ has regular structure, the problem may be more tractable. One class of graphs for which enumeration of MIS's…

Someone's gonna commit First Degree Glitter with Intent to Sparkle.
#USpol #ice #glitter

🇺🇦 #NowPlaying on KEXP's #DriveTime
The Horrors:
🎵 Sleepwalk
#TheHorrors
https://open.spotify.com/track/0V4L0O6hlU05IOfievCTmt

🇺🇦 #NowPlaying on BBCRadio3's #ThroughTheNight
Ludwig van Beethoven & Amar Quartett:
🎵 String Quartet no 2 in G, Op 18 no 2
#LudwigvanBeethoven #AmarQuartett
https://open.spotify.com/track/3hLOEf9pI7uFVOy7Neo5dv

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Eartheater:
🎵 Nova
#Eartheater
#newRelease 🆕 single
https://eartheater.bandcamp.com/track/nova
https://open.spotify.com/track/3hLfifIpMTrw1VKqfcBhGa