Research
Research
Research
Research
41,789+ open-access research outputs.
We classify fillable contact structures on all negative-definite star-shaped plumbings. Along the way, we show that such Seifert fibred spaces admit a unique negative maximal twisting number, and comp…
In 1967 Hajnal and Juh{\'a}sz showed that the cardinality of a first-countable Hausdorff space with the countable chain condition has cardinality at most $\mathfrak{c}$, the cardinality of the real li…
This paper investigates the existence and uniqueness of solutions for a nonlinear evolution equation governed by an m-accretive operator A in a Banach space, presenting a perturbation term that does n…
Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Con…
We investigate the dynamics of dissipative systems with stochastic forcing and focus in particular on mean-square stability. First we show, under a natural condition on the drift and diffusion, that t…
We consider smooth convex minimization over compact convex sets, i.e., $\min_{x \in C} f(x)$ with the (vanilla) Frank-Wolfe algorithm. Well-known lower bounds establish a worst-case $\Omega(1/t)$ prim…
In this paper, we study the $L^p$-boundedness of Stein's square function $\mathfrak{S}^{\alpha}(\mathcal{L})$ associated with the sub-Laplacian $\mathcal{L}$ on M\'etivier group $G$. A key aspect of o…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
This paper investigates the heat equation on a bounded domain with a Robin boundary condition, where the reactivity parameter (or killing rate) is modeled as a continuous-time Markov chain. We analyze…
We introduce G\r{a}rding polynomials, a class of real multivariate polynomials defined via positivity regions invariant under translation by positive directions and closed under strictly positive affi…
Let $\mathcal A$ be an $\mathbb F$-algebra and $\omega \in \mathcal A\langle x_1, \ldots, x_m \rangle$ which defines a map $\mathcal A^m \rightarrow \mathcal A$ by evaluation, called a polynomial map …
We consider a class of nonlinear parabolic equations \[ \dfrac{\partial}{\partial t} b(u)-\nabla \cdot (A(x,t,u,\nabla u))+H(x,t,\nabla u)=f , \] where $H$ is a nonlinear lower order term sati…
Let $ n \in \mathbb{N} $ with $ n \geq 3 $, and let $\mathcal{G} = \{G_i:i\in [n]\} $ be a family of $ n $-vertex graphs on a common vertex set $V$, where the graphs in the family do not need to be di…
Let $Z=\{Z(t): t\in \mathbb R\}$ be a stochastic process with trajectories in space $\mathbb D (\mathbb R)$. It is assumed that there exists an essentially smooth function $A:\mathbb R\to (-\infty, \i…
The primary goal of this paper is to give a precise definition and prove existence and uniqueness of multiphase quadrature domains for subharmonic functions, ensuring that the prescribed measures are …
Bayesian online learning provides a coherent framework for sequential inference. However, its theoretical understanding remains limited, particularly in the one-pass setting. Existing theoretical guar…
Let \((X,J,\omega)\) be a closed \(2n\)-dimensional almost K\"{a}hler manifold with negative sectional curvature. We prove that if the Nijenhuis tensor of the almost complex structure is sufficiently …
This paper is a continuation work of Ren et al. (2026) aiming to further devise q-learning algorithms for mean-field control (MFC) with controlled common noise. Based on the relaxed control formulatio…
This paper investigates the continuous-time counterpart of the Q-function for entropy-regularized mean-field control (MFC) with controlled common noise, coined as q-function by Jia and Zhou (2023) in …
Revealing the interaction topology underlying strategic behavior is fundamental to prediction, intervention, and policy design in networked systems. Yet the interaction matrix is often unobservable, a…
Free open-access publishing with Google Scholar indexing.
Submission Guide →