721+ open-access research outputs.
We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{\"…
Selecting out-of-reach objects is a fundamental task in mixed reality (MR). Existing methods rely on a single cue or deterministically fuse multiple cues, leading to performance degradation when the d…
This paper asks how institutional stock-market integration reshapes the transmission of monetary policy through asset prices in small open economies. Motivated by the persistent segmentation of Wester…
A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge…
Named Entity Recognition (NER) is a foundational NLP task, yet research in Yor\`ub\'a has been constrained by limited and domain-specific resources. Existing resources, such as MasakhaNER (a manually …
We report the empirical detection of a multi-planet quasi-commensurability in the Solar System and identify an anomalous exclusion that may bear on the dynamical history of Uranus. An exhaustive searc…
A pair $\{u,v\}$ of vertices is said to be globally linked in a $d$-dimensional framework $(G,p)$ if there exists no other framework $(G,q)$ with the same edge lengths, in which the distance bet…
We provide a description of the code implementation and structure of Cosmology Likelihood for Observables in Euclid (CLOE), developed by members of the Euclid Consortium. CLOE is a modular Python code…
Local primordial non-Gaussianity, parameterised as $f_{\rm NL}^{\rm local}$, will be stringently constrained using state-of-the-art methods applied to next-generation galaxy redshift survey data. In t…
We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has optimal dependence on $\varepsilon$ under Gap-ETH. For any fixed dimension $d\geq 2$ and for any $\varepsilon>0…
To measure the shape similarity of point sets, various notions of the Hausdorff distance under translation are widely studied. In this context, for an $n$-point set $P$ and $m$-point set $Q$ in $\math…
Selecting an appropriate motor-gearbox combination is a critical design task in robotics because it directly affects cost, mass, and dynamic performance. This process is especially challenging in modu…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all …
We present peapods (github.com/PeaBrane/peapods), an open-source Python package for Monte Carlo simulation of Ising spin systems with arbitrary coupling constants on periodic Bravais lattices with use…
We present GLM-5, a next-generation foundation model designed to transition the paradigm of vibe coding to agentic engineering. Building upon the agentic, reasoning, and coding (ARC) capabilities of i…
Agentic AI prototypes are being deployed across domains with increasing speed, yet no methodology for their structured design, governance, and prospective evaluation has been established. Existing AI …
We present scPilot, the first systematic framework to practice omics-native reasoning: a large language model (LLM) converses in natural language while directly inspecting single-cell RNA-seq data and…
The recently released Quaia quasar catalogue, with its broad redshift range and all-sky coverage, enables unprecedented three-dimensional reconstructions of matter across cosmic time. In this work, we…
Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=…
Given an elliptic curve $E$ over $\Q$ and a nontrivial element $\sigma$ of its Shafarevich--Tate group $\Sha(E)$, we introduce the \textbf{Visualization category} $\V(E; \sigma)$ of abelian varieties …
Free open-access publishing with Google Scholar indexing.
Submission Guide →