arXiv preprints from January 1, 2026 through July 21, 2026 — 15:22:01 EST
Long documents pose many challenges to current intelligent writing systems. These include maintaining consistency across sections, sustaining efficient planning and writing as documents become more complex, and effectively providing and integrating AI assistance to the user. Existing AI co-writing tools offer either inline suggestions...
We analyze the problem of a free 1D Klein-Fock-Gordon-Majorana (KFGM) particle in an interval. By free, we mean that there is no potential within the interval and that its walls are penetrable; hence, the pertinent energy current density does not vanish at the walls. Certainly, quantization in an interval is not trivial because...
Monotonicity of pairs of operators is an extension of monotonicity of operators, which plays an important role in solving non-monotone inclusions. One of challenging problems in this new tool is how to design the associated mappings to obtain the monotone pairs. In this paper, we solve this problem and propose a Generalized Inertial...
Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question is whether it contains arbitrarily long arithmetic progressions. In this paper we study the...
We propose KaoLRM to re-target the learned prior of the Large Reconstruction Model (LRM) for parametric 3D face reconstruction from single-view images. Parametric 3D Morphable Models (3DMMs) have been widely used for facial reconstruction due to their compact and interpretable parameterization, yet existing 3DMM regressors often...
REST APIs, based on the REpresentational State Transfer (REST) architecture, are the primary type of Web API. The OpenAPI Specification (OAS) serves as the de facto standard for describing REST APIs and is crucial for multiple software engineering tasks. Automated OAS generation can help developers identify and correct issues in...
We introduce a novel spatial discretization technique for the reliable and efficient simulation of magnetization dynamics governed by the Landau-Lifshitz (LL) equation. The overall discretization error is systematically decomposed into temporal and spatial components. The spatial error analysis is conducted by formulating the LL...
We investigate the Keller--Segel--(Navier--)Stokes system posed in a smooth bounded domain \(Ω\subset \mathbb{R}^N\) with \(N = 2,3\): \begin{equation*} \begin{cases} n_t + u \cdot \nabla n = Δn - \nabla \cdot \big( n S(n)\nabla c \big), \\[2mm] u \cdot \nabla c = Δc - c + n, \\[2mm] u_t + κ(u \cdot \nabla) u = Δu - \nabla P + n...
In this paper, we consider the following logarithmic Schrödinger equation \[ -Δu + V(x)u = u \log u^{2},\quad x\in\mathbb{R}^{N}. \] Assuming that \(V\in C(\mathbb{R}^{N},\mathbb R)\), \(V\) is bounded away from zero, and \(V(x)\to+\infty\) as \(|x|\to\infty\), we develop a new perturbative variational approach to overcome the...
Predicting problem-difficulty in large language models (LLMs) refers to estimating how difficult a task is according to the model itself, typically by training linear probes on its internal representations. In this work, we study the multilingual geometry of problem-difficulty in LLMs by training linear probes using the AMC subset of...
The exploration-exploitation (EE) trade-off is a central challenge in reinforcement learning (RL) for large language models (LLMs). With Group Relative Policy Optimization (GRPO), training tends to be exploitation driven: entropy decreases monotonically, samples convergence, and exploration fades. Most existing fixes are...
One of the central challenges in visual place recognition (VPR) is learning a robust global representation that remains discriminative under large viewpoint changes, illumination variations, and severe domain shifts. While visual foundation models (VFMs) provide strong local features, most existing methods rely on a single model,...
We report the discovery of multiple compact molecular features exhibiting extremely broad velocity widths toward the W44 molecular cloud. ALMA CO $J$=3--2 data reveal eight ``Petit--Bullets'' surrounding the previously known ``Bullet.'' Each Petit--Bullet shows a distinct V-shaped structure in position--velocity space, reminiscent of...
The article focuses on the differences in mathematics performance between girls and boys visible from the first four months of compulsory schooling in the French education system. The influence of gender stereotypes in the evaluation practices of teachers and the threat of the gender stereotype on student performance are questioned....
Highly oscillatory differential equations, commonly encountered in multi-scale problems, are often too complex to solve analytically. However, several numerical methods have been developed to approximate their solutions. Although these methods have shown their efficiency, the first part of the strategy often involves heavy...
Long contexts challenge transformers: attention scores dilute across thousands of tokens, critical information is often lost in the middle, and models struggle to adapt to novel patterns at inference time. Recent work on test-time adaptation addresses this by maintaining a form of working memory -- transient parameters updated on the...
We solve the two-electron problem on a square lattice with d-wave altermagnetism, considering both on-site and nearest-neighbor attractive interactions. The altermagnetic spin-splitting in the single-particle dispersion naturally gives rise to a ground state of two-electron bound pairs with nonzero center-of-mass momentum. The...
Retrieval-Augmented Generation enhances Large Language Models by integrating external knowledge, which reduces hallucinations but increases prompt length. This increase leads to higher computational costs and longer Time to First Token (TTFT). To mitigate this issue, existing solutions aim to reuse the preprocessed KV cache of each...
Temporal Graph Clustering (TGC) is a new task with little attention, focusing on node clustering in temporal graphs. Compared with existing static graph clustering, it can find the balance between time requirement and space requirement (Time-Space Balance) through the interaction sequence-based batch-processing pattern. However, there...
This document provides an assessment of the overall structure of the BNEUF system and how it operates within the framework of the Initiative for Digital Development in French speaking Universities (IDNEUF). This report aims to support the AUF's new strategy for 2021-2025, with its new structural and governance foundations for the...
Diffusion-based planners have emerged as a promising approach for human-like trajectory generation in autonomous driving. Recent works incorporate reinforcement fine-tuning to enhance the robustness of diffusion planners through reward-oriented optimization in a generation-evaluation loop. However, they struggle to generate...
The continuous-review (s,S) inventory model is a cornerstone of stochastic inventory theory, yet its analysis becomes analytically intractable when dealing with non-Markovian systems. In such systems, evaluating long-run performance measures typically relies on costly simulation. This paper proposes a supervised learning framework...
Motivated by the recent progress in the moiré superlattice systems and spin-1/2 triangular lattice antiferromagnets, we revisit the triangular-lattice spin liquids and study their magnetic responses. While the magnetic responses on the ordered phases can be mundane, the orbital magnetic flux and the Zeeman coupling have synergetic...
A bi-Cayley graph over a cyclic group $\mathbb{Z}_n$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=R^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T=T^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a...
We study bi-Lipschitz right-equivalence of holomorphic function germs $f:(\mathbb{C}^2,0)\to(\mathbb{C},0)$ via polar arcs and gradient canyons. For a polar arc $γ$ we consider the Newton polygon of $f_x(X+γ(Y),Y)$ and define its augmentation by adjoining the point $(0,\operatorname{ord} f(γ(y),y)-1)$. We prove that the resulting...