Tootfinder

Jury nullification has never had a better shot than this absolutely absurd felony charge
https://www.axios.com/2025/08/14/trump-dc-federal-agent-sandwich-assault-charge

D.C. man accused of throwing sandwich at federal agent faces felony charges
The incident is alleged to have occurred after President Trump ordered an increased federal law enforcement presence in the city.

Projective Delineability for Single Cell Construction
Jasper Nalbach, Lucas Michel, Erika \'Abrah\'am, Christopher W. Brown, James H. Davenport, Matthew England, Pierre Mathonet, Na\"im Z\'ena\"idi
https://arxiv.org/abs/2508.00512

Projective Delineability for Single Cell Construction
The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra, despite its doubly exponential complexity. Recent exploration-guided algorithms like NLSAT, NuCAD, and CAlC rely on CAD technology but reduce the computational effort heuristically. Single cell construction is a paradigm that is used in each of these algorithms. The central property on which the CAD algorithm is bas…

RLZ-r and LZ-End-r: Enhancing Move-r
Patrick Dinklage, Johannes Fischer, Lukas Nalbach, Jan Zumbrink
https://arxiv.org/abs/2507.17300 https://arxiv.org/pdf…

RLZ-r and LZ-End-r: Enhancing Move-r
In pattern matching on strings, a locate query asks for an enumeration of all the occurrences of a given pattern in a given text. The r-index [Gagie et al., 2018] is a recently presented compressed self index that stores the text and auxiliary information in compressed space. With some modifications, locate queries can be answered in optimal time [Nishimoto & Tabei, 2021], which has recently been proven relevant in practice in the form of Move-r [Bertram et al., 2024]. However, there remains th…

A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Jasper Nalbach, Erika \'Abrah\'am
https://arxiv.org/abs/2508.00505 https://

A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations try to avoid some of the computations. The first such adaptation named NLSAT was followed by Non-uniform CAD (NuCAD) and the Cylindrical Algebraic Covering (CAlC). Both NLSAT and CAlC have been developed and implemented in SMT solvers for satisfiability checkin…