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)

Sunday 19 April

Combinatorics

Fundamental cycles in grid graphs

We show that the average length of a fundamental cycle with respect to any fixed spanning tree of the $n\times n$ square grid is at least $\Omega(\log n)$; the bound is asymptotically tight. This result answers in the affirmative a question posed by McCarty in relation to sparse representations of binary matroids.
Read the full abstract

All authors Bartłomiej Kielak, Daniel Král', Ander Lamaison, Xichao Shu

2604.17595 · 19 Apr · An anonymous reviewer brought the paper "N. Alon et al.: A graph-theoretic game and its application to the k-server problem, SIAM J. Comput. 24 (1995), 78-100" to our attention. Since our main result is contained in Section 6 there, we will not pursue publication of this paper. We keep it publicly available on arXiv in case our proof argument may be of use in another setting

Representation Theory

Pointwise character bounds for $\mathrm{SU}(3)$

We present a basic pointwise bound for the irreducible characters of $\mathrm{SU}(3)$ and, as an application, derive new $L^p$ bounds for these characters. Our approach is based on the descent of characters to singular sets and the cancellation in this formula.

Dynamical Systems

Recurrent and gradient dynamics of Iterated Function Systems

We study the qualitative dynamics of general Iterated Function Systems (IFSs) through chain recurrence and a decomposition into recurrent and gradient-like behavior. At the same time, we move the focus from the topological property of the phase space to the dynamical properties of the system and we say that an IFS has compact dynamics if it has an invariant compact set (global attractor) that attracts every compact subset of the phase space. For an IFS with compact dynamics, we introduce a distinction that has no counterpart for a single map: ordinary chain recurrence, which may be realized along a suitable itinerary, and orbitwise chain recurrence, which requires the whole semigroup orbit of a point to remain in its chain component. This leads naturally to two directed graphs encoding the recurrent components and the downstream relations between them. We prove that the chain structure of an IFS with compact dynamics over a locally compact space is completely determined by the restriction of the IFS to its compact global attractor. We then obtain a Conley-type trichotomy: every point of the global attractor has either orbitwise recurrent dynamics, mixed recurrent-gradient dynamics, or purely gradient dynamics. The three alternatives admit equivalent descriptions in terms of bitrajectories and strict Lyapunov functions. We also give conditions guaranteeing connectedness of the chain graph and of the orbitwise chain graph. Finally, we compare the point dynamics of the IFS with two associated single-map systems and establish a localization principle extending several compact-space results from Conley theory for closed relations to IFSs whose global attractor has a compact neighborhood. This is a second and highly modified version of the original manuscript. Most of the examples present in the first version have been removed and will appear soon in a second manuscript.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Recovery Guarantees for Continual Learning of Dependent Tasks: Memory, Data-Dependent Regularization, and Data-Dependent Weights

Continual learning (CL) is concerned with learning multiple tasks sequentially without forgetting previously learned tasks. Despite substantial empirical advances over recent years, the theoretical development of CL remains in its infancy. At the heart of developing CL theory lies the challenge that the data distribution varies across tasks, and we argue that properly addressing this challenge requires understanding this variation–dependency among tasks. To explicitly model task dependency, we consider nonlinear regression tasks and propose the assumption that these tasks are dependent in such a way that the data of the current task is a nonlinear transformation of previous data. With this model and under natural assumptions, we prove statistical recovery guarantees (more specifically, bounds on estimation errors) for several CL paradigms in practical use, including experience replay with data-independent regularization and data-independent weights that balance the losses of tasks, replay with data-dependent weights, and continual learning with data-dependent regularization (e.g., knowledge distillation). To the best of our knowledge, our bounds are informative in cases where prior work gives vacuous bounds.
Read the full abstract

All authors Liangzu Peng, Uday Kiran Reddy Tadipatri, Ziqing Xu, Eric Eaton, René Vidal

Optimization and Control

Exact Finite-Horizon Quantile Kelly for Repeated Multi-Outcome Events

We formulate and prove an exact finite-horizon quantile theorem for repeated identical multi-outcome Kelly wagering in wealth-profile / Arrow–Debreu coordinates. For a fixed $m$-outcome event repeated independently over a horizon $n$, the terminal wealth induced by a one-period wealth profile $W$ is a monomial $W^N$ in the multinomial count vector $N$. We show that every fixed upper quantile of terminal wealth is a positively homogeneous piecewise-monomial function on the closed Arrow–Debreu wealth simplex, equivalently piecewise linear in log-wealth coordinates on the positive interior. The pieces are indexed by the chambers of the multinomial count arrangement, and on each chamber the quantile objective is exactly a one-period Kelly objective for a count-based shadow law $k/n$. Consequently the finite-horizon quantile problem decomposes into finitely many shadow-Kelly subproblems. We then refine the interior chamber picture to a finite stratification of the full closed simplex by support faces and arrangement faces, and we prove a weak exact recursive boundary algorithm. We also prove a natural first-order asymptotic collapse to ordinary Kelly, showing that the optimal scaled log-quantile converges to the ordinary Kelly value and that exact finite-horizon maximizers converge to the Kelly wealth profile. For illustration, we include worked binary and ternary examples in the main text and expanded versions in the appendices. We conclude with further remarks and conjectures concerning stronger pruning, higher-order finite-horizon corrections, and extensions to simultaneous wagers.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Diverse Dictionary Learning

Given only observational data $X = g(Z)$, where both the latent variables $Z$ and the generating process $g$ are unknown, recovering $Z$ is ill-posed without additional assumptions. Existing methods often assume linearity or rely on auxiliary supervision and functional constraints. However, such assumptions are rarely verifiable in practice, and most theoretical guarantees break down under even mild violations, leaving uncertainty about how to reliably understand the hidden world. To make identifiability actionable in the real-world scenarios, we take a complementary view: in the general settings where full identifiability is unattainable, what can still be recovered with guarantees, and what biases could be universally adopted? We introduce the problem of diverse dictionary learning to formalize this view. Specifically, we show that intersections, complements, and symmetric differences of latent variables linked to arbitrary observations, along with the latent-to-observed dependency structure, are still identifiable up to appropriate indeterminacies even without strong assumptions. These set-theoretic results can be composed using set algebra to construct structured and essential views of the hidden world, such as genus-differentia definitions. When sufficient structural diversity is present, they further imply full identifiability of all latent variables. Notably, all identifiability benefits follow from a simple inductive bias during estimation that can be readily integrated into most models. We validate the theory and demonstrate the benefits of the bias on both synthetic and real-world data.
Read the full abstract

All authors Yujia Zheng, Zijian Li, Shunxing Fan, Andrew Gordon Wilson, Kun Zhang

Optimization and Control

Composition and tensor train structure in polynomial optimization

We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to intermediate variables (“states”) of dimension lower than the ambient dimension. Structures like these arise naturally in dynamical systems, Markov chains, and neural networks. We develop two moment-SOS (sums of squares) hierarchies that exploit this composition structure in different ways. The first one, termed state-lifting chordal, is based on the correlative sparsity graph of the problem. The second one, termed state-lifting push-forward, encodes the structure at the level of the measures directly. Numerical experiments demonstrate that the proposed methods can compute certified bounds for problems with hundreds or even a thousand variables. To illustrate the versatility of the hierarchies we apply them to Markov chain optimization, quantum optimal control, and neural networks.
Read the full abstract

Optimization and Control

The Multi-Block DC Function Class: Theory, Algorithms, and Applications

We present the Multi-Block DC (BDC) class, a rich class of structured nonconvex functions that admit a DC ("difference-of-convex") decomposition across parameter blocks. This multi-block class not only subsumes the usual DC programming, but also turns out to be provably more powerful. Specifically, we demonstrate how standard models (e.g., polynomials and tensor factorization) must have DC decompositions of exponential size, while their BDC formulation is polynomial. This separation in complexity also underscores another key aspect: unlike DC formulations, obtaining BDC formulations for problems is vastly easier and constructive. We illustrate this aspect by presenting explicit BDC formulations for modern tasks such as deep ReLU networks, a result with no known equivalent in the DC class. Moreover, we complement the theory by developing algorithms with non-asymptotic convergence theory, including both batch and stochastic settings, and demonstrate the broad applicability of our method through several applications.
Read the full abstract

All authors Pouria Fatemi, Hoomaan Maskan, Alp Yurtsever, Suvrit Sra

Number Theory

A remark on an integral structure of the imperfect coefficient ring of $(\varphi,\Gamma)$-modules

Let $K$ be a complete discrete valuation field of characteristic $0$ with perfect residue field of characteristic $p>0$. Let $\mathbb{A}_K$ denote the imperfect coefficient ring of $(\varphi,\Gamma)$-modules defined by Jean-Marc Fontaine. We prove that the canonical map $W(k_{K_\infty})[[\mu]]\rightarrow \mathbb{A}_K\cap A_{\mathrm{inf}}$ is an isomorphism, even when $K$ is ramified. This fact was remarked by Nathalie Wach without proof. In Appendix 2, we include a result of Dylan Pentland. Both results indicate the difficulty of constructing a coefficient ring of “Wach modules” in the ramified case.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Deterministic Trust Regions for Finite-Window Black-Hole Spectroscopy in GW250114

We study finite-window black-hole spectroscopy in the loud-event regime and ask when a multimode ringdown fit supports a stable common-remnant Kerr interpretation. Starting from whitened, tapered detector-frame data, we prove a deterministic frequency-extraction theorem for a projected sampled Prony–matrix-pencil pipeline with explicit statistical, algorithmic, omitted-tail, and mismatch terms. We then construct a local inverse atlas for the Kerr $(\ell,m,n)=(2,2,0)$ map on an event-local detector-frame remnant box for GW250114 and propagate the resulting primary uncertainty into $(2,2,1)$ and $(4,4,0)$ consistency tests. These ingredients yield a detector-frame trust criterion for individual windows. We calibrate mismatch and colored-noise radii on a GW250114-like synthetic waveform bank built from public surrogate, CCE, and numerical-relativity information, and we apply the resulting bounds to the public H1/L1 strain and public parameter-estimation products for GW250114. The accepted windows form an intermediate post-peak band: earlier windows remain sensitive to start-time drift and structured nuisance fits, whereas later windows become variance dominated. Within that band, the recovered remnant remains consistent with the public inspiral–merger–ringdown estimates and supports a common-remnant Kerr interpretation that survives the full preprocessing and robustness checks. For loud events, the relevant question is therefore which finite detector-frame windows sustain spectroscopy, not whether some multimode fit can be made in isolation.
Read the full abstract

Optimization and Control

On-Trip Matching and Pricing for Shared Rides

Shared rides, which match compatible riders in one vehicle, have the potential to increase vehicle utilization and reduce congestion and emissions. However, this service has seen limited success outside dense urban areas due to insufficient matching opportunities. The dominant model in the literature, which we refer to as the pre-trip model, matches riders before dispatch using non-bipartite matching, and dispatches unmatched riders solo. In practice, augmenting this pre-trip matching mechanism with an on-trip matching phase, where riders initially dispatched solo can still match with later arrivals, can expand matching opportunities. Yet the addition of the on-trip phase complicates the dynamic matching problem, as riders' matching opportunities evolve as they travel: both the set of compatible riders and the value of matches can diminish as a rider progresses towards her destination. To address this challenge, we formulate a Markov decision process that tracks riders' evolving states and weighs immediate matches against future matching opportunities. Within this framework, we incorporate pricing decisions to maximize long-run average profit, where we develop a fluid relaxation for static pricing and use value function approximation for dynamic (state-dependent) pricing. Experiments using Chicago ridesharing data show that pre-trip matching performs well with concentrated demand, whereas on-trip matching is particularly beneficial in the sparse outskirts where operating shared rides is especially challenging. Across both static and dynamic pricing settings, adding on-trip matching increases platform profit and match rates while lowering average quoted prices, showing the value of capturing matching opportunities along the route when demand is too dispersed for effective pre-trip matching.
Read the full abstract

All authors Yifan Shen, Junlin Chen, Julia Yan, Chiwei Yan

Numerical Analysis

Robust Deep FOSLS for Transmission Problems

This work presents a robust, energy-based deep learning framework for solving transmission problems in heterogeneous media, including cases with discontinuous material scenarios. We introduce a weighted First-Order System Least-Squares (FOSLS) formulation involving an energy-norm Poincaré constant and prove its equivalence to a natural energy norm of the underlying equations, with constants independent of material parameters. As a result, the optimization landscape remains aligned with a meaningful error approximation even under high material contrast, where standard neural network losses often deteriorate. We further prove that the FOSLS formulation, together with its integral-loss representation, exhibits a passive variance reduction property, whereby the gradient variance progressively decreases as the loss diminishes, in contrast to methods such as VPINNs and Deep Ritz. From a numerical standpoint, we adopt a reduced-order perspective by constructing a low-dimensional space described by a neural network. The optimal coefficients are computed via a least-squares solver, and the space is subsequently improved through gradient-based updates. By selecting the activation function ReQU, the method mitigates the spurious overshoots typically observed in smooth networks when approximating discontinuities. Numerical experiments in 1D and 2D interface settings corroborate these findings.
Read the full abstract

All authors Alejandro Duque, Paulina Sepúlveda, Carlos Uriarte, Jamie M. Taylor, David Pardo

Algebraic Topology · Cross-listed from cs.LG

Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells

Persistent homology (PH) encodes global information, such as cycles, and is thus increasingly integrated into graph neural networks (GNNs). PH methods in GNNs typically traverse an increasing sequence of subgraphs. In this work, we first expose limitations of this inclusion procedure. To remedy these shortcomings, we analyze contractions as a principled topological operation, in particular, for graph representation learning. We study the persistence of contraction sequences, which we call Contraction Homology (CH). We establish that forward PH and CH differ in expressivity. We then introduce Hourglass Persistence, a class of topological descriptors that interleave a sequence of inclusions and contractions to boost expressivity, learnability, and stability. We also study related families parametrized by two paradigms. We also discuss how our framework extends to simplicial and cellular networks. We further design efficient algorithms that are pluggable into end-to-end differentiable GNN pipelines, enabling consistent empirical improvements over many PH methods across standard real-world graph datasets. Code is available at \href{https://github.com/Aalto-QuML/Hourglass}{this https URL}.
Read the full abstract

Differential Geometry

Decreasing Weyl's energy by connected sums with locally conformally flat manifolds

We study the Weyl functional on connected sums of two four-dimensional manifolds $(M,g_M)$ and $(Z,g_Z)$, assuming $g_M$ is Bach-flat and $g_Z$ locally conformally flat. We show that if $g_M$ is neither self-dual nor anti self-dual and if $g_Z$ is of positive Yamabe class, there exists a metric $g_Y$ on $Y := M \# Z$ with Weyl energy lower than that of $g_M$ (with the trivial exception of $(Z,g_Z) = (\mathbb{S}^4, g_{\mathbb{S}^4})$). This result has a relation to a conjecture by Singer and has a perspective application to the minimization of Weyl's energy. The proof relies on a simultaneous interplay of $W_M^+, W_M^-$ and the topology of $Z$, and also covers some orbifold cases.
Read the full abstract

Rings and Algebras

A note on $n$-Jordan homomorphisms

By using a variation of a theorem on $n$-Jordan homomorphisms due to Herstein, we deduce the following G. An's result: Let $ A $ and $ B $ be two rings where $ A $ has a unit and $ char(B)> n. $ If every Jordan homomorphism from $ A $ into $ B $ is a homomorphism (anti-homomorphism), then every $n$-Jordan homomorphism from $ A $ into $ B $ is an $n$-homomorphism (anti-$n$-homomorphism).
Read the full abstract

Number Theory

Effective Joint Sato-Tate Distribution and Sign Change of Symmetric Power Coefficients

We prove an unconditional, effective joint Sato–Tate distribution for the Fourier coefficients of two twist-inequivalent, non-CM newforms $f$ and $f'$. Our result generalises a result of Thorner, which holds for rectangular regions, by extending it to any measurable region of $[-2,2]^2$ whose boundary consists of finitely many continuous curves of finite length. As a consequence, we develop a unified framework to study various arithmetic properties of Fourier coefficients of symmetric power $L$-functions attached to $f$ and $f'$. In particular, for these coefficients (and their polynomial expressions), we obtain effective distribution results, quantitative statements on simultaneous sign behaviour, and bounds for the first sign change.
Read the full abstract

Dynamical Systems

The Convex-Analytic Structure of Thermodynamic Equilibrium: Pressure, Subdifferentials, and Phase Transitions

We develop the convex-analytic structure of the thermodynamic formalism for continuous maps on compact metric spaces. The pressure functional is the Legendre-Fenchel transform of the negative entropy, and the biconjugate recovery of the entropy from the pressure establishes a complete duality. Equilibrium states are elements of the subdifferential of the pressure, uniqueness of equilibrium states corresponds to Gâteaux differentiability, and first-order phase transitions correspond to non-differentiability. For systems with specification and Hölder potentials, the pressure is Fréchet differentiable in the Hölder norm, and the second derivative of the pressure equals the asymptotic variance of the Birkhoff sums. We prove a universal variational principle that unifies the classical additive, the subadditive, and the relative variational principles through a single theorem on convex functionals satisfying convexity, lower semi-continuity, coercivity, and cocycle invariance. Extensions to systems with the specification property and to non-compact spaces under coercivity conditions are included, with applications to countable Markov shifts via Sarig's recurrence classification. This Part constitutes Part II of a six-part series on the thermodynamic formalism for hyperbolic dynamical systems.
Read the full abstract

Dynamical Systems

Gibbs Measures on Subshifts of Finite Type: Five Equivalent Characterizations with Explicit Constants

We prove that five characterizations of Gibbs measures for Hölder potentials on topologically mixing subshifts of finite type are equivalent: the Jacobian condition, the classical cylinder-based Gibbs property, the eigenmeasure of the Ruelle transfer operator, the variational equilibrium state, and the minimizer of the large deviations rate function. The equivalence is established in a single theorem with explicit constants expressed in terms of the Hölder exponent, the potential norm, the alphabet size, and the mixing time. The proof yields explicit spectral gap estimates for the transfer operator via the Birkhoff cone contraction technique, Lipschitz stability of the Gibbs measure in Wasserstein distance under perturbation of the potential, and statistical limit theorems including a central limit theorem with Berry-Esseen bounds and a large deviations principle. This Part constitutes Part I of a six-part series on the thermodynamic formalism for hyperbolic dynamical systems.
Read the full abstract

Probability

Convergence of Langevin AIS for multimodal distributions

We study convergence rates of the annealed importance sampling algorithm (Neal '01) combined with Langevin Monte Carlo when the target is a multimodal Gibbs measure. The main result shows that for a fixed error threshold, the time complexity is quadratic in the inverse temperature. We identify a simple and useful quantity that controls the sampling error for AIS in a general setting, and then bound this quantity in our setting using spectral estimates. We also study an autonormalized version and obtain bounds for the time complexity in terms of the inverse temperature.
Read the full abstract

All authors Akshat Agarwal, Gautam Iyer, Aidan Jameson, Seungjae Son, Wyatt Wimmer

Numerical Analysis

Multi-domain spectral approach for Zakharov-Kuznetsov equations in 3D with cylindrical symmetry

We present a novel numerical framework for studying nonlinear dispersive equations in higher-dimensional settings, specifically designed for solutions featuring traveling waves along a preferred axis (or field-aligned traveling waves). Using the three-dimensional generalized Zakharov-Kuznetsov (gZK) equation as a model, we convert it into cylindrical coordinates and implement a domain decomposition strategy. By partitioning the computational domain into distinct regions based on expected solution behavior, we significantly reduce computational complexity while maintaining the high resolution necessary for capturing small-scale dynamics. Another key innovation of our method is the ability to efficiently handle fractional nonlinearities, specifically, the critical power $p = 7/3$ in 3D, which typically introduces significant computational overhead and numerical instabilities that compromise simulation accuracy. Using this framework, we are able to investigate the dynamics of solutions (with cylindrical symmetry) close to the ground state soliton and show that for the 3D critical ZK equation, the ground state serves as the sharp threshold for global vs. finite time existence of solutions. Our method successfully tracks the profiles of these singular solutions, providing new insights into the dynamics of wave collapse in three-dimensional magnetized media.
Read the full abstract

Differential Geometry

Maxfaces with infinitely many Swallowtails

In this article, we discuss the existence of a 1-parameter infinite genus family of maxfaces having infinitely many planar (spacelike) ends and infinitely many swallowtails. In particular, we show the existence of the following: (1) a period-2 family of maxfaces with infinitely many planar ends and alternating singularity types, where every odd-layer neck has exactly four swallowtails, while each even-layer neck is almost conical; for $n=2$, the fundamental piece is a genus-1 Wei-type maxface; (2) a period-3 family where every neck carries four swallowtails (24 per period); and (3) a period-2 family of maxfaces with an almost conical singularity on every neck. All maxfaces are embedded in a wider sense.
Read the full abstract

Metric Geometry

Rado's covering problem for cubes and balls: a semi-survey

What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint sub-collection $\mathcal{S}$ occupying at least a fraction $c$ of the area covered by $\mathcal{C}$? This problem was first raised by T.~Radó in 1928, who was motivated by a classical covering lemma in real analysis due to Vitali. R.~Rado later generalized the problem from axis-parallel squares in the plane to homothetic copies of any given convex body $K$ in $\mathbb{R}^d$, where now we are looking for an optimal constant $F(K)$. Our utmost interest is for cubes and balls in the high-dimensional regime $d\rightarrow \infty$. The estimates that we currently have for cubes are much more precise than those for balls: namely if $Q^d$ is a $d$-dimensional cube, then \[ (e^{-1}+o(1))\frac{2^{-d}}{d \log{d}} \leq F(Q^d)\leq 2^{-d}, \] while denoting $B^d$ a $d$-dimensional Euclidean ball, then \[ (1+\epsilon_d)3^{-d}\leq F(B^d)\leq 2.447^{-d}, \] where $\epsilon_d>0$ vanishes exponentially fast as $d\rightarrow \infty$. The latter upper bound is obtained here by using the Kabatiansky–Levenshtein bound for the sphere packing problem.
Read the full abstract

Analysis of PDEs

Energy asymptotics and blow-up phenomena for biharmonic Brézis-Nirenberg problem

For dimensions $n\geq8$, we are concerned with the quotient functional of the biharmonic Brézis-Nirenberg problem under the Navier boundary condition $$ S(\varepsilon V):=\inf_{0\not\equiv u\in H^2(\Omega)\cap H_0^1(\Omega)}\frac{\int_{\Omega}|\Delta u|^2dx+\varepsilon\int_{\Omega}V|u|^2dx}{\big(\int_{\Omega}|u|^{2^\star}dx\big)^{2/2^\star}}, $$ where $2^\star=\frac{2n}{n-4}$ is the critical Sobolev exponent of the embedding $H^2(\Omega)\cap H_0^1(\Omega)\hookrightarrow L^{2^\star}(\Omega)$, $\Omega\subset\mathbb{R}^n$ is a bounded open set and $V:\overline{\Omega}\rightarrow\mathbb{R}$ is a continuous function. Under certain assumptions on $V$, we establish sharp asymptotics for the energy difference $S(0)-S(\varepsilon V)$, as $\varepsilon\rightarrow0^+$, by means of matching upper and lower bound estimates. Moreover, we give a precise description of the blow-up profile of (almost) minimizing sequences and characterize the blow-up rate and the location of concentration points.
Read the full abstract

Functional Analysis

Exploring q-Stancu Operators via a New Representation

This paper investigates the q-Stancu operators, which generalize the q-Bernstein operators, by developing a new representation in terms of the q-Pochhammer symbol. Based on this representation, some known properties are re-discovered, and a general recurrence relation for the moments is established. It is shown that higher-order moments can be expressed in terms of lower-order ones. Furthermore, the limit form of the operators is defined and their uniform convergence is proved. Finally, the moments of the limit operator and their recurrence relations are presented.
Read the full abstract

Differential Geometry

Improved Morse Index Stability for Sequences of Harmonic Maps from Degenerating Riemann Surfaces

We study the stability of the extended Morse index, defined as the number of negative and zero eigenvalues of the Jacobi operator, for sequences of harmonic maps on degenerating Riemann surfaces. As the conformal structure approaches the boundary of moduli space, collar collapse creates major analytical challenges. We analyze the second variation of the energy under these degenerations and identify conditions ensuring upper semicontinuity of the extended Morse index. Refining earlier results of the first and second authors in [7], we obtain sharper control of the spectrum of the Jacobi operator on degenerating domains. A key new aspect is the explicit contribution of geodesics arising as limits of the images of degenerating collars. We show that these neck regions converge to geodesic segments whose Morse index contributes nontrivially to the limiting extended index.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

A Note on Coadjoint Orbits for Multifermion Systems

The coadjoint orbit action for a multifermion system, as an exact description of its dynamics, is considered. A parametrization of the variables involved is given which facilitates the approximation of this by another coadjoint orbit action suitable for expansions around the Fermi surface, recovering various actions which have been used in previous literature. The presentation of this in terms of functions on phase space with star-products as well as further truncations are briefly considered.
Read the full abstract

Statistics Theory

Joint Exclusivity

We introduce joint exclusivity (JE), a relaxation of mutual exclusivity (ME) for non-negative random vectors that forbids only the simultaneous positivity of all $n$ components. Whereas ME requires the probabilities of positive outcomes to sum to at most one, a JE random vector with prescribed marginals $F_1,\ldots,F_n$ exists if and only if $$ \sum_{i=1}^n \overline{F}_i(0)\le n-1. $$ An inclusion–exclusion identity shows that JE laws are determined by their $(n-1)$-dimensional margins and decomposes aggregate stop-loss premiums into those of sub-portfolios. A single wrap-around construction attains the existence bound, minimises the number of claims in convex order and, in frequency–severity models with exchangeable severities, the aggregate loss, extending the safest-dependence property of ME beyond its admissible range. We develop canonical and distortion-based constructions, an $m$-exclusivity hierarchy between ME and JE, and admissibility criteria for general families of claim patterns, explicit for hierarchical caps. Finally, we identify the most dangerous exclusive structure in convex order for lines sharing a severity law, which yields sharp stop-loss and Tail Value-at-Risk bounds.
Read the full abstract

Representation Theory

Permutation, stabilization and decomposition

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized quaternion groups and only in those cases.

Information Theory

Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes

The soft-output successive cancellation list (SO-SCL) decoder provides a methodology for estimating the a-posteriori probability log-likelihood ratios by only leveraging the conventional SCL decoder of polar codes. However, the sequential decoding nature of SCL introduces high decoding latency to SO-SCL. In this paper, we incorporate node-based fast decoding into the SO-SCL framework. After addressing the challenge of soft output extraction in special node decoding, we proposed the soft-output fast SCL (SO-FSCL) decoding algorithm, along with its log-domain implementation and hardware-friendly version. The proposed SO-FSCL decoder can be regarded as an add-on extension to FSCL decoder, enabling us to autonomously choose whether to output only hard decisions like FSCL or to provide additional soft outputs. Latency and complexity analyses demonstrate that SO-FSCL can significantly reduce, for example, decoding time steps by 81.8% (with unlimited resources), the number of additions by 41.3%, and the number of comparisons by 46.4%. Meanwhile, simulation results indicate that SO-FSCL delivers almost the same soft-output performance as SO-SCL, outperforming other soft-output polar decoders, especially in scenarios involving iterative decoding.
Read the full abstract

All authors Li Shen, Yongpeng Wu, Zhen Gao, Yin Xu, Xiaohu You, Xiqi Gao, Wenjun Zhang