Optimization and Control
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
Mauro Lucci, Diego Delle Donne and Mariana Escalante
The optimal placement of measurement devices in electrical power systems is commonly modeled through the power dominating set problem. However, in real-world applications, these devices have limited capacities, leading to a capacitated variant of the problem that has received little
attention in the literature. In this work, we introduce forbidden propagation sets, novel combinatorial structures that cannot occur simultaneously in any feasible solution. This notion enables a new class of integer linear programming formulations. They combine infection-based variables with exponentially many constraints, while avoiding big-$M$ constraints. We derive structural properties, valid inequalities, and redundancy-breaking constraints, and design an efficient lazy-separation procedure based on cycle detection. Computational experiments on
benchmark instances with up to 14,000 vertices show that the proposed method achieves an average execution-time improvement of 1.7x over existing approaches adapted from the literature. Moreover, the results indicate that performance depends not only on network size, but also on capacities.
Read the full abstract ▾
Differential Geometry
Estimates on scalar curvature of self-shrinkers
Qing-Ming Cheng, Fengjiang Li and Guoxin Wei
In this paper, we study $n$-dimensional complete self-shrinkers in $\mathbb R^{n+1}$ with constant squared norm $S$ of the second fundamental form. We partially resolve the
conjecture on $n$-dimensional complete self-shrinkers in $\mathbb R^{n+1}$ with constant squared norm $S$ of the second fundamental form. Furthermore, if the scalar
curvature of an $n$-dimensional self-shrinker is constant, then we prove that the scalar
curvature $R$ satisfies $R\leq n-1$. We also classify $n$-dimensional complete self-shrinkers in $\mathbb R^{n+1}$ with non-negative constant scalar
curvature.
Read the full abstract ▾
Optimization and Control
Tight Complexity of Muon under Heavy-Tailed Noise
Jiayu Zhang and Tianyi Lin
A growing lesson from neural network optimization is that optimizer design should respect how the model is parametrized. The layerwise input-output structure of neural networks motivates
Muon and Scion, whose updates also support hyperparameter transfer. At the same time,
stochastic gradient noise in deep learning is often far from sub-Gaussian and may exhibit heavy tails. These observations have shaped recent algorithmic principles for training neural networks, yet their joint theoretical consequences are underexplored. In particular, it is unclear what dimension dependence is unavoidable for gradient-based methods when the problem class is defined using an input-output norm and the
stochastic gradient noise is heavy-tailed, and if higher-order smoothness can accelerate optimization. We study these questions through nonconvex smooth
stochastic optimization over $\mathbb{R}^{m\times n}$ equipped with general norms and under $p^\mathrm{th}$-moment heavy-tailed noise, where the goal is to achieve an $\epsilon$-stationary point in the dual norm. Our first contribution is a dimension-dependent lower bound: when $\max\{m,n\}$ is large enough, any method using only the
stochastic gradients requires $\Omega(\min\{m, n\}\epsilon^{-\frac{3p-2}{p-1}})$ oracle calls for the problem class defined by the spectral norm, which is a common input-output
matrix norm. We prove that a batched
Muon method with the spectral norm can achieve the matching upper bound of $O(\min\{m, n\}\epsilon^{-\frac{3p-2}{p-1}})$. To exploit higher-order smoothness, we propose a transported
Muon method and improve the bound to $O(\min\{m, n\}\epsilon^{-\frac{5p-3}{2p-2}})$ when the norm is spectral and the Hessian is Lipschitz. Finally, we incorporate practical heuristics into our transported method and evaluate it across multiple architectures and model sizes, showing its compatibility with neural network training.
Read the full abstract ▾
Analysis of PDEs
Nonlinear Kinetic Diffusion Equations with $p$-Growth
Helge Dietert, Lukas Niebel and Rico Zacher
We establish the local boundedness of (sub-)solutions to nonlinear kinetic
diffusion equations with $p$-growth, where the kinetic p-Laplace equation is a prototypical example. A key ingredient is the derivation of kinetic Gagliardo-Nirenberg inequalities, where the Lebesgue norm of a function is estimated in terms of its transport and diffusive directions controlled in different Lebesgue spaces.
Read the full abstract ▾
Optimization and Control
Boundary Stabilization for the Rayleigh Beam System under Event-triggered Controls
Siwen Wang, Yi Cheng, Yuhu Wu et al. (+2 more)
In this paper, we propose two event-triggered control laws incorporating an eventtriggering mechanism to tackle the boundary stabilization for the Rayleigh beam system. Under this event-triggered controls, a sufficient condition for parameter determination is constructed to guarantee the exponential stability of the closed-loop system by using the integral multiplier technique and energy perturbation method, wherein the desired exponential decay rate can be precisely determined. Numerical examples are presented to demonstrate the efficacy of the event-triggered control methodology.
Read the full abstract ▾
All authors Siwen Wang, Yi Cheng, Yuhu Wu, Yongxin Wu, Wen Kang
Algebraic Geometry · Cross-listed from hep-th
Monodromy of Calabi-Yau threefold flops via grade restriction rule and their quantum Kahler moduli
Ban Lin and Mauricio Romo
We present exact expressions, based on the grade restriction rule and window categories, for monodromies associated to certain Calabi-Yau threefold flops. We show a general formula for the monodromy action on the
lattice of B-brane charges, based on the hemisphere partition function for abelian and nonabelian gauged linear sigma models. We exploit the explicit form of the discriminant in the
quantum Kähler
moduli to further refine the form of the monodromies, in several examples, using their relation to the fundamental group of nested
torus links.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
On Piecewise Quadratic Terminal Costs for MPC
Sampath Kumar Mulagaleti, Boris Houska, Mario Zanon et al. (+1 more)
This paper presents a novel approach to synthesize stabilizing termi- nal ingredients for linear model predictive control (MPC) schemes, with the aim of increasing the region of attraction while reducing suboptimal- ity with respect to the solution of the infinite-horizon optimal control problem. It is based on the construction of a novel terminal region using methods from the field of configuration-constrained polytopic computing, along with a terminal cost that is exactly equal to the infinite-horizon linear-quadratic regulator cost in a nontrivial neighborhood of the steady- state. The practical performance of the controller is illustrated through various case studies, and comparisons with state-of-the-art approaches are presented.
Read the full abstract ▾
All authors Sampath Kumar Mulagaleti, Boris Houska, Mario Zanon, Mario E. Villanueva
Analysis of PDEs
On Heat kernel Estimtes for Brownian SDEs with Distributional Drift
Stéphane Menozzi and Stefano Pagliarani
We establish heat-kernel bounds and regularity estimates for the transition densities of the
diffusion associated with the martingale problem corresponding to the generator of a formal multidimensional Brownian SDE with singular drift. As a by-product, we also derive Schauder estimates for the associated Kolmogorov (kinetic) Cauchy problem. We consider both the cases of non-degenerate and degenerate noise (e.g. kinetic-type models), in the so-called Young regime. Namely, we consider a time inhomogeneous drift in L $\infty$ [0,T ] C $\beta$ o for some fixed time horizon T , where ), with o standing for an underlying distance, namely the usual Euclidean one in the non degenerate setting, and the scale-homogeneous one in the kinetic case. Importantly, the estimates are obtained by employing as parametrix the transition density of the SDE (with variable coefficients) without singular perturbation, as opposed to the standard Levi parametrix obtained by freezing the noise. Finally, since the noise is multiplicative, the weak well-posedness of the singular SDE is a novel result in itself, and the density estimates directly imply irreducibility and strong Feller property of its solutions.
Read the full abstract ▾
Optimization and Control
The distance-based formation controller design for multi-agent systems in port-Hamiltonian form
Jingyi Zhao, Yongxin Wu, Héctor García de Marina et al. (+2 more)
Based on the practical scenario where collisions in formation control may lead to
agent damage, this paper investigates the integrated problem of distance-based formation control and collision avoidance for multi-
agent systems governed by port-
Hamiltonian dynamics. A foundational step involves constructing a signed incidence
matrix, which, by design, corresponds to a directed acyclic graph and possesses the full column rank property. To overcome the prevalent issue of local minima in traditional artificial potential fields, a novel design utilizing attraction-only potentials is introduced, with collision avoidance rigorously enforced by safety barriers. This framework leads to a unified controller that concurrently manages velocity tracking, target formation acquisition, and inter-
agent safety. The stability of the resulting closed-loop system is guaranteed through LaSalle's invariance principle. Numerical simulations demonstrate the validity and effectiveness of the proposed control strategy.
Read the full abstract ▾
All authors Jingyi Zhao, Yongxin Wu, Héctor García de Marina, Yuhu Wu, Yann Le Gorrec
Probability
Sharp Rates of MMD Empirical Estimation with Power Kernels
Francesco Colasanto, Matteo Focardi, Massimo Fornasier et al. (+1 more)
We establish quantitative rates of convergence for the empirical estimation of probability measures by means of the Maximum Mean Discrepancy (MMD) with power kernel $K_q(x,y) = -|x-y|^q$, $q \in (0,2)$. The resulting discrepancy is the classical energy distance $$\mathcal E_q^2(\mu, \omega) = -\frac{1}{2}\iint_{\mathbb{R}^d \times \mathbb{R}^d} |x-y|^q \, d(\mu - \omega)(x)\, d(\mu - \omega)(y),$$ and we ask how fast the best $N$-point empirical approximation $\inf_{\mu_N \in \mathcal{P}^N}\mathcal{E}_q(\mu_N,\omega)$ decays as $N \to \infty$. Given a probability measure $\omega$ on $\mathbb{R}^d$ with compact support satisfying an Ahlfors regularity condition of exponent $\beta \in (0,d]$, we prove that the sharp two-sided bound $$\mathcal E_q(\mu_N, \omega) \asymp N^{-\frac{1}{2}\left(1 + \frac{q}{\beta}\right)}$$ holds both for the worst-case empirical measure $\mu_N$ (lower bound, holding for every configuration of $N$ points) and for an optimally chosen empirical measure $\mu_N$ (upper bound). This complements the qualitative consistency result of Fornasier and Hütter \cite{fornasier2014consistency}, who proved narrow convergence of the minimizers of $\mathcal E_q^2(\cdot, \omega)$ over empirical measures without quantitative rates.
Read the full abstract ▾
All authors Francesco Colasanto, Matteo Focardi, Massimo Fornasier, Francesco Mattesini
Dynamical Systems
Addendum to "Persistence and extinction in an Elk-Wolf prey-predator system with refuge and inter-regional movement. Appl. Math. Comput. 514 (2026) 129834"
Rajesh Das, Dibakar Ghosh and Sourav Kumar Sasmal
The elk - wolf model with movements between refuge and open habitat was put forward in Maji et al. (Appl. Math. Comput. 514 (2026)), which is rigorously re-examined in this remark. We re-evaluate the local and global stability analyses, especially the construction of the Lyapunov function, and provide mathematical clarifications on boundedness, model formulation, and the existence of
equilibria. The sensitivity and numerical results are re-examined for consistency and re-producibility, and the
Hopf bifurcation conditions are rederived using the proper transversality criteria. The purpose of this note is to support future studies of predator-prey systems based on refuges by offering mathematically consistent conditions.
Read the full abstract ▾
Combinatorics
The number of realisations of a random graph
Sean Dewar, Anthony Nixon and Ben Smith
Determining the number of realisations, up to isometries, of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove that, asymptotically almost surely, the $d$-dimensional complex realisation number for each $n$-vertex graph in an Erdős-Rényi random graph process is either infinite or equal to $2^{n-t}$ where $t$ is the size of the $(d+1)$-core; moreover this number coincides exactly with the real realisation number for such graphs. We also determine a similar formula for the number of complex solutions to the generic rank-$d$ positive semi-definite
matrix completion problem with randomly selected non-diagonal unknown entries.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
A characteristic function framework for chance constraint programming in stochastic model predictive control
Yuwei Ying, Johan Löfberg and Anders Hansson
The computation of chance constraints in
stochastic model predictive control is often numerically challenging due to the non-Gaussian nature of the disturbances. To overcome this problem, we propose an optimization computational framework applicable to non-Gaussian disturbances. This framework employs a numerical inversion method, utilizing the characteristic function of the disturbance distribution to compute the probability in the chance constraint as well as its gradient. To improve efficiency, it vectorizes integral points and reuses intermediate computations in Gauss-Kronrod quadrature. The framework is implemented within the YALMIP toolbox to perform chance constraint calculations for arbitrary non-Gaussian disturbances, applicable to both single-component distributions and mixture models. It allows the user to simply specify a distribution type and its parameters for the disturbance and directly compute the probability and its gradient to solve the optimization problem. The method is validated through a numerical example of a
stochastic model predictive control application.
Read the full abstract ▾
Classical Analysis and ODEs
On the spectra of Cantor measures
Leandro Zuberman
We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive
prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a complete characterization of maximal orthogonal sets of exponentials in $L^2(\mu)$, for a class of such measures $\mu$. It is proved that the $n+1$-th digit in the base-$N$ expansion of frequencies in a maximal orthogonal set, with the first $n$ digits prescribed, has $m$ possible values. In consequence, there are a correspondence between labelings of the $m$-homogeneous rooted tree and maximal orthogonal sets of frequencies.
Read the full abstract ▾
Algebraic Geometry
Picard bundles and the degree of irrationality of Jacobians and Pryms
Federico Moretti and Andrés Rojas
For a smooth projective curve of genus $g$, we study some positivity properties of (twisted) rank-$g$ Picard bundles on the $g$-fold symmetric product. As an application, we prove that the degree of irrationality of any genus $g$ Jacobian is bounded from above by $2^g$, and the degree of irrationality of any $(g-1)$-dimensional Prym variety is bounded from above by $2^{2g-3}$.
Read the full abstract ▾
Dynamical Systems
Approximation of Attractors of Nonautonomous Lattice Dynamical Systems
David Cheban and Andrei Sultan
The aim of this paper is to study the finite-dimensional approximations of the nonautonomous
lattice dynamical systems of the form $u_{i}'=\nu (u_{i-1}-2u_i+u_{i+1})-\lambda u_{i}+F(u_i)+f_{i}(t)\ (i\in \mathbb Z)\ (*)$. We show that the finite-dimensional approximations for (*) are uniformly dissipative. The upper semi-continuous convergence of the attractors of the finite-dimensional approximations is established.
Read the full abstract ▾
Combinatorics
The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
Meili Liang, Yue Guan, Ruiling Zheng et al. (+1 more)
For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of a transitive tournament. We prove that almost every \(T_{r+1}^t\)-free oriented graph on n vertices admits an r-partition \(V_1\cup\cdots\cup V_r\) such that each induced subgraph \(G[V_i]\) is \(T_2^t\)-free, and the same holds for almost every \(T_{r+1}^t\)-free digraph.Consequently, the number \(f(n,T_{r+1}^t)\) of labelled \(T_{r+1}^t\)-free oriented graphs satisfies \(f(n,T_{r+1}^t)=|\mathcal{P}_{n,r,t}|(1+o(1))\), where \(\mathcal{P}_{n,r,t}\) is the family of oriented graphs admitting such an r-partition with each part \(T_2^t\)-free; an analogous statement holds for digraphs.When \(t=1\) this recovers the result of K"uhn, Osthus, Townsend and Zhao (2017) that almost all \(T_{r+1}\)-free oriented graphs (resp. digraphs) are r-partite, thereby confirming a generalised form of Cherlin's
conjecture. Our proof combines the hypergraph container method, a weighted Erdős-Stone
theorem, and a stability analysis for near-extremal \(T_{r+1}^t\)-free digraphs.
Read the full abstract ▾
All authors Meili Liang, Yue Guan, Ruiling Zheng, Jianxi Liu
Statistics Theory
Fixed-order PCA: Theory for Overestimated Factor Models
Yuan Liao, Xin Tong, Wanjie Wang et al. (+1 more)
We develop asymptotic theory for principal component analysis (PCA) of a high-dimensional factor model in which the working dimension $R$ is fixed and only required to satisfy $R \ge r$, where $r$ is the true number of factors. Building on anisotropic local laws from random
matrix theory, we show that the “extra” empirical eigencomponents beyond the $r$-th are asymptotically noise-governed, incoherent, and nearly orthogonal to the factor loadings. We introduce two rotations, an expanded $r\times R$ map $H'$ and a compressed $R\times r$ map $H^{+}$, and establish consistency of the estimated factors under both. As an application, we analyze a factor-augmented regression for treatment-effect inference and prove $\sqrt{T}$-asymptotic normality for every fixed $R \ge r$. These results provide a theoretical underpinning for the common empirical practice of adopting a conservative upper bound on the number of factors, and shift the analytical burden from consistent dimension selection to the milder requirement of bounding $r$ from above.
Read the full abstract ▾
All authors Yuan Liao, Xin Tong, Wanjie Wang, Dacheng Xiu
Quantum Algebra
The balanced structure on the category of representations of a conformal net
Adrià Marín-Salvador
Let $\mathcal{A}$ be a (not necessarily rational) conformal net. We show that the braided $\mathrm{W}^*$-tensor category $\text{Rep}(\mathcal{A})$ of representations of $\mathcal{A}$ is canonically a balanced $\mathrm{W}^*$-tensor category. The balance is given by the action of $e^{-2\pi i L_0}$, where $L_0$ denotes the generator of rotations on $S^1$. In arXiv:2606.03623, we generalize this result to the larger context of a group acting on $\mathcal{A}$. We provide here a more accessible proof for the case where no group is present.
Read the full abstract ▾
Dynamical Systems
Coamenability and strong ergodicity
Ben Hayes
Following methods of Bannon-Marrakchi-Ozawa, we show that for coamenable inclusion $\mathcal{S}\leq \mathcal{R}$ of ergodic, probability measure-preserving relations, we have that $\mathcal{R}$ is strongly ergodic if and only if $\mathcal{S}$ is strongly ergodic. More general results are given when $\mathcal{S}\leq \mathcal{R}$ is coamenable, $\mathcal{R}$ is strongly ergodic, but we do not assume ergodicity of $\mathcal{S}$. As a consequence, if $\Lambda\leq \Gamma$ is a coamenable inclusion of groups, then any strongly ergodic $\Gamma$ action has countably many ergodic components for the $\Lambda$ action, each of which is strongly ergodic.
Read the full abstract ▾
Number Theory
Classicality for Hilbert modular forms
Yuanyang Jiang
Let $F$ be a totally real number field. We prove that a character of the spherical Hecke
algebra appearing in the completed
cohomology of
Hilbert modular varieties is modular if the associated Galois representation is absolutely irreducible, and de Rham of regular parallel weights. As an application, we prove some new cases of the Langlands-Clozel-Fontaine-Mazur
conjecture of $\mathrm{GL}_2$ over totally real fields. For the proof, we generalize the method in [Pan26], calculate
geometric partial Fontaine operators, and study the
cohomology of the associated Koszul-type partial de Rham complexes. The key step is the establishment of a locally analytic Jacquet-Langlands transfer, whose proof consists of several novel ingredients including a comparison of Igusa stacks for different quaternionic Shimura data constructed by [DvHKZ26], and the Grothendieck-Messing theory for locally analytic infinite level Shimura varieties established in [Jiang26a].
Read the full abstract ▾
Statistics Theory · Cross-listed from cs.LG
Generative Adversarial Learning from Deterministic Processes
Joris C. Kühl and Hanno Gottschalk
Physical AI is being successfully applied to data which does not follow the traditional paradigm of independent and identically distributed (i.i.d.) samples. In fact, physical AI is often trained on data which is not random at all, and is instead derived from chaotic dynamical systems like
turbulence. We aim to explain the empirical success of these methods using the example of generative
adversarial networks (GANs), whose statistical learning theory under the i.i.d. assumption is generally well understood. We prove that it is possible, using an infinite-dimensional model of generative
adversarial learning (GAL), to learn the invariant distribution of a sufficiently chaotic dynamical system from a single deterministically evolving time series of its states or measurements thereof, and give explicit rates for the convergence to the solution in terms of the Jensen-Shannon divergence.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Generalized Functional ANOVA: A Complete Theoretical Framework
Baptiste Ferrere, Nicolas Bousquet, Fabrice Gamboa et al. (+1 more)
The functional ANOVA provides a fundamental representation of square-integrable multivariate functions into main effects and higher-order interactions. For independent inputs, the components belong to mutually orthogonal
Hilbert subspaces and admit an explicit representation. For dependent inputs, however, the components are only hierarchically orthogonal: although existence and uniqueness results are available, the
Hilbert subspaces underlying the generalized decomposition have remained implicit. We resolve this representation problem for continuous inputs supported on a bounded hyperrectangle whose joint density is bounded above and away from zero. We introduce a distribution-adapted family of functions and prove that it forms a Riesz basis of the $L^2$ space, thereby guaranteeing a unique, stable, and unconditionally convergent representation. We then show that, for every coalition of variables, the corresponding block of this basis exactly characterizes the
Hilbert subspace containing the functional ANOVA component. Our construction recovers the classical orthogonal decomposition under input independence. As a direct consequence, computing the generalized functional ANOVA reduces to estimating coefficients in an explicit, distribution-adapted basis. Finally, as a proof of concept, we introduce an elementary, fast and model-agnostic
estimator based on our theoretical results. Experiments on synthetic and real-world
datasets illustrate its connections with established tabular explanation methods and show that low order components often capture most of the signal in the model output.
Read the full abstract ▾
All authors Baptiste Ferrere, Nicolas Bousquet, Fabrice Gamboa, Jean-Michel Loubes
Complex Variables
Hadamard product of convex functions and Jackson operator
K. Piejko, J. Sokół and K. Tra̧bka-Wiȩc\a{l}aw
In this paper we consider some properties of Jackson's difference operator for convex univalent functions in $|z|<1$ with complex parameter $q$ as a Hadamard product of two power series. Jackson in 1908 introduced for a real $q$, $q\in[0,1)$, the difference operator \mbox{${\rm d}_qf(z)$} for an analytic function $f$ in the unit disc $|z|<1$ in the complex plane. Thanks to this operator, many mathematicians have extended the theory of functions in $q$-theory. The $q$-theory has found many applications in theory of hypergeometric series, special functions, combinatorics, number theory, fluid mechanics,
quantum mechanics and physics.
Read the full abstract ▾
Numerical Analysis
Computational aspects of the Volterra Signature
Paul P. Hager, Fabian N. Harang, Luca Pelizzari et al. (+1 more)
The Volterra signature extends the classical path signature by incorporating general
matrix-valued kernel into its iterated integral structure, yielding a flexible notion of
memory for time series. Its components can be viewed as successive Picard iterates of linear controlled Volterra equations, making their exact computation of additional mathematical interest. However, the kernel introduces substantial algorithmic challenges. We provide a resolution by first decomposing the Chen-type convolution relation established in [arXiv:2603.04525] into analytic and arithmetic parts, and then introducing several efficient
algorithms: a general approximative scheme with quadratic complexity $O(J^2)$ in the number of time steps $J$, an FFT-based acceleration with complexity $O(J\log J)$ for convolution kernels on uniform grids, and an exact recursion with complexity $O(JR^2)$ for kernels admitting a state-space representation of dimension $R$; retaining standard signature complexity in the path dimension and truncation level $N$. We further show that the number of factors in
matrix-valued kernels of the form $K(t,s)=\sum_p k_p(t-s)A_p$ do not increase the asymptotic complexity in $J$ and $N$. Finally, we derive a finite-difference predictor–corrector scheme for the associated Volterra signature kernel. All
algorithms are implemented in the publicly available JAX-based package "tensordev".
Read the full abstract ▾
All authors Paul P. Hager, Fabian N. Harang, Luca Pelizzari, Samy Tindel
Optimization and Control
Solving a large oral examination timetabling problem using a multidimensional knapsack MILP formulation
Cyrille Briand and Jean-Pierre Belaud
This paper addresses the Oral Examination Timetabling Problem (OETP) for France's prestigious engineering schools, an organization managed by the Service des Concours Communs Polytechniques (SCCP). The scheduling is highly complex, involving over 7,000 candidates across a four-week period while accounting for constraints such as exam overlaps, geographic origin, and visa requirements. To manage this scale, the paper shows how to model the problem as a Multidimensional Knapsack Problem (MKP) using a Mixed-Integer Linear Programming (MILP) formulation. Their strategy reduces combinatorial complexity by assigning candidates to a predetermined set of pre-validated schedules rather than individual time slots. Experimental results using the SCIP solver on a real 2025 data instance successfully accommodated 7,796 out of 7,804 candidates within a 20-minute time limit.
Read the full abstract ▾
Optimization and Control
Quantum Model for CVRPTW
Imran Meghazi and Éric Bourreau
This paper proposes a
quantum algorithm for the capacitated vehicle routing problem with time windows (CVRPTW) based on Grover Search framework. This problem is often faced by Postal services in the context of package delivery or other time-sensitive operations. We provide an implementation on gate based
quantum computer of a model inspired by classical route first, cluster second technique. The
quantum paradigm allows to overcome suboptimality inherent property of this decomposition. In the current NISQ (Noisy Intermediate-Scale
Quantum) era, the most important limitation is the number of available
qubits which makes time windows and capacity constraints hard to tackle. We introduce a
qubit-efficient split-inspired modeling which adds only a linear number of decision
qubits to standard
quantum formulations for Traveling Salesman Problem (TSP).
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Spherical Harmonic Optimal Transport: Application to Climate Models Comparisons
Pierre Houédry, Iskander Legheraba, Léo Buecher et al. (+1 more)
Optimal transport provides a powerful framework for comparing measures while respecting the geometry of their support, but comes with an expensive computational cost, hindering its potential application to real world use cases. On
manifolds, convolutional
algorithms based on the heat kernel have been proposed to alleviate this cost, but their theoretical properties remain largely unexplored. We establish that the heat kernel cost converges to the optimal transport cost as time vanishes in the balanced and unbalanced cases. In the specific case of the 2-sphere $\mathbb{S}^2$, we ensure that the associated Sinkhorn divergences retains the desirable
geometric and analytic properties of classical optimal transport discrepancies. Moreover, we leverage the harmonic structure of the sphere to derive a fast Sinkhorn
algorithm, requiring only $\mathcal{O}(n)$
memory and $\mathcal{O}(n^{3/2})$ time per iteration, with fully dense GPU-friendly operations. We validate its computational efficiency on synthetic data, and discuss its potential use in the evaluation of global
climate models, providing both spatial and seasonal insights into models performances.
Read the full abstract ▾
All authors Pierre Houédry, Iskander Legheraba, Léo Buecher, Nicolas Courty
Algebraic Geometry
2-dimensional finite-gap Schrödinger operator whose spectrum admits two involutions
O.K.Sheinman
Two-dimensional Schrödinger operators that are finite-gap at one energy level are introduced in 1976 by Dubrovin, Krichever and Novikov. In two subsequent works by Novikov and Veselov the potentiality conditions for them have been studied, that are conditions for the
magnetic term to be absend. Besides their physical importance, these works played a crucial role in solving out the Riemann–Shottki problem of indetification of Prymians of smooth coverings with two branch points in the class of principally polarized Abelian varieties, going back to 80s, and completed in Krichever'06, and Krichever and Grushevsky'07. For smooth coverings with more than two branch points, the Prym varieties are no longer principally polarized. In wellknown Fay's lectures, certain isogenic to them principally polarized varieties are introduced, which we refer to as isoPrymians. In the present work we propose the new potentiality conditions for the Schrödinger operators in question, and a related approach to identification of isoPrymians of smooth double coverings of curves of a certain class, with more than two branch points.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.RO
Dynamic robotic cloth folding with efficient Koopman operator-based model predictive control
Edoardo Caldarelli, Franco Coltraro, Adrià Colomé et al. (+2 more)
Robotic cloth folding is a challenging task, particularly when considering dynamic folding tasks, which aim at folding cloth by fast motions that leverage its dynamics. When subject to such fast motions, the complexity of cloth dynamics hinders both system identification and planning of folding trajectories, resulting in a difficult simulation-to-reality transfer when using physical models of cloth. Compared to the dexterity that humans exhibit when performing folding tasks, robotic approaches usually employ small garments with quite rigid dynamics, and are either too slow, or fast but imprecise, requiring several attempts to achieve a reasonably good fold. In this paper, we tackle these challenges by generating fast folding trajectories with a novel model predictive controller, integrating physics-based simulation of cloth dynamics and efficient, kernel-based Koopman operator regression. Koopman operator regression, an increasingly popular machine learning technique for nonlinear system identification, is used to obtain a linear model for the cloth being folded. Such a surrogate model, trained with data from a high-fidelity, physics-based cloth simulator, can then be employed within a suitable model predictive control
algorithm, in place of the costly, nonlinear one, to efficiently generate folding trajectories to be executed by a robotic manipulator. Both in simulated and real-
robot experiments, we show how the linearization supplied by the Koopman operator-based model can be employed to efficiently generate fast folding trajectories to unseen poses, without sacrificing folding accuracy.
Read the full abstract ▾
All authors Edoardo Caldarelli, Franco Coltraro, Adrià Colomé, Lorenzo Rosasco, Carme Torras