Research
Research
Research
Research
73,394+ 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…
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$…
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…
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…
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…
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…
We prove that the Lorentz--FitzGerald contraction is the unique deformation of a resonant cavity moving through a mechanical wave medium that preserves spherical-harmonic phase closure. For a cavity m…
A Berge $k$-factor in a hypergraph is a generalization of a $k$-factor in a graph. In this paper, we study the problem of determining the values $k$ such that every $\lambda$-edge-connected $r$-regula…
We introduce an entropy-compatible neural network method for scalar hyperbolic conservation laws based on a computable surrogate of the Kru\v{z}kov entropy residual. The proposed loss is designed to e…
Free open-access publishing with Google Scholar indexing.
Submission Guide →