150,356+ open-access research outputs.
Reinforcement learning (RL) has become essential to the post-training of large language models (LLMs) for reasoning, agentic capabilities and alignment. Successful RL relies on sufficient exploration …
Finite Larmor radius magnetohydrodynamics (FLR-MHD) provides a hybrid model of plasma that explains how turbulent energy cascade extends to sufficiently small parallel length scales, potentially leadi…
Recent research has shown that filtering massive English web corpora into high-quality subsets significantly improves training efficiency. However, for high-resource non-English languages like German,…
A Killing tensor field on a Riemannian space corresponds to an integral of the geodesic flow polynomial in momenta. A Killing tensor field is called decomposable if it is a polynomial in Killing vecto…
We introduce a framework called LAPITHS (Language model Analysis through Paradigm grounded Interpretations of Theses about Human likenesS) and use it to show that several major claims advanced by mode…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
In this paper, we present a new approach to obtain so-called damping estimates for self-similar solutions to general hyperbolic relaxation systems applying the method of characteristics. Such damping …
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimu…
A pygmy shrew (\textit{Suncus etruscus}, ${\approx}2$\,g) sustains a resting heart rate near $1{,}000$\,beats\,min$^{-1}$ and dies within two years; an African elephant (${\approx}4{,}000$\,kg) beats …
In \cite{Bedford}, the dynamics of a particular polynomial diffeomorphism of $\mathbb{C}^N$, called a polynomial shift-like map of type $\nu$, has been studied as a higher dimensional analog of H\'eno…
We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) da…
We present YOSO (You Only Shot Once), a single-frame phase retrieval framework for digital in-line holographic microscopy (DIHM) in which supervised deep learning is used to numerically generate an ad…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vo…
Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map …
In this paper we study when the origin $(0,0)$ is a regular (or irregular) boundary point for the so-called soda can domains of the type \[ \Theta_{l,\theta}:= \{(x,t) \in \mathbf{R}^{n+1}: 0<-t < \th…
The primary goal of this paper is to give a precise definition and prove existence and uniqueness of multiphase quadrature domains for subharmonic functions, ensuring that the prescribed measures are …
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possibl…
We analytically derive the all-order strong-field S-matrix series incorporating intermediate-state Coulomb-Volkov corrections (ICSFA). Focusing on rescattering processes described by the second-order …
Across science and engineering, mean-field methods have been a powerful and versatile approach for the analysis of systems of many interacting elements. However, common arguments used to characterize …
Let $\mathcal{R}$ be an association scheme with nontrivial relations $A_1,\ldots,A_d$. We call $\mathcal{R}$ amorphic if every possible fusion of its nontrivial relations gives rise to a fusion scheme…
Free open-access publishing with Google Scholar indexing.
Submission Guide →