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)

Monday 30 March

Analysis of PDEs

Some remarks on the Allen-Cahn equation in $\mathbb{R}^n$

In this short note we present new results on a higher-dimensional generalization of De~Giorgi's conjecture for Allen–Cahn type equations, focusing on dimensions $n \ge 9$. Although counterexamples are known in this regime, our goal is to identify assumptions on solutions that still enforce one-dimensional symmetry. We prove an analogue of Savin's theorem in arbitrary dimension: for energy-minimizing solutions whose level sets enjoy n-7 directions of monotonicity, we deduce one-dimensional symmetry. In the same spirit, we extend these ideas to nonlocal phase transitions, and we discuss an application to free boundary problems Finally, we establish a counterpart of the Ambrosio–Cabré theorem for solutions that are not necessarily energy minimizers and may lack bounded energy density, assuming instead n-2 directions of monotonicity everywhere. Overall, this note aims to further strengthen the connection between phase transition models and minimal surface theory.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

A Unified Framework for Nonlinear Mediation Analysis of Random Objects

Mediation analysis for complex, non-Euclidean data, such as probability distributions, compositions, images, and networks, presents significant methodological challenges due to the inherent nonlinearity and geometric constraints of such spaces. Existing approaches are often restricted to Euclidean settings or specific data types. We propose Random Object Mediation Analysis (ROMA), a unified framework that simultaneously accommodates object-valued exposures, mediators, and outcomes, enabling the analysis of nonlinear causal pathways in general metric spaces. ROMA leverages an additive Reproducing Kernel Hilbert Space (RKHS) operator model to rigorously disentangle direct and indirect causal pathways, which is a significant advancement over existing single-predictor or purely predictive additive frameworks. Theoretically, we establish the nonparametric identification of causal effects and derive global asymptotic normality for our estimators. Crucially, this theoretical foundation enables the construction of simultaneous confidence bands and global test statistics without the need for computationally intensive resampling. We demonstrate the practical utility of ROMA through simulations and real-world applications involving compositional mediators and distributional outcomes, extending the scope of mediation analysis.
Read the full abstract

Numerical Analysis

Macroscopic Traffic Flow Network Modeling For Wildfire Evacuation: A Game-Theoretic Junction Optimization Approach with Application to Lahaina Fire

The 2023 Lahaina wildfire killed 102 people on a peninsula served by a single two-lane highway, making exit lane capacity the binding constraint on evacuation time. We model the evacuation as a system of hyperbolic scalar conservation laws on a directed graph with game-theoretic junction conditions that maximize total network flux, an evacuation-calibrated piecewise linear-quadratic flux function, and a loss-driven optimization framework that tunes traffic distribution toward priority corridors. Analytical results on a toy network and numerical simulations of the Lahaina road network reveal a phase transition in exit lane capacity. Additional lanes improve throughput linearly until a computable critical threshold, beyond which no route optimization yields further benefit. For Lahaina, reversing one southbound lane captures nearly all achievable improvement, and a fourth lane can be reserved for emergency vehicles with negligible impact on civilian clearance time. These results provide a rigorous mathematical basis for contraflow recommendations in wildland-urban interface evacuations.
Read the full abstract

All authors Annie Lu, Hong Kiat Tan, Alexander Xue, Alice Koniges, Andrea L. Bertozzi

Algebraic Geometry

Deformations of locally constant stability conditions and good moduli spaces

We give a structure result on the set of locally constant stability conditions, $\operatorname{Stab}(\mathcal{D}/R)$, defined by Halpern-Leistner-Robotis showing that it has the structure of a complex manifold, in total analogy with Bridgeland's work. As a consequence, we show that the property of having relative mass-hom bounds and the existence of good moduli spaces depends only on the connected components of $\operatorname{Stab}(\mathcal{D}/R)$. Lastly, we observe that the datum of a locally constant stability condition is equivalent to that of a flat family of stability conditions, as described by Bayer et al. in the context of noncommutative algebraic geometry.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Stable Walking for Bipedal Locomotion under Foot-Slip via Virtual Nonholonomic Constraints

Foot slip is a major source of instability in bipedal locomotion on low-friction or uncertain terrain. Standard control approaches typically assume no-slip contact and therefore degrade when slip occurs. We propose a control framework that explicitly incorporates slip into the locomotion model through virtual nonholonomic constraints, which regulate the tangential stance-foot velocity while remaining compatible with the virtual holonomic constraints used to generate the walking gait. The resulting closed-loop system is formulated as a hybrid dynamical system with continuous swing dynamics and discrete impact events. A nonlinear feedback law enforces both classes of constraints and yields a slip-compatible hybrid zero dynamics manifold for the reduced-order locomotion dynamics. Stability of periodic walking gaits is characterized through the associated Poincaré map, and numerical results illustrate stabilization under slip conditions.
Read the full abstract

All authors Leonardo Colombo, Álvaro Rodríguez Abella, Alexandre Anahory Simoes, Anthony Bloch

Analysis of PDEs

Asymptotic stabilization of weak solutions to phase-field equations with non-degenerate mobility and singular potential

A common paradigm in phase-field models with singular potentials is that global-in-time weak solutions converge to a single equilibrium only after undergoing asymptotic regularization. However, in arXiv:2510.17296 we introduced a novel method to establish the convergence to a single equilibrium for solutions to Cahn–Hilliard equations, and some related coupled systems, with non-degenerate mobility and singular potentials, under very general assumptions: we only require the existence of a global weak solution satisfying an energy inequality and then we make use of a Lojasiewicz–Simon inequality. Here we take a non-trivial step further. We relax the assumptions needed to prove the precompactness of trajectories, which is an essential ingredient of the complete proof. Thanks to this generalization, we can handle all the main phase-field models, with fully general singular potentials, in a three-dimensional domain, whose asymptotic behavior has so far remained an open problem. Namely, we apply the new method to the Cahn–Hilliard equation with nonlinear diffusion, the conserved Allen–Cahn equation, and the nonlocal Cahn–Hilliard equation. In the case of second-order equations, De Giorgi's iteration argument is crucial to show that weak solutions stay asymptotically uniformly away from pure phases (strict separation property), which is the key ingredient to apply the Lojasiewicz–Simon inequality. We expect this new technique to have a wider range of applications to coupled problems, including hydrodynamic models like the conserved Allen–Cahn–Navier–Stokes system or the nonlocal Abels–Garcke–Grün system with non-degenerate mobility. Further applications to multi-component models are also possible.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Longest weakly increasing subsequences of discrete random walks on the integers with heavy tailed distribution of increments

We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of $n$-step random walks with nonzero integer increments $k = \pm 1, \pm 2, \dots$ given by a symmetric heavy tailed mass distribution proportional to $|k|^{-1-\alpha}$ for several values of the real parameter $\alpha > 0$ together with that of the simple random walk ($k=\pm 1$), to which the $n$-step heavy tailed walks reduce when $\alpha$ grows large enough that step jumps beyond $\pm 1$ become essentially absent on the scale of $n$. By means of exploratory fits, weighted nonlinear least squares, and nested-model comparisons, we found that the sample average length $\langle{L_{n}}\rangle$ scales like $\langle{L_{n}}\rangle \sim \sqrt{n}\log{n}$ when the distribution of increments has finite variance ($\alpha > 2$) and $\langle{L_{n}}\rangle \sim n^{\theta}$ with a varying exponent $\theta > 0.5$ when the variance is infinite ($\alpha \leq 2$). Distributional diagnostics indicate that the bulk of the $L_{n}$ distribution is very well-approximated by a lognormal model, though systematic deviations are observed in the tails. Our results corroborate and expand upon previous results for the LIS of other types of heavy-tailed random walks and raise a conjecture as to whether the distribution of $L_{n}$ is given, or can be effectively described, by a lognormal distribution.
Read the full abstract

Mathematical Physics

The Moyal cohomology of the N=1 spinning particle

The Batalin-Fradkin-Vilkovisky formalism studies a differential graded symplectic supermanifold whose cohomology vanishes in negative degree. This hypothesis is violated by the N=1 spinning particle arXiv:1605.04762; its cohomology is nontrivial in all negative degrees. Replacing the Poisson bracket by the Moyal bracket has the effect of eliminating these cohomology classes.
Read the full abstract

Optimization and Control

A user-driven pricing and scheduling framework for public electric vehicle charging

Public electric vehicle (EV) charging infrastructure has expanded rapidly, yet utilization across charging stations remains uneven and often inefficient. Existing operator-determined pricing schemes offer limited flexibility to coordinate heterogeneous user demand within constrained capacity. This study proposes a user-driven pricing and scheduling framework for public EV charging. Users submit advance bids specifying acceptable time slots, bid prices, and quantity bounds. Based on these bids, the charging operator determines prices and charging slot assignments. After observing the outcomes, users decide whether to accept the resulting prices and allocations. The operator's decision problem incorporates profit objectives, user participation requirements, and capacity constraints across charging levels and time slots. The framework captures a three-stage interaction involving user bidding, operator decisions, and user acceptance. Numerical case studies reveal trade-offs among user acceptance, operator revenue, and charging capacity utilization under different charging levels. The findings provide practical guidance and insights into designing flexible pricing schemes that better accommodate heterogeneous user preferences while improving system efficiency.
Read the full abstract

Spectral Theory

Stability of Ginzburg-Landau pulses via Fredholm determinants of Birman-Schwinger operators

We introduce a numerical method to determine the stability of stationary pulse solutions of the complex Ginzburg-Landau equation. The method involves the computation of the point spectrum of the first-order linear differential operator with matrix-valued coefficients on the real line obtained by linearizing the Ginzburg-Landau equation about a stationary pulse. Applying a general theory of Gesztesy, Latushkin, and Makarov, we show that this point spectrum is given by the set of zeros of a 2-modified Fredholm determinant of a Hilbert-Schmidt, Birman-Schwinger operator. We establish conditions which guarantee that this operator is trace class. Applying results of Bornemann on the numerical computation of Fredholm determinants, we obtain a bound on the error between the regular Fredholm determinant of the trace class operator and its numerical approximation by a matrix determinant. We verify the new numerical Fredholm determinant method for computing the point spectrum of a Ginzburg-Landau pulse by exhibiting excellent agreement with previous methods. This new approach avoids the challenge of solving the numerically stiff system of equations for the matrix-valued Jost solutions, and it opens the way for the spectral analysis of breather solutions of nonlinear wave equations, for which an Evans function does not exist.
Read the full abstract

Dynamical Systems

Translation Actions on Non-Unimodular Groups and Strong Ergodicity

We investigate translation actions of countable dense subgroups of non-unimodular locally compact second countable (lcsc) groups. Using left-right actions, we show that the left translation action $\Gamma \curvearrowright G$ given by a countable dense subgroup $\Gamma$ of a locally compact second countable group $G$ can only be strongly ergodic if $G$ is almost unimodular. We show that the strong ergodicity of the action $\Gamma \curvearrowright G$ for an almost unimodular lcsc group $G$ is equivalent to the strong ergodicity of $\Gamma \cap \ker(\Delta_G)\curvearrowright \ker(\Delta_G)$, where $\Delta_G$ is the modular function. We demonstrate the absence of rigidity, by showing that non-isomorphic lcsc almost unimodular groups can admit orbit equivalent translation actions.
Read the full abstract

Group Theory

Graphs of group actions and group actions on trees

Bass-Serre theory provides a powerful framework for studying group actions on trees. While extremely effective for structural questions in group theory, it is less suited to the systematic construction of group actions with prescribed local behaviour. Motivated by local-to-global constructions such as the Burger-Mozes universal groups and local action diagrams, we develop an analogue of Bass-Serre theory for group actions. The central object of study in our are graphs of group actions, combinatorial structures similar to graphs of groups from Bass-Serre theory, encoding compatible local permutation actions on a base graph. From these we can construct groups which act on tree-like graphs called scaffoldings and hence also on trees. We prove uniqueness and universality results for the resulting groups and show that our framework unifies and generalises (among other known constructions) both graphs of groups and local action diagrams. Remarkably, we are able to encapsulate the full generality of the former while still allowing for efficient construction of groups with certain local properties like in the latter.
Read the full abstract

All authors Florian Lehner, Christian Lindorfer, Rögnvaldur G. Möller, Wolfgang Woess

Mathematical Physics

The Contextual Modal Logic of a Wigner's Friend Generalization

Quantum mechanics has been subject to logical scrutiny since its inception. The behavior of quantum systems, which are fundamentally dissimilar from classical systems, often appears to point to a logical inconsistency in quantum mechanics, allegedly leading to contradictions in the prediction of experimental measurements–though such contradictions have never materialized. A recent example of this type of inquiry into the logical well-posedness of quantum mechanics is the Frauchiger-Renner Gedankenexperiment, which purports to demonstrate that quantum mechanics is logically inconsistent. In this article, we show that by considering the property of contextuality in quantum systems–as predicted by the Kochen-Specker theorem–the supposed contradiction proposed by Frauchiger and Renner becomes logically inaccessible.
Read the full abstract

Numerical Analysis

Discrete Poincare and Bogovskii operators on cochains and Whitney forms

Smooth Poincare operators are a tool used to show the vanishing of smooth de Rham cohomology on contractible manifolds and have found use in the analysis of finite element methods based on the Finite Element Exterior Calculus (FEEC). We construct analogous discrete Poincare operators acting on cochains and Whitney forms. We provide explicit, constructive realizations of these operators under various assumptions on the underlying domain or simplicial complex. In particular, we provide simple constructions for the discrete Poincare operators on simplicial complexes which are collapsible and those with underlying domain being star-shaped with respect to a point. We then provide more abstract constructions on simplicial complexes which are discrete contractible and domains which are Lipschitz contractible. We also modify the discrete Poincare operator on star-shaped domains to construct a discrete Bogovskii operator which satisfies the requisite homotopy identity while preserving homogeneous boundary conditions. Applications arise in the construction of discrete scalar and vector potentials and in the discrete wedge product of Discrete Exterior Calculus (DEC).
Read the full abstract

All authors Johnny Guzmán, Anil N. Hirani, Bingyan Liu, Pratyush Potu

Differential Geometry

On a generalized Finsler warped product metrics with vanishing Landsberg curvature

In this paper, we study weakly orthogonally invariant Finsler metrics and derive explicit expressions for their Berwald and Landsberg curvatures. We then obtain the system of partial differential equations characterizing generalized Finsler warped product metrics on $I \times \mathbb{R}^n$, which form a subclass of weakly orthogonally invariant Finsler metrics, under the conditions of vanishing Berwald and Landsberg curvatures. As an application, we construct examples of non-regular Landsberg metrics that are not of Berwald type.
Read the full abstract

All authors Newton Solórzano, Dik D. Lujerio Garcia, Víctor León, Alexis Rodríguez Carranza

Analysis of PDEs

Asymptotic minimization of the first Dirichlet eigenvalue in a square with two hard obstacles

We study an asymptotic minimization problem for the first Dirichlet eigenvalue in the square $Q=(-1,1)^2$, where two equal hard circular obstacles of radius $r$ move inside $Q$ with disjoint interiors; tangency between the obstacles and with the outer boundary is allowed. We prove that, as $r\to0$, every minimizing configuration approaches, up to the symmetries of the square and interchange of the holes, a pair of corner-tangent obstacles at adjacent corners, with displacement $o(r)$ from the corresponding corner-tangent centers. A uniform $u$-capacity localization argument shows that any obstacle whose individual eigenvalue excess is $O(r^4)$ must lie in a fixed $O(r)$ neighborhood of a corner, thereby excluding interior, open-side, and intermediate approaches to the boundary. At the corner scale, the leading coefficient is the full $u$-capacity. The proof is then organized by geometric branches. The side-tangent one-hole branch is asymptotically driven to the adjacent corner; an exact polarization argument shows that the adjacent corner-tangent pair has smaller first eigenvalue than the opposite pair; and configurations concentrated near a single corner are excluded by a scalar one-hole comparison. Additivity for well-separated corner defects then completes the distinct-corner analysis. We also include reproducible finite element computations that support the branch ordering predicted by the proof.
Read the full abstract

Functional Analysis

Nonlinear type and metric embeddings of lamplighter spaces

We prove that for all metric spaces $X$ the following properties of the lamplighter space $\mathsf{La}(X)$ are equivalent: (1) every snowflake of $\mathsf{La}(X)$ admits a biLipschitz embedding into a finite product of $\mathbb{R}$-trees, (2) every snowflake of $\mathsf{La}(X)$ admits a biLipschitz embedding into a Hilbert space, (3) $\mathsf{La}(X)$ has finite Nagata dimension, (4) $\mathsf{La}(X)$ has Markov type 2, (5) $\mathsf{La}(X)$ has nontrivial Enflo type, (6) $\mathsf{La}(X)$ does not contain the Hamming cubes with uniform distortion. We characterize metric spaces $X$ for which $\mathsf{La}(X)$ satisfies properties (1)-(6) as those that are “TSP-efficient" - a new condition that we introduce - which roughly means that the traveling salesman problem in $X$ can be solved as “efficiently" as the traveling salesman problem in $\mathbb{R}$, up to a constant multiplicative factor. We also prove that if such metric spaces $X$ admit a biLipschitz embedding into $\mathbb{R}^n$, then $\mathsf{La}(X)$ admits a biLipschitz embedding into a finite product of $\mathbb{R}$-trees, and therefore into every nonsuperreflexive Banach space. Finally, we give a full characterization of metric spaces $X$ such that the lamplighter space $\mathsf{La}(X)$ biLipschitz embeds into a Hilbert space.
Read the full abstract

Group Theory

Virtual splittings of right-angled Artin groups

In this article, we determine, given a finite graph $\Gamma$ and an integer $n \geq 1$, when a right-angled Artin group $A(\Gamma)$ virtually splits over an abelian subgroup of rank $n$. More precisely, we show that the following assertions are equivalent: (1) $A(\Gamma)$ admits $\mathbb{Z}^n$ as a codimension-one subgroup, (2) $A(\Gamma)$ virtually splits over $\mathbb{Z}^n$, (3) $A(\Gamma)$ splits over $\mathbb{Z}^n$, and (4) $\Gamma$ either is a complete graph with $n+1$ vertices or contains a complete subgraph of size $n$ that has a subgraph separating $\Gamma$.
Read the full abstract

Optimization and Control

Transfer Learning in Bayesian Optimization for Aircraft Design

The use of transfer learning within Bayesian optimization addresses the disadvantages of the so-called cold start problem by using source data to aid in the optimization of a target problem. We present a method that leverages an ensemble of surrogate models using transfer learning and integrates it in a constrained Bayesian optimization framework. We identify challenges particular to aircraft design optimization related to heterogeneous design variables and constraints. We propose the use of a partial-least-squares dimension reduction algorithm to address design space heterogeneity, and a meta data surrogate selection method to address constraint heterogeneity. Numerical benchmark problems and an aircraft conceptual design optimization problem are used to demonstrate the proposed methods. Results show significant improvement in convergence in early optimization iterations compared to standard Bayesian optimization, with improved prediction accuracy for both objective and constraint surrogate models.
Read the full abstract

All authors Ali Tfaily, Youssef Diouane, Nathalie Bartoli, Michael Kokkolaras

Functional Analysis

Characterizations of Sobolev and BV functions on Carnot groups

We establish two characterizations of real-valued Sobolev and BV functions on Carnot groups. The first is obtained via a nonlocal approximation of the distributional horizontal gradient, while the second is based on an $L^p$ Taylor approximation, in the spirit of the results by Bourgain, Brezis and Mironescu.
Read the full abstract

Optimization and Control

Collisionless Multi-Agent Path Planning in the Hamilton-Jacobi Formulation

We present a method for collisionless multi-agent path planning using the Hamilton-Jacobi-Bellman equation. Because the method is rooted in optimal control theory and partial differential equations, it avoids the need for hierarchical planners and is black-box free. Our model can account for heterogeneous agents and realistic, high-dimensional dynamics. We develop a grid-free numerical method based on a variational formulation of the solution of the Hamilton-Jacobi-Bellman equation which can resolve optimal trajectories even in high-dimensional problems, and include some practical implementation notes. In particular, we resolve the solution using a primal-dual hybrid gradient optimization scheme. We demonstrate the method's efficacy on path planning problems involving simple cars and quadcopter drones.
Read the full abstract

Statistics Theory

Linear Regression from 1-bit Quantized Data

Motivated by the prevalence of environments in which data is abundant while resources for storage and/or transmission might be scarce, we study linear regression when predictors, their squares, and responses are subject to single-bit dithered quantization. An estimator relying on plug-in estimation of the quadratic and linear terms in the quadratic program formulation of the least squares problem is proposed. We provide a non-asymptotic bound on the $\ell_2$-estimation error of this estimator and obtain its asymptotic distribution when the number of predictors is fixed, which can be used for inference and an investigation of the mean-square error efficiency relative to the ordinary least squares estimator. It is shown that for the quantization protocol under consideration, substantial improvements over the proposed estimator cannot be expected. A compression pipeline in which the underlying data is first subject to sketching and subsequently quantization can be studied within our framework as well. We also present an extension to address high-dimensional predictors. Numerical experiments with synthetic data complement our theoretical findings.
Read the full abstract

Optimization and Control

Multi-fidelity approaches for general constrained Bayesian optimization with application to aircraft design

Aircraft design relies heavily on solving challenging and computationally expensive Multidisciplinary Design Optimization problems. In this context, there has been growing interest in multi-fidelity models for Bayesian optimization to improve the MDO process by balancing computational cost and accuracy through the combination of high- and low-fidelity simulation models, enabling efficient exploration of the design process at a minimal computational effort. In the existing literature, fidelity selection focuses only on the objective function to decide how to integrate multiple fidelity levels, balancing precision and computational cost using variance reduction criteria. In this work, we propose novel multi-fidelity selection strategies. Specifically, we demonstrate how incorporating information from both the objective and the constraints can further reduce computational costs without compromising the optimality of the solution. We validate the proposed multi-fidelity optimization strategy by applying it to four analytical test cases, showcasing its effectiveness. The proposed method is used to efficiently solve a challenging aircraft wing aero-structural design problem. The proposed setting uses a linear vortex lattice method and a finite element method for the aerodynamic and structural analysis respectively. We show that employing our proposed multi-fidelity approach leads to $86\%$ to $200\%$ more constraint compliant solutions given a limited budget compared to the state-of-the-art approach.
Read the full abstract

All authors Oihan Cordelier, Youssef Diouane, Nathalie Bartoli, Eric Laurendeau

Numerical Analysis

A conservative finite-volume Buckley–Leverett solver with bounded-interval multiwavelet state analysis

We develop a conservative finite-volume Buckley–Leverett solver equipped with a bounded-interval multiwavelet state-analysis layer. Because non-capillary Buckley–Leverett transport is a nonlinear hyperbolic conservation law with entropy-admissible shocks, the saturation equation is advanced by a conservative finite-volume method with monotone numerical fluxes. The accepted finite-volume state is then embedded in a bounded-domain multiwavelet hierarchy, reconstructed back to cell averages, and used for multiresolution diagnostics. The formal transport accuracy is therefore governed by the underlying finite-volume discretization, while the multiwavelet layer is used for representation, compression, and front-localization diagnostics. Its purpose is instead to quantify whether the deterministic physical-space saturation state can be represented faithfully, compressed in a controlled manner, and used to identify dynamically active front regions. Validation against reference Buckley–Leverett profiles for a Berea benchmark shows accurate saturation histories, spatial profiles, front-position diagnostics, and mass balance. The multiwavelet reconstruction tracks the internal finite-volume state with essentially exact fidelity. Additional thresholding tests show that a substantial fraction of detail coefficients can be discarded while maintaining small reconstruction errors and negligible global mass defect, and fine-level detail activity localizes the moving displacement front. The resulting formulation provides a conservative and reproducible first stage toward future transport-active adaptive multiwavelet solvers for porous-media flow.
Read the full abstract

Optimization and Control

Beyond binarity: Semidefinite programming for ternary quadratic problems

We study the ternary quadratic problem (TQP), a quadratic optimization problem with linear constraints where the variables take values in $\{0, \pm 1\}$. While semidefinite programming (SDP) techniques are well established for $\{0,1\}$- and $\{\pm 1\}$-valued quadratic problems, no dedicated integer semidefinite programming framework exists for the ternary case. In this paper, we introduce a ternary SDP formulation for the TQP that forms the basis of an exact solution approach. We derive new theoretical insights in rank-one ternary positive semidefinite matrices, which lead to a basic SDP relaxation that is further strengthened by valid triangle, RLT, split and $k$-gonal inequalities. These are embedded in a tailored branch-and-bound algorithm that iteratively solves strengthened SDPs, separates violated inequalities, applies a ternary branching strategy and computes high-quality feasible solutions. We test our algorithm on TQP variations motivated by practice, including unconstrained, linearly constrained and quadratic ratio problems. Computational results on these instances demonstrate the effectiveness of the proposed algorithm.
Read the full abstract

All authors Frank de Meijer, Veronica Piccialli, Renata Sotirov, Antonio M. Sudoso

Differential Geometry

A note on Ricci flow from small curvature concentration and a Morrey-type condition

In \cite{ChauMartens} the authors proved the long-time existence of Ricci flow starting from complete bounded curvature Riemannian manifolds with scale-invariant integral curvature bounded by a dimensional constant times the inverse of the Sobolev constant. We generalize this result by replacing the bounded curvature assumption with the assumption that $g$ is only equivalent to a complete bounded curvature metric $h$ while satisfying a Morrey-type condition on the gradient of $g$ relative to $h$: a local integral condition on the covariant derivative $\nabla_h g$. The Morrey-type condition was first considered in \cite{LeeLiu} in the context of Ricci flow on non-compact manifolds, and in particular allows the possibility for $g$ to have unbounded curvature on $M$. As in \cite{ChauMartens}, our long-time solution enjoys curvature decay estimates implying in particular that $M$ is diffeomorphic to $\mathbb{R}^n$.
Read the full abstract

Mathematical Physics

Remarks on "Further comments on "Rebuttal of "Refutation of "Comment on "Reply to "Comments on "A genuinely natural information measure" " " " " " "

It's a bit tedious, but as John Doe and Jean Roe have insisted on offering further comments on our comprehensive refutation of the former's already tiringly obstinate advances, we feel compelled to review their not even wrong opinions once again, hoping to put some sense back into the discourse.
Read the full abstract

Quantum Algebra

The Drinfeld Center of the Generic Temperley–Lieb Category

We show that the Temperley–Lieb category $\mathbf{TL}(q;\mathbb{C})$ embeds in an ultraproduct of modular tensor categories when $q$ is not a root of unity. As a result, we show that its Drinfeld center is semisimple and describe its simple objects. The canonical functor $$\mathbf{TL}(q;\mathbb{C})\boxtimes \mathbf{TL}(q;\mathbb{C})^{\mathrm{rev}} \boxtimes \mathbf{Rep}(\mathbb{Z}/2\mathbb{Z}) \to \mathcal Z(\mathbf{TL}(q;\mathbb{C})),$$ induced by the braiding and the $\mathbb{Z}/2\mathbb{Z}$–grading on the Temperley–Lieb category, is thus shown to be a monoidal equivalence, which becomes a braided equivalence upon twisting the braiding by a certain bicharacter. Along the way, we formalize some general results about ultraproducts of tensor categories and tensor functors, building on earlier works of Crumley, Harman, and Flake–Harman–Laugwitz. We also discuss the center at some exceptional values of $q$.
Read the full abstract

Numerical Analysis

A Spectral Preconditioner for the Conjugate Gradient Method with Iteration Budget

We study the solution of large symmetric positive-definite linear systems in a matrix-free setting with a limited iteration budget. We focus on the preconditioned conjugate gradient (PCG) method with spectral preconditioning. Spectral preconditioners map a subset of eigenvalues to a positive cluster via a scaling parameter, and leave the remainder of the spectrum unchanged, in hopes to reduce the number of iterations to convergence. We formulate the design of the spectral preconditioners as a constrained optimization problem. The optimal cluster placement is defined to minimize the error in energy norm at a fixed iteration. This optimality criterion provides new insight into the design of efficient spectral preconditioners when PCG is stopped short of convergence. We propose practical strategies for selecting the scaling parameter, hence the cluster position, that incur negligible computational cost. Numerical experiments highlight the importance of cluster placement and demonstrate significant improvements in terms of error in energy norm, particularly during the initial iterations.
Read the full abstract

All authors Youssef Diouane, Selime Gürol, Oussama Mouhtal, Dominique Orban

Dynamical Systems · Cross-listed from eess.SY

Koopman Operator Framework for Modeling and Control of Off-Road Vehicle on Deformable Terrain

This work presents a hybrid physics-informed and data-driven modeling framework for predictive control of autonomous off-road vehicles operating on deformable terrain. Traditional high-fidelity terramechanics models are often too computationally demanding to be directly used in control design. Modern Koopman operator methods can be used to represent the complex terramechanics and vehicle dynamics in a linear form. We develop a framework whereby a Koopman linear system can be constructed using data from simulations of a vehicle moving on deformable terrain. For vehicle simulations, the deformable-terrain terramechanics are modeled using Bekker-Wong theory, and the vehicle is represented as a simplified five-degree-of-freedom (5-DOF) system. The Koopman operators are identified from large simulation datasets for sandy loam and clay using a recursive subspace identification method, where Grassmannian distance is used to prioritize informative data segments during training. The advantage of this approach is that the Koopman operator learned from simulations can be updated with data from the physical system in a seamless manner, making this a hybrid physics-informed and data-driven approach. Prediction results demonstrate stable short-horizon accuracy and robustness under mild terrain-height variations. When embedded in a constrained MPC, the learned predictor enables stable closed-loop tracking of aggressive maneuvers while satisfying steering and torque limits.
Read the full abstract