Dynamical Systems
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 31 March
We analyze a three-dimensional Keen–Goodwin model that couples wage–employment dynamics with Minsky-style private debt. At zero real interest the interior equilibrium is nonhyperbolic and organized by a two-dimensional center manifold foliated by neutral Goodwin cycles. Introducing a small positive interest rate unfolds this degeneracy: we derive an explicit Hopf condition, prove persistence of the center manifold as a normally hyperbolic attracting surface, and obtain first-order amplitude and frequency corrections for the emergent limit cycle via phase–amplitude reduction. Numerical simulations support the asymptotic predictions and demonstrate how interest rates determine and modulate endogenous business cycles.
Functional Analysis
Differentiation in Topological Vector Spaces
Differentiation in mathematical analysis is commonly built by using {\epsilon}-{\delta}-language. This approach also works similarly for defining continuity, Gateaux (directional) derivative and Frechet derivative in normed vector spaces, in particular, in Banach spaces, where Frechet derivatives are defined as limits of ratios with respect to the norms in the considered normed vector spaces. For general topological vector spaces, if the space is not equipped with a norm, then Frechet derivatives cannot be similarly defined as in normed vector spaces. The cornerstone of this paper is the fact that the topology of every topological vector space can be induced by a family of F-seminorms, which is used to develop an extended {\epsilon}-{\delta}-language with respect to the F-seminorms. By using the extended {\epsilon}-{\delta}-language in topological vector spaces, we first define the continuity of single-valued mappings. Then we define Gateaux and Frechet derivatives as a certain type of limits of ratios with respect to the F-seminorms equipped on the considered spaces, which are naturally generalized Gateaux and Frechet derivatives in normed vector spaces. We will prove some analytic properties of the generalized versions of Gateaux and Frechet derivatives, which are similar to the analytic properties in normed vector spaces. Then we apply them to some general topological vector spaces that are not normed, such as the Schwartz space and other two spaces that are not even locally convex. For some single-valued mappings defined on these three spaces, we will precisely calculate their Gateaux and Frechet derivatives. Finally, we apply the generalized Gateaux and Frechet derivatives to solve some vector optimization problems and investigate the order monotonic of single-valued mappings in general topological vector spaces.
Read the full abstract
Group Theory
Morse and stable subgroups via the coset intersection complex
In this note, we study the equivalence of Morse and stable subgroups in the framework of the coset intersection complex. Under certain conditions on a coset intersection complex of a group, we prove that infinite-index Morse subgroups are stable.
Read the full abstract
Algebraic Geometry
Hodge Structures in Sextic Fourfolds Equipped with an Involution
To each ternary sextic $f(X_0, X_1, X_2)$ whose associated plane curve is smooth, the Shioda construction attaches a smooth sextic fourfold $X \subset \mathbb{P}^5$ whose defining equation $f(X_0, X_1, X_2) - f(Y_0, Y_1, Y_2)$ is fixed under the involution $\iota : (X_0, X_1, X_2, Y_0, Y_1, Y_2) \mapsto i \cdot (Y_0, Y_1, Y_2, -X_0, -X_1, -X_2)$. The induced action $\iota^* : H^4(X, \mathbb{Q}) \to H^4(X, \mathbb{Q})$ fixes a Hodge substructure $H \subset H^4(X, \mathbb{Q})$ whose Hodge coniveau is 1. By the general Hodge conjecture, we expect that there should exist a divisor $Y \subset X$ for which $H \subset \ker\left( H^4(X, \mathbb{Q}) \to H^4(X \setminus Y, \mathbb{Q}) \right)$. We verify this prediction in case the Waring rank of $f(X_0, X_1, X_2)$ takes on its minimum possible value, partially answering a question of Voisin (J. Math. Sci. Univ. Tokyo '15).
Read the full abstract
Dynamical Systems
Local smooth rigidity of Anosov diffeomorphisms in $\mathbb{T}^{3}$
Given a $C^0$ conjugacy between two Anosov diffeomorphisms, the matching periodic data problem asks whether this conjugacy is smooth provided spectral data of the diffeomorphisms match at periodic points. We show that if the two $C^0$ conjugate diffeomorphisms on $\mathbb{T}^3$ are sufficiently close to a hyperbolic linear automorphism with a pair of complex conjugate eigenvalues, then the conjugacy must be smooth. In particular, we have that in a neighborhood of a hyperbolic toral automorphism, matching periodic data implies that the conjugacy is $C^{1+\text{H\"older}}$
Read the full abstract
Information Theory
A Structural Characterization of Cyclotomic Cosets with Applications to Affine-Invariant Codes and BCH Codes
Affine-invariant codes have attracted considerable attention due to their rich algebraic structure and strong theoretical properties. In this paper, we study a family of affine-invariant codes whose defining set consists of all descendants of elements in the cyclotomic coset of a single specified element. Our main contributions are as follows. First, we establish a new combinatorial result that determines exactly the size of such descendant sets, which is of independent interest in the study of cyclotomic cosets. Second, using this result, we derive explicit formulas for the dimensions of the corresponding affine-invariant codes and their associated cyclic codes, and we establish lower bounds on the minimum distances of their duals. In particular, under appropriate parameter choices, these codes yield narrow-sense primitive BCH codes and their extended counterparts. For the special class of narrow-sense primitive BCH codes with designed distance $\delta = (b+1)q^{m-t-1}$, where $1 \leq b \leq q-1$ and $0 \leq t \leq m-1$, we provide exact dimension formulas and an improved lower bound on the minimum distance. The results presented here extend and sharpen several previously known results, and provide refined tools for the parametric analysis of BCH codes and their duals.
Read the full abstract
Classical Analysis and ODEs
Bourgain's projection theorem over normed division algebras
Information Theory
Scalable and Near-Optimal Discrete Phase Shift Optimization for Reconfigurable Intelligent Surfaces with Over 20,000 Elements
This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional methods based on iterative convex approximation or combinatorial search with exponentially increasing complexity, the CIM physically explores the solution space of Ising Hamiltonians through collective mode competition in a network of optical oscillators, enabling efficient large-scale discrete optimization. We formulate the RIS discrete phase optimization problem as a quadratic Ising model, which supports both binary and quaternary phase shifts by appropriately mapping quantized phase states to spin variables. Using a real hardware CIM, we experimentally solve quadratic optimization problems for RISs with up to 22,201 elements. The results demonstrate that the proposed method achieves physically consistent beam patterns under both line-of-sight and non-line-of-sight environments and attains the theoretical gain when transitioning from binary to quaternary phase shift. To further enhance scalability, we introduce a spin-size reduction approach that removes spins deterministically fixed by dominant channel components. This technique efficiently reduces the problem size for CIM in line-of-sight conditions without performance loss. These results confirm that CIM-based optimization offers a practical and highly scalable solution for large RIS deployments with discrete phase shift constraints.
Read the full abstract
Logic
An Optimal 14-Symbol Hybrid Basis for BCH-Algebras
We present an optimally minimal two-axiom basis for BCH-algebras. The standard presentation of a BCH-algebra relies on three axioms: two equations and one quasi-identity. Using automated theorem proving, we prove that the two standard equations can be entirely replaced by a 14-symbol equation, ((xy)z)((x(z0))y) = 0, while retaining the standard quasi-identity. We then provide a rigorous proof of strict minimality for this new equational companion. By employing an exhaustive, machine-assisted search space generation coupled with finite countermodel building, we demonstrate that no equation of 12 or fewer symbols can define the class of BCH-algebras when paired with the standard quasi-identity. Our literature searches have revealed no prior proof of this result, to the extent of our knowledge. All equivalence derivations were verified using Prover9, and all minimality countermodels were generated using Mace4.
Read the full abstract
Metric Geometry
On flat shadow boundaries from point light sources and the characterization of ellipsoids
In his classical work, W. Blaschke proved that a convex body whose shadow boundaries are flat for every direction of parallel illumination must be an ellipsoid. An extension recently proposed by I. Gonzalez-García, J. Jerónimo-Castro, E. Morales-Amaya, and D.J. Verdusco-Hernández predicts that the same conclusion holds for illumination by point light sources located on a hypersurface enclosing the body. We confirm this conjecture for convex bodies with sufficiently smooth boundaries. We further develop a duality framework relating illumination by point light sources to classical symmetry properties of hyperplane sections, linking several known and conjectured characterizations of quadrics from these complementary viewpoints.
Read the full abstract
Optimization and Control
Adaptive Delayed-Update Cyclic Algorithm for Variational Inequalities
Cyclic block coordinate methods are a fundamental class of first-order algorithms, widely used in practice for their simplicity and strong empirical performance. Yet, their theoretical behavior remains challenging to explain, and setting their step sizes – beyond classical coordinate descent for minimization – typically requires careful tuning or line-search machinery. In this work, we develop $\texttt{ADUCA}$ (Adaptive Delayed-Update Cyclic Algorithm), a cyclic algorithm addressing a broad class of Minty variational inequalities with monotone Lipschitz operators. $\texttt{ADUCA}$ is parameter-free: it requires no global or block-wise Lipschitz constants and uses no per-epoch line search, except at initialization. A key feature of the algorithm is using operator information delayed by a full cycle, which makes the algorithm compatible with parallel and distributed implementations, and attractive due to weakened synchronization requirements across blocks. We prove that $\texttt{ADUCA}$ attains (near) optimal global oracle complexity as a function of target error $\epsilon >0,$ scaling with $1/\epsilon$ for monotone operators, or with $\log^2(1/\epsilon)$ for operators that are strongly monotone.
Read the full abstract
Combinatorics
C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Odd Squares, Fully Frustrated Models, and Computational Structure
We study C_4-free subgraphs of the hypercubes Q_6, Q_7 and Q_8. Writing g(n) for the maximum size of an odd-square edge set – meeting every 4-cycle of Q_n in exactly one or three edges – we prove g(6)=132, g(7)=304, g(8)=682, with explicit machine-verifiable certificates, giving ex(Q_7,C_4)>=304 and ex(Q_8,C_4)>=682. Under the standard fully-frustrated-hypercube correspondence, these values are already implicit in the statistical-physics literature: the field identity and its optimal values go back to Derrida, Pomeau, Toulouse and Vannimenus (1979), who construct ground states for D<=7; the D=8 attainment was reported by Marinari, Parisi and Ritort (1995); Laplante et al. treat the graph-theoretic formulation directly. Our contribution is accordingly narrow: a short self-contained proof of the optima via a mod-8 refinement of the classical two-point inequality, the certificates themselves, and an exhaustive decision of the realisability of the optimal n=6 field distributions, settling a question DPTV left open in 1979: exactly one of the three optimal distributions is realisable. Independently, we classify the 19,866 previously released 304-edge C_4-free subgraphs of Q_7 (389 of them odd-square) into 20 dimension-profile types, establish their common structural core (degree sequence {4^32,5^96}), and decompose them into 180 Aut(Q_7)-orbits containing 34,227,200 labelled solutions; whether these are all orbits of 304-edge solutions is open. For Q_6, ex(Q_6,C_4)=132 rests on Harborth-Nienborg's upper bound, not independently verified here; the odd-square g(6)=132 is self-contained. All certified or deterministic claims are re-checkable from the released code and data; imported results are marked as such, and the repository carries SHA-256 manifests. Edge lists and code: https://github.com/minamominamoto/c4free-hypercube
Read the full abstract
Optimization and Control
Primal-dual dynamics featuring Hessian-driven damping and variable mass for convex optimization problems
This paper deals with a new Tikhonov regularized primal-dual dynamical system with variable mass and Hessian-driven damping for solving a convex optimization problem with linear equality constraints. The system features several time-dependent parameters: variable mass, slow viscous damping, extrapolation, and temporal scaling. By employing the Lyapunov analysis approach, we obtain the strong convergence of the trajectory generated by the proposed system to the minimal norm solution of the optimization problem, as well as convergence rate results for the primal-dual gap, the objective residual, and the feasibility violation. We also show that the convergence rates of the primal-dual gap, the objective residual, and the feasibility violation can be improved by appropriately adjusting these parameters. Further, we conduct numerical experiments to demonstrate the effectiveness of the theoretical results.
Read the full abstract
Statistics Theory
Edgeworth expansions in sphericity testing under high-dimensional two-step monotone incomplete data and their computable error bounds
In this paper, we consider the sphericity test for a one-sample problem under high-dimensional two-step monotone incomplete data. Existing asymptotic expansions for the null distributions of the likelihood ratio test (LRT) statistic and modified LRT statistic deteriorate in high-dimensional settings. Therefore, we derive an Edgeworth expansion for the null distribution of the LRT statistic in such settings and obtain its computable error bounds. Furthermore, we demonstrate that our proposed Edgeworth expansion provide better approximation accuracy than the existing asymptotic expansion. We also conduct numerical experiments using Monte Carlo simulations to evaluate the maximum absolute error between the distribution function of the standardized test statistic and the Edgeworth expansion for the null distribution of the LRT statistic, as well as to assess the performance of the computable error bounds. Finally, by deriving a Cornish-Fisher expansion for the null distribution of the LRT statistic in high-dimensional settings, we evaluate the empirical Type I error rates via Monte Carlo simulations.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Sampling-Horizon Neural Operator Predictors for Nonlinear Control under Delayed Inputs
Modern control systems frequently operate under input delays and sampled state measurements. A common delay-compensation strategy is predictor feedback; however, practical implementations require solving an implicit ODE online, resulting in intractable computational cost. Moreover, predictor formulations typically assume continuously available state measurements, whereas in practice measurements may be sampled, irregular, or temporarily missing due to hardware faults. In this work, we develop two neural-operator predictor-feedback designs for nonlinear systems with delayed inputs and sampled measurements. In the first design, we introduce a sampling-horizon prediction operator that maps the current measurement and input history to the predicted state trajectory over the next sampling interval. In the second design, the neural operator approximates only the delay-compensating predictor, which is then composed with the closed-loop flow between measurements. The first approach requires uniform sampling but yields residual bounds that scale directly with the operator approximation error. In contrast, the second accommodates non-uniform, but bounded sampling schedules at the cost of amplified approximation error, revealing a practical tradeoff between sampling flexibility and approximation sensitivity for the control engineer. For both schemes, we establish semi-global practical stability with explicit neural operator error-dependent bounds. Numerical experiments on a 6-link nonlinear robotic manipulator demonstrate accurate tracking and substantial computational speedup of 25$\times$ over a baseline approach.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Predictor-Based Output-Feedback Control of Linear Systems with Time-Varying Input and Measurement Delays via Neural-Approximated Prediction Horizons
Due to simplicity and strong stability guarantees, predictor feedback methods have stood as a popular approach for time delay systems since the 1950s. For time-varying delays, however, implementation requires computing a prediction horizon defined by the inverse of the delay function, which is rarely available in closed form and must be approximated. In this work, we formulate the inverse delay mapping as an operator learning problem and study predictor feedback under approximation of the prediction horizon. We propose two approaches: (i) a numerical method based on time integration of an equivalent ODE, and (ii) a data-driven method using neural operators to learn the inverse mapping. We show that both approaches achieve arbitrary approximation accuracy over compact sets, with complementary trade-offs in computational cost and scalability. Building on these approximations, we then develop an output-feedback predictor design for systems with delays in both the input and the measurement. We prove that the resulting closed-loop system is globally exponentially stable when the prediction horizon is approximated with sufficiently small error. Lastly, numerical experiments validate the proposed methods and illustrate their trade-offs between accuracy and computational efficiency.
Read the full abstract
Commutative Algebra
Regular rings over valuation rings
Bertin (1972) defined regularity for coherent local rings, and Knaf (2004) studied the property for a local ring $A$ essentially finitely presented over a valuation ring $V$. We discuss several properties of this notion of regularity for such $A$, obtaining results parallel to results for regularity of Noetherian local rings. We include classical and modern topics: openness of loci, perfectoid big Cohen–Macaulay algebras, and cotangent complexes. We also give an application to Noetherian rings, showing a version of Kodaira's vanishing theorem in large enough residue characteristics.
Read the full abstract
Functional Analysis
Extreme points in quotients of Hardy spaces
In the Hardy spaces $H^1$ and $H^\infty$, there are neat and well-known characterizations of the extreme points of the unit ball. We obtain counterparts of these classical theorems when $H^1$ (resp., $H^\infty$) gets replaced by the quotient space $H^1/E$ (resp., $H^\infty/E$), under certain assumptions on the subspace $E$. In the $H^1$ setting, we also treat the case where the underlying space is taken to be the kernel of a Toeplitz operator.
Read the full abstract
Information Theory
Enhanced Channel Estimation for Flexible Intelligent Metasurface-Aided Communication Systems
Flexible intelligent metasurface (FIM) has recently received considerable interest due to its advantage in realizing a better channel condition by dynamically morphing its surface shape. An FIM consists of multiple elements deposited on a flexible substrate. These elements can not only transmit signals, but also adapt their displacements in a direction perpendicular to the FIM surface via an attached controller. In this paper, we consider the channel estimation problem for the uplink of an FIM-enhanced communication system via customizing the orthogonal matching pursuit (OMP) method. Specifically, we formulate an optimization problem of minimizing the column coherence of the measurement matrix by optimizing the FIM's surface shape, subject to the morphing range constraint. Based on the estimated direction of arrival (DOA) and channel gain, we further investigate the signal-to-noise ratio (SNR) improvement in the FIM-enhanced downlink multiple-input single-output (MISO) system. Numerical results demonstrate that an FIM significantly outperforms a conventional rigid uniform planar array (UPA), thereby showing that FIM can substantially improve channel estimation accuracy and achieve SNR improvement, even when using estimated channel parameters.
Read the full abstract
Monday 30 March
Combinatorics
Existence of reciprocal matrices with specified orders for the right and inverse left Perron eigenvectors
Here we give a procedure to construct a reciprocal matrix for which the right and entrywise inverse left Perron eigenvectors have any pair of given orders. An explicit example when the matrix is of size 4 is presented. In particular, it gives an afirmative answer to the question posed in a recent manuscript by Bozóki and Csató (2026) about the existence of a reciprocal matrix of size 4 such that the right and entrywise inverse left Perron eigenvectors have reverse orders.
Read the full abstract
Rings and Algebras
Residue Constraints in the Rank-Three Lifting Problem for Projective-Plane Incidence Matrices
We study the rank-three lifting problem for incidence matrices of finite projective planes through residue-level determinant constraints invisible to tropical valuations alone. In residue characteristic $\neq 3$, any rank-$\le 3$ lift of the incidence matrix of a projective plane of order $q \ge 3$ forces $\Omega(q^8)$ distinct admissible $2 \times 2$ zero rectangles with nontrivial residue cross-ratio. We further prove that for $q \ge 6$ no monomial rank-$\le 3$ lift exists; in particular, any putative low-rank lift must already involve nontrivial first-order corrections on valuation-0 entries. These results arise from a local analysis of $4 \times 4$ identity-pattern minors, where we derive the leading derangement equation together with its first-order companion and show that every vanished identity-pattern minor contains a cross-ratio-defective admissible rectangle. The unresolved part of the problem is therefore genuinely global: one must decide whether a rank-3 residue model, together with a compatible first-order deformation, can satisfy the full overlapping system of local residue constraints.
Read the full abstract
Representation Theory
Lectures on singularity categories
These are notes for a graduate-level introductory course on singularity categories.
Spectral Theory
Spectral-Dimension Obstructions for Operators with Superlinear Counting Laws
We show that single-valuation exponential kernels, under mild regularity assumptions, converge in the continuum limit to a fourth-order operator with heat asymptotics $\Theta(t)\sim t^{-1/4}$ and hence spectral dimension $d_s=\tfrac12$. Independently, a Tauberian analysis implies that any self-adjoint operator with superlinear eigenvalue counting $N(\lambda)\sim \lambda\,L(\lambda)$ must satisfy $\Theta(t)\sim t^{-1}L(1/t)$ and therefore has spectral dimension $d_s=2$. Since spectral dimension is invariant under unitary equivalence and compact perturbations, these exponents are incompatible, yielding a structural obstruction that separates single-valuation kernel limits from operators with accelerated spectral growth.
Read the full abstract
Numerical Analysis
A Generalized Matrix Inverse that is Consistent with Respect to Diagonal Transformations
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general solution to a longstanding open problem relevant to a wide variety of applications in robotics, tracking, and control systems. The new inverse complements the Drazin inverse (which is consistent with respect to similarity transformations) and the Moore-Penrose inverse (which is consistent with respect to unitary/orthonormal transformations) to complete a trilogy of generalized matrix inverses that exhausts the standard family of analytically-important linear system transformations. Results are generalized to obtain unit-consistent and unit-invariant matrix decompositions and examples of their use are described.
Read the full abstract
General Mathematics
The Collision Transform
For a prime p and base b, the collision invariant $S_{\ell}(p)$, introduced in the companion paper, is a function of $p \bmod b^{\ell+1}$ and therefore lives on the finite group $(\mathbb{Z}/b^{\ell+1}\mathbb{Z})^{\times}$. Its Fourier expansion over Dirichlet characters modulo $b^{\ell+1}$ is the collision transform. The reflection identity forces all even-character coefficients of the centered invariant to vanish: only odd characters contribute. The centered prime harmonic sum $F^{\circ}(s) = \sum_p S^{\circ}_p / p^s$ is therefore a finite linear combination of non-trivial odd character sums $\sum_p \chi(p)/p^s$, with no principal-character term. At $s = 1$, each sum converges by Mertens' theorem for arithmetic progressions. Convergence below $s = 1$ is conditional on the absence of $L$-function zeros above a given depth. Computation indicates convergence persists to at least $s = 0.6$ in base 10 and to $s = 0.5$ in base 3. The real parts of the products $\hat{S}^{\circ}(\chi) \cdot P(s, \chi)$ have mixed signs, so convergence is a collective constraint on the joint zero distribution, not a test of each $L$-function individually. Aggregating the collision deviation across bases with a fixed convergent weighting produces the base sum, a function on primes that reveals mod-3 structure. For bases with $3 \nmid b$, the reflection $a \mapsto m - a$ fixes a unique residue class modulo 3, and the mean of $S$ over units in that class equals the grand mean $-1/2$ (the neutrality theorem). Removing the mod-3 component introduces a principal-character term that is absent from $F^{\circ}$. The base-summed harmonic sum is negligible: the collision invariant's structural content is base-specific.
Read the full abstract
Analysis of PDEs
Thickness functions for elliptic level sets: gradient formulas, normal expansions, and geometric remarks
We study the geometry of superlevel sets $\Omega_t = \{u > t\}$ of solutions to $-\Delta u = \mu$ with $\mu \geq 0$ compactly supported in a convex core $C \subset \Omega$. Under the radial monotonicity lemma (due to Shahgholian), each level set is a normal graph over $\partial C$ with thickness function $d_t$. We derive an exact formula for the tangential gradient of $d_t$ and, under a quantitative small-thickness hypothesis $\|d_t\|_{C^1(\partial C)} \ll 1$, an asymptotic expansion of the unit normal to $\Gamma^t = \partial \Omega_t$. We discuss the relation with Shahgholian's theorem and give examples showing that the geometric normal property (GNP) does not imply that $d_t$ is constant, even in the small-thickness regime. This work provides a geometric language for studying elliptic level sets, without claiming a new proof of Shahgholian's theorem.
Read the full abstract
Optimization and Control
Scalable Co-Design via Linear Design Problems: Compositional Theory and Algorithms
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not by itself reveal which problem classes admit exact and scalable computation. This paper isolates such a class by introducing Linear Design Problems (LDPs): design problems whose feasible functionality–resource relations are polyhedra over Euclidean posets. We show that queries on LDPs reduce exactly to Multi-Objective Linear Programs (MOLPs), thereby connecting monotone co-design semantics with polyhedral multiobjective optimization. We further prove that LDPs are closed under the fundamental co-design interconnections, implying that any interconnection of linear components induces a system-level LDP. To compute the resulting feasible sets, we develop two complementary constructions: a monolithic lifted formulation that preserves block-angular sparsity, and a compositional formulation that incrementally eliminates internal variables through polyhedral projection. Beyond the exact linear setting, we show that convex co-design resource queries admit arbitrarily accurate polyhedral outer approximations, with recession-cone error identically zero for standard nonnegative resource cones. Numerical studies on synthetic series-chain benchmarks, a gripper, and a rover co-design validate the theory.
Read the full abstract
Representation Theory
Superelliptic Affine Lie algebras and orthogonal polynomials II
Let $\mathfrak{g}$ be a finite-dimensional complex simple Lie algebra and $r,m\ge 2$. The universal central extension of the superelliptic current algebra $\mathfrak{g}\otimes A$ is $\widehat{\mathfrak{g}\otimes A}\cong\mathfrak{g}\otimes A \oplus(\Omega^1_A/dA)$, where $A=\mathbb{C}[t,t^{-1},u]/\langle u^m-(1-2ct^r+t^{2r})\rangle$. We compute the recursion relations governing a natural cocycle basis in $\Omega^1_A/dA$ and encode them by generating functions admitting closed integral expressions of superelliptic type. The $2r$ possible choices of initial conditions are classified into four structural types; two canonical choices (types~1 and~2) produce two distinguished polynomial families. We prove that these polynomials satisfy fourth-order linear ordinary differential equations in~$c$, valid for all integers $r,m\ge 2$. For the type~2 family the proof combines the Picard-Fuchs theory of the superelliptic curve $u^m=1-2ct^r+t^{2r}$ with an algebraic identification of the explicit coefficient formulas via a rational-function identity argument. After a parity restriction and a reindexing, the resulting sequences are identified with associated ultraspherical polynomials. We show that, for each admissible~$n$ and $m\ge4$, the corresponding fourth-order equations admit a unique polynomial solution up to scalar multiples.
Read the full abstract
Rings and Algebras
Beyond the Laurent phenomenon
In a cluster algebra, a subset of initial cluster variables can be specialised in such a way that all elements of the resulting algebra become polynomial in the remaining variables. This allows obtaining any tame integral frieze pattern of type $A_n$ by specialisation of initial cluster variables, including specialisation to zero.
Read the full abstract
Algebraic Topology · Cross-listed from cond-mat.stat-mech
How much of persistent homology is topology? A quantitative decomposition for spin model phase transitions
Point-cloud persistent homology (PH) – computing alpha or Rips complexes on spin-position point clouds – has been widely applied to detect phase transitions in classical spin models since Donato et al. (2016), with subsequent studies attributing the detection to the topological content of the persistence diagram. We ask a simple question that has not been posed: what fraction of the PH signal is genuinely topological? We introduce f_topo, a quantitative decomposition that separates the density-driven and topological contributions to any PH statistic by comparing real spin configurations against density-matched shuffled null models. Across the 2D Ising model (system sizes L = 16-128, ten temperatures) and Potts models (q = 3, 5), we find that H_0 statistics – total persistence, persistence entropy, feature count – are 94-100% density-driven (f_topo < 0.07). The density-matched shuffled null detects T_c at the identical location and with comparable peak height as real configurations, showing that density alone is sufficient for phase transition detection. However, H_1 statistics are partially topological: the topological fraction grows with system size as delta(TP_{H_1}) ~ L^{0.53} and follows a finite-size scaling collapse delta(T, L) = L^{0.53} g(tL^{1/nu}) with collapse quality CV = 0.27. The longest persistence bar is strongly topological (f_topo > 1) and scales with the correlation length. A scale-resolved analysis reveals that the topological excess shifts from large-scale to small-scale features as L increases. We propose that the TDA-for-phase-transitions community adopt shuffled null models as standard practice, and that H_1 rather than H_0 statistics be used when genuine topological information is sought.