Numerical Analysis · Cross-listed from cs.RO
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 2 April
This paper proposes a new, robust method to solve the inverse kinematics (IK) of multi-segment continuum manipulators. Conventional Jacobian-based solvers, especially when initialized from neutral/rest configurations, often exhibit slow convergence and, in certain conditions, may fail to converge (deadlock). The Virtual-Variable-Length (VVL) method proposed here introduces fictitious variations of segments' length during the solution iteration, conferring virtual axial degrees of freedom that alleviate adverse behaviors and constraints, thus enabling or accelerating convergence. Comprehensive numerical experiments were conducted to compare the VVL method against benchmark Jacobian-based and Damped Least Square IK solvers. Across more than $1.8\times 10^6$ randomized trials covering manipulators with two to seven segments, the proposed approach achieved up to a 20$\%$ increase in convergence success rate over the benchmark and a 40-80$\%$ reduction in average iteration count under equivalent accuracy thresholds ($10^{-4}-10^{-8}$). While deadlocks are not restricted to workspace boundaries and may occur at arbitrary poses, our empirical study identifies boundary-proximal configurations as a frequent cause of failed convergence and the VVL method mitigates such occurrences over a statistical sample of test cases.
Information Theory
Best-Arm Identification with Noisy Actuation
In this paper, we consider a multi-armed bandit (MAB) instance and study how to identify the best arm when arm commands are conveyed from a central learner to a distributed agent over a discrete memoryless channel (DMC). Depending on the agent capabilities, we provide communication schemes along with their analysis, which interestingly relate to the zero-error capacity of the underlying DMC.
Read the full abstract
Combinatorics
Sufficient conditions for Hamiltonianity in terms of the Zeroth-order General Randić Index
For a (molecular) graph $G$ and any real number $\alpha\ne 0$ , the zero-order general Randić index , denote by $^0R_\alpha$, is defined by the following equation: \begin{align*} {^0R_\alpha} (G) =\sum_{v\in G}d_G (v) ^{\alpha} (\alpha \in \mathbb{R}-\left\{0\right\}) . \end{align*} In this paper, we use this index to give sufficient conditions for a graph $G$ to satisfy the Hamiltonian (or $k$-Hamiltonian) property, and show that none of these conditions can be dropped. Finally we give similar results for the case when $G$ is a balanced bipartite graph.
Read the full abstract
Numerical Analysis
Hyper-differential sensitivity analysis with respect to model discrepancy: Sequential optimal experimental design
Large-scale optimization problems are ubiquitous in the physical sciences; yet, high-fidelity models can often be complex and computationally prohibitive for optimization. A practical alternative is to use a low-fidelity model to facilitate optimization. However, the discrepancy between the high- and low-fidelity models can lead to suboptimal solutions. To address this, we build on recent work in Hyper-Differential Sensitivity Analysis to leverage limited high-fidelity simulations to update the optimization solution. Our contributions in this article include: (i) incorporating pseudo-time continuation techniques to efficiently compute higher-accuracy optimal solution updates, and (ii) proposing a Bayesian framework for sequential data acquisition that strategically guides high-fidelity evaluations and reduces uncertainty in the model discrepancy estimation. Numerical results demonstrate that our framework delivers significant improvements to optimization solutions with only a few high-fidelity evaluations.
Read the full abstract
Optimization and Control
Analytic Optimal Control for a Class of Driftless x-Flat Systems
This paper studies optimal trajectory-tracking for driftless, x-flat nonlinear systems with three states and two inputs. The tracking problem is formulated in Bolza form with a quadratic cost of the tracking error and its derivative. Applying Pontryagin's maximum principle yields a mixed regular-singular optimal control problem. By exploiting geometric properties and a specific relation between the weighting matrices, a closed-form expression for the costate and an explicit feedback law for both inputs is derived. Thereby, the numerical solution of a two-point boundary-value problem is avoided. The singular input leads to a bang-singular-bang optimal control structure, while on the singular arc, the tracking error dynamics reduces to a linear dynamics of order two. The approach is illustrated for the kinematic model of a steerable axle, demonstrating accurate trajectory-tracking.
Read the full abstract
Optimization and Control
Incorporating circular economy policies into product supply chains using bilevel optimization – A case study on coffee packaging
Transitioning to a Circular Economy requires policies to drive sustainable practices. This study proposes a bilevel optimization framework to evaluate the combined use of carbon taxes and subsidies in promoting circular supply chains under varying budget levels. A case study of the coffee packaging supply chain with an Extended Producer Responsibility scenario is used to demonstrate this approach. The framework captures the hierarchical interaction between a regional government (upper level), which aims to minimize environmental impacts, and coffee companies (lower level), which seek to minimize costs. Two bilevel optimization problems are formulated based on two environmental objectives: (1) minimization of greenhouse gas (GHG) emissions, and (2) maximization of circularity. The model integrates mixed-integer linear programming (MILP) with life cycle assessment (LCA), techno-economic assessment (TEA) and circularity assessment. Results demonstrate that subsidies effectively drive supply chain shifts toward low-emission and high-circularity configurations, while carbon taxes alone have a more limited impact. Sensitivity analyses highlight the influence of key parameters, such as glass washing distance and loss rates, on policy effectiveness. Overall, the study provides a bilevel optimization framework with quantitative insights to support policy design for sustainable circular supply chains.
Read the full abstract
Geometric Topology
Finsler metrics on $1/n$-translation structures on surfaces
We define compatible Finsler distances on $1/n$-translation surfaces, we study their geodesics, and construct a Liouville current for each such metric, that is a geodesic current that encodes the information of the length of the closed curves. The construction is based on multi-foliations, a generalization of measured foliations of independent interest.
Read the full abstract
Number Theory
On congruence conjectures of Andrews and Bachraoui
Andrews and the third author recently studied congruences for certain restricted two-color partitions. They made two conjectures for Ramanujan-type congruences and a vanishing identity for the limiting sequence. In this paper, we settle these conjectures by relating the corresponding generating function to modular forms and mock theta functions.
Read the full abstract
Probability · Cross-listed from cs.DS
Subquadratic Counting via Perfect Marginal Sampling
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the input graph. We present new counting algorithms that break the quadratic-time barrier in a wide range of settings. For example, for the hardcore model of $\lambda$-weighted independent sets in graphs of maximum degree $\Delta$, we obtain a $\tilde{O}(n^{2-\delta})$-time approximate counting algorithm, for some constant $\delta > 0$, when the fugacity $\lambda < \frac{1}{\Delta-1}$, improving over the previous regime of $\lambda = o(\Delta^{-3/2})$ by Anand, Feng, Freifeld, Guo, and Wang (2025). Our results apply broadly to many other spin systems, such as the Ising model, hypergraph independent sets, and vertex colorings. Interestingly, our work reveals a deep connection between $\textit{subquadratic}$ counting and $\textit{perfect}$ marginal sampling. For two-spin systems such as the hardcore and Ising models, we show that the existence of perfect marginal samplers directly yields subquadratic counting algorithms in a $\textit{black-box}$ fashion. For general spin systems, we show that almost all existing perfect marginal samplers can be adapted to produce a sufficiently low-variance marginal estimator in sublinear time, leading to subquadratic counting algorithms.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Explicit constructions of mutually unbiased bases via Hadamard matrices
We present a detailed computational and algebraic study of Mutually Unbiased Bases (MUBs) in finite-dimensional Hilbert spaces, with a particular focus on dimensions 2, 3, 4, and the challenging case of 6. Starting from the Hadamard-phase parametrization, we derive explicit analytical conditions for mutual unbiasedness in dimension 4, providing a tractable system of trigonometric constraints on the phase parameters. We then explore a tensor-product construction via Pauli operators, highlighting the algebraic and group-theoretical origin of MUBs in two-qubit systems, and demonstrating how these constructions yield a complete set of 5 MUBs in dimension 4. Extending our approach, we investigate the Fourier-family method in dimension 6, where the absence of a prime-power structure imposes strong rigidity constraints and limits the known constructions to sets of 3 MUBs. We provide a systematic computational framework for testing candidate phase vectors, bridging the gap between analytical insight and numerical exploration. Finally, we generalize the discussion to arbitrary prime-power dimensions, emphasizing the role of finite-field structures, Heisenberg-Weyl operators, and discrete symmetries in generating complete sets of MUBs. Our work offers a transparent, line-by-line verification methodology, highlighting both the geometric and algebraic richness of MUBs, and clarifying why certain dimensions resist full analytical constructions. This study serves as a comprehensive resource for researchers seeking both theoretical understanding and practical construction of MUBs in quantum information science.
Read the full abstract
Algebraic Topology
On the universality of multiexcisive functors
We provide a multiplicative classification of polynomial endofunctors on spectra in terms of their Mackey functors of cross–effects. More precisely, we prove that various categories of multivariable excisive functors from spectra to spectra are symmetric monoidally equivalent to the corresponding variants of spectral Mackey functors. The symmetric monoidal structures appearing here are the Day convolutions on both sides, and the Mackey functors we consider involve variations on the category of finite sets and surjections. The method is first to introduce certain multivariable functors we call subdiagonal functors. By considering them all at once using parametrised category theory, we prove inductively that they all admit Mackey functor descriptions as symmetric monoidal categories, endowing them with a universal property along the way. In particular, specialising this to univariate functors gives a new proof and strengthening of Glasman's result about d-excisive endofunctors on spectra. As application of our perspective, we prove a “Segal conjecture” in the context of Goodwillie calculus when d is a prime number.
Read the full abstract
Optimization and Control
On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several structured tensors. An equivalent condition for the convexity of the solution set of the $\mathrm{TLCP}$ is established. In addition, sufficient conditions for uniqueness and for feasibility implying solvability are derived.
Read the full abstract
Functional Analysis
Sharp forms and quantitative stability for general weighted discrete $p$-Hardy inequalities
In this paper, we provide a sharp remainder term for the general weighted discrete $p$-Hardy inequality. By choosing appropriate weights and specifying $1<p<\infty$, we are able to recover the identity by Krejčiřík-Štampach [KS22, Theorem 1], obtain the sharp form of the $p$-Hardy inequality by Fischer-Keller-Pogorzelski [FKP23, Theorem 1] and generalize the power weighted inequality by Gupta [Gup22, Theorem 2.1] with a sharp remainder. In addition, we prove a quantitative stability type result, thereby showing that the deficit of the discrete $p$-Hardy inequality controls the weighted distance to the family of non-trivial minimizers.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Sensitivity analysis for stopping criteria with application to organ transplantations
We consider a stopping problem and its application to the decision-making process regarding the optimal timing of organ transplantation for individual patients. At each decision period, the patient state is inspected and a decision is made whether to transplant. If the organ is transplanted, the process terminates; otherwise, the process continues until a transplant happens or the patient dies. Under suitable conditions, we show that there exists a control limit optimal policy. We propose a smoothed perturbation analysis (SPA) estimator for the gradient of the total expected discounted reward with respect to the control limit. Moreover, we show that the SPA estimator is asymptotically unbiased.
Read the full abstract
Probability
Modeling Transmission Intensity in SI Epidemics via CIR and Jacobi Processes: Asymptotic Results and Preliminary Intervention Strategies
This paper introduces a way of modeling the epidemic transmission rate using a stochastic process of the form $(\beta_t = \varphi(t)P_t : t \ge 0)$, where the positive deterministic function $\varphi(t)$ models the impact of a public health intervention and $P_t$ describes the stochastic evolution of the infection rate in the absence of any control measures. We establish general asymptotic results for an SI model governed by $(\beta_t : t \ge 0)$, showing that the asymptotic behavior is determined by the integrated intensity process $(H_t =\int_0^t \beta_s \, ds : t \ge 0)$. We study the intrinsically bounded Jacobi process and the Cox–Ingersoll–Ross (CIR) process as models for $(P_t : t \ge 0)$; both exhibit almost surely positive sample paths. We highlight that in the case of non-intervention $(\varphi \equiv 1)$, the process $(H_t : t \ge 0)$ is considerably more analytically tractable. Finally, we present numerical simulations for both models in two different scenarios: the case of non-intervention $(\varphi(t)=1)$ and the case of a successful intervention strategy (where $\int_0^\infty \varphi(t) \, dt < \infty$) modeled using exponential decay $\varphi(t) = e^{-\alpha t}$ for both models.
Read the full abstract
Dynamical Systems
Kronecker Flow on the Infinite Torus
This article is concerned with Kronecker flows on the infinite torus. The work is partly motivated by the fact that many Hamiltonian PDEs and systems on infinite lattices admit invariant tori, of possibly infinite dimension, on which the dynamics is linearizable. Finite-dimensional Kronecker flows are well understood: the dynamics can be reduced to a non-resonant flow on a subtorus, which is equivalent to being topologically transitive, to minimality, and to unique ergodicity in the projection. We prove that these properties still hold when the dimension of the torus is infinite if and only if the integer (finite) linear combinations of the frequencies form a free abelian group. Next, we construct a class of orbits whose closure is locally homeomorphic to the product of a ball and a Cantor set, extending a recent result by Sakbaev and Volovich. We also show that the Benjamin-Ono equation admits this type of solutions. Finally, we prove the equivalence between a classification problem for Kronecker flows and that for countable abelian groups without torsion.
Read the full abstract
Differential Geometry
Rigidity of the timelike marked length spectrum and length-twist coordinates of singular de-Sitter tori
In this paper, we study the closed timelike geodesics of de-Sitter tori with one singularity and prove their uniqueness in their free homotopy class. We introduce the notion of timelike marked length spectrum of such a torus, and establish its rigidity with respect to the lengths of two homotopy classes of intersection number one. We also construct length-twist coordinates on the deformation space of de-Sitter tori with one singularity.
Read the full abstract
Group Theory
On the intersection of $\mathfrak{F}$-maximal subgroups of a finite group
We investigate the properties of the intersection $\mathrm{Int}_{\mathfrak{F}}(G)$ of all $\mathfrak{F}$-maximal subgroups of a finite group $G$ for a hereditary formation $\mathfrak{F}$ of finite groups. We prove that $\mathrm{Int}_{\mathfrak{F}}(G/\mathrm{Int}_{\mathfrak{F}}(G))\simeq 1$ holds for any finite group $G$ if and only if $\mathfrak{F}$ contains every group $G$ all of whose $\mathfrak{F}$-subgroups are $\mathfrak{F}$-subnormal. As corollaries we obtain the results of A. N. Skiba (2011), J. C. Beidleman and H. Heineken (2011) about $\mathrm{Int}_{\mathfrak{F}}(G)$ for a hereditary saturated formation $\mathfrak{F}$.
Read the full abstract
Optimization and Control
Random-Subspace Sequential Quadratic Programming for Constrained Zeroth-Order Optimization
We study nonlinear constrained optimization problems in which only function evaluations of the objective and constraints are available. Existing zeroth-order methods rely on noisy gradient and Jacobian surrogates in high dimensions, making it difficult to simultaneously achieve computational efficiency and accurate constraint satisfaction. We propose a zeroth-order random-subspace sequential quadratic programming method (ZO-RS-SQP) that combines two-point directional estimation with low-dimensional SQP updates. At each iteration, the method samples a random low-dimensional subspace, estimates the projected objective gradient and constraint Jacobians using two-point evaluations, and solves a reduced quadratic program to compute the step. As a result, the per-iteration evaluation cost scales with the subspace dimension rather than the ambient dimension, while retaining the structured linearized-constraint treatment of SQP. We also consider an Armijo line-search variant that improves robustness in practice. Under standard smoothness and regularity assumptions, we establish convergence to first-order KKT points with high probability. Numerical experiments illustrate the effectiveness of the proposed approach on nonlinear constrained problems.
Read the full abstract
Information Theory · Cross-listed from eess.SY
Computing the Exact Pareto Front in Average-Cost Multi-Objective Markov Decision Processes
Many communication and control problems are cast as multi-objective Markov decision processes (MOMDPs). The complete solution to an MOMDP is the Pareto front. Much of the literature approximates this front via scalarization into single-objective MDPs. Recent work has begun to characterize the full front in discounted or simple bi-objective settings by exploiting its geometry. In this work, we characterize the exact front in average-cost MOMDPs. We show that the front is a continuous, piecewise-linear surface lying on the boundary of a convex polytope. Each vertex corresponds to a deterministic policy, and adjacent vertices differ in exactly one state. Each edge is realized as a convex combination of the policies at its endpoints, with the mixing coefficient given in closed form. We apply these results to a remote state estimation problem, where each vertex on the front corresponds to a threshold policy. The exact Pareto front and solutions to certain non-convex MDPs can be obtained without explicitly solving any MDP.
Read the full abstract
Spectral Theory
Continuity of Weighted Dirac Spectra
For the weighted Dirac eigenvalue problem, we show that the two-sided weighted spectrum depends continuously on the weight under continuous deformations within a uniformly elliptic class. Moreover, for differentiable families of weights we obtain a quantitative Lipschitz estimate for the full spectrum in the arsinh–metric, based on a weighted Hellmann–Feynman variational identity.
Read the full abstract
Algebraic Geometry
Intersections and the Bézout Range: Abelian Varieties
Given subvarieties $X, Y$ of a complex algebraic variety $S$ of complementary dimension, must they intersect? When $S$ is projective space, this is a consequence of the classical Bézout theorem, and an analogue for simple abelian varieties was established by Barth in 1968. Moreover, the moving lemma suggests that, after suitable translations, one may arrange for intersections of the expected dimension. In this work, we obtain variants for simple abelian varieties in the spirit of the completed Zilber–Pink philosophy. When $X$ and $Y$ have complementary dimension, we show that the intersections $X \cap [n]Y$ are zero-dimensional for all but finitely many integers $n$, and that these intersections collectively give rise to an analytically dense subset of $X$ as $n$ varies. We moreover control those $n$ for which $X \cap [n] Y$ has a positive dimensional component uniformly in $X, Y$ and $A$. When $\dim X + \dim Y < \dim A$, we show that $X \cap [n]Y = \varnothing$ for a set of integers $n$ of asymptotic density one, except in the presence of intersections at torsion points.
Read the full abstract
Optimization and Control
Explicit Distributed MPC: Reducing Computation and Communication Load by Exploiting Facet Properties
Classical Distributed Model Predictive Control (DiMPC) requires multiple iterations to achieve convergence, leading to high computational and communication burdens. This work focuses on the improvement of an iteration-free distributed MPC methodology that minimizes computational effort and communication load. The aforementioned methodology leverages multiparametric programming to compute explicit control laws offline for each subsystem, enabling real-time control without iterative data exchanges between subsystems. Extending our previous work on iteration-free DiMPC, here we introduce a FAcet-based Critical region Exploration Technique for iteration-free DiMPC (FACET-DiMPC) that further reduces computational complexity by leveraging facet properties to do targeted critical region exploration. Simulation results demonstrate that the developed method achieves comparable control performance to centralized methods, while significantly reducing communication overhead and computation time. In particular, the proposed methodology offers substantial efficiency gains in terms of the average computation time reduction of 98% compared to classic iterative DiMPC methods and 42% compared to iteration-free DiMPC methods, making it well-suited for real-time control applications with tight latency and computation constraints.
Read the full abstract
Combinatorics
Almost all graphs have no cospectral mates with height relative small to its order
The main result of this paper shows that almost all graphs of order $n$ have no cospectral mates with height $o(( n / \ln n)^{1/10})$, improving an earlier result on cospectral mates with fixed level and covering the cospectral graphs obtained by GM-switching of relative small blocks.
Read the full abstract
Optimization and Control
Data-Driven Tube-Based Zonotopic Predictive Control With Nonconvex Layered Terminal Sets
This paper presents a data-driven tube-based zonotopic predictive control (DTZPC) framework with nonconvex layered terminal sets. Existing DTZPC schemes with closed-loop guarantees typically rely on a single ellipsoidal terminal set, which can be conservative and thereby limit feasibility. We propose a layered terminal-set design that decouples stability certification, feasibility enlargement, and motion-region screening into three components with distinct roles. First, an offline-designed feedback gain together with a contractive constrained zonotope provides a terminal ingredient for stability certification, while avoiding probabilistic feedback synthesis in high-dimensional DTZPC. Second, we derive a data-driven characterization of the inverse admissible closed-loop model set, avoiding the conservatism of interval-matrix relaxation and inversion. Combined with exact set multiplication, this yields inner and outer approximations of the maximal robust positively invariant (MRPI) set under fixed closed-loop dynamics. The inner approximation serves as a nonconvex terminal set to enlarge feasibility, whereas the outer approximation provides certified motion-region descriptions for fast screening and monitoring. Numerical examples demonstrate tighter inverse-set enclosures and improved feasibility over existing convex-terminal DTZPC schemes.
Read the full abstract
Numerical Analysis
Conservative flux reconstruction for an elliptic interface problem using CutFEM
This paper deals with the local recovery of conservative fluxes for an elliptic interface problem with discontinuous coefficients. The transmission conditions on the interface are imposed weakly and the discretisation is achieved by using conforming finite elements on unfitted meshes, with the aid of the CutFEM method. In a first attempt at flux reconstruction, we define a flux belonging to the Raviart-Thomas space of each sub-domain following the method developed for a boundary problem. However, the transmission condition is not satisfied by the recovered flux. In order to overcome this shortcoming, we propose a second approach, where the flux belongs to the recently introduced immersed Raviart-Thomas space. This ensures both the continuity of the normal flux across the interface and a natural conservation property on the cut cells. Subsequently, we apply the recovered flux to a posteriori error analysis and prove the sharp reliability of the error estimator.
Read the full abstract
Number Theory
Counting Frobenius extensions over local function fields
We determine the asymptotic growth of extensions of local function fields of characteristic p counted by discriminant, where the Galois group is a subgroup of the affine group AGL_1(p). More general, we solve the corresponding counting problems for all groups which arise in a tower of a cyclic extension of order p over a cyclic extension of degree d coprime to p. This in particular give answers for certain non-abelian groups including S_3, dihedral groups of order 2p, and many Frobenius groups.
Read the full abstract
Numerical Analysis
Samplet limits and multiwavelets
Samplets are data adapted multiresolution analyses of localized discrete signed measures. They can be constructed on scattered data sites in arbitrary dimension such that they exhibit vanishing moments with respect to any prescribed set of primitives. We consider the samplet construction in a probabilistic framework and show that, if choosing polynomials as primitives, the resulting samplet basis converges to signed measures with broken polynomial densities in the infinite data limit. These densities amount to multiwavelets with respect to a hierarchical partition of the region containing the data sites. As a byproduct, we therefore obtain a construction of general multiwavelets that allows for a flexible prescription of vanishing moments going beyond tensor product constructions. For congruent partitions we particularly recover classical multiwavelets with scale- and partition- independent filter coefficients. The theoretical findings are complemented by numerical experiments that illustrate the convergence results in case of random as well as low-discrepancy data sites.
Read the full abstract
Representation Theory
Classification of Auslander-Gorenstein monomial algebras: The acyclic case
We give a linear algebraic classification of Auslander regular acyclic monomial algebras via the Bruhat factorisation of the Coxeter matrix. Namely, we show under mild assumptions that a monomial acyclic quiver algebra is Auslander regular if and only if its Coxeter matrix $C$ has a Bruhat factorisation $U_1 P U_2$ with $U_1$ the identity matrix. In particular, this holds without restrictions for linear Nakayama algebras and we use the Bruhat decomposition to answer a question raised by Ringel by showing that his homological permutation coincides with the permutation coming from the Bruhat factorisation of the Coxeter matrix. We also use our methods to show that general Auslander regular acyclic quiver algebras are echelon-independent, proving a conjecture of Defant-Jiang-Marczinzik-Segovia-Speyer-Thomas-Williams, and we answer another question by Ringel on the delooping level of simple modules over Nakayama algebras.
Read the full abstract
Algebraic Topology
Characteristic numbers of canonical toric manifolds and their applications
We compute all the Chern, Milnor and Pontryagin numbers for canonical toric manifolds associated with abstract simplicial complexes and the Stiefel-Whitney numbers for their real counterparts. Applications include combinatorial characterizations of the unitary, oriented and unoriented bordism classes, new geometrical representatives of the unitary bordism ring generators, a combinatorial criterion for a canonical toric manifold to bound, as well as the dimension estimates for their immersions into euclidean spaces.