Rings and Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 24 March
Let $\mathbb{H}=(H_{1},H_{2})$ be a Hopf brace in a symmetric monoidal category ${\sf C}$. In this article it is proved that the category of modules over $\mathbb{H}$ is isomorphic to the category of modules over the smash product algebra $H_{1}\sharp H_{2}$. Furthermore, the category of modules over $\mathbb{H}$ in the sense of Zhu is characterized by the condition that a certain action lies in the cocommutativity class of $H_{2}$.
Representation Theory
Classify all representation which contains a Steinberg in its hyperspecial subgroup
This paper addresses Question 1 posed by Dipendra Prasad in his recent problem list: classify all irreducible smooth representations of an unramified reductive p-adic group such that the space of vectors fixed by the pro-unipotent radical of a hyperspecial maximal compact subgroup, viewed as a representation of the finite reductive group obtained as the quotient of that hyperspecial subgroup by its pro-unipotent radical, contains the Steinberg representation. We prove that any such representation must be Iwahori-spherical, hence a subquotient of some unramified principal series. By a detailed analysis of the action of the Iwahori–Hecke algebra on the Iwahori-fixed space, we show that in each principal series there exists exactly one irreducible subquotient containing the Steinberg representation, and we give an explicit construction of this subquotient. Hence this gives a bijection between Weyl group orbits of unramified characters and irreducible representations containing the Steinberg representation in their hyperspecial subgroup. This classification is richer than Prasad's expectation: besides twists of the Steinberg representation and generic unramified representations, every principal series contributes a unique subquotient with the required property. The proof relies on establishing an isomorphism between the finite Iwahori–Hecke algebra of the finite Lie group obtained as the quotient of the hyperspecial subgroup by its pro-unipotent radical and the finite Hecke algebra of the p-adic group consisting of compactly supported I-bi-invariant functions on the hyperspecial subgroup, and comparing their actions on the Iwahori-fixed vectors.
Read the full abstract
Optimization and Control
Positive Observers Revisited
The paper shows that positive linear systems can be stabilized using positive Luenberger-type observers. This is achieved by structuring the observer as monotonically converging upper and lower bounds on the state. Analysis of the closed-loop properties under linear observer feedback gives conditions that cover a larger class than previous observer designs. The results are applied to nonpositive systems by enforcing positivity of the dynamics using feedback from the upper bound observer. The setting is expanded to include stochastic noise, giving conditions for convergence in expectation using feedback from positive observers.
Read the full abstract
Number Theory
$p$-adic multiple zeta values of integer indices
This paper concerns the $p$-adic multiple zeta values of integer indices that may contain zero or negative components. We introduce the admissibility and regularizability conditions for integer indices. We define the $p$-adic multiple zeta values associated with admissible integer indices to be finite rational linear combinations of $p$-adic multiple zeta values associated with admissible positive integer indices. We prove that the double shuffle relations, that is, the shuffle and stuffle product formulas, both hold for the values.
Read the full abstract
Analysis of PDEs
Transition fronts of combustion reaction-diffusion equations in domains with multiple cylindrical branches
This paper is concerned with propagation dynamics for combustion reaction-diffusion equations in domains with multiple cylindrical branches. We first establish the existence and uniqueness of a time-increasing entire solution behaving like planar traveling fronts in some branches and converging to $0$ in the remaining part of the domain as $t\to-\infty$. Under the assumption of complete propagation, we then show that this entire solution propagates into the other branches in the form of planar traveling fronts (up to finite shifts) and converges to $1$ elsewhere as $t\to+\infty$. In particular, it is proved that this entire solution is a transition front connecting $0$ and $1$, whose global mean speed coincides with the planar wave speed. By assuming complete propagation for front-like solutions originating from single branch, we further prove that every transition front connecting $0$ and $1$ propagates completely. Moreover, we show that the global mean speed is independent of the choice of transition front. Namely, all transition fronts connecting $0$ and $1$ share the same global mean speed.Finally, we provide two sufficient geometric conditions under which the complete propagation assumptions are satisfied.
Read the full abstract
Analysis of PDEs
V-shaped transition fronts of monotone bistable reaction-diffusion systems in exterior domains
This paper investigates the propagation phenomena of a monotone bistable reaction-diffusion system in an exterior domain of R2. By constructing suitable sub- and supersolutions, we establish the existence and monotonicity of an entire solution originating from a V-shaped traveling front. It is further shown that, under the complete propagation condition, this entire solution eventually recovers its V-shaped profile as time tends to infty after passing the obstacle. In particular, we show that the entire solution is a V-shaped transition front whose global mean speed coincides with the planar wave speed.
Read the full abstract
Geometric Topology
$\mathbb{Z}_2$-Thurston norm in Sol manifolds and embeddability of non-orientable surfaces
For every Sol manifold $M$, we determine the $\mathbb{Z}_2$-Thurston norm of every element in $H_2(M;\mathbb{Z}_2)$. Each Sol manifold is either a torus bundle over the circle or a torus semi-bundle, thus corresponds to a torus map. We discuss the action of this torus map on a curve complex for the torus, whose edges connect curve classes of intersection number 2. For torus bundles over the circle, the $\mathbb{Z}_2$-Thurston norm of any $\mathbb{Z}_2$-homology class equals either zero or the minimum translation distance under the action; and for torus semi-bundles, it equals either zero or the translation distance of a specific curve class. Moreover, we construct incompressible surfaces to realize all the $\mathbb{Z}_2$-homology classes. As a consequence, for any torus bundle over the circle or torus semi-bundle, we determine which non-orientable closed surfaces can be embedded in it.
Read the full abstract
Analysis of PDEs
Transition fronts of monotone bistable reaction-diffusion systems around an obstacle
This paper is concerned with the interaction between a planar traveling front and a compact obstacle for monotone bistable reaction-diffusion systems in exterior domains. By constructing appropriate sub- and supersolutions, we first establish the existence, uniqueness and monotonicity of the entire solution emanating from a planar traveling front. In particular, we verify that regardless of the shape of the obstacle, the entire solution locally converges to a stationary solution as time tends to infinity. Under the complete propagation assumption, we further show that the entire solution recovers to the same planar traveling front as time tends to infinity after passing the obstacle, and it constitutes a transition front. In addition, we provide some geometric conditions on the obstacle to ensure that the complete propagation assumption is nonempty. Finally, we apply our theoretical results to the Lotka-Volterra competition-diffusion system.
Read the full abstract
Optimization and Control
Quantifying Non-linearity in Topology Optimization with similarity based Visualization
Topology optimization (TO) can be viewed as seeking an optimal solution in the design space of a given TO problem. For weakly non-linear TO problems, e.g., compliance minimization, sensitivity-based methods typically converge well, whereas for strongly non-linear problems, e.g., maximum stress minimization, stabilization strategies such as stabilization terms and projection functions are often required to enhance convergence. Especially in scenarios with massive design variables, it is difficult to intuitively demonstrate the non-linear complexity of different TO problems and to elucidate the mechanisms by which stabilization strategies affect convergence. To address this challenge, we propose a visualization framework and a quantitative non-linearity index for objectives with varying complexity. We employ a multi-start fixed-gradient sampling tailored to similarity-based dimensionality reduction while keeping the computational cost under control. The samples are then parameterized via cosine similarity to obtain a low-dimensional visualization surface of the objective function. Based on this visualization, we construct a dimensionless complexity index with a clear geometric interpretation by measuring the gap between the visualization surface and the discrete approximation of its convex envelope, which enables quantitative comparisons of non-linearity across TO tasks, parameter choices, and stabilization strategies. Extensive comparative experiments show that the proposed approach is both adaptable and discriminative on a variety of representative TO problems, and it provides intuitive and measurable guidance for parameter selection.
Read the full abstract
Statistics Theory
Boundary Inference for Mixed Fractional Models under High-Frequency Observation Critical LAN and Score Tests at $H=3/4$
We study boundary inference at $H=3/4$ for mixed fractional Brownian motion and mixed fractional Ornstein–Uhlenbeck models under high-frequency observation. This boundary is economically important because it separates the critical and supercritical regimes of mixed fractional dynamics. We make three contributions. First, we identify the exact critical first-order scaling and show that, after removing the explicit linear component in the $H$-score, the transformed $(\sigma,H)$ block is already non-degenerate. Second, we establish critical score central limit theorems (CLT) and derive local asymptotic normality (LAN) with fully explicit leading information constants for both models. Third, we construct boundary-calibrated one-sided score tests for detecting entry into the supercritical region $H>3/4$ and discuss feasible implementation through restricted nuisance estimation. Monte Carlo evidence shows that the feasible statistic has the correct directional power but conservative null calibration. Finally, an intraday illustration on one-minute SPY data finds no persistent evidence in favor of $H>3/4$.
Read the full abstract
Combinatorics
Constructive characterizations concerning total outer-independent domination in subdivision trees
Let $G$ be a nontrivial connected graph with vertex set $V(G)$. A set of vertices $D\subseteq V(G)$ is called a total outer-independent dominating set of $G$ if every vertex of $G$ is adjacent to at least one vertex in $D$, and $V(G)\setminus D$ is an independent set of $G$. The total outer-independent domination number of $G$, denoted by $\gamma_t^{oi}(G)$, is the minimum cardinality among all total outer-independent dominating sets of $G$. The subdivision graph of $G$, denoted by $\mathtt{S}(G)$, is the graph obtained from $G$ by subdividing every edge exactly once. Cabrera-Martínez et al. [On the total outer-independent domination number of subdivision graphs, Comput. Appl. Math. 45 (2026) 315] proved that $\tfrac{4n(T)-l(T)-s(T)}{3}\leq \gamma_{t}^{oi}(\mathtt{S}(T))\leq \tfrac{4n(T)-l(T)+s(T)-2}{3}$ for any nontrivial tree $T$ of order $n(T)$ with $l(T)$ leaves and $s(T)$ support vertices. In this paper, we provide constructive characterizations of the families of trees that attain these bounds.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Cooperative Bandit Learning in Directed Networks with Arm-Access Constraints
Sequential decision-making under uncertainty often involves multiple agents learning which actions (arms) yield the highest rewards through repeated interaction with a stochastic environment. This setting is commonly modeled by cooperative multi-agent multi-armed bandit problems, where agents explore and share information without centralized coordination. In many realistic systems, agents have heterogeneous capabilities that limit their access to subsets of arms and communicate over asymmetric networks represented by directed graphs. In this work, we study multi-agent multi-armed bandit problems with partial arm access, where agents explore and exploit only the arms available to them while exchanging information with neighbors. We propose a distributed consensus-based upper confidence bound (UCB) algorithm that accounts for both the arm accessibility structure and network asymmetry. Our approach employs a mass-preserving information mixing mechanism, ensuring that reward estimates remain unbiased across the network despite accessibility constraints and asymmetric information flow. Under standard stochastic assumptions, we establish logarithmic regret for every agent, with explicit dependence on network mixing properties and arm accessibility constraints. These results quantify how heterogeneous arm access and directed communication shape cooperative learning performance.
Read the full abstract
Number Theory
On generalized Thabit numbers $(p+1)p^\mathfrak{a}-1$ in the $k$-Lucas sequence
Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-Lucas numbers whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we solve the Diophantine equation $L_n^{(k)}=(p+1)p^\mathfrak{a}-1$, for a Mersenne or Fermat prime $p=2^{\ell}\pm 1$, and positive integers $n\ge 2$, $k\ge 2$, $\mathfrak{a}\ge 1$ and $\ell \ge 1$.
Read the full abstract
Analysis of PDEs
A Lavrentiev phenomenon in the neo-Hookean model
We exhibit a Lavrentiev gap phenomenon for the neo-Hookean energy in three-dimensional nonlinear elasticity. More precisely, we construct boundary data for which the infimum of the neo-Hookean energy over deformations satisfying a natural regularity and invertibility condition is strictly larger than the infimum over the weak $H^1$-closure of that class. The mechanism underlying the gap is a deformation with a dipole-type singularity.
Read the full abstract
Dynamical Systems · Cross-listed from cs.AI
Dynamical Systems Theory Behind a Hierarchical Reasoning Model
Current large language models (LLMs) primarily rely on linear sequence generation and massive parameter counts, yet they severely struggle with complex algorithmic reasoning. While recent reasoning architectures, such as the Hierarchical Reasoning Model (HRM) and Tiny Recursive Model (TRM), demonstrate that compact recursive networks can tackle these tasks, their training dynamics often lack rigorous mathematical guarantees, leading to instability and representational collapse. We propose the Contraction Mapping Model (CMM), a novel architecture that reformulates discrete recursive reasoning into continuous Neural Ordinary and Stochastic Differential Equations (NODEs/NSDEs). By explicitly enforcing the convergence of the latent phase point to a stable equilibrium state and mitigating feature collapse with a hyperspherical repulsion loss, the CMM provides a mathematically grounded and highly stable reasoning engine. On the Sudoku-Extreme benchmark, a 5M-parameter CMM achieves a state-of-the-art accuracy of 93.7 %, outperforming the 27M-parameter HRM (55.0 %) and 5M-parameter TRM (87.4 %). Remarkably, even when aggressively compressed to an ultra-tiny footprint of just 0.26M parameters, the CMM retains robust predictive power, achieving 85.4 % on Sudoku-Extreme and 82.2 % on the Maze benchmark. These results establish a new frontier for extreme parameter efficiency, proving that mathematically rigorous latent dynamics can effectively replace brute-force scaling in artificial reasoning.
Read the full abstract
Information Theory
Aerial Agentic AI: Synergizing LLM and SLM for Low-Altitude Wireless Networks
Low-Altitude Wireless Networks (LAWNs), composed of Unmanned Aerial Vehicles (UAVs) and mobile terminals, are emerging as a critical extension of 6G. However, applying Large Language Models in LAWNs faces three major challenges: 1) Computational and energy constraints; 2) Communication and bandwidth limitations; 3) Real-time and reliability conflicts. To address these challenges, we propose Aerial Agentic AI, a hierarchical framework integrating UAV-side fast-thinking Small Language Model (SLMs) with BS-side slow-thinking Large Language Model (LLMs). First, we design SLM-based Agents capable of on-board perception, short-term memory enhancement, and real-time decision-making on the UAVs. Second, we implement a LLM-based Agent system that leverages long-term memory, global knowledge, and tool orchestration at the Base Station (BS) to perform deep reasoning, knowledge updates, and strategy optimization. Third, we establish an efficient hierarchical coordination mechanism, enabling UAVs to execute high-frequency tasks locally while synchronizing with the BS only when necessary. Experimental results validate the effectiveness of the proposed Aerial Agentic AI.
Read the full abstract
Analysis of PDEs
The Benjamin-Feir instability in KdV-like equations with general dispersion and monomial nonlinearity
Nonlinear waves in dispersive media can be succeptible to modulational instabilities. We examine a category of scalar equations, with general dispersion and monomial nonlinearity, including a large variety of KdV-like equations. For small-amplitude traveling wave solutions, we provide a complete characterization of the spectrum near the origin of the linear operator obtained from linearizing about periodic traveling waves. We prove rigorously that, when the modulational instability is present, the spectrum connected to the origin consists of curves that invariably form a closed figure-eight pattern.
Read the full abstract
Differential Geometry
The Ricci-DeTurck flow on complete manifolds
Based on the framework of Koch-Lamm and tensor heat kernel estimates, we obtain a uniform proof of the short-time existence, uniqueness, and continuous dependence for Ricci flows starting from a complete Riemannian metric with bounded curvature. A new ingredient is an effective continuous dependence estimate without the assumption of injectivity radius lower bound.
Read the full abstract
Probability
Approximating inter-point distances in directed Bernoulli graphs
In directed random graphs, in which edges can be assigned to have one of two directions, or perhaps both, the distance between two vertices $v$ and $v'$ can be computed along paths that are directed from $v$ to $v'$, or along paths that are directed from $v'$ to $v$. These two distances are in general dependent. Here, we approximate their joint distribution in the setting of the directed Bernoulli random graph $\mathcal{DG}(n,p,\theta)$, obtained as a natural extension of the Bernoulli random graph $\mathcal{G}(n,p)$ by assigning directions to the edges independently, bidirectional with probability $\theta$, and either of the two possible choices of single direction with probability $\frac12(1-\theta)$. The approximation involves two independent copies of a trivariate limiting random vector $(W^*_1,W^*_2,W_3)$ associated with a $3$-type Bienaymé–Galton–Watson process. The approximation error is shown to be typically of order $O(n^{-1/2}\log n)$; this asymptotic order is likely to be optimal, even for the corresponding approximation in the Bernoulli random graph $\mathcal{G}(n,p)$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Towards The Implicit Bias on Multiclass Separable Data Under Norm Constraints
Implicit bias induced by gradient-based algorithms is essential to the generalization of overparameterized models, yet its mechanisms can be subtle. This work leverages the Normalized Steepest Descent} (NSD) framework to investigate how optimization geometry shapes solutions on multiclass separable data. We introduce NucGD, a geometry-aware optimizer designed to enforce low rank structures through nuclear norm constraints. Beyond the algorithm itself, we connect NucGD with emerging low-rank projection methods, providing a unified perspective. To enable scalable training, we derive an efficient SVD-free update rule via asynchronous power iteration. Furthermore, we empirically dissect the impact of stochastic optimization dynamics, characterizing how varying levels of gradient noise induced by mini-batch sampling and momentum modulate the convergence toward the expected maximum margin solutions.Our code is accessible at: https://github.com/Tsokarsic/observing-the-implicit-bias-on-multiclass-seperable-data.
Read the full abstract
Differential Geometry
Well-posedness of mean curvature flow
In this paper, using heat kernel estimates and contraction mapping principle, we give a new proof of the existence and uniqueness of mean curvature flow starting from hypersurface with bounded second fundamental form. Moreover, we show the continuous dependence of mean curvature flow on initial data.
Read the full abstract
Number Theory
Murmurations, Periods, and Local Factors
This note replaces arXiv:2603.22807v1 and withdraws its three theorems, which do not stand as stated. Theorem A, that the order of the Tate-Shafarevich group of $y^2=x^3+x+D(t)$ over $\mathbb{F}_q(t)$ is determined by the cyclotomic type of the $L$-polynomial, holds at rank $0$ when $D$ has degree $5$ but fails at positive rank; we give a counterexample and cite the correct statement. Theorem B is Turán's inequality for modified Bessel functions; we prove a version for general even weights and a class of increasing tilts that includes the Euler factor, which gives the Euler-factor tilt at every prime. Theorem C, a limit law for the covariance of $a_p$ with the real period at fixed $L(f,1)$, was not proved, and we explain why. We also recompute the empirical section of the first version from Cremona's tables, correct its numbers, withdraw those we could not reconstruct, and show that its sign flip at $p=3$ and its "100% Tamagawa channel" are artefacts of decile conditioning and of the rank-$0$ BSD formula.
Read the full abstract
Optimization and Control
Equivalence of Finite- and Fixed-time Stability to Asymptotic Stability
In this paper, we present new results on finite- and fixed-time convergence for dynamical systems using LaSalle-like invariance principles. In particular, we provide first and second-order non-smooth Lyapunov-like results for finite- and fixed-time convergence, thereby relaxing the requirement of existence a differentiable, positive definite Lyapunov function. Based on these findings, we show that a dynamical system whose equilibrium point is globally asymptotically stable can be modified through scaling so that the resulting dynamical system has a fixed-time stable equilibrium point. The results in this paper expand our understanding of various convergence rates and strengthen the hypothesis that all the convergence rates are interconnected through a suitable transformation.
Read the full abstract
Number Theory
On the series expansion of k-free Dirichlet series and its analytical continuation
In this article, we develop a k-free zeta Dirichlet series into a Laurent series with a simple pole, and prove a Stieltjes like formula for the expansion coefficients of the regular part. We also investigate another analytical continuation of these series and develop a formula for $\zeta(\tfrac{1}{k})$ for positive integer $k\geq 2$ in terms of the k-free indicator function.
Read the full abstract
Representation Theory
$L^r$-Multipliers on compact $p$-adic Lie groups
Let $p$ be a prime number, and let $\mathbb{G}$ be a compact $p$-adic Lie group. This work provides multiplier theorems for invariant operators on $\mathbb{G}$ acting on $L^r_\alpha(\mathbb{G})$, $1<r<\infty$, $\alpha>0$, in terms of the Ruzhansky-Turunen difference operators and Saloff-Coste's condition. As an application, a Littlewood-Paley decomposition is proven, together with the $L^r$-boundedness of bounded functions of the Vladimirov-Taibleson operator on compact Vilenkin groups.
Read the full abstract
Functional Analysis
A random demiclosedness principle for random asymptotically nonexpansive mappings
By making full use of the inherent connection between the theory of random conjugate spaces and the theory of classical conjugate spaces, in this paper we establish a random demiclosedness principle for a random asymptotically nonexpansive mapping, which generalizes Xu's classical demiclosedness principle from a uniformly convex Banach space to a complete random uniformly convex random normed module: let $(E,\|\cdot\|)$ be a complete random uniformly convex random normed module, $E^{*}$ the random conjugate space of $E$, $G$ an almost surely bounded closed $L^{0}$-convex subset of $E$ and $f: G \rightarrow G$ a random asymptotically nonexpansive mapping, then $(I-f)$ is random demiclosed at $\theta$, namely, for each sequence $\{x_{n}, n\in \mathbb{N}\}$ in $G$, if $\{x_{n}, n\in \mathbb{N}\}$ converges in $\sigma(E, E^{*})$ to $x$ and $\{(I-f)x_{n}, n\in \mathbb{N}\}$ converges to $\theta$, then $(I-f)x=\theta$, where $I$ denotes the identity operator on $E$ and $\sigma(E, E^{*})$ the random weak topology on $E$.
Read the full abstract
Numerical Analysis
Matrix-Free Stabilized BDF Schemes for Semilinear Parabolic Equations with Unconditional Maximum Bound Principle Preservation and Energy Stability
We develop a family of stabilized backward differentiation formula (sBDF) schemes of orders one through four for semilinear parabolic equations. The proposed methods are designed to achieve three properties that are rarely available simultaneously in high-order time discretizations: unconditional preservation of the maximum bound principle (MBP), unconditional discrete energy stability, and practical matrix-free implementation. The construction integrates carefully designed stabilization terms, fixed-point iterations, and a pointwise cut-off strategy. The nonlinear algebraic systems arising from the implicit sBDF discretizations are solved by fixed-point iteration, resulting in fully matrix-free algorithms. This makes the approach particularly attractive for practical computations on general domains and under mixed boundary conditions, where FFT-based exponential time differencing methods are often unavailable or inefficient. We further present a unified analysis for the fully implemented schemes, explicitly incorporating the interplay among time discretization, nonlinear iteration, and cut-off. Unconditional contractivity of the fixed-point iterations and error estimates are established. For the Allen-Cahn equation, we additionally prove an unconditional discrete energy dissipation law. Numerical experiments confirm the theoretical convergence rates and demonstrate the robustness and efficiency of the proposed methods, particularly relative to ETD-based approaches for problems with mixed boundary conditions.
Read the full abstract
Functional Analysis
On Banach Spaces with the Helly Approximation Property
Qualitatively, a no-dimensional Helly-type theorem says that if every small subfamily of convex sets has a common point in a bounded region, then suitable neighborhoods of all the sets in the whole family have a common point. Quantitative bounds, when available, depend on the ambient metric. We say that a Banach space has the Helly approximation property if the radii of these neighborhoods tend to zero as the size of the subfamilies tends to infinity. In this paper, we show that the Helly approximation property holds if and only if the dual space has non-trivial Rademacher type. The argument combines Maurey's empirical method with a duality argument at a minimizer of the maximal distance function. We also prove a colorful version of this theorem, with control over the average of the radii.
Read the full abstract
Differential Geometry
The Calderón-Zygmund inequalities on evolving Riemannian manifolds
The Calderón-Zygmund inequality is a cornerstone of harmonic analysis and partial differential equations. In this article, we establish various Calderón-Zygmund inequalities on evolving Riemannian manifolds with bounded curvature. We also provide concrete applications of such inequalities.
Read the full abstract
Numerical Analysis · Cross-listed from cs.DS
Algorithmic warm starts for Hamiltonian Monte Carlo
Generating samples from a continuous probability density is a central algorithmic problem across statistics, engineering, and the sciences. For high-dimensional settings, Hamiltonian Monte Carlo (HMC) is the default algorithm across mainstream software packages. However, despite the extensive line of work on HMC and its widespread empirical success, it remains unclear how many iterations of HMC are required as a function of the dimension $d$. On one hand, a variety of results show that Metropolized HMC converges in $O(d^{1/4})$ iterations from a warm start close to stationarity. On the other hand, Metropolized HMC is significantly slower without a warm start, e.g., requiring $\Omega(d^{1/2})$ iterations even for simple target distributions such as isotropic Gaussians. Finding a warm start is therefore the computational bottleneck for HMC. We resolve this issue for the well-studied setting of sampling from a probability distribution satisfying strong log-concavity (or isoperimetry) and third-order derivative bounds. We prove that non-Metropolized HMC generates a warm start in $\tilde{O}(d^{1/4})$ iterations, after which we can exploit the warm start using Metropolized HMC. Our final complexity of $\tilde{O}(d^{1/4})$ is the fastest algorithm for high-accuracy sampling under these assumptions, improving over the prior best of $\tilde{O}(d^{1/2})$. This closes the long line of work on the dimensional complexity of MHMC for such settings, and also provides a simple warm-start prescription for practical implementations.