99,081+ open-access research outputs.
Relaxation of far-from-equilibrium quantum fluids, intimately related to the emergence of long-range order, is theoretically associated with the decay of a turbulent isotropic tangle of vortex lines. …
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 construct bounded, commuting projections for the three-dimensional de Rham complex with the additional property that the projections preserve the trace of functions/fields if the latter is a piecew…
We propose new graph representations that exploit dense local structure to improve time and space simultaneously. Given an undirected graph $G$, we define a dual clique cover (DCC) representation of $…
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…
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…
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…
For three-dimensional (3D) magnetic objects with linear size $L$ exceeding a few exchange lengths, the micromagnetic state exhibits pronounced informational sparsity: low-dimensional, high-gradient re…
An important tool in the design of fault-tolerant graph data structures are $(L,f)$-replacement path coverings (RPCs). An RPC is a family $\mathcal{G}$ of subgraphs of a given graph $G$ such that, for…
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…
We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a E…
In this paper, we present a new approach to obtain so-called damping estimates for self-similar solutions to general hyperbolic relaxation systems applying the method of characteristics. Such damping …
A pygmy shrew (\textit{Suncus etruscus}, ${\approx}2$\,g) sustains a resting heart rate near $1{,}000$\,beats\,min$^{-1}$ and dies within two years; an African elephant (${\approx}4{,}000$\,kg) beats …
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…
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…
We consider the problem of finding the (unique) minimal Walrasian equilibrium price in multi-item, multi-unit auction models: there are multiple indivisible items for sale, with several units of each …
We investigate several aspects of the Bialynicki-Birula decomposition of a smooth complete $\mathbb{G}_m$-variety with finite fixed locus. Our results include novel characterizations of when the Bialy…
We propose a method to probe weakly bound s-wave neutron components near the neutron emission threshold in heavy nuclei using Coulomb-assisted neutron transfer reactions. Weakly bound s-wave neutrons …
Motivated by an optimal-matching problem (Leighton-Shor) and the random-field Ising model (Aizenman-Wehr, Ding-Wirth), we consider a variational problem for graphs in $1+1$ dimension maximizing an act…
Free open-access publishing with Google Scholar indexing.
Submission Guide →