Tootfinder

Im using case_when() quite a lot, case_match() is new to me: #rstats

A general vectorised switch() — case_match
This function allows you to vectorise multiple switch() statements. Each case is evaluated sequentially and the first match for each element determines the corresponding value in the output vector. If no cases match, the .default is used. case_match() is an R equivalent of the SQL "simple" CASE WHEN statement. Connection to case_when() While case_when() uses logical expressions on the left-hand side of the formula, case_match() uses values to match against .x with. The following two statement…

MPC strategies for density profile control with pellet fueling in nuclear fusion tokamaks under uncertainty
Christopher A. Orrico, Hari Prasad Varadarajan, Matthijs van Berkel, Lennard Ceelen, Thomas O. S. J. Bosman, W. P. M. H. Heemels, Dinesh Krishnamoorthy
https://arxiv.org/abs/2510.04784

MPC strategies for density profile control with pellet fueling in nuclear fusion tokamaks under uncertainty
Control of the density profile based on pellet fueling for the ITER nuclear fusion tokamak involves a multi-rate nonlinear system with safety-critical constraints, input delays, and discrete actuators with parametric uncertainty. To address this challenging problem, we propose a multi-stage MPC (msMPC) approach to handle uncertainty in the presence of mixed-integer inputs. While the scenario tree of msMPC accounts for uncertainty, it also adds complexity to an already computationally intensive …

Obstructions for normally spanned sets of vertices
Nicola Lorenz, Max Pitz
https://arxiv.org/abs/2510.04367 https://arxiv.org/pdf/2510.04367

Obstructions for normally spanned sets of vertices
Halin conjectured that a graph has a normal spanning tree if and only if every minor of it has countable colouring number. This has recently been proven by the second author. In this paper, we strengthen this result by establishing the following local version of it: Given a prescribed set of vertices $U$ in a connected graph $G$, there is a normal tree in $G$ that includes $U$ if and only if every $U$-rooted minor of $G$ (i.e. a minor every branch set of which meets $U$) has countable colouri…

A Computational Framework for Interpretable Text-Based Personality Assessment from Social Media
Matej Gjurkovi\'c
https://arxiv.org/abs/2510.02811 https://

A Computational Framework for Interpretable Text-Based Personality Assessment from Social Media
Personality refers to individual differences in behavior, thinking, and feeling. With the growing availability of digital footprints, especially from social media, automated methods for personality assessment have become increasingly important. Natural language processing (NLP) enables the analysis of unstructured text data to identify personality indicators. However, two main challenges remain central to this thesis: the scarcity of large, personality-labeled datasets and the disconnect betwee…

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Film School:
🎵 11:11
#FilmSchool
https://filmschoolmusic.bandcamp.com/album/11-11
https://open.spotify.com/track/5uIGgu1uNou08EVpJcK9Jq

A Time-certified Predictor-corrector IPM Algorithm for Box-QP
Liang Wu, Yunhong Che, Richard D. Braatz, Jan Drgona
https://arxiv.org/abs/2510.04467 https://

A Time-certified Predictor-corrector IPM Algorithm for Box-QP
Minimizing both the worst-case and average execution times of optimization algorithms is equally critical in real-time optimization-based control applications such as model predictive control (MPC). Most MPC solvers have to trade off between certified worst-case and practical average execution times. For example, our previous work [1] proposed a full-Newton path-following interior-point method (IPM) with data-independent, simple-calculated, and exact $O(\sqrt{n})$ iteration complexity, but not …

Existence of ghost-eliminating constraints in multivielbein theory
J. Flinckman, S. F. Hassan
https://arxiv.org/abs/2510.03014 https://arxiv.org/pdf/2510.0…

Existence of ghost-eliminating constraints in multivielbein theory
We perform a Hamiltonian constraint analysis of the multivielbein theory proposed in arXiv:1804.09723. The analysis shows that the secondary constraints have the correct form to constrain the dynamical variables, thereby eliminating the problematic ghost modes that generally plague theories of interacting spin-2 fields. Under mild restrictions on the solution space, we also identify the tertiary constraints and show that these eliminate the canonical momenta associated with the ghost modes. Our…

The minimum degree of minimal 2-extendable claw-free graphs
Jing Guo, Fuliang Lu, Heping Zhang
https://arxiv.org/abs/2510.03554 https://arxiv.org/pdf/2510.…

The minimum degree of minimal 2-extendable claw-free graphs
A connected graph $G$ with a perfect matching is said to be $k$-extendable for integers $k$, $1 \leq k\leq \frac{|V(G)|}{2}-1$, if any matching in $G$ of size $k$ is contained in a perfect matching of $G$. A $k$-extendable graph is minimal if the deletion of any edge results in a graph that is not $k$-extendable. In 1994, Plummer proved that every $k$-extendable claw-free graph has minimum degree at least $2k$. Recently, He et al. showed that every minimal 1-extendable graph has minim…

Results on long twins in random words and permutations
Elliott Liu, Linus Tang, Jessica Wan
https://arxiv.org/abs/2510.04335 https://arxiv.org/pdf/2510.043…

Results on long twins in random words and permutations
We study long $r$-twins in random words and permutations. Motivated by questions posed in works of Dudek-Grytczuk-Ruciński, we obtain the following. For a uniform word in $[k]^n$ we prove sharp one-sided tail bounds showing that the maximum $r$-power length (the longest contiguous block that can be partitioned into $r$ identical subblocks) is concentrated around $\frac{\log n}{(r-1)\log k}$. For random permutations, we prove that for fixed $k$ and $r\to\infty$, a uniform permutation of $[rk]$ …

Closing paths to cycles in symmetric graphs
Martin Milani\v{c}, {\DJ}or{\dj}e Mitrovi\'c
https://arxiv.org/abs/2510.05404 https://arxiv.org/pdf/2510.05…

Closing paths to cycles in symmetric graphs
It was shown by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2022 that every induced $2$-edge path in a vertex-transitive graph closes to an induced cycle. Similar results were obtained for 3-edge paths closing to cycles in edge-transitive graphs, where the cycle can be assumed to be induced if the path is induced. Motivated by these results, we consider the following problem: For a given class of graphs, determine all integers $\ell\geq 0$ such that for every graph in the class, e…