Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 1 April

Optimization and Control

Affine Normal Directions via Log-Determinant Geometry: Scalable Computation under Sparse Polynomial Structure

Affine normal directions provide intrinsic affine-invariant descent directions derived from the geometry of level sets. Their practical use, however, has long been hindered by the need to evaluate third-order derivatives and invert tangent Hessians, which becomes computationally prohibitive in high dimensions. In this paper, we show that affine normal computation admits an exact reduction to second-order structure: the classical third-order contraction term is precisely the gradient of the log-determinant of the tangent Hessian. This identity replaces explicit third-order tensor contraction by a matrix-free formulation based on tangent linear solves, Hessian-vector products, and log-determinant gradient evaluation. Building on this reduction, we develop exact and stochastic matrix-free procedures for affine normal evaluation. For sparse polynomial objectives, the algebraic closure of derivatives further yields efficient sparse kernels for gradients, Hessian-vector products, and directional third-order contractions, leading to scalable implementations whose cost is governed by the sparsity structure of the polynomial representation. We establish end-to-end complexity bounds showing near-linear scaling with respect to the relevant sparsity scale under fixed stochastic and Krylov budgets. Numerical experiments confirm that the proposed MF-LogDet formulation reproduces the original autodifferentiation-based affine normal direction to near machine precision, delivers substantial runtime improvements in moderate and high dimensions, and exhibits empirical near-linear scaling in both dimension and sparsity. These results provide a practical computational route for affine normal evaluation and reveal a new connection between affine differential geometry, log-determinant curvature, and large-scale structured optimization.
Read the full abstract

Analysis of PDEs

Blow-up analysis and extremal functions for nonlocal interaction functionals in dimension $N$

In this paper we study Moser-Trudinger type inequalities for some nonlocal energy functionals in presence of a logarithmic convolution potential, when the domain is a ball of $\mathbb{R}^N$ with $N \geq 2$. In particular, we perform a blow-up analysis to prove existence of extremal functions in the borderline case of critical growth. Using this, we extend the results in \cite{CiWeYu} to higher dimension and sharpen \cite{CC}.
Read the full abstract

Analysis of PDEs

Frequency-dependent capacitance matrix formulation for Fabry-Pérot resonances. Part I: One-dimensional finite systems

We study scattering resonances of finite one-dimensional systems of high-contrast resonators beyond the subwavelength regime. Introducing a novel tridiagonal frequency-dependent capacitance matrix, we derive quantitative asymptotic expansions of the hybridized Fabry-Pérot resonant frequencies in terms of the material contrast parameter. The leading-order shifts are governed by the eigenvalues of this matrix, while the corresponding eigenmodes are approximated, to leading order, by trigonometric functions on selected spacings between resonators. Our results extend the use of discrete approximations as a powerful tool for characterizing the resonant properties of a system of high-contrast resonators at arbitrarily high frequencies.
Read the full abstract

All authors Habib Ammari, Bowen Li, Ping Liu, Yingjie Shao

Analysis of PDEs

Stochastically-constrained Koiter shell models

We derive stochastically-constrained Koiter shell models in line with the SALT (Stochastic Advection by Lie Transport) approach introduced by Holm [Proc. A. 471 (2015)]. First, we deduce the stochastic partial differential equations for the generalised nonlinear elastic and linear elastic Koiter shell models with abstract functional derivatives of their corresponding membrane and flexural energies. We then present a prototype for a stochastically-constrained (simplified) linearised Koiter shell model that captures stiffness effects arising from shell curvature, bending and membrane stresses, interior and surface forces, and, more generally, stochastic buckling. Finally, we show that if a weak pathwise solution of this prototype is parametrised by a suitably chosen family of noise coefficients, we obtain in the parameter limit, the deterministic viscoelastic shell model with viscous damping.
Read the full abstract

Optimization and Control

Spectral Decomposition of Discrete-Time Controllability Gramian and Its Inverse via System Eigenvalues

This paper develops a closed-form spectral decomposition framework for the Gramian matrices of discrete-time linear dynamical systems. The main results provide explicit decompositions of the discrete-time controllability Gramian and its inverse in terms of the eigenvalues of the dynamics matrix, yielding a mode-resolved representation of these matrices. In contrast to the more common use of aggregate Gramian characteristics, such as eigenvalues, singular values, determinants, and trace-based metrics, the proposed approach describes the internal structure of the Gramian itself through contributions associated with individual modes and their pairwise combinations. The framework is extended further to the solution of the discrete-time Lyapunov difference equation, placing the obtained formulas in a broader context relevant to the analysis and computation of time-varying and nonlinear systems. In addition, the decomposition is generalized to systems whose dynamics matrix has multiple eigenvalues, enabling a closed-form estimation of the effects of resonant interactions between eigenmodes. The proposed results provide a structural tool for the analysis of controllability, observability and stability in discrete-time systems and complement existing Gramian-based methods used in model reduction, estimation, actuator and sensor selection, and energy-aware control. Beyond their theoretical interest, the derived decompositions may support the development of improved computational procedures and more informative performance criteria for a range of discrete-time control problems.
Read the full abstract

Numerical Analysis

A deterministic multiple-shift lattice algorithm for function approximation in Korobov and half-period Cosine spaces

Approximating multivariate periodic functions in weighted Korobov spaces via rank-1 lattices is fundamentally limited by frequency aliasing. Existing optimal-rate methods rely on randomized constructions or large pre-computations. We propose a fully deterministic multiple-shift lattice algorithm without pre-computation. First, we develop a simplified multiple shift framework for aliased frequency fibers that reduces sampling costs. Second, leveraging the Chinese Remainder Theorem and the Weil bound, we introduce an adaptive hybrid construction that algebraically guarantees the full rank and bounded condition number of the reconstruction matrix. We rigorously prove that this deterministic method maintains the optimal convergence rate in the worst-case setting. Furthermore, we extend this framework to non-periodic, half-period cosine spaces via the tent transformation. By establishing a strict projection equivalence, we prove that the algorithm attains optimal $L_2$ and $L_\infty$ approximation orders in the half-period cosine space, successfully resolving an open theoretical problem posed by Suryanarayana et al. (2016). This mathematically also validates the proposed algorithm as a generic meshless spectral solver for high-dimensional boundary value problems, such as the Poisson equation with Neumann conditions. Numerical experiments corroborate the theoretical bounds, demonstrating an order-of-magnitude reduction in sampling complexity over probabilistic baselines while ensuring absolute deterministic stability.
Read the full abstract

Combinatorics

Inversion monotonicity in subclasses of the 1324-avoiders

We prove injectively that the pattern-avoiding permutation classes $\mathrm{Av}(1324, 231)$ and $\mathrm{Av}(1324, 2314, 3214, 4213)$ are inversion monotone: for every $k$, the number of length-$n$ permutations with $k$ inversions in either class is weakly increasing in $n$. These are the first known nontrivial examples of the phenomenon. The latter is a special case of a general construction. We also characterize the finitely based permutation classes in which the number of length-$n$ members with a fixed number of inversions stabilizes as $n$ grows, and determine the limiting values for all classes $\mathrm{Av}(1324, p)$ with $p \in S_4$. Connections to several nice families of integer partitions are revealed. Lastly, we show that for asymptotically almost every pattern $p \in \mathrm{Av}(1324)$, the class $\mathrm{Av}(1324, p)$ is inversion monotone in the region $n \geq \frac{k+7}{2}$, expanding on the work of Linusson and Verkama. This work is motivated by the conjectures of Claesson, Jelínek and Steingrímsson that $\mathrm{Av}(1324)$, and more generally $\mathrm{Av}(p)$ for every nonidentity pattern $p$, is inversion monotone.
Read the full abstract

All authors Anders Claesson, Svante Linusson, Henning Ulfarsson, Emil Verkama

Logic

Makkai's lost proof of projectivity of N in the free topos

We give a categorical proof of the projectivity of $N$ in the free topos – in proof-theoretic terms, the rule of countable choice for intuitionistic higher-order logic – based on the unpublished proof of Michael Makkai (c.1980). The presentation aims to be self-contained and accessible to any reader acquainted with elementary toposes and their logic.
Read the full abstract

Analysis of PDEs

Non-Ljusternik–Schnirelman eigenvalues of the pure $p$-Laplacian exist

An old and well-known open problem in the critical point theory asks whether, for some $p \neq 2$ and some bounded domain $\Omega$, there exists a critical value of the $p$-Dirichlet energy $\|\nabla u\|_p^p$ over an $L^p(\Omega)$-sphere in $W_0^{1,p}(\Omega)$ lying outside of a Ljusternik–Schnirelman type sequence of critical values, the latter will be called LS eigenvalues of the $p$-Laplacian. In this work, we provide a positive answer by showing the existence of a non-LS eigenvalue when $p>2$ is sufficiently close to $2$ and $\Omega$ is just a planar rectangle close to the square. The arguments pursue the observation that a simple eigenvalue of the Laplacian can be a meeting point for several branches of eigenvalues of the $p$-Laplacian as $p$ varies. Since LS eigenvalues are continuous with respect to $p$ and exhaust the whole spectrum when $p=2$, we deduce that at least one of the branches must contain non-LS eigenvalues.
Read the full abstract

Probability

The localized phase of pinning models with correlated Gaussian disorder

We demonstrate that the results established for the localized regime of the pinning model with independent disorder – notably the $\mathcal{C}^\infty$ regularity of the free energy, the scaling of the largest excursion between pinned sites, and the Central Limit Theorems for both the contact number and its mean – can be generalized to translation-ergodic environments under the hypothesis that disorder is Gaussian. Our results are obtained assuming only summability of the charges' covariances. The two key ingredients for our proofs are the Birkhoff-sum approach introduced in Giacomin, Zamparo (2024) for independent disorder, but uniquely suited to handle correlated environments, and decorrelation tools such as the general and powerful Nelson's Gaussian hypercontractivity. We also rely on the Bernstein blocking method to prove a Central Limit Theorem under dependence. Additionally, we develop further techniques specifically tailored to the one-dimensional structure of the pinning model.
Read the full abstract

Analysis of PDEs

Oscillations in a scalar differential equation coupled to a diffusive field

We study the emergence of periodic oscillations through a Hopf bifurcation in a scalar diffusion equation on the half line coupled to a dynamic boundary condition. Our results quantify the effect of delay through the buffering in the diffusive field on boundary kinetics, drawing a parallel to the emergence of oscillations in delay equations. Technically, the Hopf bifurcation occurs in the presence of essential spectrum induced by the diffusive field, preventing a simple approach via center-manifold reduction. The results are motivated by observations in biological systems where dynamic boundary conditions arise when modeling surface dynamics coupled to bulk diffusion.
Read the full abstract

Combinatorics

Between proper and square colorings of planar graphs with maximum degree at most four

An $i$-independent set is a vertex set whose pairwise distance is at least $i+1$. A proper (square) $k$-coloring of a graph $G$ is a partition of its vertex set into $k$ independent ($2$-independent) sets. A packing $(1^{j}, 2^k)$-coloring of a graph $G$ is a partition of $V(G)$ into $j$ independent sets and $k$ $2$-independent sets. It can be viewed as intermediate colorings between proper and square coloring. Wegner conjectured in 1977 that every planar graph with maximum degree at most four is square $9$-colorable. Bousquet, Deschamps, de Meyer, and Pierron proved an upper bound of $12$, which is the current best result toward the conjecture of Wegner. In this paper, we prove two analogue results that every planar graph with maximum degree at most four is packing $(1,2^{10})$-colorable and packing $(1^2,2^7)$-colorable.
Read the full abstract

Rings and Algebras

Further results on modularity in evolution algebras

In this paper, we study modularity in the context of evolution algebras. Although this property has been previously considered, a complete description is still missing in several natural settings. In particular, we obtain a full characterisation of modular evolution algebras in the nilpotent case and in the class of supersolvable regular evolution algebras.
Read the full abstract

Group Theory

On fixed points and equalizers of injective endomorphisms of the free group at infinity

We study equalizers and fixed points of monomorphisms of free groups at infinity. We show that the action of the equalizer of two monomorphisms on the regular points of the equalizer at infinity has finitely many orbits, showing that the equalizer at infinity is, in some sense, finitely generated and generalizing a previous result of Cooper about fixed points. We additionally show that it is decidable whether an automorphism of a free group has a nontrivial fixed point at infinity. The same result is shown for monomorphisms satisfying the condition of being almost length-increasing. We remark that almost length-increasing monomorphisms are generic among endomorphisms of a free group. We also prove that being almost length-increasing is a decidable condition. We end the paper with several open problems arising from this work.
Read the full abstract

Information Theory

On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code

In 1998, E. Couselo, S. González, V. T. Markov, and A. A. Nechaev introduced the notions of recursive codes and recursively differentiable quasigroups. They conjectured that recursive MDS codes of dimension $2$ and length $4$ exist over every finite alphabet of size $q \not\in \{2, 6\}$, and verified this conjecture in all cases except $q \in \{14, 18, 26, 42\}$. In 2008, V. T. Markov, A. A. Nechaev, S. S. Skazhenik, and E. O. Tveritinov resolved the case $q=42$ by providing an explicit construction. The present paper settles the outstanding case $q=26$. The construction rests upon methods for producing recursively differentiable quasigroups and recursive MDS codes via perfect cyclic Mendelsohn designs. Moreover, we sharpen several known bounds concerning the existence of recursively $n$-differentiable quasigroups of small orders.
Read the full abstract

Dynamical Systems

Extremal distributions of partially hyperbolic systems: the Lipschitz threshold

We prove a sharp phase transition in the regularity of the extremal distribution $E^s \oplus E^u$ for $C^\infty$ volume-preserving partially hyperbolic diffeomorphisms on closed $3$-manifolds: if $E^s \oplus E^u$ is Lipschitz, then it is automatically $C^\infty$. This extends the rigidity phenomenon established by Foulon–Hasselblatt for conservative Anosov flows in dimension $3$ to the partially hyperbolic setting. This gain in regularity has several applications to rigidity problems. In particular, we study the relationship between the $\ell$-integrability condition introduced by Eskin–Potrie–Zhang and joint integrability in the conservative setting, yielding rigidity results for $u$-Gibbs measures. We also obtain several $C^\infty$ classification results for partially hyperbolic diffeomorphisms on $3$-manifolds under various assumptions.
Read the full abstract

Information Theory · Cross-listed from cs.DS

Sequential Sampling for Binary Classification: Two LLMs are (Almost) All You Need

We study how to orchestrate multiple large language models (LLMs) for reliable binary classification when models differ in accuracy, monetary cost, and response time. A decision-maker adaptively chooses which LLM to query, updates its belief after each response, and stops once sufficient confidence has been reached. Our results reveal a sharp contrast between exact and near-optimal orchestration. In the worst case, an exactly optimal policy may need to query every available LLM. Yet under high reliability requirements, a simple policy using at most two LLMs is asymptotically optimal. The policy identifies one specialist for each possible outcome and adaptively switches between them according to the accumulated evidence. We derive a universal lower bound on the achievable cost and show that this two-LLM policy approaches the bound at the best possible rate. Two LLMs are not merely sufficient; they can be essential. When models have complementary strengths, relying on the best single LLM can be arbitrarily more costly than using two specialists. How the models are queried also matters: committing to a fixed query plan can waste substantial resources because it cannot stop early or redirect queries as evidence accumulates. In a weak-signal regime, we analytically show that the best static design costs four times as much as the optimal sequential policy. Numerical experiments using 18 LLMs on a public benchmark show that these benefits remain substantial at practically relevant confidence levels. The main message is simple: near-optimal LLM orchestration need not require coordinating a large portfolio of models. Identifying two complementary specialists and switching between them as evidence evolves can capture most of the value of adaptive inference.
Read the full abstract

All authors Guokai Li, Alys Liang, Mo Liu, Murray Lei, Stefanus Jasin, Fenghua Yang, Preet Baxi

Category Theory

Dioperads, Frobenius monoidal functors and duality

Motivated by duality phenomena for derived global sections on derived local systems on compact oriented manifolds, we introduce the notion of a $d$-duality context between symmetric monoidal enriched categories. In this setting, the right adjoint of a symmetric monoidal functor carries compatible lax and colax structures twisted by an invertible object $d$. For any enriched dioperad $\mathcal{P}$, we define a $d$-twist $\mathcal{P}\{d\}$ and prove that, in a $d$-duality context, the right adjoint sends $\mathcal{P}$-algebras to $\mathcal{P}\{-d\}$-algebras. To achieve this, the key conceptual result is that Frobenius monoidal functors between symmetric monoidal categories are precisely those functors inducing morphisms between the underlying dioperads. We also develop a dioperadic Day convolution, yielding an alternative proof of the main theorem and suggesting an $\infty$-categorical extension of the theory.
Read the full abstract

Dynamical Systems

Topological entropy is generically infinite for non-Lipschitz velocity fields

We prove that for any Osgood non-Lipschitz modulus of continuity $\omega$, flow maps associated with time-periodic $\omega$-continuous velocity fields generically (in the sense of Baire) have infinite topological entropy.

Spectral Theory

Quantum ergodicity in the Benjamini–Schramm limit for locally symmetric spaces

We prove that for almost all symmetric spaces $X$ and for any sequence of compact locally symmetric spaces $Y_n$ which is uniformly discrete, has a uniform spectral gap, and converges in the sense of Benjamini–Schramm to $X$, the joint eigenfunctions of all invariant differential operators on $Y_n$ delocalize on average when their spectral parameters are taken to lie in a fixed spectral window.
Read the full abstract

All authors Farrell Brumley, Simon Marshall, Jasmin Matz, Carsten Peterson

Optimization and Control

Stability, Contraction, and Controllers for Affine Systems

Recent developments in data-driven control have revived interest in the behavioral approach to systems theory, where systems are defined as sets of trajectories rather than being described by a specific model or representation. However, most available results remain confined to linear systems, limiting the applicability of recent methods to complex behaviors. Affine systems form a natural intermediate class: they arise from linearization, capture essential nonlinear effects, and retain sufficient structure for analysis and design. This paper derives necessary and sufficient conditions independent of any particular representation for three fundamental stability problems for affine behaviors: (i) converse Lyapunov theorems for contraction of input-output systems; (ii) implementability and existence of prescribed contractive references; and (iii) whether these references can be implemented with linear or affine feedback control. For the latter, we show that linear controllers suffice for implementing contractive closed-loop, and and affine controllers are needed for equilibrium placement.
Read the full abstract

All authors L. P. Wieringa, A. Padoan, F. Dorfler, J. Eising

Combinatorics

Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs

For a positive integer $k$, a graph property $\mathcal{H}$, and a graph parameter $\mathcal{P}$, let $\operatorname{ex}_{\mathcal{P}}(n, \mathcal{H}; \delta \geq k)$ denote the maximum value of $\mathcal{P}$ over all $n$-vertex graphs with minimum degree at least $k$ that do not possess the property $\mathcal{H}$. The corresponding extremal families are denoted by $\operatorname{EX}_{\mathcal{P}}(n, \mathcal{H}; \delta \geq k)$. For two disjoint graphs $H_1$ and $H_2$, let $H_1 \cup H_2$ denote their disjoint union, and let $H_1 \vee H_2$ denote their join. In 1962, Erdős established a classical theorem on the maximum number of edges in a non-Hamiltonian graph with prescribed order and minimum degree. Motivated by recent work on feasible graph parameters in \cite{ALNS2023}, we prove several extensions of Erdős's 1962 theorem on non-Hamiltonian graphs. The first result gives a common generalization of the extremal theorem due to Erdős and its spectral analogues. As direct applications, we obtain complete solutions to open problems raised in the literature since 2016, thereby improving nearly all related prior results in this direction.
Read the full abstract

Combinatorics

Edge-Isoperimetric Inequalities in Chamber Graphs of Hyperplane Arrangements

We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the induced stratification by intersections of arrangement hyperplanes. This yields general lower bounds for a broad class of sets. We show that a convex set of chambers of size $\sum_{i=0}^d \binom{k}{i}$, with $k\ge d-1$, has edge boundary at least $\sum_{i=0}^{d-1}\binom{k}{i}$, and we conjecture that convex sets minimize the edge boundary among all chamber sets of a fixed size. We verify this conjecture in dimension $2$. Our main result is a three-dimensional asymptotic inequality for arbitrary subsets of chambers: for arrangements in general position, every set $S$ occupying at most a fixed proportion of the chambers satisfies $|\partial S|=\Omega(|S|^{2/3})$. As a consequence, for an arrangement of $n$ hyperplanes in general position in $\mathbb R^3$, the lazy simple random walk on the chamber graph has $\varepsilon$-mixing time $O(n^2\log(n/\varepsilon))$.
Read the full abstract

Quantum Algebra

Universal $T$-matrices for quantum Poincaré groups: contractions and quantum reference frames

Universal $T$-matrices, or Hopf algebra dual forms, for quantum groups are revisited, and their contraction theory is developed. As a first illustrative example, the (1+1) timelike $\kappa$-Poincaré $T$-matrix is explicitly worked out. Afterwards, motivated by recent results on the role of the Hopf algebra dual form of a quantum (1+1) centrally extended Galilei group as the algebraic object underlying non-relativistic quantum reference frame transformations, a new quantum deformation of the (1+1) centrally extended Poincaré Lie algebra is obtained, and its universal $T$-matrix is presented. Finally, the Hopf algebra dual form contraction is applied to this Poincaré $T$-matrix, showing that its corresponding non-relativistic counterpart is precisely the Galilei $T$-matrix associated with quantum reference frames. In this way, the Poincaré Hopf algebra dual form introduced here stands as a natural candidate for describing the symmetry structure of relativistic quantum reference frame transformations. In the appropriate basis, the associated quantum Poincaré group is recognized, remarkably, as a non-trivial central extension of the (1+1) spacelike $\kappa$-Poincaré dual Hopf algebra.
Read the full abstract

Information Theory

SynDe: Syndrome-guided Decoding of Raw Nanopore Reads

Nanopore sequencing technology remains highly error-prone, making efficient error correction essential in DNA-based data storage. Prior work addressed high error rates using convolutional codes with their decoder coupled with the basecaller, but such approaches only accommodate a limited number of code classes and incur significant decoding complexity. To overcome these limitations, we propose two algorithms: PrimerSeeker, which efficiently detects primer sequences in raw nanopore sequencing reads, and SynDe, a decoder that operates on the same raw reads and supports any linear error correction code with a low-complexity graphical representation. PrimerSeeker provides primer location estimates close to those of existing approaches while being better suited for real-time primer detection during sequencing. SynDe performs well with convolutional codes augmented with periodic markers, often approaching or exceeding the performance of existing algorithms with a lower time complexity. Remarkably, the confidence scores produced by SynDe reliably identify which of its outputs should be discarded.
Read the full abstract

All authors Anisha Banerjee, Roman Sokolovskii, Thomas Heinis, Antonia Wachter-Zeh, Eirik Rosnes, Alexandre Graell i Amat

Information Theory

Secure Network Function Computation for General Target and Security Functions

Secure network function computation is a critical research direction in network coding, which aims to ensure that the target function is correctly computed at the sink node while preventing the wiretapper from obtaining any information about the security function. In this paper, we focus on the general secure network function computation model, where the target function f and the security function {\zeta} are arbitrary, and the wiretapper can eavesdrop on any subset of edges with size at most a given security level. Using information-theoretic techniques, we establish a nontrivial upper bound on the secure computing capacity, which is applicable to arbitrary networks, arbitrary target and security functions, and arbitrary security levels. This upper bound is shown to degenerate to the existing bounds in the literature when the target and security functions are specific forms. Furthermore, we consider two specific models: one where the target function is vector-linear and the security function is the identity function, and another where both functions are vector-linear. For the former, we derive a simplified form of the upper bound on the secure computing capacity via order-theoretic methods and propose an efficient algorithm to compute this bound with linear time complexity in the number of network edges. For the latter, we characterize the equivalent conditions for the computability and security of linear secure network codes, develop two constructive schemes for such codes, and derive an upper bound on the minimal finite field size required for the constructions, thereby obtaining a nontrivial lower bound on the secure computing capacity.
Read the full abstract

Mathematical Physics

The Semiclassical Einstein-Klein-Gordon System: Asymptotic Analysis of Minkowski Spacetime

We establish the linear instability of the semiclassical Einstein-Klein-Gordon system linearised about the Minkowski vacuum spacetime. The proof relies on formulating a forcing problem for both metric and state perturbations within the space of past-compact sections. This geometric framework admits a unique tensor decomposition which, in conjunction with the quantum Møller operator, enables the decoupling of the linearised system into two distinct Cauchy problems. Consequently, the metric perturbations are shown to be governed by a higher-order, nonlocal hyperbolic partial differential equation. By relegating the nonlocal contributions to subleading order, we establish the well-posedness of this forcing problem. Furthermore, we provide a rigorous asymptotic analysis for physically admissible choices of the renormalisation constants. We prove that the system exhibits a late-time linear instability: the metric perturbations grow exponentially, bounded strictly by a universal scale H, thereby indicating a quantum backreaction-driven transition toward a de Sitter cosmological spacetime. Provided the parameters governing the system are restricted to a physically relevant regime, this universal scale is compatible with the measured expansion of our universe.
Read the full abstract

All authors Stefano Galanda, Paolo Meda, Simone Murro, Nicola Pinamonti, Gabriel Schmid

Analysis of PDEs

Rigorous $C_1$ integration of dissipative PDEs

We introduce a new $C^1$ algorithm for the rigorous integration of dissipative partial differential equations. The algorithm is designed for computer-assisted proofs that require rigorous control of both solutions and their derivatives with respect to initial data. As applications, we establish the existence of locally attracting periodic orbits for initial and boundary value problems for two non-autonomous dissipative PDEs: the Chafee-Infante equation and the Burgers equation with a fractional Laplacian.
Read the full abstract

Geometric Topology

Cappell-Shaneson knot pairs with the same Alexander polynomial

It is well known that for $m\geq 2$ there are at most two non-equivalent $m$-knots with diffeomorphic exterior. Such pair of knots will be called $\textit{ non-reflexive knot pair}$. A classical problem in topology is to determine all dimensions where such knot pairs exist. In 1976 Cappell and Shaneson gave a method of constructing non-reflexive knot pairs. In the present paper we construct an infinite family of new examples of Cappell-Shaneson knot pairs, and give examples of Cappell-Shaneson knot pairs that have the same Alexander polynomial but are inequivalent.
Read the full abstract