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)

Friday 17 April

Information Theory

Rate-Distortion Theory for Deductive Sources under Closure Fidelity

We study lossy compression of a finite statement source generated in a fixed deductive environment. The source symbols are statements in a knowledge base endowed with a shared proof system, and reconstruction fidelity is measured by preservation of deductive closure rather than by symbolwise equality. Fixing the proof system and a canonical scan order yields a decomposition of the source alphabet into an irredundant core and redundant stored consequences. At zero distortion, each core symbol induces a set of distortion-free reconstructions. In the nonconfusable (disjoint-core) regime, we show that the minimum zero-distortion rate equals the source mass of the core times the entropy of the source conditioned on that core. In the general confusable-core regime, we characterise the exact zero-distortion rate via a hypergraph-entropy quantity induced by jointly realisable core subsets, with a reduction to Korner-style graph entropy under a natural pairwise realisability condition. For reconstruction alphabets contained in the deductive closure of the source knowledge base, we further prove that the full rate-distortion function depends only on the core, so redundant states are invisible to both rate and distortion. Finally, when the decoder is limited to a bounded inference-depth budget (a bounded number of iterations of the immediate-consequence operator), we obtain an exact rate-depth-distortion characterisation. Under an additional order-robustness assumption identifying the chosen core with the order-free essential set, this characterisation interpolates between classical symbolwise compression and unconstrained deductive compression.
Read the full abstract

Probability · Cross-listed from stat.ME

Testing and estimation of the index of stability of univariate and bivariate symmetric $\alpha-$stable distributions via modified Greenwood statistic

We propose a testing and estimation methodology for univariate and bivariate symmatric $\alpha$-stable distributions using a modified version of the Greenwood statistic. Originally designed for positive-valued random variables, the Greenwood statistic, and its modified version tailored for symmetric distributions, have been predominantly applied to univariate random samples. In this paper, we extend the modified Greenwood statistic to a bivariate setting and examine its probabilistic properties within the class of $\alpha$-stable distributions, with a focus on the sub-Gaussian case. Additionally, we introduce a novel testing approach that considers two variations of the modified Greenwood statistic as test statistics for the bivariate case. In the univariate setting, we adapt the proposed testing methodology for estimating the stability index. The simulation studies presented demonstrate that our proposed methodology outperforms classical approaches previously used in this context and serves as an effective tool for distinguishing between Gaussian and $\alpha$-stable distributions with a stability index close to 2. The theoretical and simulation results are further illustrated with practical data examples.
Read the full abstract

All authors Katarzyna Skowronek, Marek Arendarczyk, Anna K. Panorska, Tomasz J. Kozubowski, Agnieszka Wyłomańska

Probability · Cross-listed from cs.LG

Neural Continuous-Time Markov Chain: Discrete Diffusion via Decoupled Jump Timing and Direction

Discrete diffusion models based on continuous-time Markov chains (CTMCs) have shown strong performance on language and discrete data generation, yet existing approaches typically parameterize the reverse rate matrix monolithically – through proxies such as concrete scores (SEDD) or clean-data predictions (MDLM, GIDD) – rather than aligning the parameterization with the intrinsic CTMC decomposition into jump timing and jump direction. We propose Neural CTMC, which exploits the underlying Poisson structure of CTMC dynamics by separately parameterizing the reverse process through an exit rate (when to jump) and a jump distribution (where to jump) via two dedicated network heads. We show that the evidence lower bound (ELBO) reduces to a path-space KL divergence between the true and learned reverse processes that factorizes into a Poisson KL for timing and a categorical KL for direction, and admits a tractable, gradient-equivalent and consistent loss. Experimentally, scored by Gemma2-9B, our pure-uniform Neural CTMC achieves $16.36$ generative perplexity on TinyStories (vs.\ GIDD $37.60$ and MDLM $42.66$). On OpenWebText, it attains the best perplexity at the same training-token budget across 16–128 sampling steps among the methods we compare (e.g., at 128 steps: Neural CTMC $183.6$ vs.\ MDLM $210.5$ and GIDD $249.8$). To facilitate reproducibility, we release our pretrained weights at https://huggingface.co/Jiangxy1117/Neural-CTMC.
Read the full abstract

All authors Jingyuan Li, Xiaoyi Jiang, Fukang Wen, Wei Liu, Renqian Luo, Yi Zhu, Zuoqiang Shi, Pipi Hu

Mathematical Physics · Cross-listed from cond-mat.mes-hall

Current-Induced Dynamics and Instability Pathways of Skyrmioniums in Chiral Magnets

We present a comprehensive study of current-driven dynamics, transformations, and instabilities of skyrmioniums in chiral magnetic films, considering both isolated objects and collective states forming skyrmionium-based meta-matter. Using micromagnetic simulations combined with an analytical description based on the generalized Thiele equation, we clarify how the internal structure of skyrmioniums governs their nonequilibrium response to electric currents. Despite having zero total topological charge, skyrmioniums exhibit a finite transverse velocity under applied currents. We show that this skyrmionium Hall effect originates from an imbalance between positive and negative topological contributions of the inner skyrmion and surrounding ring, which typically occupy different areas. Current-induced deformations further enhance this imbalance, yielding Hall angles comparable to those of skyrmions. At higher current densities, skyrmioniums undergo distinct instabilities depending on magnetic field and uniaxial anisotropy, including elongation, collapse into a skyrmion, transformation into a topologically trivial droplet, and expansion into stripe textures. We map these regimes in current–field and current–anisotropy phase diagrams and resolve their microscopic pathways via the evolution of topological charge and local rotational measures. Beyond isolated textures, mixed skyrmion–skyrmionium lattices display rich collective dynamics, including elastic transport, polymorphic transitions, soliton exchange, and stripe formation. Pulsed currents provide additional control, enabling access to regimes beyond continuous driving. Our results establish skyrmioniums and their meta-matter as tunable nonequilibrium systems probing the topological energy landscape far from equilibrium.
Read the full abstract

Differential Geometry

Tensorial Constraints for Commuting Endomorphisms of the Generalized Tangent Bundle

In this paper we consider families of mutually commuting endomorphisms of the generalized tangent bundle. We identify natural tensorial constraints extending the notion of a generalized Kähler structure to endomorphisms that are not necessarily generalized almost complex structures. These tensors form ideals whose generators we explicitly construct and study using Gröbner basis techniques.
Read the full abstract

Optimization and Control

Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints Algorithms: Penalty Interior-Point, Implicit-Programming, and Piecewise SQP

In this workshop, we discuss several algorithms for mathematical programs with equilibrium constraints (MPECs). The unifying theme is that MPECs are optimization problems whose feasible set contains a lower-level equilibrium system, often written through complementarity or variational-inequality conditions. This destroys the smooth manifold or convex structure that standard nonlinear programming methods rely on. We focus on four algorithmic viewpoints: (i) the classical penalty interior-point algorithm (PIPA); (ii) a monotone-linear complementarity problem (LCP) variant of PIPA that explicitly controls complementarity decay; (iii) an implicit-programming descent method for variational inequality (VI)-constrained MPECs; (iv) piecewise SQP (PSQP), which applies SQP on locally selected smooth pieces. For each method we explain the model, the search direction subproblem, the globalization mechanism, and the meaning of the convergence result. Particular emphasis is placed on what the assumptions are really doing and on the distinction between an attractive algorithmic idea and a fully valid convergence theorem.
Read the full abstract

Optimization and Control

Weakly-Coupled Multi-Action Restless Bandits – Exponential Convergence in Probability

We study a finite time horizon Markov decision process (MDP) consisting of several groups of multi-action finite-state restless bandit processes, which are identical within each group. The bandit processes into different groups can be rather different. The bandit processes are subject to multiple weakly coupled constraints on their state and action variables. In contrast to prior studies that considered only a few specific policies/algorithms, here, we study the behaviours of the general stochastic process and, most importantly, the design of policies that guarantee its convergence to an ideal trajectory as the problem size increases. We prove that, for any policy in a rather general class, the resulting stochastic process converges in probability to a deterministic process as the system size (measured by the number of bandits) tends to infinity, at an exponential rate. Unlike the previous proofs, our exponential convergence does not rely on any non-degenerate assumptions. It follows that the chosen policy asymptotically approaches optimality (with exponentially diminishing suboptimality) in the size dimension if and only if the deterministic process coincides with optimality. We further propose a policy and prove that, in general, it converges in probability to optimality exponentially fast in the system size.
Read the full abstract

Combinatorics

Positive and negative 3-energies of graphs

For a simple graph $G$ with $n$ vertices, let $A_G$ denote the adjacency matrix of $G$, and let $\lambda_1(G) \geq \lambda_2(G) \geq \dots \geq \lambda_n(G)$ be its eigenvalues. For an integer $p \geq 2$, the positive $p$-energy and negative $p$-energy of $G$, denoted $\mathcal{E}^+_p(G)$ and $\mathcal{E}^-_p(G)$, are defined as follows: $\mathcal{E}^+_p(G) = \sum_{\lambda_i(G) > 0} |\lambda_i(G)|^p$ and $\mathcal{E}^-_p(G) = \sum_{\lambda_i(G) < 0} |\lambda_i(G)|^p,$ respectively. Tang, Liu, and Wang proposed a conjecture that, for any integer $p \geq 2$, every connected $n$-vertex graph $G$ satisfies $\mathcal{E}^+_p(G) \geq \mathcal{E}^+_p(P_n)$. Akbari, Kumar, Mohar, and Pragada conjectured that, for any $p \geq 2$, every connected $n$-vertex graph $G$ satisfies $\mathcal{E}^-_p(G) \geq \mathcal{E}^-_p(K_n)$, and they proved this conjecture for $p \geq 4$. In this paper, we prove that every connected $n$-vertex graph, except for $K_1$, $K_2$, and $P_3$, satisfies $\mathcal{E}^+_3(G) \geq \frac{\sqrt{5}}{2}n$. Moreover, we show that for any integer $p \geq 3$, every connected $n$-vertex graph $G$ satisfies $\mathcal{E}^-_p(G) \geq \mathcal{E}^-_p(K_n)$, which improves upon the previously known result.
Read the full abstract

Analysis of PDEs

Lyapunov Unstable Motion Bifurcating from a Circular Vortex Filament

This paper investigates the dynamics of closed vortex filaments in $\R^3$ governed by the Localized Induction Equation. Recently, Aiki and Higaki (2026) established the nonlinear orbital stability of circular vortex filaments under asymmetric perturbations, while identifying Lyapunov instability due to the linear growth of translation modes. Motivated by this result, we prove the existence of a family of closed solutions, which we call axial screw motions, that bifurcate from a circular filament. These solutions remain uniformly close to the orbit of the circle, but drift secularly away from the reference motion because their translation speed along the symmetry axis differs from that of the circular filament. In particular, they provide explicit non-trivial perturbations that satisfy orbital-stability estimates while failing Lyapunov stability, thereby realizing the gap between orbital stability and Lyapunov stability near the circular filament.
Read the full abstract

Combinatorics

Signless Laplacian index conditions for trebly chorded cycles in graphs with given order

It is proved that for a graph of order $n$, where $n\ge 6$, if the signless Laplacian index is larger than or equal to certain value depending on $n$, then the graph contains a trebly chorded cycle, where the chords incident to a common vertex, unless it is one of two specified graphs.
Read the full abstract

Combinatorics

On the asymptotic behavior of online Ramsey numbers for stars, paths and cycles

The online Ramsey game for graphs $G$ and $H$ is played on the infinite complete graph $K_\mathbb{N}$. Each round, Builder chooses an edge, and Painter colors it red or blue. The online Ramsey number $\tilde{r}(G,H)$ is the smallest integer $t$ for which Builder has a strategy that guarantees a red copy of $G$ or a blue copy of $H$ in at most $t$ rounds. We show that for every fixed $k$, there are constants $\lambda_1$ and $\lambda_2$ such that $\tilde{r}(P_k,P_n)/n$ and $\tilde{r}(P_k,C_n)/n$ converge to $\lambda_1$, and $\tilde{r}(K_{1,k},P_n)/n$ and $\tilde{r}(K_{1,k},C_n)/n$ converge to $\lambda_2$.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

Contact-Aware Planning and Control of Continuum Robots in Highly Constrained Environments

Continuum robots are well suited for navigating confined and fragile environments, such as vascular or endoluminal anatomy, where contact with surrounding structures is often unavoidable. While controlled contact can assist motion, unfavorable contact can degrade controllability, induce kinematic singularities, or introduce safety risks. We present a contact-aware planning approach that evaluates contact quality, penalizing hazardous interactions, while permitting benign contact. The planner produces kinematically feasible trajectories and contact-aware Jacobians which can be used for closed-loop control in hardware experiments. We validate the approach by testing the integrated system (planning, control, and mechanical design) on anatomical models from patient scans. The planner generates effective plans for three common anatomical environments, and, in all hardware trials, the continuum robot was able to reach the target while avoiding dangerous tip contact (100% success). Mean tracking errors were 1.9 +/- 0.5 mm, 1.2 +/- 0.1 mm, and 1.7 +/- 0.2 mm across the three different environments. Ablation studies showed that penalizing end-of-continuum-segment (ECS) contact improved manipulability and prevented hardware failures. Overall, this work enables reliable, contact-aware navigation in highly constrained environments.
Read the full abstract

All authors Aedan Mangan, Kehan Long, Ki Myung Brian Lee, Miheer Potdar, Nikolay Atanasov, Tania K. Morimoto

Algebraic Geometry

Algebraic Invariants of Lightning Self-Attention

We study the polynomial coefficients of lightning self-attention as coordinates of an algebraic variety. In the single-token case, we characterize the coefficient variety as a rank-constrained Chow-type variety and derive algebraic equations from this description. For multiple tokens, linear relations reduce the nonlinear geometry to coefficients involving interactions between distinct tokens. We characterize the resulting variety by a common linear factor together with a low-rank condition on the remaining factors. This structure yields explicit families of determinantal, Veronese-type, and Sylvester resultant-based invariants. In the rank-one case, natural pencil and flattening equations define the variety set-theoretically. We complement these results with computations in small dimensions, where the theoretical constructions recover the generators of the defining ideals. Overall, the paper gives a structural description of the algebraic constraints imposed on polynomial coefficient arrays by lightning self-attention and provides explicit certificates of non-realizability.
Read the full abstract

Geometric Topology

A note on the Burnside problem for homeomorphism groups of manifolds

This note studies the Burnside problem for homeomorphism groups of compact connected manifolds. For surfaces, we prove that the identity component of the homeomorphism group is torsion-free precisely when the surface is not the sphere, torus, projective plane, or Klein bottle. An extension argument based on the Tits alternative for mapping class groups then implies that every finitely generated periodic subgroup of the full homeomorphism group is finite for all surfaces outside this exceptional list, recovering and extending a theorem of Guelman and Liousse to non-orientable surfaces. For the circle, we prove that every finitely generated periodic subgroup of its homeomorphism group is finite and cyclic. We close with remarks on manifolds with boundary and open questions on the Burnside problem for hyperbolic three-manifolds and doubled handlebodies.
Read the full abstract

Dynamical Systems

$PG-NODE^{TB}$: Physics-Guided Neural Ordinary Differential Equations for Tuberculosis Transmission Dynamics

Tuberculosis (TB) remains a leading global infectious disease, causing approximately 1.3 million deaths and 10.6 million new infections annually. Classical compartmental ODE models are the standard epidemiological tool for TB, yet their fixed-parameter structure cannot adapt to time-varying dynamics, unmodeled effects, or heterogeneous real-world data. This paper presents a methodological framework and proof-of-concept for applying Physics-Guided Neural Ordinary Differential Equations (PG-NODE) to TB transmission modeling within a SLIR (Susceptible, Latent, Infectious, Recovered) compartmental framework. We perform a rigorous mathematical analysis of the SLIR model, including derivation of the basic reproduction number $\mathcal{R}_0$, equilibrium analysis, and normalized sensitivity indices. We then reformulate the SLIR system as a PG-NODE, preserving compartmental conservation laws and biological constraints while enabling neural network components to learn unknown or time-varying rate functions from data. Three simulation scenarios illustrate the framework's intended capabilities: (i) adaptive tracking of time-varying transmission rates, (ii) correcting for unmodeled treatment and relapse dynamics with 27% lower RMSE than the classical SLIR, and (iii) comparative forecasting of competing intervention policies over a 20-year horizon. Simulation results indicate that PG-NODE has strong potential for improving predictive accuracy while maintaining epidemiological interpretability; full adjoint-based training on real WHO surveillance data is identified as the key next step for empirical validation.
Read the full abstract

All authors Selain K. Kasereka, Eric M. Mafuta, Fadi Al Machot, Emmanuel M. Kabengele, Jean Chamberlain Chedjou, Kyandoghere Kyamakya

Numerical Analysis · Cross-listed from physics.comp-ph

A Structure-Preserving Graph Neural Solver for Parametric Hyperbolic Conservation Laws

Hyperbolic conservation laws govern a wide range of transport-driven dynamics featuring shocks, contact discontinuities, and complex wave interactions, posing distinct challenges for deep-learning-based surrogate modeling. While classical numerical methods provide robust and physically admissible solutions, their computational cost restricts applicability in many-query tasks such as parametric studies and design optimization. Conversely, existing neural surrogates offer rapid inference but often fail to respect intrinsic PDE structures, leading to non-physical artifacts, rollout instability, and poor generalization. We present an interpretable, structure-preserving graph neural solver that bridges classical numerical principles with graph neural networks (GNNs). The network is designed as a learned reconstruction-and-flux operator rather than a black-box state updater, thereby inherently preserving key properties such as local conservation and upwinding. Inspired by Arbitrary high-order DERivatives schemes, we further recast message-passing GNNs as high-order space-time predictors, enabling conservative and stable neural updates with large time steps. Evaluation is performed on challenging supersonic flow benchmarks spanning broad parametric variations in geometry, initial/boundary conditions, and flow regimes. The neural solver achieves superior long-horizon rollout stability and accuracy compared with strong surrogate baselines, outperforms low-order discretizations, and delivers orders-of-magnitude runtime speedups over high-resolution simulations.
Read the full abstract

Combinatorics

Making ends meet or just meeting at the ends? Assessing end-to-end distance in folded RNA sequences and other branched structures

Researchers have repeatedly found that the ends of an RNA sequence are significantly closer than expected for a random linear chain. However, we prove that the ends of a branched structure are almost certainly close. Our results are obtained via combinatorial branching models of increasing complexity using tools from multivariate analytic combinatorics. We completely characterize parameters tracking end-to-end distance, including means and variances. Then, we compare to existing datasets of known RNA structures, as well as the minimum free-energy structures of randomized shuffles. We find that the shuffled structures resemble our theoretical distributions while the known RNA structures have similar parameter values but are more concentrated.
Read the full abstract

Algebraic Geometry

Algebraic Geometry over Non-Algebraically Closed Fields – A-Coherent Sheaves over a Ringed Space

In this paper, we investigate the properties of $A$-coherent and $A$-quasi-coherent sheaves within the framework of algebraic geometry over non-algebraically closed fields. We define an $\mathcal{O}_X$-module to be $A$-coherent (resp. $A$-quasi-coherent) if it admits a global presentation by free modules of finite rank (resp. arbitrary rank) over a ringed space $X$. We establish a fundamental correspondence between these sheaves and modules over the ring of global sections $A = \Gamma(X,\mathcal{O}_X)$. Specifically, we prove that under conditions of flatness for the canonical morphism and the exactness of the global section functor, there exists an equivalence of categories between $A$-coherent $\mathcal{O}_X$-modules and finitely presented modules over $A$. We further demonstrate the utility of these results by proving the faithful flatness of the canonical homomorphisms from rings of Nash functions to rings of analytic functions, utilizing the vanishing of higher cohomology groups as guaranteed by Cartan's Theorem~B.
Read the full abstract

Thursday 16 April

Optimization and Control · Cross-listed from cs.CE

Cosm: orchestrated collective dynamics give rise to rapid computational search at the solution frontier

We introduce Collective Switched Motion (Cosm), a heuristic optimization framework based on orchestrated collective dynamics. Cosm organizes the objective into conflict-minimized subobjectives and activates them sequentially, temporally separating competing local influences. The interplay of switching and local interactions among variables, supplemented by structured correlated perturbations, gives rise to collective search behavior including coordinated cluster motion. Using this framework, we develop and test a solver for sparse Ising optimization. On G64, a large sparse instance with a highly heterogeneous degree distribution from the longstanding Gset Max-Cut benchmark suite, Cosm establishes a new best-known cut of 8753. On large random-graph instances G61 and G70, whose best-known cuts of 5799 and 9595 have been difficult for prior heuristics to attain, a vectorized CPU implementation of Cosm reliably reaches these cuts with times-to-target of 15 s and 2.4 s, respectively. Cosm also heuristically attains the certified optimum of G81, the largest Gset instance (a 20,000-variable two-dimensional spin glass), along with those of G72 and G77. Tests on planted-solution spin-glass benchmarks suggest more favorable empirical scaling than that previously reported for seven compared solvers. Cosm demonstrates that, from simple interacting elements and a new form of orchestration, effective search can emerge.
Read the full abstract

History and Overview of Mathematics

A Braid Box

We give a method for constructing an interactive art piece which illustrates two different definitions of the braid groups, along with their faithful action on the free group. The box also demonstrates how all motions of points in the plane can be realized by motions in a single T-shaped subspace of the plane. This helps students and those who are not specialists in algebraic topology to understand these important topological objects.
Read the full abstract

Dynamical Systems

Linear Response for Bernoulli Convolutions

Let $\mu_{\lambda}$ be the Bernoulli convolution measure with parameter $\lambda\in(0,1)$. We study the regularity of the function %We prove that $h=h_{\phi}:\lambda\mapsto \int_{\mathbb{R}}\phi(x)\,d\mu_{\lambda}(x)$ for Hölder observables $\phi$. We describe sufficient conditions for both smoothness and non smoothness of this function. In particular, we show that for almost every function with respect to certain Wiener like measures on $C[0,1]$, $h_\phi$ exhibits a phase transition: it is almost nowhere differentiable for small $\lambda$ and it is almost everywhere differentiable for large $\lambda.$
Read the full abstract

General Mathematics

On Fubini type theorems for the Riemann integral

One of the essential questions of the theory of multidimensional integrals concerns the evaluation of integrals taken in given domains. In the simplest case, when integrating over parallelepipeds, evaluation can easily be performed by repeated integration. In the case of the Lebesgue integral, the question is easily solvable by Fubini's theorem. In the case of the Riemann integral, the situation is complicated by the difference between Jordan and Lebesgue measures. In this paper, we show that in certain important applications of Riemann integrals, one can establish a modification of the theorem on repeated integration in which Fubini's theorem is as powerful as in the case of the Lebesgue integral.
Read the full abstract

Combinatorics

The decompressed tree size of $k$-ary chains

A chain is defined as a directed acyclic graph (DAG) with one source and one sink, where the children are ordered and the spanning tree computed using a depth-first search is a path. Such DAGs emerge in the context of tree compression and are therefore uniquely associated with a tree. The tree size of a DAG is defined as the size of the associated tree. For fixed out-degree $k \geq 2$, we compute the asymptotic expected decompressed tree size of a chain of size $n$ chosen uniformly at random, and we show that it contains a stretched exponential term of the form $e^{c \, \sqrt{n}}$. This result also has implications for the limit distribution of Brauer chains of fixed length.
Read the full abstract

General Mathematics

A Nonlinear Deficiency Identity for the Riemann Zeta Function with Optimal Approximation Rates

We introduce a deficiency-based representation and approximation framework for values of the Riemann zeta function. The method is based on comparing two nonlinear accumulation mechanisms: global transformation of a base partial sum and local transformation of each term. Their gap defines a cumulative deficiency functional that yields the exact identity \[ \zeta(q)=\zeta(p)^{q/p}-D_{\infty}^{(p,q)}, \qquad q>p>1. \] This converts zeta approximation into estimation of a nonlinear deficit. We derive corrected estimators that remove first-order bias and prove the convergence law \[ B_n^{(p,q)}-\zeta(q)=O\!\left(n^{-\min(2p-2,q-1)}\right). \] For odd targets, suitable choices of the base exponent recover the natural truncation rate while preserving the structural identity. Numerical experiments for $\zeta(3),\zeta(5),\zeta(7)$ confirm theory, demonstrate strong finite-sample behavior, and illustrate extension to spectral zeta functions. The contribution is structural rather than replacing classical Euler–Maclaurin methods: we provide a unified nonlinear viewpoint on zeta approximation, convexity-induced correction terms, and tunable approximation families.
Read the full abstract

Spectral Theory

Recursive determinantal framework for testing D-stability

The concept of matrix $D$-stability, introduced in 1958 by Arrow and McManus, is of major importance across a wide variety of applications in economic modeling, ecology, and control systems. However, an exact algebraic characterization of $D$-stability for dimensions $n > 4$ has remained a notoriously intractable open problem for over sixty years. In this paper, we establish a novel, systematic recursive framework that decomposes the structural check of $D$-stability into an analytical tree of parameter-dependent determinants. By applying a recursive delete/zero reduction strategy, we derive exact recurrence relations for the real and imaginary parts of the characteristic polynomial components. These algebraic relations uncover a structured hierarchy of new sufficient conditions for $D$-stability, expressed explicitly in terms of the matrix's principal minors. We show that while general numerical methods face unavoidable conservatism near the topological boundaries of the stable manifold, our deterministic framework provides sharp, absolute certification for low-order boundary matrices.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.mes-hall

Unveiling Topological Fusion in Quantum Hall Systems from Microscopic Principles

Establishing the fusion rules of anyonic quasiparticles in fractional quantum Hall fluids is essential for understanding their underlying topological order. Building on the conjecture that key topological properties are encoded in the ”DNA” of candidate many-body wave functions - that is, the pattern of dominant orbital occupations restricted to a finite number of lowest Landau levels - we propose a combinatorial framework that derives these fusion rules directly from microscopic data. By extending Schrieffer's counting argument and introducing classes of topological excitations, our framework provides a unified route to the fusion rules for both Abelian and non-Abelian excitations. This approach elucidates the emergence of topological features from first principles in both fermionic and bosonic systems. In particular, we unveil the previously unknown fusion rules of the Hafnian fluid.
Read the full abstract

All authors Arkadiusz Bochniak, Shinsei Ryu, Jürgen Fuchs, Gerardo Ortiz

Optimization and Control

Scalable Outer Approximation of Minkowski Sums of Matrix Ellipsoids for Data-Driven Control

Matrix ellipsoids provide a standard framework for representing bounded uncertainties in data-driven control. Since noise models for sequential observations are naturally represented as the Minkowski sum of multiple matrix ellipsoids, applying existing robust control methods, which typically assume a single ellipsoidal set, requires a tight outer approximation. While techniques based on linear matrix inequalities (LMI) are applicable, their computational cost grows quadratically with the data length, limiting their scalability. This paper investigates the optimal outer approximation problem under two criteria: the sum of squared semi-axes and the volume. We propose an LMI-free approach by introducing a parameterized family of bounding matrix ellipsoids. Specifically, we derive an exact analytical solution for the first criterion and develop an efficient majorization-minimization (MM) algorithm for the second. The proposed MM algorithm employs a first-order approximation of the log-determinant function to provide closed-form update rules, ensuring monotonic convergence to the set of stationary points. Numerical experiments demonstrate that our method offers significantly higher computational efficiency and scalability than standard interior-point solvers.
Read the full abstract

Representation Theory

Soergel calculus for monodromic Hecke categories

We introduce two 2-categories which categorify the monodromic Hecke algebra. The first is algebraic in nature and generalizes Abe's theory of Soergel bimodules. The second is a diagrammatic category defined via generators and relations which generalizes the Elias-Williamson diagrammatic calculus. As our first main result, we prove that these algebraic and diagrammatic categorifications are equivalent, extending an earlier theorem of Abe. Furthermore, we relate these new categorifications to a third categorification via parity sheaves which was previously studied by the author. More precisely, we provide a monodromic analogue of a theorem of Riche and Williamson to show that the diagrammatic category is equivalent to the monodromic Hecke category of parity sheaves associated to a reductive group. Finally, we show that these monodromic Hecke categories can be described by unipotent Hecke categories associated to endoscopic Coxeter groups.
Read the full abstract

Optimization and Control

Housing Decisions under Mobility Risk: A Stochastic Threshold Approach

We develop a stochastic free-boundary model of housing tenure decisions in markets with high mobility risk, such as areas near military installations. Housing prices and rents follow correlated diffusion processes, and households face an uncertain relocation horizon. We derive a closed-form characterization of the optimal buy-versus-rent boundary in terms of the price-to-rent ratio. The model highlights how mobility risk reduces the value of ownership by shortening the effective holding period and increasing uncertainty. As a result, identical price-to-rent ratios can imply different optimal decisions across locations. Numerical illustrations show how variations in volatility and relocation intensity shift the threshold, providing a structural interpretation of observed cross-market heterogeneity. The framework offers a tractable tool for analyzing housing decisions under uncertainty and for interpreting price-to-rent ratios in high-mobility environments.
Read the full abstract

Combinatorics

Stability of Partitions Induced by Nearest-Center Assignment Under Perturbations

We study clustering through the partitions it induces on a finite labeled set $[n]=\{1,\dots,n\}$, and analyze how these partitions change under perturbations of a point configuration $X=(x_1,\dots,x_n)\in(\mathbb{R}^d)^n$. We equip the space of partitions $\Pi_n$ with a normalized pairwise disagreement metric $d(\cdot,\cdot)$, and define the stability radius $r(X,A)=\sup\{\varepsilon\ge0: A(X')=A(X)$ whenever $|X-X'\|\le\varepsilon\}$, where $\|X-X'\|=\max_i\|x_i-x'_i\|$. Our main results concern nearest-center assignment with fixed centers $\{c_1,\dots,c_k\}\subset\mathbb{R}^d$. For each point, we define the margin $\gamma_i=\min_{j\ne\ell_i}(\|x_i-c_j\|-\|x_i-c_{\ell_i}\|)$ and $\gamma_{\min}=\min_i\gamma_i$, where $\ell_i$ denotes the assigned center. We show that if $\varepsilon<\gamma_{\min}/2$, then no assignments change under perturbation and hence $A(X')=A(X)$. Conversely, any point that changes its assigned center must satisfy $\gamma_i\le2\varepsilon$, showing that instability is localized near decision boundaries. We construct configurations in which arbitrarily small perturbations $\|X-X'\|\le\varepsilon$ alter the induced partition, demonstrating that the margin condition is sufficient but not necessary for stability. We further extend the framework to a discrete-time setting, showing that if $\sum_t \delta_t<r(X(0),A)$, then $A(X(t))=A(X(0))$, and we give a probabilistic bound on $\mathbb{E}[d(A(X),A(X'))]$ in terms of tail probabilities relative to $\gamma_i$. This framework identifies the margin as the key quantity governing both worst-case and average stability, and provides explicit conditions under which clustering-induced partitions remain invariant in a fixed-center Euclidean model.
Read the full abstract