Tootfinder

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…

Mean and quantile regression in the copula setting: properties, sharp bounds and a note on estimation
Henrik Kaiser, Wolfgang Trutschnig
https://arxiv.org/abs/2510.03804 https:/…

Mean and quantile regression in the copula setting: properties, sharp bounds and a note on estimation
Driven by the interest on how uniformity of marginal distributions propa\-gates to properties of regression functions, in this contribution we tackle the following questions: Given a $(d-1)$-dimensional random vector $\textbf{X}$ and a random variable $Y$ such that all univariate marginals of $(\textbf{X},Y)$ are uniformly distributed on $[0,1]$, how large can the average absolute deviation of the mean and the quantile regression function of $Y$ given $\textbf{X}$ from the value $\frac{1}{2}$ b…

A note on new type degenerate Srirling numbers of the first kind
Taekyun Kim, Dae san Kim, Kyo-Shin Hwang, Dmitry V. Dolgy
https://arxiv.org/abs/2509.03415 https://

A note on new type degenerate Srirling numbers of the first kind
We introduce a new sequence of unsigned degenerate Stirling numbers of the first kind. Following the work of Adell-Lekuona, who represented unsigned Stirling numbers of the first kind as multiples of the expectations of specific random variables, we express our new numbers as finite sums of multiples of the expectations of certain random variables. We also provide a representation of these new numbers as finite sums involving the classical unsigned Stirling numbers of the first kind. As an inve…

Cooperative Sensing Enhanced UAV Path-Following and Obstacle Avoidance with Variable Formation
Changheng Wang, Zhiqing Wei, Wangjun Jiang, Haoyue Jiang, Zhiyong Feng
https://arxiv.org/abs/2508.21316

Cooperative Sensing Enhanced UAV Path-Following and Obstacle Avoidance with Variable Formation
The high mobility of unmanned aerial vehicles (UAVs) enables them to be used in various civilian fields, such as rescue and cargo transport. Path-following is a crucial way to perform these tasks while sensing and collision avoidance are essential for safe flight. In this paper, we investigate how to efficiently and accurately achieve path-following, obstacle sensing and avoidance subtasks, as well as their conflict-free fusion scheduling. Firstly, a high precision deep reinforcement learning (…

@… ...we moeten het zeker als afschrikwekkend voorbeeld gebruiken, verder moeten we ons natuurlijk primair richten op Europa, tegelijk zal het afglijden van de VS naar een fascistische staat ook flink invloed op europa hebben of we dat nu willen of niet (is al gaande)

Constructions of Efficiently Implementable Boolean Functions with Provable Nonlinearity/Resiliency/Algebraic Immunity Trade-Offs
Palash Sarkar
https://arxiv.org/abs/2510.01720 h…

Constructions of Efficiently Implementable Boolean Functions with Provable Nonlinearity/Resiliency/Algebraic Immunity Trade-Offs
We describe several families of efficiently implementable Boolean functions achieving provable trade-offs between resiliency, nonlinearity, and algebraic immunity. In concrete terms, the following result holds for each of the function families that we propose. Given integers $m_0\geq 0$, $x_0\geq 1$, and $a_0\geq 1$, it is possible to construct an $n$-variable function which has resiliency at least $m_0$, linear bias (which is an equivalent method of expressing nonlinearity) at most $2^{-x_0}$ …

Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live
Hanchen Li, Qiuyang Mang, Runyuan He, Qizheng Zhang, Huanzhi Mao, Xiaokun Chen, Alvin Cheung, Joseph Gonzalez, Ion Stoica
https://arxiv.org/abs/2511.02230 https://arxiv.org/pdf/2511.02230 https://arxiv.org/html/2511.02230
arXiv:2511.02230v1 Announce Type: new
Abstract: Agentic LLM applications interleave LLM generation requests with tool calls. These tool calls break the continuity of the workflow by creating pauses between LLM requests, bringing many challenges for the serving system, especially under multi-turn scenarios. Each pause potentially causes KV cache eviction and extra waiting time before entering the continuous batch for the following LLM request. Since these pauses happen for each call, this problem becomes increasingly severe as turn number grow for agentic programs. Previous works either fail to incorporate information from the tool call, evicting KV cache that leads to repetitive prefill or loading, or ignore the continuity of a multi-turn program, creating waiting time between turns that increases per-request latency.
We present Continuum, a serving system to optimize job completion time for multi-turn agent workloads by combining tool-aware KV cache timeout with program-level scheduling. By predicting tool call durations in agentic workflows, Continuum selectively pins the KV cache in GPU memory with a time-to-live value based on total turn number. When combined with program-level first-come-first-serve, Continuum prevents scheduling bubbles, preserves multi-turn continuity, and optimizes for throughput for complex agentic workflows. By modeling the variability of tool call and agent program continuity, Continuum outperforms state-of-the-art baselines. Our evaluation on real-world agentic workloads (SWE-Bench and BFCL) with Llama-3.1 8B/70B models shows that Continuum significantly improves the average job completion times, and remains performant across different hardware setups and DRAM offloading schemes. Preview code is available at: https://github.com/Hanchenli/vllm-continuum
toXiv_bot_toot

Optimal Control of ODE Car-Following Models: Applications to Mixed-Autonomy Platoon Control via Coupled Autonomous Vehicles
Arwa Alanqary, Alexandre M. Bayen, Xiaoqian Gong, Anish Gollakota, Alexander Keimer, Ashish Pandian
https://arxiv.org/abs/2508.19417

Optimal Control of ODE Car-Following Models: Applications to Mixed-Autonomy Platoon Control via Coupled Autonomous Vehicles
In this paper, we study the optimal control of a mixed-autonomy platoon driving on a single lane to smooth traffic flow. The platoon consists of autonomous vehicles, whose acceleration is controlled, and human-driven vehicles, whose behavior is described using a microscopic car-following model. We formulate the optimal control problem where the dynamics of the platoon are describing through a system of non-linear ODEs, with explicit constraints on both the state and the control variables. Theor…

Binomial edge ideals of Cameron-Walker graphs
Takayuki Hibi, Sara Saeedi Madani
https://arxiv.org/abs/2509.01150 https://arxiv.org/pdf/2509.01150

Binomial edge ideals of Cameron-Walker graphs
Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is Cohen--Macaulay; (ii) $J_G$ is unmixed; (iii) $\dim (S/J_G) = n+1$; (iv) (a) $n = 3$ and $G$ is a path of length $2$ or (b) $n = 5$ and $G$ is a path of length $4$ or (c) $n=5$ and $G$ is obtained by attaching a path of length $2$ to a triangle. Moreover, the depth …

Random burning of the Euclidean lattice
Guillaume Blanc, Alice Contat
https://arxiv.org/abs/2509.02562 https://arxiv.org/pdf/2509.02562

Random burning of the Euclidean lattice
The burning number of a graph is the minimal number of steps that are needed to burn all of its vertices, with the following burning procedure: at each step, one can choose a point to set on fire, and the fire propagates constantly at unit speed along the edges of the graph. In this paper, we consider two natural random burning procedures in the discrete Euclidean torus $\mathbb{T}_n^d$, in which the points that we set on fire at each step are random variables. Our main result deals with the ca…