Research
Research
Research
Research
6,600+ 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…
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) …
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…
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 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…
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…
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…
We establish regularity results for viscosity solutions to a class of quasilinear parabolic equations exhibiting nonhomogeneous degeneracy or singularity (a double phase regime) of the form \[ u_t - \…
The main aim of this paper is to study chains of model structures arising from cotorsion pairs in extriangulated categories. Starting with a hereditary Hovey triple, we construct further hereditary Ho…
We study SINGLE-SOURCE SHORTEST PATH (SSSP) on unweighted intersection graphs whose node set corresponds to a set of $n$ constant-complexity objects in the plane. We prove SSSP can be solved in $O(U(n…
We extend the entropy-stable oscillation-eliminating discontinuous Galerkin spectral element method (ES-OEDG) on curvilinear meshes to adaptive mesh refinement (AMR) grids with nonconforming interface…
Let $\kappa'(G)$ and $\tau(G)$ denote the edge connectivity and the spanning tree packing number of a graph $G$, respectively. Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128--144] posed t…
Let $X$ be a normal projective variety of dimension $d\ge 4$ and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the degree growth rate of $f$, so that $\mathrm{deg}_1(f^n) \asymp n^{k}$.…
Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints, including robot-robot collisions, robot-obstacle collisions, and unreachable motions.…
In this paper, we consider the global spherically symmetric strong solution to the compressible Navier-Stokes equations with far-field vacuum and density-denpendent degenerate viscosity which is refer…
Let $S$ be an $\mathbb N$-graded Koszul Artin-Schelter regular algebra and let $\sigma$ be a graded algebra automorphism of $S$. We study the stable category of graded maximal Cohen-Macaulay modules o…
Free open-access publishing with Google Scholar indexing.
Submission Guide →