1,664+ open-access research outputs.
The sudoku puzzles have a long history, with variations going back more than a hundred years, but its current and perhaps surprising world-wide prominence goes back to certain initiatives and then puz…
We show that for quasi-compact smooth rigid analytic spaces, the extension functor sends holonomic D-modules to coadmissible D-cap-modules which are of finite length as weakly holonomic D-cap-modules.…
Owing to the extremely low gravity of small near-Earth asteroids (NEAs), it has been assumed that impact-generated rock fragments escape into space and thus do not contribute to the accumulation of re…
The rapid proliferation of Multimodal Large Language Models (MLLMs) has enabled mobile agents to execute high-stakes financial transactions, but their adversarial robustness remains underexplored. We …
A problem proposed by Erd\H{o}s, Fajtlowicz and Staton asks for the smallest $n$ for which every graph on $n$ vertices contains a regular induced subgraph of order at least $k$. A variation is to ask …
Dyson [Commun. Math. Phys. 12, 91 (1969)] rigorously proved the existence of a phase transition in the one-dimensional Ising model with long-range interactions of the form $r^{-\alpha}$ for $1 < \alph…
Given a bipartite graph $H$ and a natural number $s$, let $\mathrm{ex}^*(n,H,s)$ denote the maximum number of edges in an $n$-vertex graph that contains neither $K_{s,s}$ nor an induced copy of $H$. H…
The inflaton equation of motion including one loop radiative corrections from spectator fields is obtained. We consider a massless scalar conformally coupled to gravity and a massless fermion Yukawa…
Individual multi-loop diagrams for the massive Sudakov form factor contain an infinite tower of ultra-collinear momentum regions. We show that, for the on-shell form factor in QCD, these contributions…
We study the dynamical and collisional evolution of Near-Earth asteroids (NEAs) in Main Belt-crossing orbits (NEACs). We select NEACs with H < 18 and integrate their orbits for 1e7 yr with N-body simu…
We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delt…
The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ …
Given $a,b,c\in\mathbb N$, let $D_{a,b,c}$ be the tournament on $a+b+c$ vertices obtained by replacing the vertices of the directed triangle $C_3$ with transitive tournaments $TT_a$, $TT_b$, and $TT_c…
In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \le…
In this paper, we study Monge's problem on Riemannian manifolds $(M, g)$ with positive sectional curvature. Assuming that the source and target measures are absolutely continuous with respect to the R…
The size of gluon occupancies, or equivalently the nuclear gluon TMD, at gluon transverse momentum $k_\perp \le Q_s(Y)$ is evaluated. Without Sudakov corrections the occupations can become arbitrarily…
We give the first and lowest order examples of 3-regular 3-edge-colored graphs that demonstrate the non-factorization of tensor model invariants in the large N limit of Gaussian random tensors, as pro…
We analyze the Bayesian regret of the Gaussian process posterior sampling reinforcement learning (GP-PSRL) algorithm. Posterior sampling is an effective heuristic for decision-making under uncertainty…
We report a complete computation of next-to-next-to-leading order (NNLO) helicity and transversity Dokshitzer-Gribov-Lipatov-Altarelli-Parisi (DGLAP) splitting functions, in both space-like and time-l…
In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment meth…
Free open-access publishing with Google Scholar indexing.
Submission Guide →