96,148+ open-access research outputs.
$\omega$~Centauri, the most massive globular cluster in the Milky Way, exhibits a level of stellar population complexity that has long resisted a unified chemical characterisation. We exploit high-res…
In this review, we discuss the relevance and impact of studying Calabi-Yau threefolds in the context of global model building in string phenomenology. First, taking a phenomenologist-friendly approach…
Boosting superconductivity by metallic reservoirs is the essence of Kivelson's bilayer proposal. One layer provides pairing to the electrons, while the weakly coupled metal provides additional phase…
Realistic long-horizon productivity work is strongly conditioned on user-specific computer environments, where much of the work context is stored and organized through directory structures and content…
The WISE source, J141046.00+740511.2, has been recently observed from radio to $\gamma$ rays. Although the optical spectrum is consistent with a BL Lacertae (BL Lac) object, the source displays unusua…
Although intersections are the most complex parts of the roadway network, pedestrian crashes at non-intersection locations are disproportionately frequent, highlighting a serious traffic safety concer…
The computational cost of training a vision-language model (VLM) can be reduced by sampling the training data. Previous work on efficient VLM pre-training has pointed to the importance of semantic dat…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the …
In this paper, we investigate the existence of fixed-point-free automorphisms for finite-dimensional Lie algebras. By a result of Jacobson, a Lie algebra admitting a fixed-point-free automorphism is s…
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$…
Language models are saturating benchmarks for procedural tasks with narrow objectives. But they are increasingly being deployed in long-horizon, non-stationary environments with open-ended goals. In t…
We present a unifying Nearly Asymptotically Invariant Manifold (NAIM) framework for understanding Nesterovs Accelerated Gradient (NAG) method. By lifting the first-order gradient flow into a second-or…
We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms efficiently proves the bounded consistency statements $Con_{\mathcal S{+}\phi}(n)$ for a true…
We introduce G\r{a}rding polynomials, a class of real multivariate polynomials defined via positivity regions invariant under translation by positive directions and closed under strictly positive affi…
Long-term conversational memory requires retrieving evidence scattered across multiple sessions, yet single-pass retrieval fails on temporal and multi-hop questions. Existing iterative methods refine …
Cygnus X-3 is a microquasar composed of a compact object of unknown nature closely orbiting around a Wolf-Rayet star. The particularities of this source make it a unique case among microquasars. This …
We use coupled-channel calculations to explore the nature of near-threshold bound states in a simplified model of Rb+KRb. This is a prototype for systems with very strong coupling at short range and c…
While 3D Gaussian splatting (3DGS) offers explicit and efficient scene representations for cone-beam computed tomography reconstruction, conventional photometric optimization inherently suffers from s…
There is a Lie algebra structure on the tensor product of a Leibniz algebra and a Zinbiel algebra for the operads of Leibniz algebras and Zinbiel algebras are Koszul dual. In this paper, we extend suc…
Evaluating English ASR systems for conversational AI applications remains difficult, as many publicly available corpora are either pre-segmented into short segments, consist of read or prepared speech…
Free open-access publishing with Google Scholar indexing.
Submission Guide →