10,207+ open-access research outputs.
We investigate the behavior of discrete interface growth models belonging to the Edwards--Wilkinson (EW) and Kardar--Parisi--Zhang (KPZ) universality classes, when defined on a complete graph, a topol…
As AI becomes increasingly embedded in digital games, players' attitudes de-pend not only on whether AI is used, but also on where and how it intervenes in gameplay. This study examines players' evalu…
Partially ordered patterns (POPs) generalize classical permutation patterns and have been extensively studied in the contexts of permutations, words, compositions, and partitions. Burstein, Han, Kitae…
Tracing out a Galilean-invariant Caldeira-Leggett environment breaks Galilean boost covariance of the reduced dynamics, while spatial translations and rotations survive intact. An operator-level analy…
Remaining Useful Life (RUL) estimation is a critical component of Prognostics and Health Management (PHM), enabling proactive maintenance scheduling and reducing unplanned failures in industrial equip…
We study properties of the following four classes of operators on the Fock space in $\mathbb C^n:$ 1) weakly localized operators; 2) sufficiently localized operators in the sense of Xia and Zheng; 3) …
Differential-difference matrix Lax representations (Lax pairs), gauge transformations, and discrete Miura-type transformations (MTs) belong to the main tools in the theory of (nonlinear) integrable di…
The radial profile of binary fraction may vary with environment and is of significant importance for studying the formation mechanisms of binary stars and their dynamical evolution within globular clu…
Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed so…
The dispersion of fast radio bursts (FRBs) measures the column density of free electrons, tracing the diffuse ionized gas that contains more than $90\%$ of all baryons. On linear scales the FRB disper…
Modeling the emergence of human-like lexicons in computational systems has advanced through the use of interacting neural agents, which simulate both learning and communicative pressures. The NeLLCom-…
We compute the Atiyah Real $K$-theory of $C_2$-equivariant projective spaces and construct immersions of such spaces into multiples of the regular representation. These computations are made tractable…
We propose, analyze, and numerically validate a correction adaptive two-grid finite element method (CAT-GFEM) for nonselfadjoint or indefinite elliptic problems. In contrast to the adaptive two-grid f…
This paper analyzes identifiability and stability for the drifting field underlying distributional matching in the Generative Drifting framework of Deng et al. First, we introduce the class of compani…
A longest path in a graph is called a detour. Denote by $a(k,n)$ the minimum number of detours in a connected graph with minimum degree $k$ and order $n,$ and denote by $b(k,n)$ the minimum odd number…
This work studies quantum algorithms to solve high-dimensional stochastic differential equations (SDEs) $\mathrm{d} \mathbf{X}_t = A(t) \mathbf{X}_t \mathrm{d} t + B(t) \mathrm{d} \mathbf{W}_t$. Aimin…
Negative permittivity metamaterial is a scientifically rich avenue due to its tremendous application in several arena of materials research including novel superlens, band-gap materials, invisibility …
We propose a new convex programming relaxation for the weighted Nash social welfare (NSW) problem that achieves a matching $(e^{1/e}\approx 1.445)$-approximation via the rounding algorithm of Feng and…
Since the pioneering work of Korteweg (1901) and the subsequent refinement of capillary fluid models by Dunn and Serrin (1985), the global existence of strong solutions to the multi-dimensional compre…
Let $A:=\mathbb{C}[z_+,z_-]\otimes \Lambda(\theta_1,\theta_2,\theta_3)$, with $z_\pm$ even and $\theta_1,\theta_2,\theta_3$ odd. For a reductive Lie algebra $\mathfrak g$, let $\mathfrak g[A]:=\mathfr…
Free open-access publishing with Google Scholar indexing.
Submission Guide →