58+ open-access research outputs.
Online A/B testing at scale relies on proxy metrics -- short-term, easily-measured signals used in place of slow-moving long-term outcomes. When the proxy-outcome relationship is heterogeneous across …
Large language models produce fluent text but struggle with systematic reasoning, often hallucinating confident but unfounded claims. When Apple researchers added irrelevant context to mathematical pr…
We present an algorithm to enumerate isometry classes of integral quadratic lattices of a given rank and determinant, and analyze its running time by giving bounds on the number of genus symbols for a…
This paper presents the systems submitted by the Yes-MT team for the Low-Resource Indic Language Translation Shared Task at WMT 2024 (Pakray et al., 2024), focusing on translating between English and …
Deep learning methods face dual challenges of limited clinical samples and low inter-class differentiation among Diffuse Cystic Lung Diseases (DCLDs) in advancing Birt-Hogg-Dube syndrome (BHD) diagnos…
Numerical semigroups with multiplicity $e$, width $e-1$, and embedding dimension $e-2$ are of the form $$S(e,m,n) = \langle \{e, e+1, \ldots, 2e-1\} \setminus \{e+m, e+n\} \rangle,$$ for some $1 \le…
Large language models (LLMs) present significant deployment challenges due to their immense computational and memory requirements. While semi-structured pruning, particularly 2:4 sparsity, offers a pa…
Two back-to-back experiments, 28Si + 178Hf and 28Si + 186W, were intentionally conducted to validate the role of shell closure in pre-actinides by studying neutron multiplicity in compound nucleus (CN…
Walking droplets -- millimetric oil droplets that self-propel across the surface of a vibrating fluid bath -- exhibit striking emergent statistics that remain only partially understood. In particular,…
In 2011, Rubey generalized chute and ladder moves on the set of reduced pipe dreams for a permutation $w$ and conjectured that the induced poset on reduced pipe dreams is a lattice. In this paper, we …
For each permutation $w$, we consider the set $\mathrm{PD}(w)$ of reduced pipe dreams for $w$, partially ordered so that cover relations correspond to (generalized) chute moves. Settling a conjecture …
Robotic navigation in complex environments remains a critical research challenge. Traditional navigation methods focus on optimal trajectory generation within fixed free workspace, therefore strugglin…
We conjecture that, if the quotient of two $q$-binomial coefficients with the same top argument is a polynomial, then it has non-negative coefficients. We summarise what is known about the conjecture …
We establish a bijection between $01$-fillings of stack polyominoes with at most one $1$ per column and labelings of the corners along the top-right border of stack polyominoes. These labellings indic…
Social welfare orders seek to combine the disparate preferences of an infinite sequence of generations into a single, societal preference order in some reasonably-equitable way. In [2] Dubey and Laguz…
In this paper, we give a complete classification of torsion pairs in m-cluster categories of type D when m is odd, denoted by CmDn, via a bijection to combinatorial objects called Ptolemy diagrams of …
We give a complete classification of torsion pairs in repetitive cluster categories of type $A_n$, which were defined by Zhu as the orbit categories, via certain configurations of diagonals, called Pt…
The game of Gyan Chauper or snakes and ladders exists in many forms throughout history as a board game of varying size, structure, and game elements of snakes and ladders associated with various vices…
Fix an integer $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. We consider the specialized skew hook Schur polynomial $\text{hs}_{\lambda/\mu}(X,\omega X,\dots,\omega^{t-1}X/Y,\omeg…
We prove new bounds on the additive gap between the value of a random integer program $\max c^Tx,\ Ax\leq b,\ x\in\{0,1\}^n$ with $m$ constraints and that of its linear programming relaxation for a wi…
Free open-access publishing with Google Scholar indexing.
Submission Guide →