Tootfinder

Reflexive Partitions Induced by Rank Support and Non-Reflexive Partitions Induced by Rank Weight
Yang Xu, Haibin Kan, Guangyue Han
https://arxiv.org/abs/2509.11681 https://

Reflexive Partitions Induced by Rank Support and Non-Reflexive Partitions Induced by Rank Weight
In this paper, we study partitions of finite modules induced by rank support and rank weight. First, we show that partitions induced by rank support are mutually dual with respect to suitable non-degenerate pairings, and hence are reflexive; moreover, we compute the associated generalized Krawtchouk matrices. Similar results are established for partitions induced by isomorphic relation of rank support. These results generalize counterpart results established for row space partitions and rank pa…

Arithmetic properties of generalized Frobenius partitions
Scott Ahlgren, Cruz Castillo
https://arxiv.org/abs/2509.12078 https://arxiv.org/pdf/2509.12078

Arithmetic properties of generalized Frobenius partitions
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius partition functions $cϕ_m$; these are natural higher-level analogues of the partition function which have attracted a great deal of attention in the ensuing decades. For each $m\in \{5, 7, 11\}$ there are two analogues of Ramanujan's congruences for $cϕ_m$, and fo…

Predator-Prey Model: Driven Hunt for Accelerated Grokking
I. A. Lopatin, S. V. Kozyrev, A. N. Pechen
https://arxiv.org/abs/2509.10562 https://arxiv.org/pdf…

Predator-Prey Model: Driven Hunt for Accelerated Grokking
A machine learning method is proposed using two agents that simulate the biological behavior of a predator and a prey. In this method, the predator and the prey interact with each other - the predator chases the prey while the prey runs away from the predator - to perform an optimization on the landscape. This method allows, for the case of a ravine landscape (i.e., a landscape with narrow ravines and with gentle slopes along the ravines) to avoid getting optimization stuck in the ravine. For t…

»`Uint8Array.prototype.toHex()`
The toHex() method of Uint8Array instances returns a hex-encoded string based on the data in this Uint8Array object.«
I've only just discovered this and I think it's a cool new feature in JavaScript. I am now surprised when almost all users have up-to-date web browsers in order to use it easily in the frontend WebDev.
🧑‍💻

Uint8Array.prototype.toHex() - JavaScript | MDN
The toHex() method of Uint8Array instances returns a hex-encoded string based on the data in this Uint8Array object.

ProtoSiTex: Learning Semi-Interpretable Prototypes for Multi-label Text Classification
Utsav Kumar Nareti, Suraj Kumar, Soumya Pandey, Soumi Chattopadhyay, Chandranath Adak
https://arxiv.org/abs/2510.12534

ProtoSiTex: Learning Semi-Interpretable Prototypes for Multi-label Text Classification
The surge in user-generated reviews has amplified the need for interpretable models that can provide fine-grained insights. Existing prototype-based models offer intuitive explanations but typically operate at coarse granularity (sentence or document level) and fail to address the multi-label nature of real-world text classification. We propose ProtoSiTex, a semi-interpretable framework designed for fine-grained multi-label text classification. ProtoSiTex employs a dual-phase alternating traini…

Weil das sicher einige hier interessiert: der mit sehr großer Mehrheit angenommene Beschluss der Grünen BW zu Palantir.
https://parteitage.gruene-bw.de/ldk-ludwigsburg/fur-europaische-unabhangigkeit-und-digitale-souv…

@… Sure it is. Just set up a dual boot. Don't know about LUKS, but if you have two (or more) partitions you should be able to partition each of them. I've got two Linux distros on one of my laptops.

Partitioning techniques for non-centralized predictive control: A systematic review and novel theoretical insights
Alessandro Riccardi, Luca Laurenti, Bart De Schutter
https://arxiv.org/abs/2509.11470 …

Partitioning techniques for non-centralized predictive control: A systematic review and novel theoretical insights
The partitioning problem is of central relevance for designing and implementing non-centralized Model Predictive Control (MPC) strategies for large-scale systems. These control approaches include decentralized MPC, distributed MPC, hierarchical MPC, and coalitional MPC. Partitioning a system for the application of non-centralized MPC consists of finding the best definition of the subsystems, and their allocation into groups for the definition of local controllers, to maximize the relevant perfo…

An Alignment-Free Explanation for Collective Predator Evasion in Moving Animal Groups
Daniel Str\"ombom, Catherine Futterman
https://arxiv.org/abs/2509.11083 https://

An Alignment-Free Explanation for Collective Predator Evasion in Moving Animal Groups
Moving animal groups consist of many distinct individuals but can operate and function as one unit when performing different tasks. Effectively evading unexpected predator attacks is one primary task for many moving groups. The current explanation for predator evasion responses in moving animal groups require the individuals in the groups interact via (velocity) alignment. However, experiments have shown that some animals do not use alignment. This suggests that another explanation for the pred…

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
Surya Teja Gavva, Peng Zhang
https://arxiv.org/abs/2509.11382 https://

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
The Marcus-Spielman-Srivastava theorem (Annals of Mathematics, 2015) for the Kadison-Singer conjecture implies the following result in spectral graph theory: For any undirected graph $G = (V,E)$ with a maximum edge effective resistance at most $α$, there exists a partition of its edge set $E$ into $E_1 \cup E_2$ such that the two edge-induced subgraphs of $G$ spectrally approximates $(1/2)G$ with a relative error $O(\sqrtα)$. However, the proof of this theorem is non-constructive. It remains …