Papers

We present a proof of Nash's smooth embedding theorem with an emphasis on accessibility and rigor.

We study the large sample asymptotic behaviour of the Maximum Likelihood Estimator of the discount and strength parameters $(\alpha,\theta)$ in the Ewens–Pitman model for random partitions, under mild assumptions on the data-generating mechanism. We show that four distinct regimes arise, depending on the limiting behaviour of the frequency spectrum. In particular, in contrast with previous work, we find that $\theta$ may play a crucial role asymptotically. We further show that the existing literature implicitly focuses on only two of these regimes, and we relate this restriction to the constraints imposed by infinite exchangeability. Under the latter, indeed, the number of distinct blocks and the frequency spectrum are necessarily tied by a rigid structural relation. We prove that this lack of flexibility can be overcome through what we call the scaled Ewens–Pitman model, in which $\theta$ is allowed to grow with the sample size $n$. Finally, we provide empirical evidence from real-world data showing that such extensions are needed to capture frequency spectra that fall outside the classical Ewens–Pitman framework.

We prove that a large class of $2$-step solvable Lie algebras equipped with a complex structure $J$ admits a Levi-Malcev type decomposition, adapted to $J$. As an application, we prove that the Fino–Vezzoni conjecture holds true for $2$-step solvable unimodular Lie algebras. Finally, we give a structural characterisation of $2$-step, unimodular, completely solvable Lie algebras admitting an SKT metric.

ZX calculus provides a graphical formalism for reasoning about quantum processes, built from two interacting Frobenius algebras associated with the Z and X bases of a qubit. While it has found widespread application in quantum information and computing, its relationship to quantum field theory has only recently begun to be explored. In this work, we further develop this connection by providing a generalization of ZX calculus to two-dimensional Yang Mills theory with a compact gauge group. The key observation is that both frameworks can be organized around the Hopf Frobenius algebraic structure associated with a group algebra, which can in turn be described by the diagrammatics of two dimensional topological quantum field theory. Given the well known relationship between gauge theory and gravity in two and three dimensions, our work paves the way for applications of ZX to low dimensional gravity.

Singular volume integral operators associated with constant-coefficient partial differential operators extend the applicability of potential theory to inhomogeneous problems, for example arising from nonlinearities or variable coefficients. Typically the PDE kernels in these operators give rise to singularities at all $\mathcal{O}(1/h^3)$ volume discretization/evaluation points in a mesh of characteristic size $h$, while the slowly-decaying nature of such kernels give rise to long-range interactions that require coupling to fast summation algorithms. The presented method uses Green's identities to regularize a wide variety of both scalar-valued and vector-valued volume integral operators by use of a certain regularizing volume density interpolant. The analysis shows how the regularizing effect of the interpolant is global in the sense that the interpolation quality increases in an exactly compensatory fashion as the distance to the Green's function singularity decreases. High-order convergence estimates with tabulated simplex quadratures are established, including with exact representation of curved domains.

This is essentially the content of a talk at the workshop on Character Sheaves on Loop Groups at the University of Minnesota (June 8,2026). It describes the early days of the theory and also some recent developments.

We prove Hadamard ill-posedness for the non-autonomous linearised Prandtl equations around time-dependent shear-flow equilibria in function spaces up to Gevrey class 4. More precisely, we construct compactly supported smooth initial data, Gevrey class 4 in the tangential variable, for which the system admits no weak solution for any positive lifespan. In this regard, we improve previous results by showing that classical semigroup-type instabilities do not, by themselves, imply Hadamard ill-posedness in the non-autonomous case when the initial time is not a variable of the system. Our argument is based on a family of exact unstable modes whose $L^2$-norms grow, at tangential frequency $k$, like $\exp(c \sqrt k t)$ up to times of order $t \sim k^{-1/4}$. Their construction relies on an inner-outer gluing scheme, in the spirit of matched asymptotic expansions, which combines unstable inner solutions near a non-degenerate critical point with an exact outer solution and yields exponentially small matching errors for short times.

A skew-Hadamard difference set (SHDS) in a finite group $G$ is a classical combinatorial object with deep connections to design theory, coding theory, group theory, and the construction of Hadamard matrices. Even though the abelian case has been extensively studied – with strong structural constraints known, such as the necessity of $G$ being a $p$-group for some prime $p \equiv 3 \pmod{4}$ – there are still some open questions regarding existence of SHDSs for the abelian case. The non-abelian case remains largely unexplored, despite the known existence of non-abelian SHDSs. In this paper, we establish new necessary conditions on the order and structure of a finite group $G$ that admits an SHDS. These results provide the first general structural restrictions for SHDSs in non-abelian groups. In particular, we prove that if a group $G$ is nilpotent and admits an SHDS, then $G$ is a $p$-group. Our method makes use of the structure of the rational group algebra, and completely avoids the use of the group characters.

In this paper, we study the structure of Kubo-Ando means on the cone of positive Hermitian matrices over the real numbers, complex numbers, and quaternions. Given a Kubo-Ando mean $\sigma$ with representing function $f$, we obtain an explicit decomposition of $\text{A} \sigma \text{B}$ in terms of the spectrum of $\text{A}^{-1}\text{B}$. More precisely, we show that $\text{A} \sigma \text{B}$ can be expressed as a finite linear combination of matrices of the form $\text{A}\left(\text{A}^{-1}\text{B}\right)^{k}$, with coefficients depending only on $f$ and the eigenvalues of $\text{A}^{-1}\text{B}$. We first investigate the linear case and characterize the pairs of matrices for which every Kubo-Ando mean admits an affine representation. We then focus on the cone $\mathscr{P}_{3}(\mathbb{D})$, where we derive explicit formulas for the decomposition coefficients in terms of spectral invariants. Finally, we show that the same techniques extend to a broad class of alternative means, yielding explicit decompositions in the commutative setting and extending recent results of Choi, Kim, and Lim.

Urban waste collection and recycling systems face increasing operational and environmental challenges due to population growth, heterogeneous waste streams, traffic congestion, and the need for efficient resource recovery. This paper introduces the Sustainable Waste Integrated Facility and Transportation (SWIFT) approach for the design of multi-type urban waste collection and recycling systems. In the proposed system, waste generated at distributed collection points is collected by waste-type-specific vehicles and transported to intermediate consolidation facilities, where it is aggregated before being transferred to treatment plants using larger vehicles. The problem consists of jointly determining the locations of consolidation facilities and treatment plants, together with the associated two-echelon collection and transportation routes for multiple waste streams under a limited investment budget. To address this problem, an integrated location-routing optimization model is developed that simultaneously captures facility-location decisions, waste collection operations, transfer activities, and repeated unloading operations induced by vehicle-capacity limitations. The objective is to minimize the total system cost, including transportation, routing, and handling costs, while satisfying infrastructure investment constraints. Computational experiments based on realistic urban scenarios derived from the city of Medellín, Colombia, demonstrate the benefits of coordinated infrastructure and transportation planning. The results show that strategically located consolidation facilities can improve collection efficiency, enhance vehicle utilization, reduce transportation effort, and support more sustainable urban recycling operations.

We study the structure and transversal logical capabilities of stabilizer quantum error correcting codes. Among our results, we identify universal lower bounds on circuit depth to generate a full logical Clifford algebra, and develop novel constructions of logical transversal gates including a new depth-one transversal phase $\mathrm{\overline{S}}$ gate in the rotated surface code and a depth-one intra-block $\mathrm{\overline{CZ}}$ gate in the 2D-toric code that generalizes to all odd distances and all lengths $L\ge3$, respectively. Finally, we construct a high-rate non-LDPC CSS code family with parameters $[[n,\sqrt{n},\Theta({n^{\beta}})]]$ where $\beta \approx 0.2823$ in one demonstrated case, that provably possesses a constant-depth complete 2-local transversal logical Clifford basis instruction set architecture (ISA) composed of all individually targeted $\mathrm{\overline{S}}$, $\mathrm{\overline{SHS}} = \sqrt{X}$, and $\mathrm{\overline{CZ}}$ gates. This ISA is depth-one for certain subfamilies that we design and generally constant-depth under certain conditions. The code family is built from a small code with parameters $[[n_0, 2, d_0]]$, and is tunable in the standard way: it tiles out to form utility-scale logical qubit counts, and it scales up through concatenation to achieve higher distances and error suppression. We show that this construction preserves the depth-one complete transversal logical Clifford basis ISA when composed with these commuting construction actions, inheriting structure from the core codes so that at scale the complete logical Clifford basis ISA remains depth-one up to depth-two addressable operations between tiled cores. We call these Quantum Logic Codes.

In 2018, Hamaker and Reiner introduced weak order for monotone triangles, which extended the usual notion of weak order on the symmetric group. Monotone triangles on $\{1, \ldots, n\}$ are well-known to be in bijection with the set ASM$(n)$ of $n \times n$ alternating sign matrices. Hamaker and Reiner defined weak order on ASM$(n)$ to be induced from weak order on monotone triangles via the standard bijection. Recently, the present authors used an a priori different definition of weak order on ASM$(n)$ to give a combinatorial characterization of the codimension of ASM varieties and to show that the natural K-theoretic representatives of these varieties satisfy a divided difference recurrence. In the present work, we establish compatibility of these definitions of weak order on ASM$(n)$. Additionally, we give three different explicit means of computing weak order covering relations on ASM$(n)$: on ASMs themselves, on monotone triangles in a manner different from that given by Hamaker and Reiner, and on bumpless pipe dreams, which are a newer family of combinatorial objects also in correspondence with ASMs. Finally, using the language of bumpless pipe dreams, we characterize the fibers of the weak order operators, each of which forms a sublattice of the strong Bruhat order on ASM$(n)$.

We solve a long-standing problem of whether the homology groups of the Torelli subgroups $\mathcal{I}_g\le\mathrm{Mod}_g$ are finitely generated in stable range. Namely, we prove that the group $H_k(\mathcal{I}_g;\mathbb{Z})$ is finitely generated, provided that $k\le g-2$. Two main ingredients of our approach are as follows. First, we show that the action of any symplectic transvection $t_x\in\mathrm{Sp}_{2g}(\mathbb{Z})$ on the homology of $\mathcal{I}_g$ satisfies the following unipotency condition: $(t_x-1)^{k+1}H_k( \mathcal{I}_g;\mathbb{Z})=0$. The proof of this fact relies on the study of the spectral sequence for the action of $\mathcal{I}_g$ on the complex of homologous curves on $\Sigma_g$. The second key ingredient is Tavgen's theorem asserting that the group $\mathrm{Sp}_{2g}(\mathbb{Z})$ is boundedly elementarily generated. For homology with coefficients in $\mathbb{Q}$, we further prove that $H_k(\mathcal{I}_g;\mathbb{Q})$ is an algebraic $\mathrm{Sp}_{2g}(\mathbb{Z})$-representation in the same stable range $k\le g-2$. Kupers and Randal-Williams have obtained a conditional result: they computed the algebraic part of the rational cohomology of Torelli groups in stable range under the assumpition that the rational cohomology groups are finite-dimensional in this stable range. Our results turn this conditional computation into a precise theorem that describes the whole rational cohomology ring of Torelli groups in stable range. As further applications, we, firstly, prove Morita's conjecture asserting that the $\mathrm{Sp}_{2g}(\mathbb{Z})$-invariant part of the rational cohomology of $\mathcal{I}_g$ stabilizes to the polynomial ring $\mathbb{Q}[e_2,e_4,\ldots]$ in the even Miller-Morita-Mumford classes; secondly, we prove the uniform representation stability for the series of groups $\left\{ H_k\bigl(\mathcal{I}_g^1;\mathbb{Q})\right\}_{g=1}^{\infty}$.

Cospectral graphs (graphs that share the same eigenvalues) expose the limitations of using the graph spectrum to uniquely identify graphs, and they also help to understand what structural properties a graph spectrum cannot capture. Switching methods, which are standard tools for constructing cospectral graphs, require specific structural and algebraic conditions to hold for the operation to preserve the graph's spectrum. However, there is no guarantee that the obtained cospectral switched graph is non-isomorphic. In this paper we study this isomorphism problem for a recent and prolific switching method to produce cospectral graphs with respect to the adjacency spectra: Wang-Qiu-Hu (WQH) switching. We do so by using common-neighbour multisets associated with a WQH partition, which allows us to derive an external common-neighbour criterion for certifying non-isomorphism after WQH-switching. Then, we apply the new criterion to clique extensions and to weak tensor products, with coclique extensions as a special case. As an application we obtain infinite families of cospectral non-isomorphic graphs, including some known constructions. Finally we extend the conditions of WQH-switching to generalized adjacency matrices and, under an additional degree condition, to Laplacian and signless Laplacian matrices.

We establish the poset isomorphisms between $(d+1)$-term silting subcategories, functorially finite $s$-torsion pairs in the $d$-extended heart, and hereditary complete cotorsion pairs in a suitable subcategory. As an application, we also give dg algebra versions of these bijections, which establish the poset isomorphisms between $\tau$-tilting pairs, $(d+1)$-term silting complexes, and functorially finite $s$-torsion pairs.

We investigate the population dynamics of surface-mediated autocatalytic processes, in which particles diffuse in a complex environment towards surface regions where they can be either killed or replicated. These opposite mechanisms compete with each other and lead to a sophisticated stochastic evolution of the population size. We provide a systematic analysis of the generating function of the population size. We also deduce its distribution, mean, variance and higher-order moments. For this purpose, we employ several equivalent descriptions of these quantities in terms of nonlinear integral equations and partial differential equations with nonlinear boundary conditions. We inspect the long-time behavior of the population dynamics in three regimes when the mean population size vanishes, reaches a steady-state level, or grows exponentially. A numerical solution of the underlying integral equations and independent Monte Carlo simulations support our theoretical predictions.

Building on work of Ransford, we prove that whenever $E$ is a closed subset of the unit circle of Lebesgue measure zero, there exists a positive sequence $u_n\to\infty$ such that if $T$ is a contraction on a Hilbert space with $\sigma(T)\subset E$ and $\|T^{-n}\|=O(u_n)$, then $T$ is unitary. This confirms conjectures of Esterle and Ransford. Our main new idea is a spikes-in-collars principle for positive subharmonic functions.

Hypergraph edge partitioning is a central problem in theoretical and applied computer science, with broad impact on distributed computation, communications, optimization, and machine learning. In this setting, one is given a collection of hyperedges – each consisting of up to $d$ vertices from a ground set of size $n$ – and seeks to assign these hyperedges across $N$ partitions so as to minimize, for example, the vertex footprint, i.e., the maximum number of vertices that appear in any partition. We here identify the fundamental limits of hypergraph edge partitioning – optimized over all conceivable algorithms – for a broad class of probabilistic hypergraph models where each hyperedge may appear independently with its own probability; a model sufficiently general to encompass well-known models such as the Degree-Corrected or Mixed-Membership models, the Hypergraph Stochastic Block model, the Latent-Space/Geometric or Kernel Models, and others. By pairing our deterministic partitioner with a new converse, we first show that, for any $n,d$, and under the very mild condition of $N \leq \binom{\lfloor\sqrt{\frac{nd}{2}}\rfloor}{d}$, as long as the hyperedge set $\mathbf{X}$ satisfies $|\mathbf{X}| \gtrsim n N \log N$, then with probability at least $1-2/3n^z$, no algorithm can provide a footprint $\pi_{\mathbf{X}}$ less than $$\pi^{\bigstar}_{\mathbf{X}} = \frac{1}{2\sqrt{2}}\frac{n}{N^{1/d}}. $$ We then show that our hypergraph partitioner comes to within a small constant factor from $\pi^{\bigstar}_{\mathbf{X}}$, for each $\mathbf{X}$. This optimality captures dense and sparse hypergraphs alike (with sizes down to linear in $n$), and it additionally entails a near-optimally balanced allocation of hyperedges across partitions.

A generalised inverse first passage problem asks whether, given a probability measure $p$ on $[0,\infty]$, one can find a boundary $b:[0,\infty]\to \mathbb{R}$ such that the stopping time:\[\tau:=\inf\left\{t:\Lambda\int_0^t \omega(W_s-b(s))ds \geq U\right\}\] has distribution $p$, where $U\sim Exp(1)$, $\Lambda\in(0,\infty)$ and $\omega$ is a monotonic decreasing function. We construct a branching-selection particle system whose hydrodynamic limit is governed by a free boundary problem and connect this to the generalised inverse first passage problem. In the $N$-particle system, particles move as independent Brownian motions, branch at a prescribed rate, and are removed at a rate proportional to their location relative to a position $b^N(t)$ which is a function of the empirical distribution. We identify the limit of $b^N$ as the solution of the inverse first passage problem.

We present a multilevel B-spline-based fast integral method for the solution of the electric field integral equation (EFIE), combining fast Fourier transformation (FFT)-compatible kernel interpolation with robust high-order interpolation. Existing FFT-accelerated global Lagrange-based approaches rely on equidistant interpolation points and can, therefore, suffer from Runge-type instabilities at high interpolation orders, limiting robust high-accuracy compression. In contrast, B-splines on equidistant knot vectors overcome these instabilities and enable robust high-order interpolation for accurate matrix compression. Replacing Lagrange interpolation by B-spline interpolation is, however, non-trivial: B-spline coefficients do not coincide with function values at the interpolation points, and the associated sampling matrices can become ill-conditioned. To address these challenges, we introduce a knot-removal stabilization strategy, combined with exact interlevel transfers based on knot insertion, yielding accurate, well-conditioned multilevel interpolation. Moreover, we propose a factorization strategy that preserves the null space of the scalar potential operator up to machine precision and is compatible with low-frequency preconditioning techniques. Numerical results for both canonical and realistic geometries demonstrate robust high-order interpolation without the breakdown observed for Lagrange-based approaches and confirm $\mathcal{O}(N)$ complexity.

We develop a control-theoretic framework for understanding Quantum Advantage (QA), providing a systematic route to characterize when and how QA can arise. The bilinear controlled Schrödinger equation is the common thread: the target quantum computation is recast as an operator controllability problem on the special unitary group $SU(N)$, and QA is identified with a polynomial-in-$n$ upper bound on the associated minimal-time function. We illustrate the framework on two paradigmatic problems: a) the Quantum Fourier Transform (QFT) on superconducting digital quantum processors (such as IBM's ibm_brisbane), for which we prove operator controllability by a Lie-algebraic argument and derive an $O(n^2)$ upper bound on the minimal time via a gate-concatenation lemma combined with the standard QFT circuit decomposition; b) the Maximum Independent Set (MIS) problem on neutral-atom analog quantum processors (such as Pasqal's hardware), for which we analyze the Rydberg-blockade Hamiltonian as a bilinear control system and reformulate the Quantum Approximate Optimization Algorithm (QAOA) as a continuous-time optimal control problem. By a controllability result, we show how the problem can be solved on Pasqal Quantum Computers and we introduce a control-based definition of Quantum Advantage for MIS. We conclude by outlining several open problems that chart directions for future research at the intersection of Control Theory and Quantum Computing.

In this paper we deal with integral Hardy type inequalities on finite segments. The interval is assumed to be finite and avoiding the origin. We prove new sharp $L_2$-inequalities and their $L_p$-analogues. Constants in the proven inequalities depend on the first root of the corresponding Lamb type equation for the Bessel function. In the $L_2$-case the extremal function is found. We consider Hardy-type inequalities in differential form. Using the one-dimensional Hardy inequalities, we establish an optimal multi-dimensional version of the power-weighted Hardy inequality in differential form on annuli.

A finite subset $X$ of $\mathbb R^d$ is called Ramsey if for every $k$ there exists an $n$ such that whenever $\mathbb R^n$ is $k$-coloured there exists a monochromatic congruent copy of $X$. K\v rí\v z showed that if there is a soluble group of symmetries of $X$ that acts transitively on $X$, then $X$ is Ramsey. Determining which sets are Ramsey is a major unsolved problem. In this paper we show that if there is a finite group of isometries of $\mathbb R^d$ that acts transitively on a set $X$, and also on a set $Y$, then the `prism' formed by $X$ and $Y$ in $\mathbb R^{d+1}$ (meaning the set $X$ together with a translate of $Y$ in the direction perpendicular to $\mathbb R^d$) is itself contained in a finite set on which a group of isometries acts transitively. Moreover, if the initial group of isometries is soluble then so is the final group. This provides a new tool for generating Ramsey sets.

This paper introduces pro-tangles, a natural generalization of classical tangles, which are functors from the Boolean cube to Bar-Natan's cobordism category. By employing the simplicial Yoneda embedding, we construct the Khovanov simplicial presheaf of a pro-tangle as the total homotopy cofiber over the punctured Boolean cube, and prove that this simplicial presheaf is representable, with representing object the classical Khovanov simplicial object. We establish a fully faithful embedding showing that the weak equivalence class of this simplicial presheaf is determined by the chain homotopy type of the Khovanov complex. Furthermore, we utilize Boolean cube decompositions to construct an algebraic spectral sequence for pro-tangles. This spectral sequence converges to the total Khovanov homology, and its $E_1$ page is explicitly expressed in terms of the Khovanov homology of reduced tangles. This categorical setup yields a functorial interpretation of Reidemeister invariance in terms of morphisms of spectral sequences. By applying the tangle TQFT construction, we study this spectral sequence for Hopf clasps, the fundamental structural building blocks in tangle and link theory. We show that the spectral sequence collapses at the $E_3$ page, which further specializes to an $E_2$-collapse under the restriction to Hopf sums. Finally, we investigate connected sums of pro-tangles and pro-links. To address the module-action dependencies arising from tensor products in multi-connected sums, we introduce a state-dependent modified tensor operator and prove a structural decomposition theorem that generalizes the classical result at the chain complex level.

We introduce a new product on the ambient space $F_q^n$ as a generalization of Euclidean, Hermitian and $\delta$ products. We give some general properties of the dual codes, relation with Euclidean duals, definition and characterization of self orthogonal, self dual, dual containing and LCD codes along with certain existence conditions. Also, we calculate the dual codes of some classes of codes like repetition, binary and $\lambda$-constacyclic codes with respect to this product. Further, we extend and analyse this notion of the product for codes over semisimple rings.

We show that $\chi(X,T_X)<0$ for the currently known families of smooth Fano fourfolds of Picard rank $1$ and index $1$. Combining this with the known Picard rank $1$ index $> 1$ cases, we show that among all currently known smooth Fano fourfolds of Picard rank $1$, the only variety satisfying Bott vanishing is the projective space. By a result of Kawakami–Totaro, the existence of an endomorphism of degree greater than 1 implies Bott vanishing. Therefore, among the currently known smooth Fano fourfolds of Picard rank $1$, any variety admitting an endomorphism of degree greater than 1 must be $\mathbb P^4$. Together with Burt Totaro, we develop new Schubert2 functions for symmetric and skew-symmetric degeneracy loci, and weighted projective spaces.

A steady Euler flow is localizable if the pressure function is constant along its stream lines. This property was used by Gavrilov to construct the first smooth compactly supported steady states of 3D Euler. We prove that any analytic localizable 3D Euler flow in a bounded domain $\Omega$ is axisymmetric and $\Omega$ is a rotationally symmetric domain whose transverse section is a disk or an annulus with convex boundary curves. To the best of our knowledge, this is the first symmetry theorem for 3D steady Euler flows. In the context of MHD equilibria, this result shows that Grad's conjecture holds true for magnetic fields satisfying the isodynamic condition, a property introduced by Palumbo in the 1960's to minimize the effect of particle drifts in plasma confinement devices.

We prove a distributional convergence result for a multidimensional version of symmetric cooperative motion which was introduced and studied in one dimension in \cite{HRW, SCM1}. Our approach relies on framing the associated recursive distributional equation as a discretization of the porous medium equation. A major challenge is to analyze the behaviour of finite difference schemes which approximate weak solutions of the porous medium equation with unbounded initial data. In overcoming this difficulty, we perform a detailed analysis of the probability mass function of symmetric cooperative motion, in which we introduce several new comparison arguments for the discrete process. Consequently, along the way, we establish a novel multidimensional convergence result for a finite difference scheme approximating the ZKB/Barenblatt solution of the porous medium equation, which is of independent interest.

As quantum computing moves toward scientific computing applications, nonlinear differential equations remain a central challenge since quantum evolution is intrinsically linear. In this work, we introduce a reduced basis algorithm (RBA) for polynomial nonlinear ordinary differential equations (ODEs) and spatially discretized partial differential equations (PDEs). After time discretization, the method composes the resulting polynomial update map over $m$ timesteps, identifies the reduced monomial basis appearing in this composed map, and constructs a linear RBA operator whose action recovers the exact $m$-timestep nonlinear dynamics. Thus, at the level of the chosen discrete update rule, the method introduces no additional approximation error beyond the time discretization error. The qubit number requirement is governed by the size of the reduced monomial basis. For an $n$-dimensional polynomial ODE system of degree $p>1$, the lifted register requires at most $q_m^{\mathrm{ODE}} = O(nm\log p)$ qubits in the full basis scenario. For PDEs discretized on $N^D$ grid points, a locality-based construction requires at most $q_m^{\mathrm{PDE}} = O(D\log N + n m^{D+1}\log p)$ qubits. Hence, the dependence on the grid size remains logarithmic, while the nonlinear overhead is controlled by local reduced basis size. The main computational burden is moved from the quantum computer to a classical preprocessing step, where the reduced monomial basis and RBA operator are constructed for the chosen timestep window. Through numerical tests on the Lorenz system and the one-dimensional Burgers equation, we verify that the RBA reproduces the corresponding discrete time nonlinear dynamics exactly, while exposing the trade-off between timestep composition, reduced basis growth, and locality.

The classification of curvature homogeneous hypersurfaces in real space forms was established by Tsukada in 1988, with the remaining rank-two cases in $\mathbb{S}^4$ and $\mathbb{H}^4$ settled by Bryant-Florit-Ziller in 2025. It is obvious that curvature homogeneity implies constant Ricci eigenvalues. In this paper, we prove that for hypersurfaces in real space forms, the converse also holds: a connected hypersurface immersed in real space forms has constant Ricci eigenvalues if and only if it is curvature homogeneous. Hence, hypersurfaces with constant Ricci eigenvalues in real space forms are also classified, which, in particular, generalizes the classification of Einstein hypersurfaces obtained by Lawson for minimal hypersurfaces and by Ryan for general cases in 1969. Moreover, as a byproduct, curvature inhomogeneous Riemannian manifolds with constant Ricci eigenvalues can not be isometrically immersed in any real space form of codimension one. Finally, we show that a hypersurface with constant Ricci eigenvalues is isoparametric if it is a complete hypersurface either in $\mathbb{S}^{n+1}$ or nonflat in $\mathbb{R}^{n+1}$ for $n \geq 3$; or if it is not of constant sectional curvature $-1$ in $\mathbb{H}^{n+1}$ for $n \geq 5$.