Tootfinder

How to Favicon in 2025: Three files that fit most needs
It’s time to rethink how we cook a set of favicons for modern browsers and stop the icon generator madness. Frontend developers currently have to deal with 20 static PNG files just to display a tiny website logo in a browser tab or on a touchscreen. Read on to see how to take a smarter approach and adopt a minimal set of icons that fits most modern needs.
🖌️

How to Favicon in 2025: Three files that fit most needs—Martian Chronicles, Evil Martians’ team blog
Prefer SVG over PNG, trust browsers to downscale, drop obscure formats—the ultimate, exhaustive guide to favicons for modern web. Includes steps for static HTML and Webpack.

All-sky search for individual Primordial Black Hole bursts with LHAASO
Cao, Aharonian, Bai, Bao, Bastieri, Bi, Bi, Bian, Bukevich, Cai, Cao, Cao, Chang, Chang, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Cheng, Cheng, Chu, Cui, Cui, Cui, Cui, Dai, Dai, Dai, , Diao, Dong, Duan, Fan, Fan, Fang, Fang, Fang, Feng, Feng, Feng, Feng, Feng, Feng, Feng, Gabici, Gao, Gao, Gao, Gao, Gao, Ge, Ge, Geng, Giacinti, Gong, Gou, Gu, Guo, Guo, Guo, Guo…

All-sky search for individual Primordial Black Hole bursts with LHAASO
Primordial Black Holes~(PBHs) are hypothetical black holes with a wide range of masses that formed in the early universe. As a result, they may play an important cosmological role and provide a unique probe of the early universe. A PBH with an initial mass of approximately $10^{15}$~g is expected to explode today in a final burst of Hawking radiation. In this work, we conduct an all-sky search for individual PBH burst events using the data collected from March 2021 to July 2024 by the Water Che…

This https://arxiv.org/abs/2302.11862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension, etc.). Extending their research, we completely characterize the functionality of random graph $G(n,p)$ for all possible $p$. We provide matching (up to a constant factor) lower and upper bound for a large range of $p$. It follows from our bounds for $G(n,p)$…