Research
Research
Research
Research
43,342+ open-access research outputs.
Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, sho…
Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Con…
The black hole no-hair theorem is traditionally derived from the uniqueness theorems of general relativity. We show that a quantitative form follows from unitarity together with the standard semiclass…
Background: Timely, uncertainty-aware forecasting from irregular electronic health records (EHR) can support critical-care decisions, yet most approaches either impute to a grid or sacrifice interpret…
We introduce a fast, one-dimensional Newtonian {reduced model} to capture uniform rotation in cold white dwarfs, encoding centrifugal support as an effective pressure anisotropy. Using $\Delta_{\rm ro…
Context. The Large Array Survey Telescope (LAST) is a wide-field visual-band survey designed to explore the variable and transient sky with high cadence. Its raw data stream is automatically processed…
Open clusters are fundamental laboratories for investigating stellar and Galactic evolution, and serve as important benchmarks for asteroseismic analyses. Using a boutique method to analyze TESS photo…
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…
Shallow nanoindentation enables mechanical characterization of thin films, individual phases and other volume-constrained materials, but measured hardness is often inflated by the indentation size eff…
The choice of loss function in classification involves a fundamental trade-off: smooth losses (like Cross-Entropy) enable fast optimization rates but yield slow square-root consistency bounds, while p…
Preference learning has become the foundation of aligning Large Language Models (LLMs) with human intent. Popular methods, such as Direct Preference Optimization (DPO), minimize surrogate losses as pr…
MAX phases (M$_{n+1}$AX$_n$), precursors to MXenes, span a vast compositional space, motivating efficient computational screening for synthesisable candidates. We employ CrystaLLM$-\pi$, a large langu…
This work introduces Q3SAT-GPT, a generative model for discovering quantum circuits for the Max-E3-SAT problem. Our method learns from high-performing QAOA-style ans\"atze to directly generate candida…
Audio-based stuttering systems to date have been trained for detection -- what disfluency is present now -- leaving prediction, the capability needed for closed-loop intervention, unstudied at deploya…
We initiate the study of Reidemeister hardness of Legendrian unknot front projections. Using normal rulings, we obstruct several infinite families of hard unknot diagrams from being drawn with max-tb …
We present fast-vollib, an open-source Python library that provides high-performance European option pricing, implied volatility (IV) computation, and Greeks under the Black-76, Black-Scholes, and Bla…
Orbital data centers are being evaluated as solar-powered compute constellations and relay-integrated processing platforms. Their feasibility is not set by orbital solar flux alone, but by simultaneou…
Quantum integrable spin chains are known to possess a large family of long-range deformations generated by the local, boost and bilocal operators. Although these deformations are well-understood on th…
Let $G = \mathrm{SL}(n,\mathbb{C})$, let $B$ be a fixed Borel subgroup, and let $P \supset B$ be a parabolic subgroup determined by a composition $(c_1,\dots,c_k)$ of $n$. Write $P'$ for the derived g…
In generative modeling, we often wish to produce samples that maximize a user-specified reward such as aesthetic quality or alignment with human preferences, a problem known as guidance. Despite their…
Free open-access publishing with Google Scholar indexing.
Submission Guide →