Tootfinder

Clarence Thomas to decide if #Trump has immunity for the coup attempt his own wife planned - Boing Boing
https://boingboing.net/2024/02/29/clarence-thom…

Clarence Thomas to decide if Trump has immunity for the coup attempt his own wife planned
Investigate the controversy surrounding Justice Clarence Thomas's role in deciding Donald Trump's immunity in light of the January 6th events planned by his wife.

Please protect these YIGBY heroes, #ArlingtonVA https://www.washingtonblade.com/2024/03/28/clarendon-presbyterian-church-seek…

🔊 #NowPlaying on fip
Chlorine Free:
🎵 Peacock
#ChlorineFree
https://open.spotify.com/track/4mH77mALaDfO0Qc4pdxB3a
https://chlorinefree.bandcamp.com/track/peacock

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

Coloring Groups
We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der-Flaass). We present some general results connecting the structure of a coloring group to the structure of its graph coloring, providing graph-theoretic characterizations of the centralizer and primitivity of a coloring group. We apply these resu…

Very Low Clearance - Limbo to Enter.
Sign on Jefferson Highway, Old Jefferson, Louisiana.
Per other nearby signs, presumably 11 FT 6 IN (3.5 meters) was intended, rather than 1 FT 6 IN (45 cm).
#Louisiana #signs

#Frieren claramente se passa num mundo do tipo #ForgottenRealms do #DungeonsAndDragons, com a maioria dos personagens podendo claramente ser identificados com vocações deste …

$(\Delta 1)$ Vertex Coloring in $O(n)$ Communication
Maxime Flin, Parth Mittal
https://arxiv.org/abs/2404.19081 https://arxiv.org/pdf/2404.19081
arXiv:2404.19081v1 Announce Type: new
Abstract: We study the communication complexity of $(\Delta 1)$ vertex coloring, where the edges of an $n$-vertex graph of maximum degree $\Delta$ are partitioned between two players. We provide a randomized protocol which uses $O(n)$ bits of communication and ends with both players knowing the coloring. Combining this with a folklore $\Omega(n)$ lower bound, this settles the randomized communication complexity of $(\Delta 1)$-coloring up to constant factors.

I figured that today might be a good day for a ruling on immunity and voting and all that stuff, but all I found was the fact that Clarence has a deal happening.
https://www.theonion.com/clarence-thomas-announces-50-discount-on-all-favora…

Clarence Thomas Announces 50% Discount On All Favorable Rulings
WASHINGTON—Telling Americans that they must act now to avoid losing out on the chance of a lifetime, Supreme Court Justice Clarence Thomas announced at a press conference Monday a 50% discount on all favorable rulings. “Today and today only, I’m offering half off on tilting any jurisprudence in your favor—all…

A logarithmic approximation of linearly-ordered colourings
Tamio-Vesa Nakajima, Stanislav \v{Z}ivn\'y
https://arxiv.org/abs/2404.19556 https://<…

A logarithmic approximation of linearly-ordered colourings
A linearly ordered (LO) $k$-colouring of a hypergraph assigns to each vertex a colour from the set $\{0,1,\ldots,k-1\}$ in such a way that each hyperedge has a unique maximum element. Barto, Batistelli, and Berg conjectured that it is NP-hard to find an LO $k$-colouring of an LO 2-colourable 3-uniform hypergraph for any constant $k\geq 2$ [STACS'21] but even the case $k=3$ is still open. Nakajima and Živný gave polynomial-time algorithms for finding, given an LO 2-colourable 3-uniform hypergr…

Private graph colouring with limited defectiveness
Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe
https://arxiv.org/abs/2404.18692 https://arxiv.org/pdf/2404.18692
arXiv:2404.18692v1 Announce Type: new
Abstract: Differential privacy is the gold standard in the problem of privacy preserving data analysis, which is crucial in a wide range of disciplines. Vertex colouring is one of the most fundamental questions about a graph. In this paper, we study the vertex colouring problem in the differentially private setting.
To be edge-differentially private, a colouring algorithm needs to be defective: a colouring is d-defective if a vertex can share a colour with at most d of its neighbours. Without defectiveness, the only differentially private colouring algorithm needs to assign n different colours to the n different vertices. We show the following lower bound for the defectiveness: a differentially private c-edge colouring algorithm of a graph of maximum degree {\Delta} > 0 has defectiveness at least d = {\Omega} (log n / (log c log {\Delta})).
We also present an {\epsilon}-differentially private algorithm to {\Theta} ( {\Delta} / log n 1 / {\epsilon})-colour a graph with defectiveness at most {\Theta}(log n).