Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 22 April

Probability

Edge Universality for Inhomogeneous Random Matrices II: Markov Chain Comparison and Critical Statistics

The first paper in this series introduced a short-to-long mixing condition that captures mean-field GOE/GUE edge universality in the supercritical sparsity regime, for symmetric/Hermitian random matrices with independent entries and a Markov variance profile. This condition reduces the universality problem to the mixing properties of the underlying Markov chains. In this paper, we develop new short-to-long comparison conditions that extend the analysis to the subcritical and critical sparsity regimes. Specifically, we prove that two inhomogeneous random matrices exhibit the same universal edge statistics whenever their variance-profile Markov chains are comparable, regardless of the fine details of the matrix entries. To illustrate the power of our Markov chain comparison theorem, we derive the spectral edge statistics for several prototypical models: random band matrices, the Wegner orbital model, and Hankel-profile random matrices. These comparisons uncover a rich landscape of both universal and non-universal phenomena – shaped by geometric structure, spike patterns, and domains of stable attraction – features that lie fundamentally beyond the reach of classical random matrix theory.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Computationally Efficient Sparse Signal Recovery via Linear Sketching and Deep Unfolding

This paper provides a sparse signal recovery algorithm, DU-PSISTA (Deep Unfolded-Periodic Sketched Iterative Shrinkage-Thresholding Algorithm), which aims to balance computational efficiency and accuracy for recovering high-dimensional sparse signals, and a convergence analysis under sufficient conditions. DU-PSISTA introduces a random matrix projection known as sketching to reduce the dimensionality of gradient computations and periodically alternates between the standard ISTA and the sketched variant. This hybrid structure enables flexible control over the trade-off between accuracy and computational complexity through a pre-configurable period parameter. The algorithm includes many parameters to be tuned such as step sizes and thresholding factors so that we incorporate deep unfolding that optimizes the parameters through data-driven training, enabling the algorithm to adaptively improve convergence speed and performance. We show that the proposed method achieves a linear-type contraction to a neighborhood of the true sparse signal with properly selected parameters. The analysis provides an interpretation for the effectiveness of the hybrid structure to improve recovery accuracy. Numerical experiments confirm that our method achieves comparable recovery performance to conventional deep unfolded ISTA while reducing computational complexity, especially when the period parameter and sketch size are properly selected. The results are also consistent with the theoretical insights.
Read the full abstract

Quantum Algebra

Quantum Super Littlewood Correspondences

In this paper, we study the Littlewood theory associated with the quantum super immanants and supersymmetric polynomials, including both the super case and the quantum generalization. In the setting of quantum super Schur-Weyl duality between the quantum superalgebra $U_q(\mathfrak{gl}_{m|n})$ and the Iwahori-Hecke algebra $\mathcal{H}_r$ of type A, we explicitly construct basis vectors of the $(U_q(\mathfrak{gl}_{m|n}), \mathcal{H}_r)$-bimodule on the tensor product space $(\mathbb{C}^{m|n})^{\otimes r}$. Using this construction, we interpret the quantum super immanants via weight spaces of covariant tensor representations of $U_q(\mathfrak{gl}_{m|n})$.
Read the full abstract

Probability · Cross-listed from cs.RO

Stochastic Barrier Certificates in the Presence of Dynamic Obstacles

In this work, we focus on safety verification of stochastic systems in dynamic environments. We introduce both time-invariant and time-varying barrier certificates for discrete-time, continuous-space systems subject to uncertainty, which provide certified lower bounds on the probability of remaining within a safe set over a finite horizon. These certificates explicitly account for time-varying unsafe regions induced by obstacle dynamics. By leveraging Bellman's optimality perspective, the time-varying formulation directly captures temporal structure and yields less conservative bounds than state-of-the-art approaches. By restricting certificates to polynomial functions, we show that time-varying barrier synthesis can be formulated as a convex sum-of-squares program, enabling tractable optimization. Empirical evaluations on nonlinear systems with dynamic obstacles show that time-varying certificates consistently achieve tight guarantees, demonstrating improved accuracy and scalability over state-of-the-art methods.
Read the full abstract

Analysis of PDEs

Nonlocal Characterizations of Stochastic Completeness on Complete Riemannian Manifolds

In this paper, we first prove that the following generalized conservation principle holds on complete Riemannian manifolds: for every \(0<s<1\) and \(t>0\), \[ T_t^{(s)}\mathbf 1+\int_0^t T_\tau^{(s)}\mathcal R_s\,d\tau=1 \qquad\text{on }M, \] where \(\mathcal R_s\) is the intrinsic killing term measuring the loss of mass of the subordinate semigroup, and the condition \(\mathcal R_s\equiv0\) is equivalent to the stochastic completeness of \(M\). We then provide several new nonlocal characterizations of stochastic completeness. In particular, we show that stochastic completeness is equivalent to genuinely nonlocal conditions, including the zero-mean identity \[ \int_M (-\Delta)^s\varphi\,dV_g=0 \qquad\forall\,\varphi\in C_c^\infty(M), \] as well as the uniqueness of bounded distributional solutions to the associated fractional elliptic and parabolic equations. We also revisit the equivalent \(L^1\)-core characterization for the generator of the heat semigroup, which plays an important role in our approach. In addition, we prove \(L^p\)-contractivity and smoothing properties of the subordinate semigroup, establish both short-time and long-time asymptotic results for the fractional heat kernel, derive the short-time asymptotics of jump probabilities for the associated Markov process, and study the variational characterization and minimality properties of the fractional resolvent. Together, these results provide a unified analytic and probabilistic framework for the fractional Laplacian on complete Riemannian manifolds.
Read the full abstract

Commutative Algebra

New bounds on Castelnuovo–Mumford regularity of monomial curves and application to sumsets

A monomial curve $C$ is defined by a sequence of coprime integers $0 = a_0 < a_1 < \cdots < a_k =: d$. One gap of this sequence is $a_{i+1} - a_i - 1$. Gruson–Lazarsfeld–Peskine bound (1983) says that $reg (C) \le d - k +2$, which is equal to the sum of all gaps plus 2. Lvovsky (1996) showed that it is enough to take the sum of two largest gaps plus 2. In this paper, under some specific conditions, we give several new bounds which are better than Lvovsky's bound. Our method relies on the study of Apery sets and Frobenius numbers. From this we can give new criteria to check the (arithmetically) Cohen–Macaulay and Buchsbaum property of $C$. Algorithms are provided to check these properties as well as to compute $ reg(C)$ and other invariants. We also give an application to study the structure of sumsets.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Structure-Aware Variational Learning of a Class of Generalized Diffusions

Learning the underlying potential energy of stochastic gradient systems from partial and noisy observations is a fundamental problem arising in physics, chemistry, and data-driven modeling. Classical approaches often rely on direct regression of governing equations or velocity fields, which can be sensitive to noise and external perturbations and may fail when observations are incomplete. In this work, we propose a structure-aware, energy-based learning framework for inferring unknown potential functions in generalized diffusion processes, grounded in the energetic variational approach. Starting from the energy-dissipation law associated with the Fokker-Planck equation, we construct loss functions based on the De Giorgi dissipation functional, which consistently couple the free energy and the dissipation mechanism of the system. This formulation avoids explicit enforcement of the governing partial differential equation and preserves the underlying variational structure of the dynamics. Through numerical experiments in one, two, and three dimensions, we demonstrate that the proposed energy-based loss exhibits enhanced robustness with respect to observation time, noise level, and the diversity and amount of available training data. These results highlight the effectiveness of energy-dissipation principles as a reliable foundation for learning stochastic diffusion dynamics from data.
Read the full abstract

All authors Yubin Lu, Xiaofan Li, Chun Liu, Qi Tang, Yiwei Wang

Mathematical Physics

Quantitative Direct Sampling for Initial Acoustic Sources

This paper addresses the challenge of quantitatively reconstructing initial acoustic sources from time-dependent wave measurements. We introduce novel indicator functions defined through spacetime integrals of acoustic data and carefully designed auxiliary functions. These indicators are foundational for both proving the uniqueness of source reconstruction and developing a quantitative direct sampling scheme. Our comprehensive numerical experiments demonstrate the robustness, accuracy, and computational efficiency of these methods, highlighting their potential for practical acoustic imaging applications.
Read the full abstract

Group Theory

On free components of Artin and Coxeter groups

The number of connected components can be remembered by the von Neumann algebra among Artin groups, the only possible exception being the case that corresponds to the free group factor problem. In the case of Coxeter groups, this result is obtained in the absence of relatively hyperbolicity. We also discuss a specific case of the analogous problem in measure equivalence where each factor group is a product of nonabelian free groups.
Read the full abstract

All authors Guillaume Dumas, Jingyin Huang, Srivatsav Kunnawalkam Elayavalli, Lizzy Teryoshin

Dynamical Systems

Selection Rules and Channel Structure in a Base Octave Model of Collatz Dynamics

The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single parity controlled transformation, n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2, where n(i)=2k(i)+s(i) and s(i) is the parity (0 or 1) of n(i), yielding a uniform, step aligned dynamical system in which parity variables are tracked explicitly. This reformulation removes the asymmetry of the traditional presentation and exposes structural regularities that are obscured when odd and even updates are treated separately. Building on this unified rule, we introduce a base octave decomposition, representing every integer uniquely in the form n=B+8(A-1) with B = 1 to 8. The resulting dynamics separate into parity dependent base transitions and affine updates of the octave index, inducing a finite directed transition skeleton lifted across scale levels. Refining the parity description yields a finite 128 state symbolic system that encodes all admissible transitions, including carry effects arising from higher order parity inheritance. Within this framework, we identify growth permitting and decay forcing channels and show that the only persistence mechanism (base 7 transitions in even octaves) is necessarily bounded by the 2 adic valuation of the octave index. An exhaustive enumeration of admissible return paths between persistence episodes establishes a non positive drift in a logarithmic octave coordinate. Because of these finite state constraints, trajectories are eventually confined to a contractive subnetwork associated with the terminal 1,2 cycle. The approach emphasizes structural organization and return map methods, and provides a symbolic framework for analyzing parity driven integer recurrences.
Read the full abstract

Representation Theory

Koszul Duality for Quadratic Monomial Algebras

Let \(\Lambda\) be a quadratic monomial algebra and let \(\Lambda^{!}\) denote its Koszul dual. We study finitely presented and finitely copresented graded modules over \(\Lambda\) and \(\Lambda^{!}\), and use this structure to obtain explicit forms of derived and singular Koszul duality. We prove that quadratic monomial algebras are both graded coherent and graded cocoherent. Applying this to the Koszul dual \(\Lambda^{!}\), which is again quadratic monomial, we show that finitely presented and finitely copresented graded \(\Lambda^{!}\)-modules coincide with perfect and coperfect modules, respectively. It follows that the corresponding tails and cotails categories are hereditary abelian categories, and their objects are described in terms of linear and colinear modules. We also prove that quadratic monomial algebras are absolutely Koszul and have global linearity defect at most two. Consequently, finite-dimensional graded \(\Lambda\)-modules have rational Poincaré series, while finitely presented and finitely copresented graded \(\Lambda^{!}\)-modules have rational Hilbert series. As applications, we refine graded and ungraded derived Koszul dualities, singular Koszul dualities, and Bernstein–Gelfand–Gelfand correspondences for quadratic monomial algebras. We further describe the induced nonstandard \(t\)-structures on bounded derived and singularity categories and derive bounds for the finitistic dimension of \(\Lambda\) in terms of finite paths in the Koszul dual algebra.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Cover meets Robbins while Betting on Bounded Data: $\ln n$ Regret and Almost Sure $\ln\ln n$ Regret

Consider betting against a sequence of $[0,1]$-valued observations using bets that are fair if the data have a conditional mean $m_0 \in (0,1)$. Cover's universal portfolio algorithm achieves a worst-case regret of $O(\ln n)$ compared to the best constant bet in hindsight, and this logarithmic order is unimprovable against adversarial data. We construct an explicit full-support Robbins mixture that combines insights from Robbins and Cover. It retains $O(\ln n)$ regret on every path while also eventually satisfying $R_n\le(1+o(1))\ln\ln V_n$ on every path with bounded mixture wealth and $V_n\to\infty$, where $V_n$ is an intrinsic variance process. It also attains the optimal asymptotic wealth growth rate under iid alternatives. Under the conditional-mean claim and almost-sure divergence of $V_n$, the sharper regret bound holds almost surely, and its leading constant $1$ is unimprovable. We also give explicit finite-time, path-wise regret bounds. A simple hedging principle shows how splitting initial wealth between two strategies achieves a best-of-both-worlds guarantee by retaining the smaller of their regrets and the larger of their growth rates. We contrast our results to those for unbounded data in Agrawal and Ramdas (2026). Their worst-case regret is unbounded. However, hedging yields almost-sure iterated-logarithmic regret together with optimal growth. Finally, our wealth process witnesses a sharp game-theoretic upper law of iterated logarithm, analogous to Shafer and Vovk (2005).
Read the full abstract

Analysis of PDEs

Mathematical analysis of transverse EM field concentration for adjacent obstacles with nonlocal boundary conditions in the quasistatic regime

This paper presents a rigorous mathematical analysis of transverse electromagnetic (EM) field concentration between two adjacent obstacles within the framework of the quasi-static approximation. We investigate three degenerate conductivity models recently introduced in [22], two of these incorporating nonlocal boundary conditions to capture fundamental physical phenomena, such as surface nonlocality and thin-layer interactions. Our primary results establish sharp conditions for gradient blowup and derive the corresponding optimal blowup rates. These findings elucidate how nonlocal boundary conditions modify classical gradient estimates. Furthermore, we analyze the influence of wave frequency, demonstrating that it mitigates the severity of field concentration even in the limit of a vanishing gap distance. Consequently, this work extends the classical theory of field enhancement in plasmonic and metamaterial systems to incorporate nonlocal surface effects, yielding precise asymptotic formulas that are essential for the quantitative design of nanophotonic devices.
Read the full abstract

Number Theory

Root numbers for twisted Fermat quotient curves II

This is a sequel to the previous work of the author Yanagihara (2025). Let $\ell$ be an odd prime, let $N \geq 1$ be an integer, and let $\delta \geq 1$ be an $\ell^N$-th-power-free integer. Let $r,s,t>0$ be integers satisfying $r+s+t=\ell^N$. In Yanagihara (2025), the author computed the root number of the Fermat quotient curve $y^{\ell^N}=x^r(\delta-x)^s$ under the assumptions that $\ell\nmid rst$ and that $\operatorname{ord}_{\ell}(\delta)=0$ or $\ell\nmid \operatorname{ord}_{\ell}(\delta)$. In this paper, we study the case where the technical assumption $\ell\nmid rst$ is dropped. As one such case, we compute the root number when $\ell^{N-1}\| r$ and $\ell\nmid st\delta$.
Read the full abstract

Analysis of PDEs

Determining metrics from the scattering map of the time-dependent Schrödinger equation

For a time dependent Schrödinger equation, the scattering map is the map sending the asymptotic profile of solution as $t\to-\infty$ to its asymptotic profile as $t\to+\infty$. In this paper we show that, for certain class of metrics, the scattering maps associated to two Schrödinger operators with two time dependent metrics only differ by a compact operator if and only if these two metrics are related by a pull-back of a diffeomorphism.
Read the full abstract

Commutative Algebra

Epimorphisms of local cohomology modules, a general Peskine-Szpiro theorem, and an application to sheaf cohomology vanishing for thickenings

We study the surjectivity of certain maps involving local cohomology modules, which we can realize as a dual version of part of the investigation developed by Bhatt, Blickle, Lyubeznik, Singh and Zhang on the sheaf cohomology of thickenings (i.e., subschemes defined by powers of ideals), where injectivity played a central role. To this end, we introduce and investigate properties of cohomologically Mittag-Leffler (cML) rings, associated to a given flat local endomorphism (for instance the Frobenius map of a regular ring of prime characteristic), a class which we show to contain, in our setting, the so-called cohomologically full rings of Dao, De Stefani and Ma (in particular, Cohen-Macaulay, Stanley-Reisner, and Du Bois singularities) as well as rings with an ideal inducing a pure endomorphism of the quotient. Our two major specific goals rely upon the prime characteristic setting. First, we extend for the class of cML rings a classical result of Peskine and Szpiro that relates the cohomological dimension and the height of a given Cohen-Macaulay ideal. Second, we prove and illustrate a Kodaira type vanishing result on the sheaf cohomology of thickenings.
Read the full abstract

Optimization and Control

Robust Out-of-Distribution Stochastic Optimization

Data-driven decision-making under uncertainty typically presumes the collection of historical data from an unknown target probability distribution. However, one may have no access to any data from the target distribution prior to decision-making. To address this challenge, we propose robust out-of-distribution stochastic optimization, a novel data-driven framework that effectively utilizes relevant data distributions for robust decision-making under unseen distributions. A key feature of our framework is that all data distributions are assumed to be randomly generated from a meta-distribution over distributions. To describe uncertainty in distribution generation, we propose to learn a data-driven uncertainty set in a reproducing kernel Hilbert space (RKHS) from relevant data distributions, with adjustable conservatism. We then incorporate this set into a min-max stochastic program to derive robust decisions. Notably, under randomness of distribution generation, we establish rigorous out-of-distribution generalization guarantees for the uncertainty set as well as the solution. To ease problem-solving in RKHS, an approximate parametrization with a provably bounded suboptimality and a row generation strategy are presented. Extensive numerical experiments on multi-item newsvendor and portfolio optimization demonstrate the superior out-of-distribution performance of our decision-making framework under unseen data distribution, even when only a small or moderate number of relevant sources are available.
Read the full abstract

All authors Xianyu Li, Huan Xu, Xiaolin Huang, Chao Shang

Numerical Analysis

Machine learning moment closure models for the radiative transfer equation IV: enforcing symmetrizable hyperbolicity in two dimensions

This is our fourth work in the series on machine learning (ML) moment closure models for the radiative transfer equation (RTE). In the first three papers of this series, we considered the RTE in slab geometry in 1D1V (i.e. one dimension in physical space and one dimension in angular space), and introduced a gradient-based ML moment closure [1], then enforced the hyperbolicity through a symmetrizer [2], or together with physical characteristic speeds by learning the eigenvalues of the Jacobian matrix [3]. Here, we extend our framework to the RTE in 2D2V (i.e. two dimensions in physical space and two dimensions in angular space). The main idea is to preserve the leading part of the classical $P_N$ model and modify only the highest-order block row. By analyzing the structural properties of the $P_N$ model, we show that its coefficient matrices are symmetric and admit a block-tridiagonal structure. Then we use this property to introduce a block-diagonal symmetrizer for the ML moment model and derive explicit algebraic conditions on the closure blocks which guarantee the symmetrizable hyperbolicity of the resulting ML system. These conditions lead to a natural parametrization of the closure in terms of a symmetric positive definite matrix together with symmetric closure blocks, which can be learned from data while automatically enforcing symmetrizable hyperbolicity by construction. The numerical results show that the proposed framework improves upon the classical $P_N$ model while maintaining hyperbolicity.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Fourier Weak SINDy: Spectral Test Function Selection for Robust Model Identification

We introduce Fourier Weak SINDy, a minimal noise-robust and interpretable derivative-free equation learning method that combines weak-form sparse equation learning with spectral density estimation for data-driven test function selection. By using orthogonal sinusoidal test functions inspired by their prevalence in Modulating Function-based system identification, the weak-form sparse regression problem reduces to a regression over Fourier coefficients. Dominant frequencies are then selected via multitaper estimation of the frequency spectrum of the data. This formulation unifies weak-form learning and spectral estimation within a compact and flexible framework. We illustrate the effectiveness of this approach in numerical experiments across multiple chaotic and hyperchaotic ODE benchmarks.
Read the full abstract

Probability

Atypical Decay Rates for Atypical Heights in Random Recursive Trees

We establish the large deviation probabilities for the height of random recursive trees, revealing polynomial upper-tail decay and stretched-exponential lower-tail decay. Remarkably, the lower tail features an atypical prefactor that grows to infinity more slowly than any $n$-fold iterated logarithm.
Read the full abstract

Mathematical Physics · Cross-listed from hep-ph

Graph-theoretic determination of massless modes in latticized theory-space models

A graph-theoretic method is introduced for analyzing fermion mass spectra in latticized theory-space models, including chain models arising from dimensional deconstruction. Fermion mass terms are mapped to bipartite graphs, with fields as vertices and nonvanishing mass terms as edges. The number of massless modes is shown to be fixed by the cardinality of a maximum matching of the associated graph. Moreover, the wave-function support of these modes is restricted to fields reachable from exposed or unmatched vertices by even-length maximum-matching-alternating paths, as characterized by the Dulmage-Mendelsohn decomposition. These results depend only on the topology of latticized theory space and are independent of model parameters. The method enables a systematic construction of latticized models with prescribed numbers and localization properties of massless modes.
Read the full abstract

Optimization and Control · Cross-listed from cs.CG

Optimization of Constrained Quasiconformal Mapping for Origami Design

Origami structures, particularly Miura-ori patterns, offer unique capabilities for surface approximation and deployable designs. In this study, a constrained mapping optimization algorithm is designed for designing surface-aligned Miura-ori via a narrow band approximation of the input surface. The Miura-fold, embedded in the narrow band, is parameterized to a planar domain, and a mapping is computed on the parameter pattern by optimizing certain energy terms and constraints. Extensive experiments are conducted, showing the significance and flexibility of our methods.
Read the full abstract

All authors Ka Ho Lai, Hei Tung Tsang, Gary P. T. Choi, Lok Ming Lui

Analysis of PDEs

Finite-Energy Weak Solutions to the Quantum Isothermal Euler System via a Logarithmic Schrödinger Approximation

This paper investigates the collisionless quantum hydrodynamic, or quantum Euler, system in \(\mathbb{T}^3\) with the linear pressure law \(P(\rho)=\rho\). Since this pressure is associated with the logarithmic internal energy \(f(\rho)=\rho\log\rho\), the model admits a natural logarithmic Schrödinger approximation. By means of a regularized logarithmic Schrödinger equation, we rigorously construct global weak solutions to the quantum isothermal Euler system. The proof relies on the Madelung transform, the polar decomposition of the wave functions, and compactness arguments. In particular, an energy identity is used to recover the strong convergence of the hydrodynamic variables. More broadly, the analysis provides a robust Schrödinger approximation framework for QHD models whose internal energy contains an isothermal component.
Read the full abstract

Combinatorics

Combinatorial Geometry of Erdős–Szekeres Type Problems: SAT/ASP Modeling and Linear Subreduction

This paper investigates several classical and novel variations of the Erdős–Szekeres problem, including multicolored point sets, convex hexagons with a given number of interior points, and polygons with constraints on edge colors. We propose a comprehensive computational framework combining combinatorial modeling within the SAT/ASP paradigms with the geometric realization of configurations. To determine point coordinates, we developed the linear subreduction method. The core idea consists of combining the complete logical model of the problem with a system of geometric inequalities, followed by fixing the abscissae to linearize the constraints. This approach enables a simultaneous search for a realization across the entire space of admissible abstract configurations (signotopes) rather than examining them individually, while linearization significantly accelerates the SMT solving process. Using this framework, we established new exact values for several functions; in particular, we proved $h_{nc}(4,0; 4,0)=26$: any bicolored set of 26 points in general position must contain the vertices of an empty monochromatic quadrilateral.
Read the full abstract

Algebraic Geometry

Maximally nodal sextic surfaces and linear determinantal representations

We prove that every maximally nodal sextic surface (with 65 nodes) $X \subset \mathbb{P}_{\mathbb{C}}^3$ contains a symmetric half-even set of nodes of cardinality 35. It follows that the associated half-quadratic sheaf is the cokernel of a symmetric $6 \times 6$ matrix of linear forms, yielding a linear determinantal representation of $X$. In particular, after a suitable Serre twist, the half-quadratic sheaf is an Ulrich sheaf of rank 1. As an example, we exhibit an explicit $6 \times 6$ matrix of linear forms whose determinant defines the Barth sextic surface.
Read the full abstract

Dynamical Systems

Fractal transference principle for continued fractions of Laurent series

We establish a fractal transference principle for continued fraction expansions over the field of Laurent series. Let $S$ be an infinite subset of the set of all polynomials over a finite field of $q$ elements of positive degree with growth density exponent $\alpha \ge 1$, and let $U \subset S$ be a subset of positive relative upper density. We prove that there exists a subset $E_{S,U}$ of the set of points whose continued fraction digits are pairwise distinct and belong to $S$ such that \[\dim_{\rm H} E_{S,U}=\frac{1}{2\alpha}.\] Moreover, the set of digits appearing in the continued fraction expansions of points in $E_{S,U}$ recovers the relative upper density of $U$ in $S$. We also show that the same construction preserves the relative upper density of the corresponding degree sets in $\mathbb N$. As a consequence, combinatorial statements for subsets of $\mathbb N$ of positive upper density can be transferred to degree sets arising from continued fraction expansions of Laurent series on sets of optimal Hausdorff dimension.
Read the full abstract

Algebraic Geometry

From Finite-Node Conifold Geometry to BPS Structures II: Functorial Incidence and Quiver Assembly

In previous work, we extracted the intrinsic finite algebraic state data of a finite-node conifold degeneration in the form $A_\Sigma := (V_\Sigma,E_\Sigma,c_\Sigma)$, where $V_\Sigma$ is the finite node-indexed vertex set, $E_\Sigma$ is the nodewise coupling space, and $c_\Sigma$ is the coefficient vector of the corrected global extension class. The purpose of the present paper is to construct the corresponding interaction and incidence layer. Starting from the finite-node schober package $S_\Sigma := (\mathcal C_{\mathrm{bulk}},\{\mathcal C_{p_k}\}_{k=1}^r,\{\Phi_k,\Psi_k\}_{k=1}^r,Sh(S_\Sigma))$, we define the extended vertex set $V_\Sigma^{\mathrm{ext}} := V_\Sigma \sqcup \{v_{\mathrm{bulk}}\}$, the functorial coupling relation determined by the attachment functors, the resulting functorial incidence package $\mathfrak{I}_\Sigma := (V_\Sigma^{\mathrm{ext}},\rightsquigarrow_\Sigma)$, and its canonical binary decategorification $\mathcal I_\Sigma := (V_\Sigma^{\mathrm{ext}},I_\Sigma)$. From these data we assemble the finite quiver-theoretic package $\mathfrak Q_\Sigma := (V_\Sigma,E_\Sigma,c_\Sigma,\mathcal F_\Sigma,I_\Sigma)$, where $\mathcal F_\Sigma := \{(\Phi_k,\Psi_k)\}_{k=1}^r$ is the functorial coupling datum. We prove that this package is canonically determined by the finite-node schober datum, compatible with the corrected perverse extension and its mixed-Hodge-module refinement, and invariant under equivalence of finite-node schober realizations. This yields the interaction and incidence layer required for later graded interaction, stability, BPS, and wall-crossing structures.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning

The quadratic assignment problem (QAP) is a fundamental NP-hard task that poses significant challenges for both traditional heuristics and modern learning-based solvers. Existing QAP solvers still struggle to achieve consistently competitive performance across structurally diverse real-world instances. To bridge this performance gap, we propose PLMA, an innovative permutation learning framework. PLMA features an efficient warm-started MCMC finetuning procedure to enhance deployment-time performance, leveraging short Markov chains to anchor the adaptation to the promising regions previously explored. For rapid exploration via MCMC over the permutation space, we design an additive energy-based model (EBM) that enables an $O(1)$-time 2-swap Metropolis-Hastings sampling step. Moreover, the neural network used to parameterize the EBM incorporates a scalable and flexible cross-graph attention mechanism to model interactions between facilities and locations in the QAP. Extensive experiments demonstrate that PLMA consistently outperforms state-of-the-art baselines across various benchmarks. In particular, PLMA achieves a near-zero average optimality gap on QAPLIB, exhibits remarkably superior robustness on the notoriously difficult Taixxeyy instances, and also serves as an effective QAP solver in bandwidth minimization.
Read the full abstract

All authors Yicheng Pan, Ruisong Zhou, Haijun Zou, Tianyou Li, Zaiwen Wen

Dynamical Systems · Cross-listed from quant-ph

Efficient Quantum Algorithms for Higher-Order Coupled Oscillators

Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics becomes computationally prohibitive as their state space grows combinatorially in the multiway interaction order. Here we develop quantum algorithms for two central tasks – synchronization estimation and certification of the no-phase-locking regime – in the simplicial Kuramoto model. This model is a higher-order generalization of the celebrated Kuramoto model for coupled oscillators on graph-based networks. Under explicit assumptions on data access and types, and simplicial structure, we derive end-to-end quantum gate complexities and identify regimes with polynomial quantum advantage for synchronization estimation and super-polynomial quantum advantage for no-phase-locking certification over classical methods. More broadly, these results extend quantum algorithms for higher-order networks from structural analysis to nonlinear dynamical diagnostics, easing a major computational bottleneck and opening a route to quantum methods for probing higher-order phenomena beyond the reach of direct classical approaches.
Read the full abstract

All authors Caesnan M. G. Leditto, Angus Southwell, Muhammad Usman, Kavan Modi

Optimization and Control

A Benchmark of 25 Nonlinear Functions with Domain-Induced Discontinuity-Like for Global Optimization

A benchmark of 25 nonlinear optimization problems exhibiting domain-induced discontinuity-like behavior is proposed to support the performance evaluation of global optimization algorithms under feasibility-scarce and structurally disconnected landscapes. Referred to as the CPC Benchmark (Challenging Problems for Computation), the test suite consists of functions that are continuous on their natural domains, while infeasible regions and undefined evaluations are implicitly embedded in the objective, creating substantial challenges for global minimization. Six representative algorithms from diverse methodological paradigms are assessed to investigate the structural difficulty and discriminative capability of the proposed benchmark. Numerical results show that many functions possess extremely small feasible regions and strong precision sensitivity near feasibility boundaries, complicating initialization, feasibility discovery, and reliable objective evaluation. The findings demonstrate that the CPC benchmark provides a rigorous and discriminative testbed for advancing research on global optimization under hidden feasibility constraints.
Read the full abstract