Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 31 March
Optimal scheduling of batteries has significant potential to reduce electricity costs and to enhance grid resilience. However, effective battery scheduling must account for both physical constraints as well as uncertainties in consumption and generation of renewable energy sources. Instead of optimizing fixed battery power setpoints, we propose an approach that optimizes battery power intervals, allowing the optimization to explicitly account for uncertain consumption and generation as well as how the battery system should respond to them within its physical limits. Our method is based on mixed random variables, represented as mixtures of discrete and continuous probability distributions. Building on this representation, we develop an analytical stochastic formulation for minimizing electricity costs in a residential setting with load, photovoltaics, and battery storage. We demonstrate its effectiveness across real-world data from 15 residential buildings over five consecutive months. Compared with deterministic and probabilistic benchmark controllers, the proposed interval-based optimization achieves the lowest costs. These results show that mixed random variables are a practical and promising tool for decision-making under uncertainty.
Combinatorics
Resolving problems on polynomial characterizations of daisy cubes and extensions
Let $X\subseteq\{0,1\}^n$ be a set of binary strings of length $n$. The daisy cube $Q_n(X)$ is the subgraph of the hypercube $Q_n$ induced by the union of the intervals $I(0^n,x)$ for $x\in X$. As a subclass of partial cubes, it generalizes Fibonacci cubes and Lucas cubes. For a graph $G$ and a vertex $u\in V(G)$, the generating function of the number of $k$-cubes (resp. $k$-cubes at distance $d$ from $u$, and vertices at distance $d$ from $u$) is called the cube polynomial $C_G(x)$ (resp. the distance cube polynomial $D_{G,u}(x,y)$, and the distance polynomial $W_{G,u}(x)$). Let $G$ be a partial cube embedded into the hypercube $Q_n$ with $0^n \in V(G)$. In this paper, we prove that $G$ is a daisy cube if and only if one of the following equivalent conditions holds: (1) $C_{G}(x)=W_{G,0^n}(x+1)$; (2) $D_{G,0^n}(x,y)=W_{G,0^n}(x+y)$; (3) $D_{G,0^n}(x,y)=C_{G}(x+y-1)$. In particular, the results related to (1) and (3) give affirmative answers to two open problems posed by Klavžar and Mollard (2019). Meanwhile, our results yield non-constructive characterizations of daisy cubes, which answer the question posed by Taranenko (2020). Further, we prove that $D_{G, u}(x, y)\leq W_{G, u}(x+y)$ and $C_{G}(x)\leq W_{G, u}(x+1)$ among the whole class of partial cubes. Besides, combined with another sharp upper bound $Cl_{G^\#}(x+1)$ for $C_G(x)$ due to Xie et al.(2024), we obtain polynomial characterizations of simplex graphs (a subclass of daisy cubes): $G$ is a simplex graph if and only if $W_{G, 0^n}(x)=Cl_{G^\#}(x)$, here $Cl_{G^\#}(x)$ is the clique polynomial of the crossing graph $G^\#$ of $G$.
Read the full abstract
Algebraic Topology
Structured flow categories and twisted presheaves
An orientation theory for flow categories without bubbling is determined by a functor of $\infty$-categories $\mu \colon \mathcal{C} \to U/O$. For any such functor, we construct a stable $\infty$-category $\mathcal{F}low^{\mu}$ of $\mu$-structured flow categories and bimodules. We also construct the expected functors between such $\infty$-categories, giving a tractable framework for manipulating orientations, local systems, and filtrations in exact Floer homotopy theory. Classifying spaces for certain bordism theories determined by $\mu$ appear as mapping spaces in $\mathcal{F}low^{\mu}$, and we use a Pontrjagin–Thom construction to naturally identify $\mathcal{F}low^{\mu}$ with the $\infty$-category of $\mu$-twisted presheaves on $\mathcal{C}$.
Read the full abstract
Category Theory
Clock systems for stochastic and non-deterministic categorical systems theories
One of the characteristic features of categorical systems theory is that the behavior of systems can be characterized by certain morphisms into them. In other words, behaviors form a representable covariant functor to Set. And more generally, in the compositional setting, behaviors form a representable double functor to Span. Clock systems are convenient because behavior functors represented by clock systems are automatically well-behaved. It was previously not known whether stochastic and non-deterministic systems theories have clock systems. In this paper, we show that indeed they do have clock systems. Moreover, the clock systems for non-deterministic systems point to generalized notions of behavior for non-linear time.
Read the full abstract
Probability
Randomstrasse101: Open Problems of 2025
Randomstrasse101 is a blog dedicated to Open Problems in Mathematics, with a focus on Probability Theory, Computation, Combinatorics, Statistics, and related topics. This manuscript serves as a stable record of the Open Problems posted in 2025, with the goal of easing academic referencing. The blog can currently be accessed at randomstrasse101.math.ethz.ch
Read the full abstract
Optimization and Control
A Mollification Approach to Ramified Transport and Tree Shape Optimization
The paper analyzes a mollification algorithm, for the numerical computation of optimal irrigation patterns. This provides a regularization of the standard irrigation cost functional, in a Lagrangian framework. Lower semicontinuity and Gamma-convergence results are proved. The technique is then applied to some numerical optimization problems, related to the optimal shape of tree roots and branches.
Read the full abstract
Algebraic Geometry · Cross-listed from cs.LG
The Geometry of Polynomial Group Convolutional Neural Networks
We study polynomial group convolutional neural networks (PGCNNs) for an arbitrary finite group $G$. In particular, we introduce a new mathematical framework for PGCNNs using the language of graded group algebras. This framework yields two natural parameterizations of the architecture, based on Hadamard and Kronecker products, related by a linear map. We compute the dimension of the associated neuromanifold, verifying that it depends only on the number of layers and the size of the group. Furthermore, we show the general fiber of both parameterizations is trivial up to the regular group action and rescaling. Hence both parametrization maps are identifiable.
Read the full abstract
Number Theory
On Diophantine pairs and triples of triangular numbers
We investigate Diophantine pairs and triples of triangular numbers with the property $D(a)$ for a non-zero integer $a$. We prove that if a triangular number belongs to a $D(a)$-pair, it can be extended to infinitely many $D(a)$-triples of triangular numbers. Additionally, we determine infinite families of integers $a$ that admit such pairs, as well as families for which no $D(a)$-pairs can exist.
Read the full abstract
Functional Analysis
Estimates for tail functions under Riesz transforms in Grand Lebesgue Spaces
We study the tail behaviour of measurable functions under generalized Riesz-type operators in the framework of Grand Lebesgue Spaces. By exploiting the connection between the growth of $L^p$ norms and the Young–Fenchel transform, we derive explicit tail estimates from suitable $L^p$ bounds. We also present model examples and apply the abstract result to the classical Riesz transforms, showing how the $L^p$ growth of the operator interacts with the intrinsic tail behaviour of the input function.
Read the full abstract
Mathematical Physics
Ground state energy of the Bose–Hubbard model with large coordination number with a polaron-type quantum de Finetti theorem
We consider the ground state energy of the Bose–Hubbard model on a graph with large and homogeneous coordination number. In the limit of infinite coordination number, we prove convergence of the ground state energy to the minimizer of a mean-field energy functional. This functional is obtained by averaging the hopping term over the large number of connected sites, while the interaction energy is not averaged. Hence, the resulting mean-field description is in the strong coupling regime, and is expected to provide a qualitatively correct picture of the phase diagram of the Bose–Hubbard model for large enough coordination number. For our proof, we develop a new version of a de Finetti-type theorem, which we call the polaron-type quantum de Finetti theorem, and which we expect to be a more broadly useful extension of existing quantum de Finetti results. Our theorem covers the case where the Hilbert space is a tensor product of some Hilbert space with a bosonic Fock space. This theorem is applied to the convergence of the ground state energy of the Bose–Hubbard model after reducing it to a polaron-type model.
Read the full abstract
Probability
Accessibility Percolation with Rough Mount Fuji labels
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label vertex $v$ with $X_v = U_v + \theta d(\rho,v)$. We say that accessibility percolation occurs if there is an infinite path started from $\rho$ along which the vertex labels are increasing. When the graph is a Bienaymé-Galton-Watson tree, we give an exact characterisation of the critical value $\theta_c$ such that there is accessibility percolation with positive probability if and only if $\theta>\theta_c$. We also give more explicit bounds on the value of $\theta_c$. The lower bound holds for a much more general class of trees. When the graph is the lattice $\mathbb{Z}^n$ for $n\ge 2$, we show that there is a non-trivial phase transition and give some first bounds on $\theta_c$. To do this we introduce a novel coupling with oriented percolation.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Distributed Predictive Control Barrier Functions: Towards Scalable Safety Certification in Modular Multi-Agent Systems
We consider safety-critical multi-agent systems with distributed control architectures and potentially varying network topologies. While learning-based distributed control enables scalability and high performance, a lack of formal safety guarantees in the face of unforeseen disturbances and unsafe network topology changes may lead to system failure. To address this challenge, we introduce structured control barrier functions (s-CBFs) as a multi-agent safety framework. The s-CBFs are augmented to a distributed predictive control barrier function (D-PCBF), a predictive, optimization-based safety layer that uses model predictions to guarantee recoverable safety at all times. The proposed approach enables a permissive yet formal plug-and-play protocol, allowing agents to join or leave the network while ensuring safety recovery if a change in network topology requires temporarily unsafe behavior. We validate the formulation through simulations and real-time experiments of a miniature race-car platoon.
Read the full abstract
Group Theory
A note on right-angled Artin subgroups of one-relator groups
We give a short proof of the following result due to Howie: if $A(\Gamma)$ is a right-angled Artin group embedding into some one-relator group, then $\Gamma$ is a finite forest. The proof only uses elementary Bass–Serre theory and classical properties of one-relator groups.
Operator Algebras
Separable neighbourhood of identity in C$^{\ast}$-algebras
We study the structure of separable elements in bipartite C$^{\ast}$-algebras, focusing on the existence and size of a separable neighbourhood around the identity element. While this phenomenon is well understood in the finite-dimensional setting, its extension to general C$^{\ast}$-algebras presents additional challenges. We show that the problem of determining such a neighbourhood can be reduced to estimating the completely bounded norm of contractive positive maps. This approach allows us to characterize the size of such neighbourhoods in terms of structural properties of the algebra, notably its rank. As a consequence, we also resolve a recent conjecture of Musat and Rørdam.
Read the full abstract
Probability · Cross-listed from cs.LG
Total Variation Guarantees for Sampling with Stochastic Localization
Motivated by the success of score-based generative models, a number of diffusion-based algorithms have recently been proposed for the problem of sampling from a probability measure whose unnormalized density can be accessed. Among them, Grenioux et al. introduced SLIPS, a sampling algorithm based on Stochastic Localization. While SLIPS exhibits strong empirical performance, no rigorous convergence analysis has previously been provided. In this work, we close this gap by establishing the first guarantee for SLIPS in total variation distance. Under minimal assumptions on the target, our bound implies that the number of steps required to achieve an $\varepsilon$-guarantee scales linearly with the dimension, up to logarithmic factors. The analysis leverages techniques from the theory of score-based generative models and further provides theoretical insights into the empirically observed optimal choice of discretization points.
Read the full abstract
Functional Analysis
Translation complete subgroups of affine Weyl-Heisenberg groups and their generalized wavelet systems
The $n$-dimensional affine Weyl-Heisenberg group is a Lie group typically parameterized as $G_{aWH} = \mathbb{T} \times \mathbb{R}^n \times \widehat{\mathbb{R}^n} \times \mathrm{GL}(n, \mathbb{R})$, generated by all translation, dilation, and modulation operators acting on $L^2(G)$. It was introduced by Torrésani and his coauthors as a common framework to discuss both wavelet and time-frequency analysis, as well as possible intermediate constructions. In this paper, we focus on a particular class of subgroups of $G_{aWH}$, namely those of the form $G = \mathbb{T} \times \mathbb{R}^n \times V \times H$, where $V$ is a subspace of $\mathbb{R}^n$ and $H$ is a closed subgroup of $\mathrm{GL}(n, \mathbb{R})$. The main goal is to identify pairs $(V, H)$ that ensure the existence of an associated inversion formula, through the notion of square-integrable representations. We derive an admissibility criterion that is largely analogous to the well-known Calderón condition for the fully affine case, corresponding to $V = \{ 0 \}$. %The criteria for such a characterization can be formulated and proved in a way that is in many respects analogous to the affine case. We then identify $G_{aWH}$ as a subgroup of the semidirect product of the $n$-dimensional Heisenberg group and the symplectic group $Sp(n,\mathbb{R})$, which acts via the extended metaplectic representation, and compare our admissibility conditions to existing criteria based on Wigner functions. Finally, we present a list of novel examples in dimensions two and three which illustrate the potential of our approach, and present some foundational results regarding the systematic construction, classification, and conjugacy of these groups.
Read the full abstract
Probability
Multitype PCR branching processes
To model amplification Polymerase Chain Reaction (PCR) techniques targeting DNA sequences of several types, we introduce a multitype PCR branching process as a generalized version of the Michaelis-Menten-based branching process model introduced in Jagers-Klebaner, 2003. We establish two limit theorems extending the results of Chigansky-Jagers-Klebaner, 2018 to the multitype case.
Read the full abstract
Combinatorics
A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
We investigate the minimum number of cliques of orders $3$, $4$, and $5$ needed to cover the edges of $K_{33}$ with zero excess. General covering results yield the lower bound 57. The main result of the paper is that no decomposition of $K_{33}$ into $57$ blocks from $\{K_3,K_4,K_5\}$ exists. Our approach is algorithmic and relies on a layered exact-search pipeline rather than a single monolithic solver. We combine symmetry reduction, enumeration of local signatures, arithmetic profile restrictions, geometric tests for partial configurations, SAT realisation on reduced instances, and final decoding checks. The benchmark comparison shows that this structured approach is substantially more effective than direct ILP, DLX, or SAT formulations on the full problem. As a consequence, we obtain $C^\xi(33,\{3,4,5\},2)\ge 58$. A short additional counting argument further strengthens this to $C^\xi(33,\{3,4,5\},2)\ge 59$. We also give new compressed proofs for the known exceptional cases $K_{18}$ and $K_{19}$ in the setting of $\{K_3,K_4\}$-decompositions, illustrating the same combination of theoretical reduction and exact computation. Finally, we explain the relevance of the $K_{33}$ result to the open packing problem of determining the packing number $D(33,5,2)$. A packing of $51$ copies of $K_5$ in $K_{33}$ would leave a $4$-regular graph on $9$ vertices, and our exclusion already rules out two natural candidate leave structures.
Read the full abstract
Differential Geometry
Non-uniqueness and symmetries for the Nirenberg problem using computer assistance
We apply verified numerics to the Nirenberg problem, proving that a genuine solution exists near two given computer-generated approximate solutions. This proves existence of a solution for a particular prescribed curvature that was previously predicted, but not proved, to exist. We are also able to determine the symmetry groups of the genuine solutions exactly, which in one case is different from the symmetry of the prescribed curvature. We expect the computer code for this proof can be reused to study other aspects of the Nirenberg problem.
Read the full abstract
Algebraic Geometry · Cross-listed from cs.CG
Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
Computing the Voronoi diagram of mixed geometric objects in $R^3$ is challenging due to the high cost of exact geometric predicates via Cylindrical Algebraic Decomposition (CAD). We propose an efficient exact verification framework that characterizes the parameter space connectivity by computing certified topological transition sets. We analyze the fundamental non-quadric case: the trisector of two skew lines and one circle in $R^3$. Since the bisectors of circles and lines are not quadric surfaces, the pencil-of-quadrics analysis previously used for the trisectors of three lines is no longer applicable. Our pipeline uses exact symbolic evaluations to identify transition walls. Jacobian computations certify the absence of affine singularities, while projective closure shows singular behavior is isolated at a single point at infinity, $p_{\infty}$. Tangent-cone analysis at $p_{\infty}$ yields a discriminant $\Delta_Q = 4ks^2(k-1)$, identifying $k=0,1$ as bifurcation values. Using directional blow-up coordinates, we rigorously verify that the trisector's real topology remains locally constant between these walls. Finally, we certify that $k=0,1$ are actual topological walls exhibiting reducible splitting. This work provides the exact predicates required for constructing mixed-object Voronoi diagrams beyond the quadric-only regime.
Read the full abstract
Probability
Linear Risk Sharing in Community-Based Insurance: Ruin Reduction in the Compound Poisson Model
This paper studies proportional risk sharing at claim occurrence time in community-based insurance. Each participant is modeled by an individual Cramér-Lundberg surplus process, and, whenever a claim is reported within the pool, its cost is redistributed according to a fixed allocation matrix. We compare the infinite-time ruin probability of each participant under stand-alone operation and under pool participation. Our main result shows that pooling reduces, for every participant, the infinite-time ruin probability when claim severities belong to a common scale family, the allocation rule satisfies full allocation and actuarial fairness, and each transfer remains bounded by an individual capacity condition. The proof relies on a convex-order comparison between the losses borne inside the pool and the corresponding stand-alone losses. We also clarify the role of these assumptions by showing that, outside this framework, pooling need not be beneficial for all participants. Numerical illustrations with Exponential and LogNormal severities support the theoretical findings and highlight how the design of proportional sharing rules affects solvency. The paper thus provides simple and interpretable sufficient conditions under which transparent linear risk-sharing arrangements improve individual solvency in community-based insurance.
Read the full abstract
Logic
AKE principles for deeply ramified fields
We study the model theory of deeply ramified fields of positive characteristic. Generalizing the perfect case treated in work by Jahnke and Kartas on the model theory of perfectoid fields, we obtain Ax-Kochen/Ershov principles for certain deeply ramified fields of positive characteristic and fixed degree of imperfection. Our results apply in particular to all deeply ramified henselian valued fields of rank 1.
Read the full abstract
Group Theory
Geometric Inverse Semigroup Theory: a note on the Milnor-Schwarz Lemma for inverse monoids
We generalise the Milnor-Schwarz lemma to inverse monoids acting on presheaves of geodesic metric spaces. We provide two proofs of this fact: one only uses elementary techniques, inspired by the arguments for group actions on metric spaces; the other involves a version of the Vietoris-Rips complex, and builds on work of Chung-Martínez-Szakács.
Read the full abstract
Logic
A General Theory of Class Symmetric Systems
We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present sufficient conditions for the preservation of the axioms of Gödel-Bernays set theory (without the axiom of choice), and for the forcing theorem to hold for class-sized symmetric systems.
Read the full abstract
Commutative Algebra
The $v$-number of generalized binomial edge ideals of some graphs
Let $G$ be a finite connected simple graph, and let $\mathcal{J}_{K_m,G}$ denote its generalized binomial edge ideal. By investigating the colon ideals of $\mathcal{J}_{K_m,G}$, we derive a formula for the local $\mathrm{v}$-number of $\mathcal{J}_{K_m,G}$ with respect to the empty cut set. Furthermore, we classify graphs for which this generalized binomial edge ideal has $\mathrm{v}$-numbers $1$ or $2$. When $G$ is a connected closed graph, we compute the local $\mathrm{v}$-number of $\mathcal{J}_{K_2,G}$ by generalizing the work of Dey et al. Additionally, under the condition that $G$ is Cohen–Macaulay, we derive formulas for the $\mathrm{v}$-number of $\mathcal{J}_{K_m,G}$ and $\mathcal{J}_{K_2,G}^k$, and show that the $\mathrm{v}$-number of $\mathcal{J}_{K_2,G}^k$ is a linear function of $k$.
Read the full abstract
Mathematical Physics
Derivative relations for determinants, Pfaffians and characteristic polynomials in random matrix theory
Explicit expressions are proven for derivatives of the ratio of a determinant or Pfaffian determinant and a Vandermonde determinant. Such ratios appear for example in general group integrals of Harish-Chandra–Itzykson–Zuber type and in expectation values of products of characteristic polynomials in random matrix theory. In the latter case we start from known results for general non-Hermitian and Hermitian ensembles for expectation values without derivatives, at finite matrix size. They are given in terms of the determinant or Pfaffian of the corresponding kernel, for unitary or orthogonal and symplectic ensembles, respectively. Several equivalent expressions are proven for general ratios of determinants, starting from first order derivatives containing the Borel transform of the corresponding matrix or kernel. Higher order derivatives are expressed as sums over partitions containing determinants of derivatives of these, with coefficients given in terms of combinatorial expressions. Our most general result is valid for mixed higher order derivatives of ratios of determinants in several variables. This generalises previous findings, e.g. for mixed moments in specific ensembles of random matrices, relevant in applications to the Riemann $\zeta$-function. Applications of our results to several examples are presented, including the complex Ginibre ensemble and the circular unitary ensemble.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Model Predictive Path Integral PID Control for Learning-Based Path Following
Classical proportional–integral–derivative (PID) control remains widely used in industrial control systems, while model predictive control (MPC) is actively studied to achieve higher performance for systems with nonlinear dynamics. Model predictive path integral (MPPI) control is a sampling-based MPC method that optimizes control inputs without gradient calculations and can handle non-differentiable models and objective functions. However, conventional MPPI directly samples control-input sequences, which can produce large temporal input increments and causes the optimization dimension to grow with the prediction horizon. This study proposes MPPI–PID control, which uses MPPI to optimize PID gains online instead of directly optimizing the control-input sequences. By replacing high-dimensional input-sequence optimization with low-dimensional gain-space optimization while retaining the PID structure, the proposed formulation improves sampling efficiency and promotes smoother control inputs. Theoretical analyses are provided for a unified path-integral update, the relation between optimization dimension and effective sample size, and the temporal correlation of input perturbations induced by the PID structure. The method is evaluated on a learning-based path following of a mini forklift using a residual-learning dynamics model that combines a physical model and a neural network identified from real-machine driving data. Numerical results show that MPPI–PID improves tracking performance over fixed-gain PID, yields smaller input increments than conventional MPPI, and maintains favorable performance under reduced sampling budgets.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Flatness-based control of a Timoshenko beam
The paper presents an approach to flatness-based control design for hyperbolic multi-input systems, building upon the hyperbolic controller form (HCF). The transformation into HCF yields a simplified system representation that considerably facilitates the design of state feedback controllers for trajectory tracking. The proposed concept is demonstrated for a Timoshenko beam and validated through numerical simulations, demonstrating trajectory tracking and closed-loop stability.
Read the full abstract
Statistics Theory
Inference in covariate-adjusted bipartite network models
In this paper, we introduce a general model for jointly modelling the nodal heterogeneity and covariates in weighted or unweighted bipartite networks, which contains two different types of nodes. The model has a degree heterogeneity parameter for each node and a fixed-dimensional regression coefficient for the covariates. We use the method of moments to estimate the unknown parameters. When the model belongs to the exponential family of distributions, the moment estimator is identical to the maximum likelihood estimator. We show the uniform consistency of the moment estimator, when the number of actors and the number of events both go to infinity under some conditions. Further, we derive an asymptotic representation of the moment estimator, which leads to their asymptotic normal distributions under some conditions. We present two applications to illustrate the unified results. Numerical simulations and a real-data analysis demonstrates our theoretical findings.
Read the full abstract
Classical Analysis and ODEs · Cross-listed from physics.atom-ph
Thomas-Fermi equation revisited: A variation on a theme by Majorana
Majorana found a way to exploit the scaling properties of the Thomas-Fermi equation for converting this second-order differential equation into one of first order. We explore his method for the familiar neutral-atom solution and extend it to the solution that is relevant for weakly ionized atoms. Various integrals and other quantities with importance for atomic physics are recalculated and their values compared with the ones obtained in the 1980s by more tedious numerical procedures.