Research
Research
Research
Research
43,968+ 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…
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 how long the SIRS process persists or how quickly it reaches extinction across various network topologies. Our results provide a three-part characterization of this process: In finite sparse …
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…
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…
In this paper, we prove that if the Frobenius traces agree at all but finitely many places, then two $l$-adic Galois representations, associated to rank-$2$ non-CM Drinfeld modules of generic characte…
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…
Viscoelastic rate-type fluid models constitute a fundamental framework for the mathematical description of complex materials exhibiting coupled elastic and viscous effects, with a wide range of applic…
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 …
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$…
We study structural properties of the free Banach lattice $FBL\langle L\rangle$ generated by a distributive lattice $L$. We characterize when $FBL\langle L\rangle$ has a strong unit, compute its densi…
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications, however, the graph t…
In this paper, we compute the iterated Aluthge transforms $\widetilde{C_\phi}^{(n)}$ of the composition operator $C_\phi$ on the weighted Bergman spaces $\mathcal{A}_\alpha^2(\mathbb{D})$, where $\phi…
In this paper, we study the three-dimensional inviscid incompressible resistive Hall-MHD system in the axisymmetric setting with nontrivial swirl velocity and purely azimuthal magnetic. Assuming only …
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…
\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…
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 study the quantum Gromov-Hausdorff convergence of spectral truncations for compact quantum groups. Using a proper length function, we define a Dirac operator and the associated spectral truncations…
Free open-access publishing with Google Scholar indexing.
Submission Guide →