Combinatorics
Log-Concavity and Infinite Log-Concavity of Linear Recurrent Sequences with Linear Coefficients via Companion Matrix Methods
Piero Giacomelli
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in companion-
matrix form $\mathbf{v}_{n+1} = M_n\,\mathbf{v}_n$ with $M_n = nA + B$, we show that the log-concave operator value $\mathcal{L}(a_n) = b_n \coloneqq a_n^2 - a_{n+1}a_{n-1}$ is a quadratic form in the state vector $\mathbf{v}_n$, and identify the
matrix $Q_n = Q^{(0)} + nQ^{(1)}$ whose positive semi-definiteness gives a sufficient condition for log-concavity. For the class of second-order recurrences with constant coefficients, we prove a tight (necessary and sufficient) criterion for the sequence to be $\infty$-log-concave, a consequence of the fact that $\mathcal{L}(a_n)$ is itself a
geometric sequence so that $\mathcal{L}^2(a_n) = 0$ identically. We obtain analogous tight criteria for sequences fixed by $\mathcal{L}$, and for P-recursive sequences satisfying a dominant-root asymptotic behaviour. We leave some further insight in case this criteria break down in full generality.
Read the full abstract ▾
Algebraic Geometry
Minimal resolutions of toric substacks by line bundles
Zengrui Han
We construct minimal resolutions of pushforwards of structure sheaves of toric substacks of smooth toric stacks by line bundles, by realizing them as strong deformation retracts of the cellular resolutions constructed by Hanlon, Hicks, and Lazarev. We also provide a canonical and combinatorial description of the differentials of these minimal resolutions. The construction combines the homological perturbation lemma with Moore-Penrose inverses, and suggests a general strategy for extracting minimal resolutions from explicit non-minimal cellular resolutions, with potential broader applications to other settings in commutative
algebra.
Read the full abstract ▾
Combinatorics
The Geometry of Rectangular Multisets
Michael Dougherty and Jon McCammond
This article describes a natural piecewise Euclidean bi-simplicial
cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex
polynomials and permutahedra.
Combinatorics · Cross-listed from quant-ph
Learning Cut Distributions with Quantum Optimization
Bao Bach, Cameron Ibrahim, Reuben Tate et al. (+3 more)
Many combinatorial optimization problems admit a maximin
fairness variant, where the aim is to find a distribution over possible solutions which maximizes an expected worst-case outcome. However, the support for an optimal distribution may be exponential, which can be intractable to represent in the worst case. To this end, we propose a
quantum based approach to solving distribution optimization problems. Expanding on work analyzing the Dynamical Lie
Algebras of the
Quantum Approximate Optimization
Algorithm (QAOA), we show that with a finite number of layers, a QAOA ansatz can be constructed to capture any distribution over bitstrings. We show that the resulting
circuit is able to effectively solve the Fair Cut Cover, a fair interpretation of the classical Fractional Cut Cover Problem. In addition, we show that our
algorithm is provably better than classical approximations on certain graph structures and empirically outperforms these classical
algorithms on tested instances.
Read the full abstract ▾
All authors Bao Bach, Cameron Ibrahim, Reuben Tate, Jad Salem, Stephan Eidenbenz, Ilya Safro
Optimization and Control
A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization
Figen Oztoprak and Richard Byrd
We propose a sequential quadratic programming (SQP)
algorithm for inequality constrained optimization that is robust to the presence of bounded noise in function and derivative evaluations. We cover the case where constraint evaluations contain noise as well as the objective. The proposed
algorithm is a line search SQP method with relaxations to deal with noise. We study the effect of noise on the global convergence behavior of the
algorithm. We implement the
algorithm with noise-aware quasi-Newton updates, and numerically observe that the
algorithm can achieve accuracy proportional to the noise level and problem-dependent parameters, as suggested by the theory.
Read the full abstract ▾
Differential Geometry
Gradient estimates for a parabolic partial differential equation under the Ricci-Bourguignon flow
José N.V. Gomes, Willian I. Tokura and Hikaru Yamamoto
We study the
Ricci-Bourguignon flow on warped product
manifolds with noncompact base. This setting leads naturally to a
parabolic partial differential equation on the space of smooth warping functions, arising from the necessary and sufficient conditions for a warped metric to evolve under the flow. One of our main results establishes a gradient estimate for this equation, providing the analytic input for the
geometric applications developed herein and, in particular, recovering classical gradient estimates for the heat equation under the
Ricci flow. Furthermore, we develop a method for constructing explicit warped product solutions to the
Ricci-Bourguignon flow and present examples that illustrate the scope and
geometric relevance of our results
Read the full abstract ▾
Optimization and Control
Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
Michael J. O'Neill and Aoji Tang
In this paper, we consider nonlinear optimization problems with a
stochastic objective function and deterministic equality constraints. We propose an inexact two-stepsize
stochastic sequential quadratic programming (SQP)
algorithm and analyze its worst-case complexity under mild assumptions. The method utilizes a step decomposition strategy and handles
stochastic gradient estimates by assigning different stepsizes to different components of the search direction. We establish the first known $\mathcal{O}(\epsilon_c^{-2})$ worst-case complexity with respect to the infeasibility measure when no constraint qualification is assumed and a worst-case complexity of $\mathcal{O}(\epsilon_c^{-1})$ when LICQ holds, matching the best known result in the literature. In addition, under mild conditions, our method achieves the optimal $\mathcal{O}(\epsilon_L^{-4})$ complexity with respect to the gradient of the Lagrangian regardless of constraint qualifications. Our results provide the first complexity guarantees for the popular Byrd-Omojukun step decomposition strategy and verify its theoretical efficacy. Numerical experiments show that our
algorithm has a superior infeasibility convergence performance and a competitive KKT convergence rate compared to the state-of-the-art
stochastic SQP method.
Read the full abstract ▾
Numerical Analysis
GTH Algorithm, Censored Markov Chains, and $RG$-Factorization in Block-Form
Qihui Bu and Yiqiang Q. Zhao
In 1985, Grassmann, Taksar, and Heyman published their celebrated paper, in which they introduced a numerically stable
algorithm for computing the stationary probabilities of a finite-state Markov chain, one of the key performance quantities in both theory and applications. This
algorithm later became the well-known GTH
algorithm (or the state-reduction method) in the literature, becoming one of the standard
algorithms in applied probability. Later, this
algorithm was extended to deal with the stationary distributions of block-structured Markov chains with repeating rows. In this paper, we focus on the block-form GTH
algorithm and organize it into two parts. In the first part, we connect the block-form GTH
algorithm to censored Markov chains and the block-form $RG$-factorization. We show that the forward block-elimination and back block-form substitution of the block-form GTH
algorithm are equivalent to solving a system formulated using the $RG$-factorization in two steps. We also show that this connection remains valid when the block-form GTH
algorithm is extended to infinite-state Markov chains. It is well known that censoring an infinite-state Markov chain to a finite state space yields a stationary distribution that provides a best approximation to the stationary distribution of the original infinite-state Markov chain. In the second part, we first derive an explicit expression for the censored Markov chain from the infinite state space to a finite space for Markov chains of $M/G/1$ type. Based on this expression, we propose a renormalized approximated censored transition
matrix (RA-CM). The resulting stationary distribution is shown to be asymptotically optimal in terms of approximation error. We compare the approximation error of the RA-CM with the error arising from the last-block-column augmentation.
Read the full abstract ▾
Probability
Fluctuations for the Toda lattice
Amol Aggarwal and Matthew Nicoletti
In this paper we consider the Toda
lattice $(\mathbf{p}(t);\mathbf{q}(t))$ at thermal
equilibrium, meaning that its variables $(p_j)$ and $(e^{q_j-q_{j+1}})$ are independent Gaussian and Gamma random variables, respectively. We show under diffusive scaling that the space-time fluctuations for the model's currents converge to an explicit Gaussian limit. As consequences, we deduce, (i) the scaling limit for the trajectory of a single particle $q_0$ is a Brownian motion; (ii) space-time two-point correlation functions for the model decay inversely with time, with explicit scaling distributions predicted by Doyon (SciPost Phys. 5 (2018), 054) and Spohn (J. Phys. A 53 (2020), 265004). Our starting point is the notion that the Toda
lattice can be thought of as a dense collection of many “quasi-particles” that interact through scattering. The core of our work is to establish that the full joint scaling limit of the fluctuations for these quasi-particles is given by a Gaussian process, called a dressed Lévy-Chentsov field.
Read the full abstract ▾
Metric Geometry
Projection Theorems for $\Phi$-Intermediate Dimensions
Lara Daw and Najmeddine Attia
$\Phi$-intermediate dimensions interpolate between Hausdorff and box-counting dimensions by restricting admissible coverings to scale windows of the form $[\Phi(r),r]$. Using a family of $\Phi$-dependent kernels, we develop a potential-theoretic framework that characterizes these dimensions in terms of capacities and leads to associated $\Phi$-dimension profiles. This framework provides effective tools for obtaining lower bounds from uniform potential estimates. As an application, we prove Marstrand–Mattila type projection
theorems, showing that for $\gamma_{n,m}$-almost all $m$-dimensional subspaces $V$, the $\Phi$-intermediate dimensions of $\pi_V E$ coincide with deterministic profile values depending only on $E$ and $m$. We also discuss consequences for continuity at the Hausdorff end-point and for the box dimensions of typical projections.
Read the full abstract ▾
Classical Analysis and ODEs
Energy, Polarization, and Separation of Greedy Sequences for Riesz and Green Kernels
Dmitriy Bilyk, Liudmyla Kryvonos, Ryan W. Matzke et al. (+1 more)
We investigate the asymptotic behavior of greedy $s$-Riesz and Green energy sequences $\{x_{n}\}_{n=1}^{\infty}$ on the unit sphere $\mathbb{S}^{d} \subset \mathbb{R}^{d+1}$, where each point $x_n$ is defined as the minimizer of the discrete potential generated by the preceding points $x_1, x_2, ..., x_{n-1}$. We show that the greedy sequence attains optimal growth behavior for the second-order term of the Green and Riesz $s$-energies when $d-2 \leq s < d$. The main idea is to establish the bounds on polarization using well-separation properties of the greedy configurations.
Read the full abstract ▾
All authors Dmitriy Bilyk, Liudmyla Kryvonos, Ryan W. Matzke, Edward Saff
Probability
The free energy of the interacting Bose gas: a variational description with loops and interlacements
Wolfgang König
We consider the interacting Bose gas in the thermodynamic limit in a large box in $\R^d$ at positive temperature $1/\beta\in(0,\infty)$ with particle density $\sim\rho\in(0,\infty)$. We follow a path-integral approach and adopt from \cite {ACK10} a description of the free energy in terms of the Brownian loop soup, a Poisson point process consisting of Brownian bridges, also called loops or cycles. It is the objective of this paper to derive, for any values of $\beta$ and $\rho$, a formula for the limiting free energy with explicit control on the particle numbers in the short and in the long loops. The latter are presumed to play the role of the condensate, according to Feynman's \cite{F53} famous, vague suggestion, and they turn into random interlacements (bi-infinite, locally finite random processes in $\R^d$) in our formula. In \cite{ACK10} there was no concept that could describe the long loops; only small $\rho$ could be handled successfully. In the present paper we represent the limiting free energy in terms of a variational formula, ranging over the set of all stationary point processes with loops and with interlacements, having each a given particle density, and minimizing the sum of the interaction energy and a characteristic
entropy term. The latter is a new kind of a specific relative
entropy density with respect to the reference process of loops (the Brownian loop soup), together with an independent Markov kernel describing collections of path shreds in large boxes. In $d\geq 3$, the latter can be seen as a projection of the {\em Brownian interlacement Poisson point process with $\beta$-spacing}. Our proof tool box comes from large-deviation theory, both for the derivation of the formula for the free energy and for the proof of the existence of the specific relative
entropy.
Read the full abstract ▾
Information Theory
Aerial Multi-Functional RIS in Fluid Antennas-Aided Full-Duplex Networks: A Self-Optimized Hybrid Deep Reinforcement Learning Approach
Li-Hsiang Shen and Yu-Quan Zheng
To address high data traffic demands of sixth-generation (6G) networks, this paper proposes a novel architecture that integrates autonomous aerial vehicles (AAVs) and multi-functional reconfigurable intelligent surfaces (MF-RISs) as AM-RIS in fluid
antenna (FA)-assisted full-duplex (FD) networks. The AM-RIS provides hybrid functionalities, including signal reflection, amplification, and energy harvesting (EH), potentially improving both signal coverage and sustainability. Meanwhile, FA facilitates fine-grained spatial adaptability at FD-enabled base station (BS), which complements residual self-interference (SI) suppression. We aim at maximizing the overall energy efficiency (EE) by jointly optimizing transmit DL beamforming at BS, UL user power, configuration of AM-RIS, and positions of the FA and AM-RIS. Owing to the hybrid continuous-discrete parameters and high dimensionality of the intractable problem, we have conceived a self-optimized multi-
agent hybrid deep reinforcement learning (DRL) framework (SOHRL), which integrates multi-
agent deep Q-networks (DQN) and multi-
agent proximal policy optimization (PPO), respectively handling discrete and continuous actions. To enhance self-adaptability, an
attention-driven state representation and meta-level hyperparameter optimization are incorporated, enabling multi-
agents to autonomously adjust learning hyperparameters. Simulation results validate the effectiveness of the proposed AM-RIS-enabled FA-aided FD networks empowered by SOHRL
algorithm. The results reveal that SOHRL outperforms
benchmarks of the case without
attention mechanism and conventional hybrid/multi-
agent/standalone DRL. Moreover, AM-RIS in FD achieves the highest EE compared to half-duplex, conventional rigid
antenna arrays, partial EH, and conventional RIS without amplification, highlighting its potential as a compelling solution for EE-aware wireless networks.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Depth dependence of entanglement and circuit complexity in random linear optical networks
Laura Shou, Joseph T. Iosue, Yu-Xin Wang et al. (+2 more)
We study the growth of
entanglement and
circuit complexity in random passive linear optical networks as a function of the
circuit depth. For
entanglement dynamics, we start with an initial Gaussian state with all $n$ modes equally squeezed. For random brickwork
circuits, we show that
entanglement, as measured by the Rényi-2
entropy, grows diffusively as a function of the depth, in contrast to the linear growth for random
qubit brickwork
circuits. In the other direction, for arbitrary
circuit geometries we prove bounds on depths which ensure the average-case subsystem
entanglement reaches within a constant factor of the maximum value in all subsystems, and bounds which ensure closeness of the random linear optical
unitary to a Haar random
unitary in $L^2$ Wasserstein distance. We also consider robust
circuit complexity for random one-dimensional brickwall
circuits, as measured by the minimum number of gates required in any
circuit that approximately implements the linear optical
unitary. Viewing this as a function of the number of modes and the
circuit depth, we show the robust
circuit complexity for random one-dimensional brickwall
circuits scales at most diffusively in the depth with high probability, again in contrast to the linear scaling for certain random
qubit circuits. The corresponding Gaussian
unitary $\tilde{\mathcal U}$ for the approximate implementation retains high output fidelity $|\langle\psi|\mathcal U^\dagger \tilde{\mathcal U}|\psi\rangle|^2$ for pure states $|\psi\rangle$ with constrained expected
photon-number.
Read the full abstract ▾
All authors Laura Shou, Joseph T. Iosue, Yu-Xin Wang, Victor Galitski, Alexey V. Gorshkov
Mathematical Physics · Cross-listed from hep-th
Magic and Non-Clifford Gates in Topological Quantum Field Theory
William Munizzi and Howard J. Schnitzer
Non-Clifford gates, used to generate
quantum magic, are essential for universal
quantum computation. We show that non-Clifford gates arise naturally from path integrals in topological
quantum field theories, where their magic-generating properties are determined by the algebraic data of the theory. In Chern-Simons theory, we construct the Ising interaction gate, whose generator is prepared by path integration over simple three-boundary
manifolds, and show that it produces non-local magic away from discrete Clifford points. We show that the Toffoli gate is obstructed in $SU(2)_1$ by the $\mathbb{Z}_2$ fusion structure, while $SU(2)_3$ is the minimal theory supporting the required conditional logic, given the density of the mapping class group in the projective
unitary group on the
manifold boundary. Finally, we demonstrate that the T gate arises as a path integral in Dijkgraaf-Witten theory, with gauge group $\mathbb{Z}_4$, where a single Dehn twist on the boundary
torus produces the gate without approximation. These results show that topological path integrals construct gates in multiple levels of the Clifford hierarchy, and across distinct classes of field theories, with implications for topological
quantum computing.
Read the full abstract ▾
Combinatorics
Enumerative Combinatorics of Homogeneous Linear Orderings
David Gonzalez
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates $sp-$homogeneity, a notion recently uncovered in [2] to have important computability theoretic properties. Explicit formulas are derived for both of the quantities in question, along with asymptotic bounds. The objects being counted are generally infinite, and it is not obvious that there are even only finitely many. This fact, along with the more precise counting, is demonstrated by corresponding the linear orderings with finite objects.
Read the full abstract ▾
General Mathematics
Concentric Circles Each Passing Through One Vertex of Each of Two Regular Polygons
Mamuka Meskhishvili
Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the problem of whether such a construction is possible for any two given regular $n$-gons on the plane. In this paper, we establish the necessary and sufficient conditions for the existence of $n$ concentric circles such that each circle passes through one vertex of each of the two regular $n$-gons. Keywords and phrases: Polygonal distances, cyclic averages, concentric circles, two regular polygons, two equilateral triangles, two squares
Read the full abstract ▾
General Mathematics
Higher regularity of solutions of an iterative functional equation
Liang Feng and Xiao Tang
In this paper, we investigate the existence of $C^n$, $n\in \mathbb{N}^+$, solutions for a class of second-order iterative functional equations involving iterates of the unknown function and a nonlinear term. Applying the Fiber Contraction
Theorem and Faà di Bruno's Formula, we establish the existence of bounded $C^n$ solutions with bounded derivatives of order from $1$ to $n$.
Read the full abstract ▾
Differential Geometry
Mean curvature flows with prescribed singular sets
Raphael Tsiamis
For every closed set $K \subset \mathbb{R}^n$ and every $m \geq 2$, we construct a mean-convex ancient solution to mean
curvature flow of hypersurfaces in $\mathbb{R}^{m+n}$, with respect to a smooth Riemannian metric arbitrarily $C^\infty$-close to the Euclidean metric, whose first-time singular set is exactly $K \times \{0\}$.
Read the full abstract ▾
Probability
Sweet Trims are made of Threes: A càdlàg erasure of the Brownian tree
Alessandra Caraceni, Nicolas Curien, William Fleurat et al. (+1 more)
We present a simple trimming
algorithm that generates nested uniform binary plane trees by removing leaves one-by-one using a best-of-three-match procedure. While its one-step transition specializes to the Luczak-Winkler & Caraceni-Stauffer coupling, its scaling limit provides a suprising càdlàg erasure of Brownian trees, reminiscent of SLE theory.
Read the full abstract ▾
All authors Alessandra Caraceni, Nicolas Curien, William Fleurat, Adrianus Twigt
Information Theory · Cross-listed from cs.CR
Temporary Power Adjusting Withholding Attack
Mustafa Doger and Sennur Ulukus
We consider the block withholding attacks on pools, more specifically the state-of-the-art Power Adjusting Withholding (PAW) attack. We propose a generalization called Temporary PAW (T-PAW) where the adversary withholds a fPoW from pool mining at most $T$-time even when no other block is mined. We show that PAW attack corresponds to $T\to\infty$ and is not optimal. In fact, the extra reward of T-PAW compared to PAW improves by an unbounded factor as
adversarial hash fraction $\alpha$, pool size $\beta$ and
adversarial network influence $\gamma$ decreases. For example, the extra reward of T-PAW is 22 times that of PAW when an adversary targets a pool with $(\alpha,\beta,\gamma)=(0.05,0.05,0)$. We show that honest mining is sub-optimal to T-PAW even when there is no difficulty adjustment and the
adversarial revenue increase is non-trivial, e.g., for most $(\alpha,\beta)$ at least $1\%$ within $2$ weeks in Bitcoin even when $\gamma=0$ (for PAW it was at most $0.01\%$). Hence, T-PAW exposes a significant structural weakness in pooled mining-its primary participants, small miners, are not only contributors but can easily turn into potential adversaries with immediate non-trivial benefits.
Read the full abstract ▾
Dynamical Systems · Cross-listed from eess.SY
Joint Identification of Linear Dynamics and Noise Covariance via Distributional Estimation
Yang Hu and Na Li
In this paper, we propose a novel framework for the joint identification of system dynamics and noise covariance in linear systems, under general noise distributions beyond Gaussian. Specifically, we would like to simultaneously estimate the dynamical
matrix $A$ and the noise covariance
matrix $\varSigma$ using state transition data. The formulation builds upon a novel parameterization of the state-transition distribution, which enables more effective use of distributional "shape" information for improved identification accuracy. We introduce two practical
estimators, namely the maximum likelihood
estimator (MLE) and the score-matching
estimator (SME), to solve the joint dynamics-covariance identification problem, and provide rigorous analysis of their statistical properties and sample complexity. Simulation results show that the proposed
estimators outperform the ordinary least squares (OLS) baseline.
Read the full abstract ▾
Algebraic Geometry
Lagrangian correspondences for moduli spaces of Higgs bundles and holomorphic connections
Panagiotis Dimakis, Duong Dinh and Shengjing Xu
On a compact connected Riemann surface $C$ of genus at least $2$, we construct Lagrangian correspondences between
moduli spaces of rank-$n$
Higgs bundles (respectively, holomorphic connections) and the
Hilbert schemes of points on $T^\ast C$ (respectively, the twisted cotangent bundles of $C$). Central to these constructions are
Higgs bundles (respectively, holomorphic connections) which are transversal to line subbundles of the underlying bundles: these naturally induce divisors on $C$ together with auxiliary parameters, namely lifts to divisors on spectral curves for
Higgs bundles and residue parameters of apparent singularities for holomorphic connections. We discuss the evidence showing that the Dolbeault
geometric Langlands correspondence is generically realized by these Lagrangian correspondences; we expect that the de Rham
geometric Langlands correspondence can be realized by their quantization, following Drinfeld's construction of Hecke eigensheaves. We also discuss the relations of our constructions to various topics, including reductions of Kapustin-Witten equations, the conformal limit, separation of variables, and degenerate fields in conformal field theories.
Read the full abstract ▾
Probability
The scaling limit of random walk and the intrinsic metric on planar critical percolation
Irina {\DJ}anković, Maarten Markering, Jason Miller et al. (+1 more)
We consider critical site percolation ($p=p_c=1/2$) on the triangular
lattice $\mathbf{T}$ in two dimensions. We show that the simple random walk on the clusters of open vertices converges in the scaling limit to a continuous
diffusion which lives in the gasket of a conformal loop ensemble with parameter $\kappa = 6$ $\big(\mathrm{CLE}_6\big)$, the so-called $\mathrm{CLE}_6$ Brownian motion. We also show that the intrinsic (i.e., chemical distance) metric converges in the scaling limit to the geodesic $\mathrm{CLE}_6$ metric. As a consequence, we deduce the existence of the chemical distance exponent, the resistance exponent, and the spectral dimension of the critical percolation clusters. Moreover, we show that the exponents satisfy the Einstein relations.
Read the full abstract ▾
All authors Irina {\DJ}anković, Maarten Markering, Jason Miller, Yizheng Yuan
Spectral Theory · Cross-listed from cs.LG
Complex Interpolation of Matrices with an application to Multi-Manifold Learning
Adi Arbel, Stefan Steinerberger and Ronen Talmon
Given two symmetric positive-definite
matrices $A, B \in \mathbb{R}^{n \times n}$, we study the spectral properties of the interpolation $A^{1-x} B^x$ for $0 \leq x \leq 1$. The presence of `common structures' in $A$ and $B$, eigenvectors pointing in a similar direction, can be investigated using this interpolation perspective. Generically, exact log-linearity of the operator norm $\|A^{1-x} B^x\|$ is equivalent to the existence of a shared eigenvector in the original
matrices; stability bounds show that approximate log-linearity forces principal singular vectors to align with leading eigenvectors of both
matrices. These results give rise to and provide theoretical justification for a multi-
manifold learning framework that identifies common and distinct latent structures in multiview data.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.LG
Momentum Further Constrains Sharpness at the Edge of Stochastic Stability
Arseniy Andreyev, Advikar Ananthkumar, Marc Walden et al. (+2 more)
Recent work suggests that (
stochastic) gradient descent self-organizes near an instability boundary, shaping both optimization and the solutions found. Momentum and mini-batch gradients are widely used in practical deep learning optimization, but it remains unclear whether they operate in a comparable regime of instability. We demonstrate that SGD with momentum exhibits an Edge of
Stochastic Stability (EoSS)-like regime with batch-size-dependent behavior that cannot be explained by a single momentum-adjusted stability threshold. Batch Sharpness (the expected directional mini-batch
curvature) stabilizes in two distinct regimes: at small batch sizes it converges to a lower plateau $2(1-\beta)/\eta$, reflecting amplification of
stochastic fluctuations by momentum and favoring flatter regions than vanilla SGD; at large batch sizes it converges to a higher plateau $2(1+\beta)/\eta$, where momentum recovers its classical stabilizing effect and favors sharper regions consistent with full-batch dynamics. We further show that this aligns with linear stability thresholds and discuss the implications for hyperparameter tuning and coupling.
Read the full abstract ▾
All authors Arseniy Andreyev, Advikar Ananthkumar, Marc Walden, Tomaso Poggio, Pierfrancesco Beneventano
Numerical Analysis
Bound-Preserving Flux-Corrected Transport Methods for Solving Richards' Equation
Arnob Barua, Christopher E. Kees and Dmitri Kuzmin
Simulating infiltration in porous media using Richards' equation remains computationally challenging due to its
parabolic structure and nonlinear coefficients. While a wide range of numerical methods for differential equations have been applied over the past several decades, basic higher-order numerical methods often fail to preserve physical bounds on water pressure and saturation, leading to spurious oscillations and poor iterative solver convergence. Instead, low-order, bound-preserving methods have been preferred. The combination of mass lumping and relative permeability upwinding preserves bounds but degrades accuracy to first order in space. Flux-corrected transport is a high-resolution numerical technique designed for combining the bound-preserving property of low-order schemes with the accuracy of high-order methods, by blending the two methods through limited anti-diffusive fluxes. In this work, we extend flux-corrected transport schemes to the nonlinear, degenerate
parabolic structure of Richards' equation, verify attainment of second-order convergence on unstructured meshes, and demonstrate applications to stormwater management infrastructure.
Read the full abstract ▾
Operator Algebras
Toeplitz exactness for strong convergence
David Gao and Srivatsav Kunnawalkam Elayavalli
We prove a new "Toeplitz exactness"
theorem for strong convergence. This is a machine to upgrade strong convergence in the general setting of $C^\ast$-correspondences, and has several applications.
Category Theory
Internal structures in the category of right-preordered groups
Aubril Ony
We give explicit axioms for the algebraic theory of the quasivarieties of right-preordered groups and preordered groups. We then look at
lattices of effective equivalence relations, which turn out to be similar to the
lattices of equivalence relations in the category of groups. Once this is established, we study internal structures in the category of right-preordered groups. We start with some general results and then prove the S-protomodularity of the category of right-preordered groups, when considering the class S of Schreier split epimorphisms. Following this, we investigate further and prove that the category of right-preordered groups turns out to be action representable when we restrict our
attention to split epimorphisms in S. Relatively to this class of split epimorphisms, we define the notion of S-precrossed modules, and then of S-crossed modules; that correspond exactly to Schreier internal reflexive graphs and Schreier internal categories, respectively. Lastly, we characterize groupoids among Schreier internal categories and give some examples.
Read the full abstract ▾
Functional Analysis
Transfinite Daugavet property
Antonio Avilés, Johann Langemets, Miguel Martín et al. (+1 more)
We extend the Daugavet property and a perfect version of it to transfinite cardinals in order to distinguish between spaces with the ordinary Daugavet property by some kind of complexity (topological, density\ldots), providing a number of examples and results. First, we characterise the transfinite Daugavet $C(K)$ spaces in terms of a cardinal index $\mathfrak r(K)$, which generalises the notion of the reaping number of a Boolean
algebra. Besides, the perfect Daugavet property characterizes the absence of $G_\delta$-points in $K$. We also study several inheritance results of the transfinite Daugavet properties by almost isometric ideals, absolute sums, and tensor product spaces, with a number of applications. We classify these properties for $L_1(\mu)$ and $L_\infty(\mu)$ spaces in terms of the Maharam's decomposition of the measure. We also show that the space of Lipschitz functions $\Lip(M)$ on a complete length metric space has the $\omega$-perfect Daugavet property, improving the previous knowledge.
Read the full abstract ▾
All authors Antonio Avilés, Johann Langemets, Miguel Martín, Abraham Rueda Zoca