10,221+ open-access research outputs.
We investigate the effects of coupling a quantum-magnetic cavity field to molecules. Our high-precision auxiliary-field quantum Monte Carlo calculations capture the effect of the cavity field in the pโฆ
We investigate the geometric behavior of $\tau(E)$ for bounded finite-perimeter sets $E \subset \mathbb R^n$, where $\tau(E)$ is the trace constant introduced by Figalli--Maggi--Pratelli [Invent. Mathโฆ
Datalog is a declarative logic-programming language used for complex analytic reasoning workloads such as program analysis and graph analytics. Datalog's popularity is due to its unique price-point, mโฆ
Spatial join is a fundamental operation in spatial databases. With the rapid growth of 3D data in applications such as LiDAR-based object detection and 3D digital pathology, there is an increasing neeโฆ
In this article, we prove that the quantum $f$-divergence between two normal states on a semifinite von~Neumann algebra is equal to the classical $f$-divergence between two corresponding classical staโฆ
Polar metals and noncentrosymmetric superconductors are exceptionally rare, yet their broken inversion symmetry can give rise to emergent electronic phenomena including mixed singlet-triplet supercondโฆ
The orbital degree of freedom in rare-earth nickelates is typically inactive across the temperature-driven metal-insulator transition, where the system develops two inequivalent Ni sites associated wiโฆ
A number of optimization algorithms have been inspired by the physics of Newtonian motion. Here, we ask the question: do algorithms themselves obey some ``natural laws of motion,'' and can they be derโฆ
We show that the Markov fractions introduced recently by Springborn coincide with the index of the Cohn matrices defined by Aigner. This provides a simple concatenation rule for the corresponding contโฆ
The generalized Tur\'an number $\text{ex}(n, H, F)$ denotes the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Let $kK_{r+1}$ be the disjoint union of $k$ copies of the complete grapโฆ
In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ verticesโฆ
We extend our recent work on the cavity-modified spin Zeeman effect of an effective spin-1/2-system[J. Chem. Phys. 163, 174307 (2025)] to a relativistic Jahn-Teller scenario under strong light-matter โฆ
Large language models compress heterogeneous knowledge into a single parameter space, allowing facts from different domains to interfere during generation. We propose DALM, a Domain-Algebraic Languageโฆ
We study a variant of a polygon partition problem, introduced by Chung, Iwama, Liao, and Ahn [ISAAC'25]. Given orthogonal unit vectors $\mathbf{u},\mathbf{v}\in \mathbb{R}^2$ and a polygon $P$ with $nโฆ
Recent advances in query optimization have shifted from traditional rule-based and cost-based techniques towards machine learning-driven approaches. Among these, reinforcement learning (RL) has attracโฆ
Recently, Abo Khamis et al. showed how to upper bound the size of a join of multiple tables, a problem essential to query optimization in database theory. They unified earlier works by the following iโฆ
While Large Language Models (LLMs) have significantly advanced Text-to-SQL performance, existing benchmarks predominantly focus on Western contexts and simplified schemas, leaving a gap in real-world,โฆ
We address the problem of interaction topology identification in open multi-agent systems (OMAS) with dynamic node sets and fast switching interactions. In such systems, new agents join and interactioโฆ
Refining the sharp upper bounds $\mu_{k,d}^* $ obtained by Kr\"oger (1999) for the $k$-th Neumann eigenvalue of a convex domain $\Omega \subset \mathbb{R}^d$, we prove the following inequalities: for โฆ
We investigate the localized-electron character of the Mott-insulating phase in A$_3$C$_{60}$ using a single-site multiorbital electron model coupled to anisotropic molecular vibrations (Jahn--Teller โฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ