Classical Analysis and ODEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 16 February
In this article we prove the existence of sets $E \subseteq \mathbb{R}$ of zero Fourier dimension such that it is possible to restrict the Fourier transform to $E$ on a certain non-trivial range $[1,\tilde{p})$ with $1<\tilde{p}<2$. This builds upon Mockenhaupt's Restriction Theorem; while this theorem could only be applied to sets of positive Fourier dimension, we show that the existence of a measure with polylogarithmic Fourier decay combined with full Hausdorff dimension 1 on the real line is enough to guarantee restriction. In order to achieve this, we combine two different tools: a modification of a construction from a recent work of Li and Liu to produce a set with specific Hausdorff and Fourier dimensions, and a generalization of the Stein-Tomas-Mockenhaupt Restriction Theorem.
Dynamical Systems
A golden-ratio partition of information and the balance between prediction and surprise: a neuro-cognitive route to antifragility
Adaptive systems must strike a balance between prediction and surprise to thrive in uncertain environments. We propose an information-theoretic balance function, $ f(p) = -(1 - p)\ln(1 - p) + \ln p $, which quantifies the net informational gain from contrasting explained variance $p$ with unexplained novelty $(1 - p)$. This function is strictly concave on $(0,1)$ and reaches its unique maximum at $ p^* \approx 0.882$, revealing a regime where confidence is high but the residual uncertainty carries a disproportionate potential for surprise. Independently of this maximum, imposing a self-similarity condition between known, unknown and total information, $p : (1-p) = 1 : p$, leads to the golden-ratio reciprocal $p = 1/\varphi \approx 0.618$, where $ \varphi$ is the golden ratio. We interpret this value not as the maximizer of $f$, but as a structurally privileged partition in which known and unknown are proportionally nested across scales. Embedding this dual structure into a Compute-Inference-Model-Action (CIMA) loop yields a dynamic process that maintains the system near a critical regime where prediction and surprise coexist. At this edge, neuronal dynamics exhibit power-law structure and maximal dynamic range, while the system's response to perturbations becomes convex at the level of its payoff function-fulfilling the formal definition of antifragility. We suggest that the golden-ratio partition is not merely a mathematical artifact, but a candidate design principle linking prediction, surprise, criticality, and antifragile adaptation across scales and domains, while the maximum of $f$ identifies the point of greatest informational vulnerability to being wrong.
Read the full abstract
Combinatorics
Automorphisms of Kimura Hadamard Matrices
We investigate the structure of the automorphism groups of Kimura Hadamard matrices (KHMs) constructed from dihedral groups. We identify several different types of automorphisms, and show that the automorphism group of a KHM always has a subgroup isomorphic to $D_{2k}\times Q_8$, or $C_2\times D_{2k}\times Q_8$ if it is $y$-invariant. We exhibit additional automorphisms arising from the holomorph of the dihedral group under suitable structural conditions. A comparison with known examples, including those of Kimura, Niwasaki, and matrices arising from the Shinoda–Yamada construction, reveals counterexamples to a conjecture of Ó Cathaín and suggests that no further automorphisms occur beyond those predicted by our framework.
Read the full abstract
Mathematical Physics · Cross-listed from physics.soc-ph
Environment-Driven Emergence of Higher-Order Collective Behavior
Collective behavior is commonly attributed to direct interactions among system components. Using a minimal stochastic model, we show that higher-order collective structure can instead emerge from shared stochastic environments, even in the absence of interactions. Quantified via the O-information, environmental fluctuations induce both redundant and synergistic dependencies, with the latter occupying larger regions of the correlation space. We establish a no-go theorem showing that time-independent coupling between the system variables and a shared stochastic environment rules out synergistic higher-order behavior. Crucially, this constraint can be overcome dynamically: transitions between redundancy and synergy arise from time-dependent environmental coupling or from the nontrivial interplay between shared environments and direct interactions. Together, these results identify environmental mediation as a distinct mechanism of higher-order collective organization beyond the conventional interaction-centric paradigm.
Read the full abstract
Optimization and Control · Cross-listed from cs.AI
Predicting Invoice Dilution in Supply Chain Finance with Leakage Free Two Stage XGBoost, KAN (Kolmogorov Arnold Networks), and Ensemble Models
Invoice or payment dilution is the gap between the approved invoice amount and the actual collection is a significant source of non credit risk and margin loss in supply chain finance. Traditionally, this risk is managed through the buyer's irrevocable payment undertaking (IPU), which commits to full payment without deductions. However, IPUs can hinder supply chain finance adoption, particularly among sub-invested grade buyers. A newer, data-driven methods use real-time dynamic credit limits, projecting dilution for each buyer-supplier pair in real-time. This paper introduces an AI, machine learning framework and evaluates how that can supplement a deterministic algorithm to predict invoice dilution using extensive production dataset across nine key transaction fields.
Read the full abstract
Algebraic Topology
Pruning distance of upset-decomposable persistence modules
The pruning distance recently introduced by Bjerkevik compares persistence modules using approximate decompositions called prunings. Bjerkevik conjectures that this distance is Lipschitz equivalent to the classical interleaving distance on modules of a bounded pointwise dimension. In this article, we establish a Lipschitz equivalence with respect to the bottleneck distance for upset-decomposable persistence modules. In particular, this proves half of Bjerkevik's conjecture for these modules. More precisely, we bound the bottleneck distance by a multiple of the pruning distance, improving the conjectured bound from~$2r$ to~$(2r-1)$ where~$r$ is the maximal pointwise dimension, and show that this improved bound is sharp. We also prove the converse inequality, bounding the pruning distance by the bottleneck distance. Our approach relies on explicitly computing the pruning of upset-decomposable modules, which we carry out using a directed graph formalism.
Read the full abstract
Optimization and Control
Efficient Adjoint-based Design Optimization with Optimal Control
Multidisciplinary engineering system design typically employs a sequential process, progressing from system dynamics to design variables and control. However, this process is inefficient and may lead to a suboptimal design. We propose formulating the optimal control and multidisciplinary design optimization (MDO) problems as a single problem with linear quadratic regulator (LQR) control. We use the coupled adjoint method to compute the design variable derivatives, which are critical for gradient-based design optimization. The computational cost of the derivative computation using the adjoint method is independent of the number of design variables, making it suitable for large-scale problems. We show that the coupled adjoint can be solved indirectly and more efficiently by solving three smaller adjoint equations that leverage the feedforward structure of the problem. We demonstrate this new approach on two test problems: design optimization of a classic cart-pole problem and the aerodynamic shape of a quadrotor blade. For the quadrotor blade design problem, we reduce the control cost by 10% by optimizing the blade for a specific control task with a slight penalty in steady hovering power consumption.
Read the full abstract
Complex Variables
Ellipsoids in pseudoconvex domains
We consider the problem of maximizing the volume of hermitian ellipsoids inscribed in a given pseudoconvex domain in complex Euclidean space. We prove existence and uniqueness, and give a characterization of the maximizer.
Combinatorics
A Weighted Words Study of MacMahon's and Russell's Modulo 6 Identities
We give new proofs of MacMahon and Russell's modulo 6 identities using the method of weighted words. We also present a new refinement of MacMahon's identity, some related finite sum identities, and a companion partition theorem to sequence avoiding partitions theorem of the author and Andrews.
Read the full abstract
Combinatorics
Breaking small automorphisms of graphs of arbitrary cardinality
We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves some vertex to its neighbour. We study the edge colourings of graphs that break every small automorphism. Kalinowski, Pilśniak, and Woźniak proved that three colours are enough for such a colouring to exist for every finite graph without isolated edges. They conjectured that two colours are enough for every finite connected graph on at least six vertices. We confirm this conjecture in its more general version, namely for connected finite and infinite graphs of arbitrary cardinality.
Read the full abstract
Combinatorics
Irreducible distinguishing colourings and the Axiom of Choice
We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two non-empty classes of colours to obtain a (proper) distinguishing colouring. We show that every graph has an irreducible (proper) distinguishing vertex colouring and that every graph without isolated edge and with at most one isolated vertex has an irreducible (proper) distinguishing edge colouring. Moreover, we show that the existence of any of these colourings for every connected graph (not isomorphic to $K_2$) is equivalent to the Axiom of Choice.
Read the full abstract
Combinatorics
A new problem related to Eulerian graphs
Let $G$ be a graph, and $H$ be a finite subgraph of $G$. We say that $H$ is a (semi) $S$-Eulerian subgraph if there exists a closed (open) trail $T$ in $G$ such that each edge of $H$ appears in $T$. We show that the problem of determining whether a subgraph $H$ of a finite graph $G$ is (semi) $S$-Eulerian is NP-Complete. Moreover, we show that both versions of the problem become linear in time if we restrict ourselves to connected subgraphs $H$.
Read the full abstract
Numerical Analysis · Cross-listed from eess.SP
Multiplierless DFT Approximation Based on the Prime Factor Algorithm
Matrix approximation methods have successfully produced efficient, low-complexity approximate transforms for the discrete cosine transforms and the discrete Fourier transforms. For the DFT case, literature archives approximations operating at small power-of-two blocklenghts, such as \{8, 16, 32\}, or at large blocklengths, such as 1024, which are obtained by means of the Cooley-Tukey-based approximation relying on the small-blocklength approximate transforms. Cooley-Tukey-based approximations inherit the intermediate multiplications by twiddled factors which are usually not approximated; otherwise the effected error propagation would prevent the overall good performance of the approximation. In this context, the prime factor algorithm can furnish the necessary framework for deriving fully multiplierless DFT approximations. We introduced an approximation method based on small prime-sized DFT approximations which entirely eliminates intermediate multiplication steps and prevents internal error propagation. To demonstrate the proposed method, we design a fully multiplierless 1023-point DFT approximation based on 3-, 11- and 31-point DFT approximations. The performance evaluation according to popular metrics showed that the proposed approximations not only presented a significantly lower arithmetic complexity but also resulted in smaller approximation error measurements when compared to competing methods.
Read the full abstract
Optimization and Control
Linear error bounds for HJB equations in finite horizon control problems
We study semi Lagrangian approximation schemes for Hamilton Jacobi Bellman equations arising from finite horizon optimal control problems. Classical error estimates for these schemes include the term $\frac{1}{\Delta t}$ which leads to pessimistic convergence bounds and is not observed in numerical experiments. In this work, we provide improved error estimates under standard regularity assumptions on the dynamics, the running cost, and the final cost, assuming the presence of a positive discount factor. The new bound depends linearly on the time step, the spatial mesh size, and a measure of the temporal oscillation of the control, thus removing the mixed term appearing in previous analyses. The proof relies on a refined comparison between continuous and discrete cost functionals and on stability estimates for the controlled dynamics. Numerical experiments confirm first-order convergence in both space and time and suggest that the improved behavior persists even in the undiscounted case.
Read the full abstract
Number Theory
$\mathcal L$-invariants and deep congruences between newforms
We study congruences modulo powers of a prime $p$ between pairs of $p$-new modular Hecke eigenforms of level $\Gamma_0(p)$ and same weight $k$. Based on explicit computations, we conjecture that every such eigenform $f$ admits a twin to which it is congruent modulo a surprisingly high power of $p$, whose exponent is close to the opposite of the valuation of the $\mathcal L$-invariant of $f$, and whose Atkin–Lehner sign is opposite to that of $f$. This is a new phenomenon that is not explained by the known results on the $p$-adic variation of eigenforms. Inspired by the global picture, we formulate a local conjecture describing congruences between semistable representations of fixed weight, varying $\mathcal L$-invariant, and opposite Atkin–Lehner signs. We give some theoretical evidence towards our conjectures.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Secure High-Resolution ISAC via Multi-Layer Intelligent Metasurfaces: A Layered Optimization Framework
Integrated sensing and communication (ISAC) has emerged as a pivotal technology for next-generation wireless networks, enabling simultaneous data transmission and environmental sensing. However, existing ISAC systems face fundamental limitations in achieving high-resolution sensing while maintaining robust communication security and spectral efficiency. This paper introduces a transformative approach leveraging stacked intelligent metasurfaces (SIM) to overcome these challenges. We propose a multi-functional SIM-assisted system that jointly optimizes communication secrecy and sensing accuracy through a novel layered optimization framework. Our solution employs a multi-objective optimization formulation that balances secrecy rate maximization with sensing error minimization under practical hardware constraints. The proposed layered block coordinate descent algorithm efficiently coordinates sensing configuration, secure beamforming, communication metasurface optimization, and resource allocation while ensuring robustness to channel uncertainties. Extensive simulations demonstrate significant performance gains over conventional approaches, achieving 32-61% improvement in sensing accuracy and 15-35% enhancement in secrecy rates while maintaining computational efficiency. This work establishes a new paradigm for secure and high-precision multi-functional wireless systems.
Read the full abstract
Combinatorics
Self-Convolutions of Generalized Narayana Numbers
For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} + R_{n-3}$, and then generalize it to the $k$-step Narayana numbers $\mathcal{R}_n$ with order-$k$ recurrence formula $\mathcal{R}_n = \mathcal{R}_{n-1} + \mathcal{R}_{n-k}$.
Read the full abstract
Analysis of PDEs
Solvability of a class of evolution operators on compact Lie groups
This paper provides sufficient conditions for the solvability of a class of first-order evolution operators of Vekua-type on the product of a one-dimensional torus and a compact Lie group. The conditions are expressed in terms of the time-dependent coefficients and the spectral behavior of a normalized left-invariant vector field on the group. The three-sphere case is discussed in detail, leading to more explicit criteria, and the main results are further extended to operators defined on finite products of compact Lie groups.
Read the full abstract
Numerical Analysis · Cross-listed from quant-ph
Tomography by Design: An Algebraic Approach to Low-Rank Quantum States
We present an algebraic algorithm for quantum state tomography that leverages measurements of certain observables to estimate structured entries of the underlying density matrix. Under low-rank assumptions, the remaining entries can be obtained solely using standard numerical linear algebra operations. The proposed algebraic matrix completion framework applies to a broad class of generic, low-rank mixed quantum states and, compared with state-of-the-art methods, is computationally efficient while providing deterministic recovery guarantees.
Read the full abstract
Dynamical Systems
Time-Spectral Resolvent Analysis For Periodic Dynamical Systems
Traditional resolvent analysis is a powerful framework for identifying the most amplified input-output structures in fluid flows from a stationary base state. Extending this resolvent analysis to periodic base flows poses computational challenges due to quasi-periodic responses and expensive linearization around a time-varying base flow. This work proposes a time-spectral resolvent operator formulated using the time-spectral method and Fourier collocation that operates directly in the time domain. Rather than mapping between truncated Fourier coefficients as in frequency-domain approaches, the proposed operator maps forcing and response envelopes defined on a discrete temporal grid, enabling direct Jacobian evaluation at collocation points without computing Fourier coefficients of the base flow. The time-spectral resolvent achieves spectral convergence and offers simplified implementation that integrates easily with existing scientific computing tools. The time-spectral resolvent method is validated numerically in three examples including the parametrically forced Mathieu oscillator, the autonomous van der Pol oscillator and the complex Ginzburg-Landau partial differential equation to show that the proposed method accurately predicts the maximum energy amplification and optimal response mode when the system is subject to optimal quasi-periodic forcing. The proposed framework provides a foundation for extending resolvent-based analysis and control to high-dimensional periodic dynamical systems.
Read the full abstract
Numerical Analysis
Equivalence of mixed and nonconforming methods on general polytopal partitions. Part I: Multiscale and projection methods
We study equivalence, in the context of a variable diffusion problem, between (conforming) mixed methods and (primal) nonconforming methods defined on potentially general polytopal partitions. In this first paper of a series of two, we focus on multiscale and projection methods. For multiscale methods, we establish the first-level equivalence between four different (oversampling-free) approaches, thereby broadening the results of [Chaumont-Frelet, Ern, Lemaire, Valentin; M2AN, 2022]. For projection methods, in turn, we provide a simple criterion (to be checked in practice) for primal/mixed well-posedness and equivalence to hold true. In the process, we also shed a new light on some self-stabilized hybrid methods. Part II of this work will address (general) polytopal element methods.
Read the full abstract
Algebraic Geometry
Zariski equisingularity of surface singularities in $\mathbb C^3$ by a local invariant
We associate to every analytic surface singularity $(V,0)$ in $(\mathbb C^3,0)$, not necessarily isolated, an invariant $mult^* (V)$ and show that an analytic family of such singularities $(V_t,0)$, $t\in (\mathbb C^l,0)$, is generically Zariski equisingular if and only if $mult^* (V_t)$ is constant. The invariant, that we call the multiplicity sequence of $V$, takes into account the multiplicities of the successive discriminants of $V$ by generic corank one projections.
Read the full abstract
Probability
Derivation of the AMP equations from belief propagation for the $\ell_2$ minimisation problem
We consider the $\ell_p$-minimisation, which consists of finding the vector $x\in\mathbb{R}^N$ which minimises $\|x\|_p$ subject to the linear constraint $y=Ax$, where $y\in\mathbb{R}^m$ is given and $A$ is a $m\times N$ random matrix with i.i.d. sub-Gaussian centred entries ($m<N$). This can be viewed as the zero temperature version of a statistical mechanics problem, in which one introduces a suitable Gibbs measure on $\mathbb{R}^N$. To such a Gibbs measure there are associated belief propagation equations. We prove in the easiest case $p=2$ that the means of the distributions obtained by the belief propagation iteration satisfy asymptotically the approximate message passing equations.
Read the full abstract
Mathematical Physics
Quantization as a Categorical Equivalence for Hilbert Bimodules and Lagrangian Relations
It is well known that classical and quantum theories carry distinct types of representations, each type of representation corresponding to possible values of generalized charges in the classical or quantum context. This paper demonstrates a sense in the structure of these representation theories is preserved from classical to quantum physics. To show this, I discuss distinct representation-theory preserving morphisms in the classical and quantum contexts. Specifically, I consider categories whose morphisms are Lagrangian relations in the classical context and Hilbert bimodules in the quantum context. These morphisms are significant because they give rise to induced representations of classical and quantum theories, respectively. I consider quantization and the classical limit as determining functors between these categories. I treat quantization via the strict deformation quantization of a Poisson algebra and the classical limit via the extension of a uniformly continuous bundle of C*-algebras. With these tools, I prove that the quantization and classical limit functors are "almost-inverse" to each other, thus establishing a categorical equivalence.
Read the full abstract
Information Theory
GRAM-DIFF: Gram Matrix Guided Diffusion for MIMO Channel Estimation
We propose GRAM-DIFF, a Gram-matrix-guided diffusion framework for semi-blind multiple input multiple output (MIMO) channel estimation. Recent diffusion-based estimators leverage learned generative priors to improve pilot-based channel estimation; but they do not exploit second-order structural information estimated from data symbols. In practical systems, the channel Gram matrix can be estimated from received symbols and it provides realization-level information about channel subspace structure. The proposed method integrates a pre-trained angular-domain diffusion prior with two complementary guidance mechanisms: a novel Gram-matrix guidance term that enforces second-order consistency during the reverse diffusion process, and likelihood guidance from pilot observations. Signal-to-noise ratio (SNR)-matched initialization and adaptive guidance scaling ensure stability and low inference latency. Simulations on 3GPP and QuaDRiGa channel models demonstrate consistent normalized mean-squared error (NMSE) improvements over deterministic diffusion baselines, achieving 4 to 6 dB SNR gains at an NMSE of 0.1 over the baseline in Fest et al. (2024). The framework exhibits graceful degradation under coherence-time constraints, smoothly reverting to likelihood-guided diffusion when data-based Gram estimates become unreliable.
Read the full abstract
Algebraic Geometry
Moduli of Higgs bundles over the two punctured elliptic curve
We study moduli spaces of Higgs bundles with two poles on an elliptic curve. We describe all singular fibers of the Hitchin map, including the nilpotent cone. To achieve this, we consider a modular map that lifts Higgs bundles with five poles on the Riemann sphere to Higgs bundles on the elliptic curve. This map is a two-sheeted covering and we analyze its Galois involution. We prove that the modular map is surjective and determine its ramification locus. In particular, we also obtain an explicit description of the singular locus of the moduli space.
Read the full abstract
Probability · Cross-listed from q-fin.MF
Optimal investment under capital gains taxes
We generalize classical existence results for expected utility maximization in discrete time frictionless market models to models with capital gains taxes. We consider the realistic but mathematically challenging rule that losses do not trigger negative taxes but can only be offset against potential gains in the future. Central to the analysis is a well-known phenomenon from arbitrage-free markets with proportional transaction costs that does not exist in arbitrage-free frictionless markets: an investment in specific quantities of stocks that is completely riskless but may provide an advantage over holding money in the bank account. As a result of this phenomenon, on an infinite probability space, no-arbitrage does not imply that the set of attainable terminal wealth is closed in probability. We provide simple sufficient conditions for closedness. Then, we characterize the closure of the set of attainable terminal wealth, thereby identifying precisely the source of non-closedness. As a by-product, we obtain a new construction for an integrable majorant that dominates the utilities of all nonnegative terminal wealth attainable from a given initial capital in a frictionless market and that works directly in multiperiod models.
Read the full abstract
Commutative Algebra
Powers of binary forms and derived Hermite reciprocity
For $a,b \ge 1$, Hilbert found in 1886 a collection of polynomial equations that cut out set-theoretically the variety X parametrizing a-th powers of binary forms of degree b. We determine the ideal of all polynomials vanishing on X, showing that it is generated in degree b+1 and that it has a linear minimal free resolution. We do this by generalizing results of Abdesselam and Chipalkatti on an analogue of the Foulkes–Howe map and by establishing a derived analogue of the classical Hermite reciprocity theorem for complexes of ${\rm SL}_2$-representations. In our investigation, we are led to the ideal generated by the subrepresentation ${\rm Sym}^{ab}({\Bbb C}^2) \subset {\rm Sym}^a({\rm Sym}^b {\Bbb C}^2)$. We determine its Castelnuovo–Mumford regularity in general and the minimal free resolution for small values of b.
Read the full abstract
Operator Algebras
Partial actions of free groups and groupoid homology
We give a length one projective resolution of the trivial module for the groupoid of a semi-saturated partial action (in the sense of Exel) of a free group on a compact Hausdorff and totally disconnected space. As a consequence we obtain an elementary computation of the homology of these groupoids, which include transformation groupoids of free group actions and Deaconu-Renault groupoids of systems $(X,T)$ where $X$ is compact Hausdorff and totally disconnected and $T$ is a local homeomorphism with domain a clopen subset of $X$. We also show that algebra of such a partial action groupoid over a field has global dimension at most $2$ when the space is second countable.
Read the full abstract
Metric Geometry
Chord Sobolev inequalities
The paper establishes a new family of sharp analytic inequalities. Together with the fractional Sobolev inequalities of Almgren and Lieb, they form a complete class of analytic inequalities, referred to as the chord Sobolev inequalities. A close connection between these inequalities and chord isoperimetric inequalities in integral geometry is established through a functional extension of chord power integrals. The limiting cases of the chord Sobolev inequalities are derived, one of which yields a logarithmic Sobolev-type inequality. Combined with the work of Bourgain, Brezis, and Mironescu, these results complete the picture of the chord Sobolev inequalities, including their endpoint cases.