1,811+ open-access research outputs.
We investigate several aspects of the Bialynicki-Birula decomposition of a smooth complete $\mathbb{G}_m$-variety with finite fixed locus. Our results include novel characterizations of when the Bialy…
Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}…
Magnetic skyrmions are topologically protected spin textures that can act as reconfigurable nanoscale information carriers. In synthetic antiferromagnets (SAFs), interlayer exchange coupling offers an…
Altermagnets, characterized by time-reversal symmetry breaking without net magnetization and momentum-dependent spin-split bands, offer a promising platform for spintronics due to their anisotropic sp…
We study the instanton counting in four dimensional $\mathcal{N}=2$ supersymmetric gauge theories on the blow-up of $\mathbb{C}^2$: we start by formulating the instanton moduli space as a quiver varie…
This paper studies the search for a single arc in a graph using the Szegedy walk. Arc search can be interpreted as finding a quantum particle not only in its position but also with a specific internal…
The ensemble Kalman filter (EnKF) is widely used for nonlinear and high-dimensional state estimation because it replaces complex covariance propagation with simple ensemble statistics. However, conven…
The Dzyaloshinskii-Moriya (DM) interaction has been considered essential for skyrmion formation, however, the discovery of skyrmion lattices (SkLs) in nominally centrosymmetric materials where the DM …
Probabilistic hyperproperties describe probabilistic relations between multiple sets of executions in a stochastic system. Prominent examples include information-theoretic characterizations of securit…
Two-dimensional (2D) ferromagnetic materials with high Curie temperature ($T_{\rm c}$) and large magnetic anisotropy energy (MAE) are critical for nanoscale spintronics but remain rare. We propose, vi…
Minimum dominating set is a basic local covering problem and a core task in distributed computing. Despite extensive study, in the classic LOCAL model there exist significant gaps between known algori…
We revisit the complexity analysis of the recursive version of the randomized greedy algorithm for computing a maximal independent set (MIS), originally analyzed by Yoshida, Yamamoto, and Ito (2009). …
Over the last three decades, function testing has been extensively studied over Boolean, finite fields, and discrete settings. However, to encode the real-world applications more succinctly, function …
Inspired by the recent discovery of metallic spin supersolidity and its giant magnetocaloric effect in the rare-earth alloy EuCo$_2$Al$_9$ [Nature 651, 61 (2026)], we perform a combined study through …
Nonlinear extensions of the Kalman filter (KF), such as the extended Kalman filter (EKF) and the unscented Kalman filter (UKF), are indispensable for state estimation in complex dynamical systems, yet…
This paper investigates ensemble Kalman inversion (EKI) for variational inverse problems with convex, potentially non-smooth regularization. While deterministic EKI and its Tikhonov-regularized varian…
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider…
Chains of co-B\"uchi automata (COCOA) have recently been introduced as a new canonical model for representing arbitrary omega-regular languages. They can be minimized in polynomial time and are hence …
In this paper, we address the problem of interpolation of smooth convex-concave functions. Interpolation is a key step for computer-assisted estimation of worst-case performance via PEP-like technique…
The interaction between conduction electrons and localized magnetic moments profoundly influences the electrical and magnetic properties of materials, giving rise to a variety of fascinating physical …
Free open-access publishing with Google Scholar indexing.
Submission Guide →