Research
Research
Research
Research
2,835+ open-access research outputs.
The Nash-Williams conjecture establishes degree sequence conditions ensuring Hamilton cycles in digraphs. An asymptotic version of this conjecture for large digraphs was independently derived by sever…
Accurate multiclass segmentation of the Circle of Willis (CoW) is essential for neurovascular disease management but remains challenging due to complex vascular topology and variable morphology. Exist…
This work realizes a three-dimensionally (3D) nanoarchitected, all organic, "self-separating" lithium-ion electrochemical energy storage (EES) device that is cycled as a solid-state full cell. The dev…
Orderings in charge and spin have been extensively studied to unravel their correlation to emergent superconductivity over the past decades. Bragg-Williams order (BWO), a classical structural order pa…
Let $K$ be an algebraically closed and complete non-archimedean and non-trivially valued field, and let $G$ be a reductive group scheme acting on a flat projective scheme $X$ defined over the base rin…
The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\"odl showed that, w…
Minahan and the author recently proved results that allow the calculation of the second rational cohomology group of the Torelli group. This builds on two key ingredients: Hain's calculation of the im…
Gate elimination is the primary technique for proving explicit lower bounds against general Boolean circuits, including Li and Yang's state-of-the-art $3.1n - o(n)$ bound for affine dispersers (STOC 2…
We construct a local matched-asymptotic description of time-harmonic elastic fields generated by Rayleigh waves near cuspidal elements of a traction-free surface. The free surface is represented local…
We present experimental work on a primal-dual framework simultaneously approximating maximum cut and weighted fractional cut-covering instances. In this primal-dual framework, we solve a semidefinite …
We introduce two 2-categories which categorify the monodromic Hecke algebra. The first is algebraic in nature and generalizes Abe's theory of Soergel bimodules. The second is a diagrammatic category d…
Processes involving bursts of activity separated by quiescent periods occur across diverse systems and scales. In human dynamics, these phenomena have been described by power-law inter-event time dist…
Ocean dynamics are often sidelined in exoplanet climate studies due to the high computational cost of fully coupled atmosphere-ocean general circulation models (GCMs). However, ocean heat transport (O…
We study the Max-Cut semidefinite programming (SDP) relaxation in the regime where a near-optimal solution admits a low-dimensional realization. While the Goemans--Williamson hyperplane rounding achie…
Covert wireless communication aims to establish a reliable link while hiding the transmission from an adversary. In wireless settings, uncertainty plays a central role in this tradeoff: it can help ma…
The solid state reaction method is employed to synthesize Sn1-xInxTe samples. Power Factors of synthesized samples are estimated from resistivity and thermopower data. Modifications in structural para…
This paper presents a convergence analysis for the Hessian Discretisation Method (HDM) applied to fourth-order semilinear elliptic equations involving a trilinear nonlinearity and general source, base…
We study a weakened version of the Holm--Willems Local Conjecture. The problem is reduced to quasi-simple groups under the assumption that the defect group is abelian. Complete proofs are provided in …
Max-Cut is a classical graph-partitioning problem where given a graph $G = (V,E)$, the objective is to find a cut $(S,S^c)$ which maximizes the number of edges crossing the cut. In a seminal work, Goe…
William Allan Bardeen (September 15, 1941 $-$ November 18, 2025) was an American theoretical physicist who worked at the Fermi National Accelerator Laboratory. He is renowned for his foundational work…
Free open-access publishing with Google Scholar indexing.
Submission Guide →