arXiv preprints from January 1, 2026 through July 21, 2026 — 05:52:44 EST
Large Language Models (LLMs) often hallucinate, generating nonsensical or false information that can be especially harmful in sensitive fields such as medicine or law. To study this phenomenon systematically, we introduce FalseCite, a curated dataset designed to capture and benchmark hallucinated responses induced by misleading or...
In this paper, we introduce the notion of the second Bohr radius for vector valued pluriharmonic functions on complete Reinhardt domains in $\mathbb{C}^n$. This investigation is motivated by the work of Lev Aizenberg [Proc. Amer. Math. Soc. 128 (2000), 1147-1155], where the corresponding problem was studied for complex valued...
As Large Language Models (LLMs) become ubiquitous across various scientific domains, their lack of ability to perform complex tasks like running simulations or to make complex decisions limits their utility. LLM-based agents bridge this gap due to their ability to call external resources and tools and thus are now rapidly gaining...
We study the problem of constructing explicit codes whose rate and distance match the Gilbert-Varshamov bound in the low-rate, high-distance regime. In 2017, Ta-Shma gave an explicit family of codes where every pair of codewords has relative distance $\frac{1-\varepsilon}{2}$, with rate $Ω(\varepsilon^{2+o(1)})$, matching the...
Let $s$ be a fixed hyperelliptic involution of the closed, oriented genus $g$ surface $Σ_g$. The hyperelliptic Torelli group $\mathcal{SI}_g$ is the subgroup of the mapping class group $\mathrm{Mod}(Σ_g)$ consisting of elements that act trivially on $\mathrm{H}_1(Σ_g;\mathbb{Z})$ and commute with $s$. It is generated by Dehn twists...
Policy gradient methods are known to be highly sensitive to the choice of policy parameterization. In particular, the widely used softmax parameterization can induce ill-conditioned optimization landscapes and lead to exponentially slow convergence. Although this can be mitigated by preconditioning, this solution is often...
The design-make-test-analyze cycle in early-stage drug discovery remains constrained primarily by the "make" step: small-molecule synthesis is slow, costly, and difficult to scale or automate across diverse chemotypes. Enumerated chemical spaces aim to reduce this bottleneck by predefining synthesizable regions of chemical space from...
The purpose of this paper is to study the number of limit cycles of canard type in linear regularizations of piecewise linear systems with non-monotonic transition functions. Using the notion of slow divergence integral and elementary breaking mechanisms, we construct systems with an arbitrary finite number of hyperbolic limit cycles....
We say that $d_3(n)$ has exponent of distribution $θ$ if, for every $\varepsilon>0$, the expected asymptotic holds uniformly for all moduli $q \le x^{θ-\varepsilon}$. Nguyen proved, following earlier work of Banks, Heath-Brown, and Shparlinski, that after averaging over reduced residue classes $a \bmod q$, the function $d_3(n)$ has...
Parameter-efficient fine-tuning (PEFT) is a scalable approach for adapting large speech foundation models to new domains. While methods such as LoRA and its state-of-the-art variants reduce adaptation costs, they typically allocate parameters uniformly across model subspaces, which limits their efficiency and scalability in speech...
Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on $x$. In this paper, in certain cases where $n$ is a fixed constant, we find equational proofs of...
Linear recurrent neural networks have emerged as efficient alternatives to the original Transformer's softmax attention mechanism, thanks to their highly parallelizable training and constant memory and computation requirements at inference. Iterative refinements of these models have introduced an increasing number of architectural...
We establish upper and lower bounds on the maximal number of steps needed to transform a cyclic permutation to the canonical cyclic permutation using conjugation by adjacent transpositions, and on the diameter of the underlying Schreier graph.
We give novel and explicit formulas for the Ehrhart quasi-polynomials of rational simple polytopes, in terms of Barnes polynomials and discrete moments of half-open parallelepipeds. These formulas also hold for all positive dilations of a rational polytope. There is an interesting appearance of an extra complex z-parameter, which...
This study presents a dedicated and systematic sensitivity analysis of a singlet-type vector-like $B$ quark at an FCC--$μp$ collider with a center-of-mass energy of $\sqrt{s}=24.5~\mathrm{TeV}$ via photon-induced production mechanisms. The analyses are based on the $B \to Zb$ decay and the lepton decay of the $Z$ boson on a clean and...
Contrastive language-audio pretraining (CLAP) has achieved notable success in learning semantically rich audio representations and is widely adopted for various audio-related tasks. However, current CLAP models face several key limitations. First, they are typically trained on relatively small datasets, often comprising a few million...
Individuals experiencing interpersonal violence (IPV), who depend on medical devices, represent a uniquely vulnerable population as healthcare technologies become increasingly connected. Despite rapid growth in MedTech innovation and "health-at-home" ecosystems, the intersection of MedTech cybersecurity and technology-facilitated...
In the setting of constructive reverse mathematics, we analyse the downward Löwenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of the DLS theorem to the axiom of dependent choice (DC) over classical base theories, our...
The ambiguity of human emotions poses several challenges for machine learning models, as they often overlap and lack clear delineating boundaries. Contrastive language-audio pretraining (CLAP) has emerged as a key technique for generalisable emotion recognition. However, as conventional CLAP enforces a strict one-to-one alignment...
We evaluate definite integrals involving the product of four modified Bessel functions of the first and second kind and a power function. We provide general formulas expressed in terms of the Meijer $G$-function and generalized hypergeometric and Lauricella $F_C$ functions, and study a number of special cases in which the integrals...
People's identities change during life transitions, e.g., studying abroad. They bring everyday objects that embody memories and reflect their identities during such moves. To assist in these transitions, we ask how people's human identities could be influenced by their objects through an artificial agent. This paper presents an...
Indium selenide (In$_2$Se$_3$) has garnered significant attention for its intriguing properties and applications in batteries, solar cells, photodetectors and ferroelectric devices. However, the controlled synthesis of single phase $α$-In$_2$Se$_3$ remains challenging owing to its complex phase diagram, presence of multiple polymorphs...
We address the following question: given a collection $\{\mathbf{A}^{(1)}, \dots, \mathbf{A}^{(N)}\}$ of independent $d \times d$ random matrices drawn from a common distribution $\mathbb{P}$, what is the probability that the centralizer of $\{\mathbf{A}^{(1)}, \dots, \mathbf{A}^{(N)}\}$ is trivial? We provide lower bounds on this...
Debris discs are analogues to our own Kuiper belt around main-sequence stars and are therefore referred to as exoKuiper belts. They have been resolved at high angular resolution at wavelengths spanning the optical to the submillimetre-millimetre regime. Short wavelengths probe the light scattered by such discs, which is dominated by...
Multimodal Large Language Models (MLLMs) are increasingly used to interpret visualizations, yet little is known about why they fail. We present the first systematic analysis of barriers to visualization literacy in MLLMs. Using the regenerated Visualization Literacy Assessment Test (reVLAT) benchmark with synthetic data, we open-coded...