63,250+ open-access research outputs.
We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, …
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…
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…
The impossibility of eliminating hallucination, understood here as incorrect definite answers, in sufficiently expressive yes-or-no formal domains is an immediate consequence of classical undecidabili…
We address the problem of numerically approximating the velocity and pressure governed by the Stokes system when the boundary conditions are only partially known and thus do not uniquely determine the…
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…
For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they as…
We associate a musical instrument, a "hyperbolic marimba", to every pair $(X,\Gamma)$ where $X$ is a hyperbolic surface and $\Gamma\subset X$ a simple multicurve labeled with musical keys. It works as…
We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{\"…
Let $M$ be a smooth manifold without boundary and let $\mathcal{T}$ be a countable collection of manifolds with corners, each equipped with a smooth map to $M$. We show that the singular simplicial se…
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…
In this paper we study a variant of the uncentred Hardy--Littlewood maximal operator on Damek--Ricci spaces in which balls are replaced by suitable half balls. Perhaps surprisingly, such modified maxi…
Let $X_1,\ldots,X_n$ be independent random points in the closed unit ball of $\mathbb{R}^d$. Assume that each $X_i$ has a beta distribution with parameter $\beta_i \ge -1$: if $\beta_i>-1$, then $X_i$…
We study the extremal energy problem for complex unit gain graphs whose underlying graph is the dumbbell graph $D_{r,s,\ell}$. An explicit expression of its characteristic polynomial is derived in ter…
We construct a Lagrangian Floer homology whose chain complex is generically generated by the inscriptions of isosceles trapezoids in a smooth Jordan curve. This is an extension of Greene and Lobb's Jo…
It is not known whether the realisation part of the $s$-cobordism theorem holds for smooth 4-manifolds, nor whether every pair of smoothly $h$-cobordant 4-manifolds is also smoothly $s$-cobordant. We …
We establish a half-space theorem \`a la Hoffman and Meeks for nonlocal minimal surfaces. Differently from the classical case, our result holds in every dimension.…
We construct the multilevel correlation kernel for the rising GUE eigenvalue process starting from a fixed initial configuration $x^{(m)}$, and show that it converges on short time scales (as quickly …
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…
We prove a conjecture of Paquette, Rock, and Yildirim by showing that, for every thread quiver, the abelian category of pointwise finite dimensional representations is hereditary. Since this category …
Free open-access publishing with Google Scholar indexing.
Submission Guide →