Tootfinder

New far-right party in this month's Dutch elections JA21 does well in the polls after endless talk show invitations.
Turns out they misled the government agency assessing the budget effects of party platforms. The party e.g. tells voters it will 'end aviation tax', but it told PBL they're going to keep it.
https://nos.n…

JA21 veranderde onvermeld verkiezingsbeloftes voor doorrekening
Zo heeft de partij een versnelde verhoging van de AOW-leeftijd laten doorrekenen bij het CPB. In 2060 zou de pensioenleeftijd 1,5 jaar hoger liggen. Dit staat echter niet in het partijprogramma.

Je verkiezingsbeloftes al verbreken voor de verkiezingen.
Knap, maar Eerdmans kan dat.
https://nos.nl/nieuwsuur/collectie/14005/artikel/2586491-ja21-veranderde-onvermeld-verkiezingsbeloftes-voor-doorrekening…

JA21 veranderde onvermeld verkiezingsbeloftes voor doorrekening
Zo heeft de partij een versnelde verhoging van de AOW-leeftijd laten doorrekenen bij het CPB. In 2060 zou de pensioenleeftijd 1,5 jaar hoger liggen. Dit staat echter niet in het partijprogramma.

"Surviving Mars": Paradox-Ausbaustrategie in neuer Version erschienen
Paradox hat ein Remaster seines Terraforming-Aufbaustrategiespiels "Surviving Mars" veröffentlicht. Weitere neue Inhalte sollen im kommenden Jahr erscheinen.

Bericht: Neue Apple-Produkte wie iPads schon in dieser Woche
Apple plant offenbar keine Oktober-Keynote, sondern ein schrittweises Release neuer Hardware. Das erinnert an die "Mac Week" aus dem vergangenen Jahr.

The maximum product of sizes of cross-\(t\)-intersecting families
Jingjun Bao, Lijun Ji
https://arxiv.org/abs/2510.11724 https://arxiv.org/pdf/2510.11724…

The maximum product of sizes of cross-\(t\)-intersecting families
Two families of sets \(\mathcal{A}\) and \(\mathcal{B}\) are called \emph{cross-\(t\)-intersecting} if \(|A \cap B| \geq t\) for all \(A \in \mathcal{A}\) and \(B \in \mathcal{B}\). Determining the maximum product of sizes for such cross-\(t\)-intersecting families is an active problem in extremal set theory. In this paper, we verify the following cross-\(t\)-intersecting version of the Erdős-Ko-Rado theorem: For \(k\geq l \geq t \geq 3\) and \(\min\{m,n\} \geq (t+1)(k-t+1)\), the ma…

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
Antonina Nepeivoda, Ilya Afanasyev
https://arxiv.org/abs/2510.11007 https://

Abstract String Domain Defined with Word Equations as a Reduced Product (Extended Version)
We introduce a string-interval abstract domain, where string intervals are characterized by systems of word equations (encoding lower bounds on string values) and word disequalities (encoding upper bounds). Building upon the lattice structure of string intervals, we define an abstract string object as a reduced product on a string property semilattice, determined by length-non-increasing morphisms. We consider several reduction strategies for abstract string objects and show that upon these str…

Riccati-ZORO: An efficient algorithm for heuristic online optimization of internal feedback laws in robust and stochastic model predictive control
Florian Messerer, Yunfan Gao, Jonathan Frey, Moritz Diehl
https://arxiv.org/abs/2511.10473 https://arxiv.org/pdf/2511.10473 https://arxiv.org/html/2511.10473
arXiv:2511.10473v1 Announce Type: new
Abstract: We present Riccati-ZORO, an algorithm for tube-based optimal control problems (OCP). Tube OCPs predict a tube of trajectories in order to capture predictive uncertainty. The tube induces a constraint tightening via additional backoff terms. This backoff can significantly affect the performance, and thus implicitly defines a cost of uncertainty. Optimizing the feedback law used to predict the tube can significantly reduce the backoffs, but its online computation is challenging.
Riccati-ZORO jointly optimizes the nominal trajectory and uncertainty tube based on a heuristic uncertainty cost design. The algorithm alternates between two subproblems: (i) a nominal OCP with fixed backoffs, (ii) an unconstrained tube OCP, which optimizes the feedback gains for a fixed nominal trajectory. For the tube optimization, we propose a cost function informed by the proximity of the nominal trajectory to constraints, prioritizing reduction of the corresponding backoffs. These ideas are developed in detail for ellipsoidal tubes under linear state feedback. In this case, the decomposition into the two subproblems yields a substantial reduction of the computational complexity with respect to the state dimension from $\mathcal{O}(n_x^6)$ to $\mathcal{O}(n_x^3)$, i.e., the complexity of a nominal OCP.
We investigate the algorithm in numerical experiments, and provide two open-source implementations: a prototyping version in CasADi and a high-performance implementation integrated into the acados OCP solver.
toXiv_bot_toot

Don't threaten me with a good time.
En o ja, Dilan ... GL-PvdA was toch de partij die zover van de rest afstond? Of zit het echte gat soms tussen CDA en VVD?