Combinatorics
On the structures of {diamond, bowtie}-free graphs that do not contain an induced subdivision of $K_4$
Feng Liu, Shuang Sun and Yan Wang
A graph is $\mathrm{ISK}_4$-free if it contains no induced subdivision of $K_4$. Lévêque et al. [J. Combin. Theory Ser. B 102 (2012) 924–947] conjectured that all $\mathrm{ISK}_4$-free graphs are 4-colorable. Chen et al. [J. Graph Theory 96 (2021) 554–577] proved that $\{\mathrm{ISK}_4, \mathrm{diamond}, \mathrm{bowtie}\}$-free graphs are 4-colorable and asked whether such graphs are 3-colorable, where a diamond is $K_4$ minus one edge and a bowtie consists of two triangles sharing a vertex. In this paper, we characterize the structures of $\{\mathrm{ISK}_4, \mathrm{diamond}, \mathrm{bowtie}\}$-free graphs and prove that such graphs are 3-colorable, which answers a question of Chen et al. [J. Graph Theory 96 (2021) 554–577] affirmatively and extends a result of Chudnovsky et al. [J. Graph Theory 92 (2019) 67–95]. Furthermore, our structural
theorem yields a
polynomial-time
algorithm for decomposing $\{\mathrm{ISK}_4, \mathrm{diamond}, \mathrm{bowtie}\}$-free graphs, and consequently a
polynomial-time
algorithm for coloring this class of graphs.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.CE
Automated Grammar-based Algebraic Multigrid Design With Evolutionary Algorithms
Dinesh Parthasarathy, Wayne Mitchell, Arjun Gambhir et al. (+2 more)
Although multigrid is asymptotically optimal for solving many important partial differential equations, its efficiency relies heavily on the careful selection of the individual algorithmic components. In contrast to recent approaches that can optimize certain multigrid components using deep learning techniques, we adopt a complementary strategy, employing evolutionary
algorithms to construct efficient multigrid cycles from proven algorithmic building blocks. Here, we will present its application to generate efficient algebraic multigrid methods with so-called flexible cycling, that is, level-specific smoothing sequences and non-recursive cycling patterns. The search space with such non-standard cycles is intractable to navigate manually, and is generated using genetic programming (GP) guided by context-free grammars. Numerical experiments with the linear
algebra library, hypre, demonstrate the potential of these non-standard GP cycles to improve multigrid performance both as a solver and a preconditioner.
Read the full abstract ▾
All authors Dinesh Parthasarathy, Wayne Mitchell, Arjun Gambhir, Harald Köstler, Ulrich Rüde
Combinatorics
On the number of inequivalent linearized Reed-Solomon codes
Jonathan Mannaert, Marta Messia and Ferdinando Zullo
Linearized Reed-Solomon (LRS) codes form an important family of maximum sum-rank distance (MSRD) codes that generalize both Reed–Solomon codes and Gabidulin codes. In this paper we study the equivalence problem for LRS codes and determine the number of inequivalent codes within this family. Using the correspondence between sum-rank metric codes and systems of $\mathbb{F}_q$-subspaces, we analyze the stabilizer of the Gabidulin system and derive a characterization of equivalence between LRS codes. In particular, we prove that two LRS codes are equivalent if and only if the sets of norms that define the codes coincide up to multiplication by an element of $\mathbb{F}_q^\ast$. This description allows us to reduce the classification problem to the action of $\mathbb{F}_q^\ast$ on subsets of $\mathbb{F}_q^\ast$. As a consequence, we derive formulas for the number of inequivalent linearized Reed-Solomon codes and illustrate the results with explicit examples.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Real-Time Online Learning for Model Predictive Control using a Spatio-Temporal Gaussian Process Approximation
Lars Bartels, Amon Lahr, Andrea Carron et al. (+1 more)
Learning-based model predictive control (MPC) can enhance control performance by correcting for model inaccuracies, enabling more precise state trajectory predictions than traditional MPC. A common approach is to model unknown residual dynamics as a Gaussian process (GP), which leverages data and also provides an estimate of the associated uncertainty. However, the high computational cost of online learning poses a major challenge for real-time GP-MPC applications. This work presents an efficient implementation of an approximate spatio-temporal GP model, offering online learning at constant computational complexity. It is optimized for GP-MPC, where it enables improved control performance by learning more accurate system dynamics online in real-time, even for time-varying systems. The performance of the proposed method is demonstrated by simulations and hardware experiments in the exemplary application of autonomous miniature racing.
Read the full abstract ▾
All authors Lars Bartels, Amon Lahr, Andrea Carron, Melanie N. Zeilinger
Optimization and Control · Cross-listed from cs.LG
Benchmarking Reinforcement Learning via Stochastic Converse Optimality: Generating Systems with Known Optimal Policies
Sinan Ibrahim, Grégoire Ouerdane, Hadi Salloum et al. (+3 more)
The objective comparison of Reinforcement Learning (RL)
algorithms is notoriously complex as outcomes and benchmarking of performances of different RL approaches are critically sensitive to environmental design, reward structures, and stochasticity inherent in both algorithmic learning and environmental dynamics. To manage this complexity, we introduce a rigorous benchmarking framework by extending converse optimality to discrete-time, control-affine, nonlinear systems with noise. Our framework provides necessary and sufficient conditions, under which a prescribed value function and policy are optimal for constructed systems, enabling the systematic generation of
benchmark families via homotopy variations and randomized parameters. We validate it by automatically constructing diverse environments, demonstrating our framework's capacity for a controlled and comprehensive evaluation across
algorithms. By assessing standard methods against a ground-truth optimum, our work delivers a reproducible foundation for precise and rigorous RL benchmarking.
Read the full abstract ▾
All authors Sinan Ibrahim, Grégoire Ouerdane, Hadi Salloum, Henni Ouerdane, Stefan Streif, Pavel Osinenko
Combinatorics
Anticoncentration of random spanning trees in graphs with large minimum degree
Veronica Bitonti, Lukas Michel and Alex Scott
A classical result by Otter shows that the complete graph has an exponential number of non-isomorphic spanning trees. This was recently extended by Lee to every almost regular graph of sufficiently large degree. In this paper, we consider graphs of large minimum degree. We show that every connected graph $G$ with $n$ vertices and minimum degree $d$ has at least $n^{\Omega(d)}$ non-isomorphic spanning trees. This is tight up to the constant factor in the exponent. In fact, we prove the following anticoncentration result: if $\mathcal{T}$ is a uniformly random spanning tree of $G$, then for every tree $T$, the probability that $\mathcal{T}$ is isomorphic to $T$ is at most $n^{-\Omega(d)}$. This proves a
conjecture of Lee in a strong form.
Read the full abstract ▾
Functional Analysis
Constructive Peter–Weyl Theory: What Is Known and What Remains Open
Takao Inoué
What is known about constructive Peter-Weyl theory, and what remains open? This expository article separates established
theorems, comparisons between formulations, and questions requiring further investigation in the Bishop-Coquand-Spitters line. Its central finding is that constructive Peter-Weyl theory already has an established compact-group approximation core: under specified analytic and Gelfand hypotheses, finite-rank central convolution projections converge strongly in the Haar L2 norm. We make these hypotheses and the projection-kernel normalization explicit, and record the resulting spectral
Hilbert completion. This answers the question of completion affirmatively for that precise core
theorem. Broader claims about the whole classical package or its validity across constructive foundations require separate comparisons; uniform approximation, irreducible representation data, and point-set recovery are not inferred from strong convergence alone. The historical problems of left-right almost periodicity and universal Bohr compactification are examined with a dated follow-up literature review, distinguishing related progress from a verified resolution. A sufficient metric realization criterion, finite examples, and a separate nonassociative outlook clarify the scope of the established method. An extended appendix proves the classical Peter-Weyl
theorem through Haar averaging, convolution, spectral density, point separation, and irreducible orthogonality. Stage-by-stage comparisons explain which arguments transfer constructively and which require additional data or a different proof. The article therefore identifies what is proved and what additional statements or data remain to be examined, without treating an unidentified resolution as proof that a problem is currently open.
Read the full abstract ▾
Numerical Analysis
On the validity limits of the parametrisation method for invariant manifolds: an assessment of practical criteria for vibrating systems
André de Figueiredo Stabile, Aurélien Grolet, Alessandra Vizzaccaro et al. (+1 more)
The parametrisation method for invariant
manifolds is a powerful technique for deriving reduced-order models in the context of nonlinear vibrating systems, allowing accurate computations of nonlinear normal modes. Thanks to arbitrary order asymptotic expansions, converged results are within reach and directly applicable to finite element structures. However, since it relies on a local theory and asymptotic expansions, the results are only valid up to a given amplitude, which defines the convergence radius of the approximation. The aim of this contribution is to investigate the validity limits of the approach and review the existing error estimates, with the concrete objective of proposing a practical approach to estimate the validity range during the computation, thus producing safe bounds within which the reduced-order model can be used. Three different criteria are assessed. The first one uses the error in the invariance equation as the distance to the fixed point increases. The second one is adapted from an upper bound criterion derived for normal form transforms and based on the potential singularities of the homological operator. The third one uses Cauchy and d'Alembert convergence rules for series. The criteria are tested on a number of different examples that are representative of the situations encountered when dealing with nonlinear vibrations. The Duffing equation serves as a first
benchmark that allows considering conservative oscillations, forced systems at primary resonance, and superharmonic resonance. The investigations are then extended to a vibrating system with two degrees of freedom. Finally, the different criteria are assessed on a finite element beam structure, and guidelines are formulated to generalise their practical use and produce accurate and easy-to-use error bounds in the context of model order reduction for nonlinear vibrating structures.
Read the full abstract ▾
All authors André de Figueiredo Stabile, Aurélien Grolet, Alessandra Vizzaccaro, Cyril Touzé
Number Theory
Decidability of singularities in the Ekedahl–Oort stratification
Jean-Stefan Koskivirta and Lorenzo La Porta
For an abelian type Shimura variety and an odd
prime $p$ of good reduction, we characterize the regularity in codimension one of Zariski closures of Ekedahl–Oort strata in terms of the Frobenius action on the root datum. We give an
algorithm that detects codimension one singularities for arbitrary Ekedahl–Oort strata. When the Shimura datum is of split type, we relate the singularities of Ekedahl–Oort strata to a stack of $G$-zips over the complex numbers. We study the existence of generalized Hasse invariants on this stack.
Read the full abstract ▾
Analysis of PDEs
An optimal control approach to nonlinear wave speed selection in reaction-diffusion equations
Rebecca M. Crossley, Carles Falco and Ruth E. Baker
Travelling wave solutions of reaction-
diffusion equations are widely used to model the spatial spread of populations and other phenomena in biology and physics. In this article, we reinterpret the classical variational principle approach through an optimal control formulation, in order to obtain a lower bound on the invasion speed of travelling wave solutions in systems of nonlinear partial differential equations. We begin by analysing single-species models, where the
evolution of the density is governed by a scalar equation with a density-dependent
diffusion term and a nonlinear reaction term. We show that for any admissible test function, maximising with respect to the parameter of interest yields a bound on the travelling wave speed. We apply this framework to several examples, including the porous-Fisher equation, and examine when nonlinear selection mechanisms dominate over the classical linear marginal stability criterion. Extending this approach, we then consider multi-species systems of reaction-
diffusion equations and, reframed as Pontryagin-type optimality systems, we derive analogous bounds on the travelling wave speed using a variational framework under weak coupling. Finally, we employ numerical simulations to confirm the accuracy of the predicted wave speeds across a range of illustrative examples.
Read the full abstract ▾
Complex Variables
Moduli difference of initial inverse logarithmic coefficients for starlike and convex functions
Molla Basir Aahmed and Partha Pratim Roy
Let $\mathcal{A}$ denote the class of functions $f$ that are analytic in the open unit disk $\mathbb{D}$ and satisfy the normalization conditions $f(0) = 0$ and $f'(0) = 1$. This paper investigates the inverse logarithmic coefficients $\Gamma_n$, which are defined by the expansion $\log(f^{-1}(w)/w) = 2\sum_{n=1}^{\infty} \Gamma_n w^n$. We establish sharp upper and lower bounds for the difference of the
moduli of the first two inverse logarithmic coefficients, $|\Gamma_2| - |\Gamma_1|$, for several significant subclasses of univalent functions. Specifically, we derive sharp estimates for functions belonging to the class of starlike functions with respect to symmetric points ($\mathcal{S}_S^*$), convex functions with respect to symmetric points ($\mathcal{K}_S$), and functions associated with the lune domain ($\mathcal{S}_{\leftmoon}^*$ and $\mathcal{C}_{\leftmoon}$). The results are obtained by employing subordination techniques and utilizing sharp estimates for the coefficients of Schwarz functions. In each case, the extremal functions that attain these bounds are explicitly identified. Our findings provide further insights into the
geometric properties of inverse mappings and extend recent research on coefficient functionals in
geometric function theory.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Prediction with Missing Data: Target Probabilities and Missingness Mechanisms
Pierre Catoire, Robin Genuer and Cecile Proust-Lima
Conditions ensuring optimal parameter estimation in the presence of missing data are well established in inference, typically relying on the Missing-at-Random (MAR) assumption. In prediction, similar principles are often assumed to apply. However, methods considered biased in inference, such as pattern sub-modelling or unconditional imputation, have been shown to achieve optimal predictive performance under any missingness mechanism, including non-MAR (MNAR). To explain this apparent contradiction, we introduce a new formal framework for describing missingness in prediction. Central to this framework is a distinction between two prediction targets, defined according to whether or not the indicator of observation of the predictors is exploited to predict the outcome. This distinction leads to a classification of the missingness mechanisms describing the conditions under which these targets are equal, and when consistent prediction of each is achievable. A key result is that both targets may be consistently predicted under conditions weaker than MAR. We discuss the implications of this paradigm for handling missing data in prediction, distinguishing between missingness at development, validation and deployment of a forecaster. The findings are illustrated using simulated data and a real-world application with the prediction of significant injury after trauma upon arrival at the emergency department.
Read the full abstract ▾
Dynamical Systems
Zero entropy cycles on trees: from Topology to Combinatorics and an application to star maps
D. Juher, F. Mañosas and D. Rojas
In this paper we give a fully combinatorial description of the zero
entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of the pattern and provides, thus, a practical and fast
algorithm to test zero
entropy. As an application, consider a $k$-
star $T$ (a tree with $k$ edges attached at a unique branching point of valence $k$) and the set $\mathcal{F}_{n,k}$ of all continuous maps $\map{f}{T}$ having a periodic orbit of period $n$ properly contained in $T$ (each edge of $T$ contains at least one point of the orbit). We find all pairs $(n,k)$ such that $\mathcal{F}_{n,k}$ contains maps of
entropy zero, and we describe the patterns of such zero-
entropy orbits.
Read the full abstract ▾
Group Theory
Property (LR) and an embedding theorem for virtually free groups
Ashot Minasyan
We prove that every virtually free group $G$ has property (LR) of Long and Reid: each finitely generated subgroup of $G$ is a retract of a finite index subgroup. The main ingredient in the proof is a new
embedding result stating that every countable virtually free group embeds in a double of a finite group. As a corollary, we show that any group commensurable with the direct product of a free group and a finitely generated abelian group has (LR). This applies to generalized Baumslag-Solitar groups of arbitrary rank $n \in \mathbb{N}$ with finite monodromy, which, in particular, include all non-cyclic one-relator groups with center.
Read the full abstract ▾
Combinatorics
Pretty good plus state transfer in cycles
Sarojini Mohapatra and Hiranmoy Pal
We investigate fractional revival in graphs with respect to the adjacency,
Laplacian, and signless
Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.
Read the full abstract ▾
Classical Analysis and ODEs
Quantitative harmonic approximations and Dorronsoro's Theorem in metric measure spaces
Matthew Hyde
Suppose $X$ is an $\rm{RCD}(K,N)$ space with $K \in \mathbb{R}$ and $N \in (1,\infty)$. We obtain a characterisation of the Newtonian-Sobolev space $N^{1,2}(X)$ in terms of a quantity which measures to what extent a function is locally (across all scales and locations) well-approximated by harmonic functions. A similar characterisation is obtained which further takes into account the local oscillations of the approximating harmonic functions. The first characterisation is new even when $X = \mathbb{R}^n$; the second characterisation is a version of Dorronsoro's
Theorem in RCD spaces and gives a new proof of (a special case) of this
theorem in Euclidean space.
Read the full abstract ▾
Analysis of PDEs
The relaxation limit of a homogeneous two-phase flow model: isothermal case
Huimin Yu
This paper investigates the asymptotic behavior of a
hyperbolic relaxation system designed for homogeneous two-phase flows in the limit of vanishing relaxation time. The governing equations comprise conservation laws for mixture mass and momentum, supplemented by a transport equation for the gas phase mass that includes a stiff relaxation source term. This source term drives the system toward local thermodynamic
equilibrium. Under the assumptions of constant
liquid density and an ideal isothermal gas phase, we demonstrate that, as the relaxation parameter \(\epsilon \rightarrow 0\), a subsequence of solutions \((p^{\epsilon},u^{\epsilon})\) converges strongly in \(L_{\mathrm{loc}}^{1}\) to an
entropy solution of the
equilibrium Euler system. The proof integrates several analytical techniques: the construction of a suitable
entropy pair and associated energy estimates, a transport equation approach for representing the error, commutator estimates, and the theory of compensated compactness. This work provides a rigorous justification of the relaxation limit for the homogeneous two-phase flows model.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.soc-ph
A dynamic mechanism for prevalence of triangles in competitive networks
M. N. Mooij, M. Baudena, A. S. von der Heydt et al. (+2 more)
Triangles are abundant in real-world networks but rare in standard null models for sparse graphs. Existing explanations typically rely on explicit triadic closure mechanisms or geometry-based connection rules. We propose an alternative hypothesis: the frequent appearance of triangles may arise naturally from the requirement of dynamic stability that maintains coexistence of species in Lotka-Volterra systems with equal competitive interactions. To evaluate this idea, we prove that, across all possible interaction graphs, coexistence is guaranteed whenever the coupling strength is below the reciprocal of the graph's maximum degree, and guaranteed not to occur when the coupling strength exceeds 1. This leaves a large gap that is unexplained by the graph degrees alone. We notice that the lower and upper bounds are achieved for
star and complete graphs respectively and to investigate further what structural properties of the interaction graph control the critical coupling within the gap, we optimise networks algorithmically while keeping the degree sequence fixed. We find that networks supporting stronger interaction strengths consistently exhibit higher clustering coefficients in several network models. Moreover, in real-world grassland plant networks, we observe higher clustering and stronger stability than those expected from a configuration model with the same degree sequence. Our result suggests that triangles, and clustering in general, may emerge as a structural signature of stabilising competition.
Read the full abstract ▾
All authors M. N. Mooij, M. Baudena, A. S. von der Heydt, L. Miele, I. Kryven
Quantum Algebra · Cross-listed from quant-ph
Quantum Theory Over Dual-Complex Numbers
Nathan Houyet, Dogukan Bakircioglu and Pablo Arrighi
We take
quantum theory and replace C by C[e] where e^2 = 0, i.e. we extend
quantum theory to the ring of dual complex numbers. The aim is to develop a common
language in which to treat continuous
quantum physics and discrete
quantum models in a unified manner, including their
symmetries. Since
quantum theory is linear, introducing e is enough to model infinitesimals. A first objection to this programme is that C[e] is not a field, since division by e is undefined, while
quantum mechanics typically relies on division. A second objection concerns whether unitarity still makes sense given e^2 = 0. Hence, the core of this work is dedicated to proving that dual-complex
quantum theory remains fully consistent. In particular, norm is preserved at all times, and renormalization never requires dividing by an infinitesimal. An equivalence with conventional
quantum theory is demonstrated: the dual-complex extension of a parametrized
quantum operation automatically provides a linear treatment of its first-order variations. As a first example application, we provide a unified description of both the Dirac equation in the continuum and the Dirac
Quantum Walk in the discrete. We establish the discrete Lorentz covariance of the latter.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Optimal Control for Steady Circulation of a Diffusion Process via Spectral Decomposition of Fokker-Planck Equation
Norihisa Namura and Hiroya Nakao
We present a formulation of an optimal control problem for a two-dimensional
diffusion process governed by a Fokker-Planck equation to achieve a nonequilibrium steady state with a desired circulation while accelerating convergence toward the stationary distribution. To achieve the control objective, we introduce costs for both the probability density function and flux rotation to the objective functional. We formulate the optimal control problem through dimensionality reduction of the Fokker-Planck equation via eigenfunction expansion, which requires a low-computational cost. We demonstrate that the proposed optimal control achieves the desired circulation while accelerating convergence to the stationary distribution through numerical simulations.
Read the full abstract ▾
Analysis of PDEs
On global dynamics for damped driven Jaynes-Cummings equations
A.I. Komech and E.A. Kopylova
The article concerns damped driven Jaynes-Cummings equation which describes quantised one-mode Maxwell field coupled to a two-level molecule. We consider a broad class of damping and pumping which are
polynomial in the creation and annihilation operators, and their structures correspond to the theory of completely positive and trace preserving generators (CPTP) of Lindblad and Kossakowski & al. Our main result is the construction of global generalised solutions with values in the
Hilbert space of nonnegative Hermitian
Hilbert-Schmidt operators in the case of time-dependent pumping. The proofs rely on finite-dimensional approximations of the annihilation and creation operators.
Read the full abstract ▾
Combinatorics
The inverse problem for the Steiner–Wiener index via additive number theory
Christian Bernert and Joshua Shaw
We show that, for any given $k \ge 2$, every sufficiently large number appears as the Steiner–Wiener $k$ index of a graph.
Mathematical Physics
On dynamical semigroup for damped driven Jaynes-Cummings equations
A.I. Komech and E.A. Kopylova
The article addresses the damped driven Jaynes-Cummings for quantised one-mode Maxwell field coupled to a two-level molecule. We consider a broad class of damping and pumping which are
polynomial in the creation and annihilation operators. Our main result is the construction of a contraction dynamical
semigroup in the
Hilbert space of Hermitian
Hilbert-Schmidt operators in the case of a nonpositive dissipation operator and time-independent pumping. All trajectories of the
semigroup are generalised solutions to the Jaynes-Cummings equations. As a key example, we prove nonpositivity for the basic dissipation operator of
Quantum Optics.
Read the full abstract ▾
Combinatorics
Constructing, Classifying and Studying the Space of Small Integer Weighing Matrices
Assaf Goldberger, Radel Ben-Av, Giora Dula et al. (+1 more)
Integer weighing
matrices (IW-
matrices for short) are integer valued orthogonal square
matrices. One usecase of these is to create classical weighing
matrices with various block structures. In this paper we study and classify the space $IW(n,k)$ of the integer weighing
matrices of small size $n\times n$ and weight $k$. Our classification includes a full list of all inequivalent
matrices up to Hadamard equivalence and
automorphism groups. We then continue to a secondary classification of the symmetric and antisymmetric IW up to symmetric Hadamard equivalence. We apply this to the case of projective space weighing
matrices. Next we use the classification to count the cardinality of the spaces of all $IW(n,k)$ as well as the symmetric and anti-symmetric subspace. We supply practical
algorithms and implement them in Sagemath. Finding an (anti-)symmetric IW
matrix in a given Hadamard class can be done for significantly higher orders. In particular we solve some open cases: Symmetric $W(23,16)$, $W(28,25)$ and $W(30,17)$, and an anti-symmetric $W(28,25)$. We conclude by showing a detailed classification of $IW(7,25)$. We have also improved the NSOKS
algorithm to find all possible representations of an integer $k$ as a sum of $n$ integer squares.
Read the full abstract ▾
All authors Assaf Goldberger, Radel Ben-Av, Giora Dula, Yoseph Strassler
Optimization and Control
Data-Driven Estimation of Vinnicombe metric
Margarita A. Guerrero, Henrik Sandberg and Cristian R. Rojas
Quantifying model mismatch in a control-relevant manner is fundamental in robust control. A well-known metric for this purpose is the $\nu$-gap, or Vinnicombe metric, which measures the discrepancy between a nominal model and the real system from a closed-loop viewpoint. However, its computation typically requires explicit knowledge of the true system. In this letter, we propose an identification-free, data-driven method to estimate the $\nu$-gap between discrete-time SISO systems directly from input-output experiments. The method is complemented by a data-driven winding-number test, based on Welch-type averaging, to verify a required topological condition for the computation of the metric. Numerical simulations on heavy-duty gas-turbine models and a textbook example show that the proposed estimate closely matches MATLAB$^\copyright$ gapmetric, while correctly detecting cases in which the admissibility conditions fail.
Read the full abstract ▾
Optimization and Control
Complex Markets and Mean Field Games: Beyond Basic Models
Agustín Muñoz González
This work builds on the theoretical frameworks presented in "Liquidity pools as mean field games: A new framework" and "Liquidity pools as mean field games with transaction costs" by the same author, where the strategic interactions among traders in a constant-product
market-making protocol were modelled using mean field games (MFG), first without transaction costs and then incorporating them. Here we present the formulation of a more complete model that integrates three types of
agents: traders, liquidity providers (LPs), and arbitrageurs. While we do not establish existence results for this general model, the formulation identifies the main technical difficulties and lays the groundwork for future work. The LP acts as a dominating player in the sense of 'Mean field games with a dominating player' by Bensoussan, Chau, and Yam: its strategy influences the mean field distribution of the traders, and the
equilibrium is sought as a solution to the coupled system of three problems that constitute a Major-Minor game. The arbitrageurs operate by solving the optimization problem presented in "An analysis of uniswap
markets" by Angeris et al., and their impact on the LP is captured through the loss-versus-rebalancing of "Automated
market making and loss-versus-rebalancing" by Milionis et al. The material in this article should be read as an open research proposal rather than a collection of closed results.
Read the full abstract ▾
Optimization and Control
Hierarchical Stability and Lyapunov Conditions for Linear PDEs
Matthew M. Peet
Unlike ordinary differential equations (ODEs), linear partial differential equations (PDEs) admit multiple non-equivalent notions of stability. This variety makes interpretation of Lyapunov stability results challenging. \blue{To simplify this interpretation, we propose a unified framework for hierarchical classification of notions of stability and Lyapunov conditions. To do this, for classically well-posed PDEs with admissible boundary conditions}, we define a fundamental state on $L_2$ corresponding to the minimal information needed to uniquely forward propagate the solution. Stability notions and Lyapunov functions are then defined in terms of this fundamental state. This gives rise to a hierarchy of stability notions, the weakest being fundamental state to PDE state stability. Other stability notions and Lyapunov conditions may then be interpreted relative to this weakest notion. Hierarchies are established for: Lyapunov, exponential and finite-energy stability. Sufficient Lyapunov conditions are defined in terms of operator inequalities. Illustrative examples and computational tools are provided.
Read the full abstract ▾
Optimization and Control · Cross-listed from stat.ML
Mirror Descent on Riemannian Manifolds
Jiaxin Jiang, Lei Shi and Jiyuan Tan
Mirror Descent (MD) is a scalable first-order method widely used in large-scale optimization, with applications in image processing, policy optimization, and neural network training. This paper generalizes MD to optimization on Riemannian
manifolds. In particular, we develop a Riemannian Mirror Descent (RMD) framework via reparameterization and further propose a
stochastic variant of RMD. We also establish non-asymptotic convergence guarantees for both RMD and
stochastic RMD. As an application to the Stiefel
manifold, our RMD framework reduces to the Curvilinear Gradient Descent (CGD) method proposed in [26]. Moreover, when specializing the
stochastic RMD framework to the Stiefel setting, we obtain a
stochastic extension of CGD, which effectively addresses large-scale
manifold optimization problems.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
Translation Invariance of Neural Operators for the FitzHugh-Nagumo Model
Luca Pellegrini
Neural operators (NOs) are powerful deep learning frameworks designed to learn solution operators of partial differential equations. This study evaluates the ability of NOs' to capture the stiff spatio-temporal dynamics of the FitzHugh-Nagumo model. A key contribution of this study is the assessment of the translation invariance using a novel training strategy. Models are trained using an applied current with varying spatial locations and intensities at a fixed time, while the test set presents a challenging out-of-distribution scenario where the current is translated in both time and space. This approach significantly reduces
dataset generation costs. We
benchmark seven NO architectures: Convolutional Neural Operators (CNOs), Deep Operator Networks (DeepONets), DeepONets with CNN encoders, Proper Orthogonal Decomposition DeepONets,
Fourier Neural Operators (FNOs), Tucker Tensorized FNOs, and Local Neural Operators. We evaluated these models based on their accuracy, efficiency, and inference speed. These results demonstrate that CNOs generalize well to translated test dynamics, whereas other architectures do not generalize well. On the training set, all architectures achieve comparable accuracy, with FNOs achieving the highest precision. However, this higher accuracy comes at an elevated computational cost. Meanwhile, DeepONets and their variants exhibit superior training and inference efficiency. These findings highlight the capabilities and limitations of NOs in modeling complex ionic dynamics and provide a comprehensive
benchmark for scenarios involving translated dynamics.
Read the full abstract ▾
Algebraic Geometry
Nets of quadric surfaces and plane cubics and their GIT stability
Masafumi Hattori, Theodoros Stylianos Papazachariou and Aline Zanardini
A general net of quadric surfaces, together with a choice of a base point, defines a net of plane cubics via the Gale transformation of the remaining seven base points. To both nets, one can also naturally associate the same smooth plane quartic. In this paper, we generalize the cycle of correspondences arising from nets of quadrics that define rational
elliptic threefolds and provide a complete criterion for GIT stability of the three underlying
geometric objects using birational-
geometric techniques.
Read the full abstract ▾