86,618+ open-access research outputs.
We advance Matkovi\v{c} ideas, originally applied to complete the classification of tight structures on small Seifert fibred $L$-spaces, to show the existence of contact structures on Brieskorn sphereโฆ
We study the melting of a domain wall in the quantum simple exclusion process with all-to-all hoppings (a.k.a. the charged SYK$_2$ model). We show that the real-time dynamics of physical quantities ofโฆ
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โฆ
Computer architecture simulation is essential for evaluating new designs without the need for costly tapeout. The community has developed dozens of valuable simulators that have enabled significant arโฆ
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and avโฆ
Fast radio bursts (FRBs), thought to originate from magnetars, exhibit diverse polarization properties that constrain their emission physics and local magneto-ionic environments. The polarization posiโฆ
Traditional Shot Boundary Detection (SBD) inherently struggles with complex transitions by formulating the task around isolated cut points, frequently yielding corrupted video shots. We address this fโฆ
We consider a quasi-static nonlinear model in thermoviscoelasticity at a finite-strain setting in the Kelvin-Voigt rheology where both the elastic and viscous stress tensors comply with the principle โฆ
Existing talking avatar methods typically adopt an image-to-video pipeline conditioned on a static reference image within the same scene as the target generation. This restricted, single-view perspectโฆ
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$โฆ
Language models are saturating benchmarks for procedural tasks with narrow objectives. But they are increasingly being deployed in long-horizon, non-stationary environments with open-ended goals. In tโฆ
High Bandwidth Memory with Processing-in-Memory (HBM-PIM) offers an opportunity to reduce data movement by executing computation directly inside memory, but current commercial platforms expose limitedโฆ
Large Language Models (LLMs) have rapidly improved in performance across code-related tasks, making their integration into Register Transfer Level (RTL) development increasingly attractive. Mimicking โฆ
Artificial intelligence (AI) is now embedded in educational, civic, and economic systems worldwide. For African primary and secondary education, this creates a double imperative: to prepare a young poโฆ
The rapid growth of weather-dependent renewable generation increases price volatility and imbalance penalty risk in power markets, creating the need for advanced quantitative trading strategies. We deโฆ
On the flag variety $ \mathcal{F}l_s(E)$ associated to a vector bundle $E,$ , a sequence $s$ and a partition $a,$ there is a line bundle $\it Q^a_s$ on $ \mathcal{F}l_s(E).$ The aim of this papeโฆ
This article develops a Hamilton--Jacobi theory for non-conservative classical field theories, with particular emphasis on dissipative systems, in the framework of co-oriented k-contact geometry. We iโฆ
The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic butโฆ
Software stacks embedded on microcontroller-based hardware typically provide rudimentary APIs programmed in C/C++, basic connectivity and, sometimes, a firmware update mechanism. Such coarse mechanismโฆ
\indent In this paper, we study a class of parabolic-elliptic Keller-Segel systems with diffusion sensitivity dependent on spatial position, given by type \begin{equation} \left\{ \begin{array}{llโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ