30,058+ open-access research outputs.
We prove the existence of many non-trivial characteristic classes of smooth oriented bundles with fibre a product $ S^{n}\times S^{n} $ of odd-dimensional spheres. We do so by proving injectivity of t…
We investigate the systematics of the maximum Electron-decay energy E as a function of the mass number A along isotopic chains with a fixed proton number across Z<47. By making use of the available cu…
High-order harmonic generation (HHG) in solids - the frequency up-conversion of an optical signal - is governed by symmetries. At terahertz (THz) frequencies, HHG is a key technology to access high fr…
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 study the problem of online coloring for graphs with large odd girth. The best previously known algorithm uses $O(n^{1/2})$ colors, which was discovered by Kierstead in 1998. This algorithm works w…
Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, …
Dense, dynamic crowds pose a persistent challenge for autonomous mobile robots. Purely reactive planning methods, such as Model Predictive Path Integral (MPPI) control, often fail to escape local mini…
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possibl…
Under what condition is a random constraint satisfaction problem hard to refute by the sum-of-squares (SoS) algorithm? A sufficient condition is t-wise uniformity, that is, each constraint has a t-wis…
We study the asymptotic behavior of Stiefel--Whitney classes of irreducible orthogonal representations of the finite general linear groups $\mathrm{GL}_n(\mathbb{F}_q)$. Building on recent formulas ex…
We compute exact finite-rank BPS generating functions for the fermionic matrix model with single-trace supercharge $Q_p=\operatorname{tr}(\Psi^p)$ at $(p,N)=(5,3),(5,4),(5,5),(7,4)$, together with par…
We prove that the directed five-dimensional torus $D_5(m) = \operatorname{Cay}((\mathbb{Z}_m)^5, \{e_0, e_1, e_2, e_3, e_4\})$ has a Hamilton decomposition for every odd integer $m \geq 3$. This is th…
We prove a refinement of Gromov's cowaist inequality in the case of Hermitian line bundles. Combined with the cowaist-systole estimates in recent work of Stryker, this gives sharp stable two-systolic …
We introduce a generalized family of $\left( 2\cdot \left\lfloor \frac{k}{2} \right\rfloor-1, 2\cdot \left\lceil \frac{k}{2} \right\rceil \cdot W_{1} +\max\left\{0,2\cdot\left(\left\lceil\frac{k}{2}\r…
Large language models (LLMs) accelerate software development but often exhibit instability, non-determinism, and weak adherence to development discipline in unconstrained workflows. While test-driven …
Motivated by recent evidence that equal-time correlators can be simpler than the corresponding wavefunction coefficients, we study de Sitter correlators in conformally coupled $\phi^3$ theory directly…
Runtime monitoring is essential to ensure the safety of ML applications in safety-critical domains. However, current research is fragmented, with independent methods emerging from different communitie…
In this paper, we study generating series enumerating polygonal angulations of closed oriented surfaces of fixed genus, focusing on $b$-angulations with $b = 3$ or $b = 2\nu$, $\nu \geq 2$. Based on T…
Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisf…
We introduce Flashback, a reversible string decomposition that repeatedly peels the maximal leading and trailing character runs from a sentinel-wrapped input, recording each pair as one bilateral toke…
Free open-access publishing with Google Scholar indexing.
Submission Guide →