1,530+ open-access research outputs.
Starting with describing the Dirac equation in an unconventional manner, we introduce the notion of chirality and show how chiralities are mixed in the massive Dirac particles.Then we discuss the apprโฆ
We present \textsc{dm-PhiSNet}, a physically constrained \textsc{PhiSNet}-based equivariant model that predicts one-electron reduced density matrices (1-RDMs) directly from molecular geometries in an โฆ
Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph โฆ
Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal valuโฆ
Layer-2 (L2) protocols address the fundamental limitations of Layer-1 (L1) blockchains by offloading computation while anchoring trust to the parent chain. This architectural shift, while boosting thrโฆ
We study the edge-expansion of the graph of a random $0/1$ polytope $P^d_p$, defined as the convex hull of a random subset of the points in $\{0,1\}^d$ where every point is retained independently and โฆ
We propose CHRONOS, a hardware-assisted framework that decouples the cryptographic setup required for private gradient aggregation from the active training phase. CHRONOS executes a once-per-epoch serโฆ
The emergence of Cryptographically Relevant Quantum Computers (CRQCs) presents a critical threat to classical cryptographic systems, particularly widely adopted protocols such as RSA, Diffie-Hellman (โฆ
Conventionally, octupole deformation in nuclei has been attributed to strong $\Delta l=3$ couplings between opposite-parity single-particle orbitals. In this work, we demonstrate that the often-overloโฆ
We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We gโฆ
For the weighted Dirac eigenvalue problem, we show that the two-sided weighted spectrum depends continuously on the weight under continuous deformations within a uniformly elliptic class. Moreover, foโฆ
Text production (and translations) proceeds in the form of stretches of typing, interrupted by keystroke pauses. It is often assumed that fast typing reflects unchallenged/automated translation producโฆ
The impending arrival of cryptographically relevant quantum computers (CRQCs) threatens the security foundations of modern software: Shor's algorithm breaks RSA, ECDSA, ECDH, and Diffie-Hellman, whileโฆ
We study semilinear elliptic equations \begin{equation*} \begin{cases} -\Delta u = f(u) & \text{in } \Omega, \\ \partial_\nu u = 0 & \text{on } \partial\Omega, \end{cases} \end{equation*} with homโฆ
The advent of quantum computing will pose great challenges to the current communication systems, requiring essential changes in the establishment of security associations in traditional architectures.โฆ
We investigate the mechanism of whistler-mode wave generation by shock-reflected electrons at quasi-perpendicular collisionless shocks. By employing Liouville mapping to construct the electron velocitโฆ
Let $G$ be a graph with vertex set $V=V(G)$. A double Roman dominating function on a graph $G$ is a function $f : V \to \{0,1,2,3\}$ satisfying the conditions that if $f(v) = 0$, then vertex $v$ must โฆ
We present simple and practical strategies to reduce the variance of Monte Carlo estimators. Our focus is on variational Monte Carlo calculations of atomic forces and pressure in electronic systems, aโฆ
We present a study of minimal unsatisfiable subsets (MUSs) of 2-CNF Boolean formulas, building on the Abbasizanjani-Kullmann classification of minimally unsatisfiable 2-CNFs (2-MUs). We start by givinโฆ
Quantum-enhanced sensing is commonly benchmarked using the quantum Fisher information (QFI), often interpreted as a direct indicator of achievable precision. However, this quantity acquires operationaโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ