Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 2 March

Number Theory

Periodic vanishings of the Legendre-17 signed partition numbers

For $f : \mathbb{N} \to \{0,\pm 1\}$ the $f$-signed partition numbers $\mathfrak{p}(n,f)$ are defined to be the weighted partition sums \[ \mathfrak{p}(n,f) = \sum_{\substack{x_{1}+\cdots+x_{k} = n \\ x_{1} \geq \cdots \geq x_{k} > 0 \\ k \geq 1}} f(x_{1})f(x_{2})\cdots f(x_{k}). \] For prime $p > 2$, let $(\frac{\cdot}{p})$ denote the Legendre symbol modulo $p$. The first half of this paper derives Rademacher-style series formulae for the quantities $\mathfrak{p}(n,\pm(\frac{\cdot}{p}))$ for $p < 24$ satisfying $p \equiv 1 \pmod{4}$ (that is, for $p=5,13,17$), and the extensions to general $p \equiv 1 \pmod{4}$ are made apparent in our derivations. In the second half of this paper, the series formulae for $\mathfrak{p}(n,\pm(\frac{\cdot}{17}))$, as well as various properties of Dedekind sums and their "character-twisted" analogues, are used to establish that these two quantities are identically zero on certain (mod $34$)-arithmetic progressions.
Read the full abstract

Probability

"Game, Set, Match": Double Delight Watching a Grand Slam Tennis Match

Probabilistic properties of tennis scoring systems are examined and compared with best-of-K systems. A model, where each player has his/her own probability of winning his/her service point and which remains invariant for the duration of the match, and where outcomes of points played are independent of each other, is assumed. Probabilities of winning a game tie-breaker, a game, a set tie-breaker, a set, and the match are obtained. Since tennis scoring systems are unique, probability calculations require decomposing big and complicated problems into smaller and simpler constituent problems, solving these sub-problems, then combining to obtain the solution to the big problem. The problems that arise from tennis scoring systems offer excellent pedagogical venues for teaching probability, in particular, the use of the Theorem of Total Probability and the Iterated Rules for Mean, Variance, and Covariance. There are also many interesting questions in tennis, foremost of which is whether a tennis match under this assumption will actually end with probability one; or whether when two players of `equal abilities' play a match, the first server possesses an advantage. These questions are addressed in this work. Tennis scoring systems are technically statistical decision systems to determine the better player. Since such a decision system is based on a finite number of points played, erroneous decisions could arise, such as the inferior player winning the match. We compare different systems in terms of the probability of the better player winning, as well as the duration of the match in terms of the number of points played.
Read the full abstract

Commutative Algebra

The stable set of associated primes of a complementary edge ideal

We explicitly determine the associated primes of every power of a complementary edge ideal, prove that they satisfy the persistence property, and compute the $\text{v}$-function. In the course of the proofs, we completely describe the homological properties of all powers of squarefree monomial ideals generated in degrees large relative to the number of variables defining them.
Read the full abstract

Probability · Cross-listed from cs.LG

Learning Optimal Search Strategies

We explore the question of how to learn an optimal search strategy within the example of a parking problem where parking opportunities arrive according to an unknown inhomogeneous Poisson process. The optimal policy is a threshold-type stopping rule characterized by an indifference position. We propose an algorithm that learns this threshold by estimating the integrated jump intensity rather than the intensity function itself. We show that our algorithm achieves a logarithmic regret growth, uniformly over a broad class of environments. Moreover, we prove a logarithmic minimax regret lower bound, establishing the growth optimality of the proposed approach.
Read the full abstract

Analysis of PDEs

Uniqueness in Lorentz Spaces of the 2d Navier-Stokes equation

We study uniqueness of mild solutions to the two–dimensional incompressible Navier-Stokes equations on the torus in borderline spatial classes. While Lorentz-space methods yield uniqueness in $C([0,T);L^{2,1}(\mathbb{T}^2))$ via real interpolation and weak $L^2$ control, extending such arguments to larger Lorentz spaces $L^{2,q}$, $1<q<2$, encounters endpoint obstructions. In this paper we prove that uniqueness in $C([0,T);L^{2,q}(\mathbb{T}^2))$ holds provided one assumes a short-time $L^\infty$ smoothing property at every restart time, namely \[ \lim_{\delta\downarrow 0}\sup_{t\in(T_0,T_0+\delta]}\sqrt{t-T_0}\,\|v(t)\|_{L^\infty(\mathbb{T}^2)}=0, \quad \text{for all } T_0\in[0,T). \] The proof combines the restart mild formulation, the $L^1$ bound for the periodic Oseen kernel of $e^{t\Delta}\mathbb{P}\nabla\cdot$, and an explicit Beta-function computation yielding a strict $L^2$ contraction on short intervals. The smoothing assumption is natural in Kato and Koch-Tataru type critical well-posedness frameworks and clarifies how parabolic regularization can replace Lorentz endpoint structure in uniqueness arguments.
Read the full abstract

Mathematical Physics · Cross-listed from physics.class-ph

Hamilton Revised: The Action Principle for Initial Value Problems

We present the variational action principle for initial value problems in classical, conservative-force point particle mechanics. We rigorously derive this formulation by taking the classical limit of the Schwinger-Keldysh expression for the time dependence of the expectation value for operators in quantum mechanics. We clarify the connection between the variation of the position and the variation of the velocity of a particle when implementing Hamilton's Principle in deriving the Euler-Lagrange Equations. We show that both the plus and minus Keldysh paths (of the average and difference of the forward/backward paths) have classical paths and fluctuations – unlike the common perception that the minus path provides the fluctuations around the single classical solution given by the plus path – and that the fluctuations of both paths are crucial for the correct normalization of the classical limit. The classical limit yields "initial conditions" and equations of motion for the minus paths such that the unique classical solution for the minus paths is that they are identically zero, and, fascinatingly, that the minus paths' solution propagates backwards in time; thus one does not need to set the minus paths to zero by hand when taking the classical limit of the Schwinger-Keldysh formalism. We note implications for the classical and quantum mechanics of non-holonomic constraints and quantum field theories with gauges dependent on the derivatives of the fields.
Read the full abstract

Algebraic Geometry

Kodaira-type classification of singular fibers of some minimal abelian fibrations

Let $X \to S$ be a minimal abelian fibration of relative dimension $n$ over a curve. We classify all possible singular fibers $X_s$ having $(n-1)$-dimensional “abelian variety parts”. This generalizes Kodaira's work on elliptic fibrations, and Matsushita and Hwang–Oguiso's work on Lagrangian fibrations into a single framework. The classification is divided into three parts: semistable, unstable, and multiple. Multiple fibers are again divided into three types: semistable-like, mixed, and unstable-like.
Read the full abstract

Optimization and Control

A Computationally Efficient and Human Implementable Minimum-lap-time Control Policy for Energy-limited Race Cars

This paper presents a provably optimal, real-time capable energy management policy for race cars that provides simple human-driver-implementable control cues. Specifically, we first formulate the energy-constrained minimum-lap-time control problem via Pontryagin's Minimum Principle (PMP) and derive the optimal policy and costate dynamics using Karush-Kuhn-Tucker (KKT) optimality conditions. We show that the optimal control policy follows a bang-bang structure that is easily implementable by a human driver, eliminating the need for potentially dangerous active throttle pedal overwrites or distracting signals. Moreover, the analytical formulation of the optimal system dynamics allows us to recast the problem as a sequence of boundary-value problems, which can be efficiently solved using root-finding methods. Our results show that our proposed approach can compute the same globally optimal control strategies of existing numerical methods based on direct optimal control, whilst drastically reducing computation time from the order of seconds to milliseconds.
Read the full abstract

Mathematical Physics

Flow Subgraphs and Flow Network Design under End-to-End Power Dissipation Constraints

We investigate how the underlying graph of a network supports a flow between a source node and a destination node and propose to compute the expected number of nodes and links that contribute to transferring items in random graphs. Since the transportation is associated with a \quotes{cost} or \quotes{power dissipation}, we further address how to construct a graph given predetermined end-to-end power dissipation, which can be reduced to the \quotes{inverse effective resistance problem} that asks for a weighted graph in which the effective resistance matrix equals a predetermined demand matrix. We propose a heuristic algorithm, \quotes{Resistor Gap Pruning} (RGP), which provides sparse graphs closely approximating the demand effective resistance and which shows stable performance across different demand scenarios.
Read the full abstract

All authors Zhihao Qiu, Xinhan Liu, Rogier Noldus, Piet Van Mieghem

Combinatorics · Cross-listed from quant-ph

Thirty-six quantum officers are entangled

There exist pairs of orthogonal Latin squares of any order n except if n=2 or n=6 [Bose, Shrikhande and Parker, 1960]. In particular, the problem of Euler's thirty-six officers does not have a solution. However, it has a "quantum solution": there exist so-called entangled quantum Latin squares of order six [Rather et al., 2022]. We prove that mutually orthogonal quantum Latin squares of order six do not exist if entanglement is not allowed.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Strong Zero Modes via Commutant Algebras

Strong Zero Modes (SZMs) are (approximately) conserved quantities that result in (approximate) double degeneracies in the entire spectra of certain Hamiltonians, with the Majorana zero mode of the transverse-field Ising chain being a primary example. In this work, we discover via a systematic search that many examples of SZMs can be understood as symmetries in the commutant algebra framework, which reveals novel algebraic structures hidden in Hamiltonians with well-known SZMs, including the transverse-field Ising chain. Our findings unify the understanding of different examples of SZMs in the literature, demystify their connections to ground state phases of matter, and reveal novel symmetries in simple models, such as exact quasilocal $U(1)$ symmetries that sometimes accompany the SZMs such as in the spin-1/2 XY model for certain parameter values. Moreover, while analytically tractable SZMs have mostly been demonstrated only for non-interacting or integrable models, the algebraic structures revealed in this work can be exploited to construct integrability-breaking interactions that exactly preserve these SZMs. Such non-integrable models are expected to show more clear dynamical signatures of SZMs without the interference of other conserved quantities that appear in integrable models, and we discuss many examples, including those of novel hydrodynamic modes associated with such symmetries for some special parameter values. We also show that while this commutant understanding extends to the non-interacting limit of the celebrated Fendley SZM in the spin-1/2 XYZ chain, the SZM in the interacting case cannot be understood in this framework. This suggests that there are two types of SZMs – those that survive integrability breaking and those that do not. We close by using this commutant understanding to construct an alternate proof of the Fendley SZM, which might be of independent interest.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Perturbative semiclassical entropy of dynamical black holes

We consider perturbative quantum gravity as a quantum field theory of linearized metric perturbation on an asymptotically flat spacetime with a bifurcate Killing horizon. We include the perturbative gravitational constraints into the algebra of observables restricted to the right half of the future horizon of the spacetime. We use the boundary charge, associated to the horizon Killing field, as an auxiliary "observer" degree of freedom. The observables "dressed" with the additional charge are invariant under the Killing symmetry and generate a Type-$\text{II}_{\infty}$ von Neumann factor. We compute the von Neumann entropy of the reduced density matrix of a classical-quantum coherent state constructed from the metric perturbations and the "observer wavefunction". This von Neumann entropy satisfies an analogue of the first law of thermodynamics. We further show that this entropy is related to Hollands-Wald-Zhang entropy of the (second order) perturbed dynamical black hole through the flux of perturbations through the horizon and future null infinity.
Read the full abstract

Analysis of PDEs · Cross-listed from gr-qc

Global existence for a Fritz John equation in expanding FLRW spacetimes

We study the family of semilinear wave equations $\square_{\mathbf{g}_p}\phi=(\partial_t\phi)^2$, on fixed expanding FLRW spacetimes, having $\mathbb{R}^3$ spatial slices and undergoing a power law expansion, with scale factor $a(t)=t^p$, $0< p \le 1$. This is a natural generalization to a non-stationary background of a famous Fritz John ”blow-up” equation in $\mathbb{R}^{1+3}$ (corresponding to $p=0$, i.e. the case in which $\mathbf{g}_0$ is the Minkowski metric). While, in Minkowski spacetime ($p=0$), non-trivial solutions to this equation are known to diverge in finite time, here we prove that, on the referred FLRW backgrounds ($0<p\leq 1$), sufficiently small, smooth, and compactly supported initial data yield global-in-time solutions to the future. Previous work, co-authored by the first two authors, considered accelerated expanding spacetimes ($p>1$) and relied on the integrability of the inverse of the scale factor to establish future global well-posedness. In the current work, where such an integrability condition is lacking, we rely on a vector field method that captures and combines dispersive estimates with the spacetime expansion to control the solution and suppress the nonlinear blow-up mechanism. To achieve this, we commute the Laplace-Beltrami operator with a boosts-free subset of the Poincaré algebra and employ Klainerman-Sideris types of inequalities. Our strategy is general and is developed to handle the non-stationary nature of FLRW spacetimes. While we focus solely on this Fritz John type of equation, which serves as a prototype to study blow-up of non-linear waves, our approach provides a rigorous proof of the regularizing effects of spacetime expansion and can be exploited for a wider range of applications and nonlinearities.
Read the full abstract

Commutative Algebra

Primes of bad reduction for systems of polynomial equations

Consider polynomials $F_1,\dots,F_s$ in $\K[X_1,\dots,X_n]$ over a field $\K$, their zero-set $V(F_1,\dots,F_n)$ in $\Kbar^n$ and its decomposition into equidimensional components $V_0,\dots,V_n$ (with $V_i$ either empty or of dimension $i$ for all $i$). To each $V_i$, we can associate its Chow forms, which are polynomials in new variables $(U_{k,j})_{0\le k\le i, 0 \le j \le n}$, uniquely defined up to a scalar factor. These Chow forms completely characterize $V_i$: we can recover equations for $V_i$ from them, and their degree is $(i+1)$ times the degree of $V_i$. We discuss the situation when the $F_i$'s have integer coefficients, and study the question of when the Chow forms of the $V_i$'s defined as above can be reduced modulo $p$ to give Chow forms of the equidimensional components of $V(F_1 \bmod p,\dots,F_s \bmod p)$. We show that this is the case as soon as $p$ does not divide a certain nonzero integer $\Delta$ of height $O(n^{14} s h d^{3n+4})$, with $d$ and $h$ bounds on respectively the degrees and heights of the $F_i$'s.
Read the full abstract

Numerical Analysis

Novel technique based on Léja Points Approximation for Log-determinant Estimation of Large matrices

The computation of the Log-determinant of large, sparse, symmetric positive definite (SPD) matrices is essential in many scientific computational fields such as numerical linear algebra and machine learning. In low dimensions, Cholesky is preferred, but in high dimensions, its computation may be prohibitive due to memory limitation. To circumvent this, Krylov subspace techniques have proven to be efficient but may be computationally expensive due to the required orthogonalization processes. In this paper, we introduce a Newton-Léja interpolation based approach for estimating log-determinants, where the implementation is only based on matrix multiplications and a rough estimation of eigenvalue bounds of the matrix. The method employs an adaptive stopping criterion to select the degree of interpolation according to the data and introduces a centered, scaled-based formulation for computing the logarithmic divided differences. By combining Newton-Léja interpolation with a randomized algorithm called Hutch++, we obtain a matrix-free log-determinant estimation framework that avoids explicit matrix factorization and Krylov basis orthogonalization. We establish approximation error bounds for the Newton-Léja interpolation and derive an inexact oracle error bound that separates stochastic trace estimation from the approximation errors in the projected and residual components. Numerical experiments on both large sparse synthetic matrices (Gaussian Markov Random fields) and large-scale real-world matrices demonstrate that our method substantially reduces computational time while retaining competitive accuracy, thereby confirming its effectiveness, scalability, and favorable accuracy-cost trade-off for large-scale log-determinant estimation compared with stochastic Lanczos quadrature (SLQ) and related stochastic trace-estimation methods.
Read the full abstract

Information Theory

Characterizing Information Accuracy in Timeliness-Based Gossip Networks

We investigate information accuracy in timeliness-based gossip networks where the source evolves according to a continuous-time Markov chain (CTMC) with $M$ states and disseminates status updates to a network of $n$ nodes. In addition to direct source updates, nodes exchange their locally stored packets via gossip and accept incoming packets solely based on whether the incoming packet is fresher than their local copy. As a result, a node can possess the freshest packet in the network while still not having the current source state. To quantify the amount of accurate information flowing in the network under such a gossiping scheme, we introduce two accuracy metrics, average accuracy, defined as the expected fraction of nodes carrying accurate information in any given subset, and freshness-based accuracy, defined as the accuracy of the freshest node in any given subset. Using a stochastic hybrid systems (SHS) framework, we first derive steady-state balance equations and obtain matrix-valued recursions that characterize these metrics in fully connected gossip networks under binary CTMCs. We then extend our analysis to the general multi-state information source using a joint CTMC approach. Finally, we quantify the fraction of nodes whose information is accurate due to direct source pushes versus gossip exchanges. We verify our findings with numerical analyses and provide asymptotic insights.
Read the full abstract

Statistics Theory · Cross-listed from cs.AI

Conformal Policy Control

An agent must try new behaviors to explore and improve. In high-stakes environments, an agent that violates safety constraints may cause harm and must be taken offline, curtailing any future interaction. Imitating old behavior is safe, but excessive conservatism discourages exploration. How much behavior change is too much? We show how to use any safe reference policy as a probabilistic regulator for any optimized but untested policy. Conformal calibration on data from the safe policy determines how aggressively the new policy can act, while provably enforcing the user's declared risk tolerance. Unlike conservative optimization methods, we do not assume the user has identified the correct model class nor tuned any hyperparameters. Unlike previous conformal methods, our theory provides finite-sample guarantees even for non-monotonic bounded loss functions, and it introduces a new policy control setting. Our experiments on applications ranging from natural language question answering to biomolecular engineering show that safe exploration is not only possible from the first moment of deployment, but can also improve performance.
Read the full abstract

All authors Drew Prinster, Clara Fannjiang, Ji Won Park, Kyunghyun Cho, Anqi Liu, Suchi Saria, Samuel Stanton

2603.02196 · 2 Mar · International Conference on Machine Learning (ICML), 2026. v4: Revised CPC theory to (a) show enforced smoothness for likelihood-ratio control parameter and (b) for general control parameter, assume smoothness only of constrained policy $\pi_t^{(\beta)}$ w.r.t. $\beta$ (rather than of $(l_i - \alpha)\cdot\pi_t^{(\beta)}$ or of conformal weights)

Statistics Theory

Algebraic statistics of Hüsler-Reiss graphical models in multivariate extremes

The field of extreme value statistics is concerned with modeling and predicting rare events. In a Hüsler-Reiss graphical model, a graph represents extremal conditional independence (CI) relations between random variables. These models are exponential families parameterized by a graph Laplacian and are considered the analogue of multivariate Gaussian models in the extremal setting. We study these models from the perspective of algebraic geometry. Translating the CI relations into polynomial constraints in the parameters, we define extremal CI ideals and find a determinantal representation of their generators. In terms of parametric inference, we study the extremal maximum likelihood degree as the number of solutions to a conditionally negative definite matrix completion problem. We also define and analyze the extremal maximum likelihood threshold for Hüsler-Reiss graphical models, which provides a certificate for the existence of a surrogate MLE in terms of the dimensionality of the point configuration that realizes the underlying summary statistic as a Euclidean distance matrix. We highlight throughout many interesting similarities but also differences with respect to Gaussian graphical models.
Read the full abstract

All authors Carlos Améndola, Jane Ivy Coons, Alexandros Grosdos, Frank Röttger

Combinatorics

Cuboids are canonically Ramsey

We say a set of points $C\subset \mathbb{R}^n$ is canonically Ramsey if there is some set of points $S\subset \mathbb{R}^{n'}$ such that any colouring of $S$, with any number of colours, admits either a monochromatic or rainbow copy of $C$ – that is to say, some set of points congruent to $C$ either all receive the same colour, or all receive different colours. Mao, Ozeki, and Wang introduced this notion, proving that 30-60-90 triangles are canonically Ramsey, since when various other canonically Ramsey configurations have been identified (by Gehér, Sagdeev, and Tóth, and others). Fang, Ge, Shu, Xu, Xu, and Yang showed that all triangles and rectangles are canonically Ramsey, and asked whether all cuboids are canonically Ramsey. Here cuboids are sets of the form $\{0,b_1\}\times\dots\times\{0,b_s\}$, and in particular may have dimension greater than three. We resolve this question, proving that all cuboids are canonically Ramsey.
Read the full abstract

Algebraic Topology

Perfect discrete Morse functions on Stratifoldds

In this paper, we study the computation of optimal discrete Morse functions on stratifolds. In particular, we present an algorithm that efficiently computes such functions for a broad class of them. Moreover, we characterize the conditions under which these functions are perfect.

Combinatorics

Link between bipartite and general unicellular toroidal maps via slit–slide–sew bijections

We relate general maps to bipartite maps through a bijection of type slit-slide-sew. We provide an involution on arbitrary genus maps with even degree faces. This enables a full interpretation of the relation between general and bipartite maps, in the case of genus $1$ maps with a unique face. The main tool is the use of rotations along well-chosen specific loops. Once a noncontractible simple loop is given, one slits along it, slides one notch, and sews back. This mildly modifies the structure of the map along the loop, changing the parity of the length of other loops crossing it. In the unicellular toroidal setting, the structure of noncontractible loops is simple enough to enable a full correspondence between general and bipartite maps.
Read the full abstract

Analysis of PDEs

Commutators, mean-field, and supercritical mean-field limits for Coulomb/Riesz gases

This paper is intended as a companion to the author's talk "Commutator estimates and mean-field limits for Coulomb/Riesz gases" at the 2025 Journées équations aux dérivées partielles in Aussois. The goal is to provide a concise, accessible account of sharp commutator estimates recently obtained for modulated energies associated to Coulomb/Riesz interactions and how these estimates lead to optimal results for mean-field and supercritical mean-field limits of Coulomb/Riesz gas dynamics via the modulated-energy method. The exposition centers on the works arXiv:2408.14642, arXiv:2407.15650 with Serfaty and arXiv:2511.13461, arXiv:2601.02326 with Hess-Childs and Serfaty.
Read the full abstract

Analysis of PDEs

$\mathrm{L}^p$-based Sobolev theory on closed manifolds of minimal regularity: Scalar Elliptic Equations

This paper and its follow-up arXiv:2508.11109 are concerned with the well-posedness and $\mathrm{L}^p$-based Sobolev regularity for appropriate weak formulations of a family of prototypical PDEs posed on manifolds of minimal regularity. In particular, the domains are assumed to be compact, connected $d$-dimensional manifolds without boundary of class $C^k$ and $C^{k-1,1}$ ($k \geq 1$) embedded in $\mathrm{R}^{d+1}$. The focus of this program is on the $\mathrm{L}^p$-based theory that is sharp with respect to the regularity of the source terms and the manifold. In the present paper, we focus our attention on the case of general scalar elliptic problems. We first establish $\mathrm{L}^p$-based well-posedness and higher regularity for the purely diffusive problems with variable coefficients by localizing and rewriting these equations in flat domains to employ the Calderón–Zygmund theory, combined with duality arguments. We then invoke the Fredholm alternative to derive analogous results for general scalar elliptic problems, underscoring the subtle differences that the geometric setting entails compared to the theory in flat domains.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits

Recent studies have shown that reinforcement learning with KL-regularized objectives can enjoy faster rates of convergence or logarithmic regret, in contrast to the classical $\sqrt{T}$-type regret in the unregularized setting. However, the statistical efficiency of online learning with respect to KL-regularized objectives remains far from completely characterized, even when specialized to multi-armed bandits (MABs). We address this problem for MABs via a sharp analysis of KL-UCB using a novel peeling argument, which yields a $\tilde{O}(\eta K\log^2T)$ upper bound: the first high-probability regret bound with linear dependence on $K$. Here, $T$ is the time horizon, $K$ is the number of arms, $\eta^{-1}$ is the regularization intensity, and $\tilde{O}$ hides all logarithmic factors except those involving $\log T$. The near-tightness of our analysis is certified by the first non-constant lower bound $\Omega(\eta K \log T)$, which follows from subtle hard-instance constructions and a tailored decomposition of the Bayes prior. Moreover, in the low-regularization regime (i.e., large $\eta$), we show that the KL-regularized regret for MABs is $\eta$-independent and scales as $\tilde{\Theta}(\sqrt{KT})$. Overall, our results provide a thorough understanding of KL-regularized MABs across all regimes of $\eta$ and yield nearly optimal bounds in terms of $K$, $\eta$, and $T$.
Read the full abstract

All authors Kaixuan Ji, Qingyue Zhao, Heyang Zhao, Qiwei Di, Quanquan Gu

Combinatorics

Degree Sequences vs. Forests in Finite Graphs

We prove two conjectures of Shteiner and Shteyner stating that for an undirected graph $G=(V,E)$, the number of degree sequences arising from its spanning subgraphs is at least the number of forests in $G$, with equality if and only if $G$ is bipartite. In the process of proving the bipartite case, we provide several equivalent evaluations of the Tutte polynomial $T_G(x,y)$ at $(2,1)$, including interpretations in terms of degree vectors obtained from orientations of $G$. For the non-bipartite case, we prove strict inequality by expressing degree sequences as subset sums of signless incidence vectors and comparing these with linearly independent edge sets, showing that the presence of odd cycles yields additional independent sets beyond forests. We further strengthen this result by introducing odd pseudoforests, showing that their number is bounded above by the number of degree sequences and characterizing the corresponding independent sets accordingly.
Read the full abstract

Functional Analysis

Weighted Norm Inequalities for the Strichartz Fourier transform on the Heisenberg Group

In this article, we establish an analogue of Pitt's inequality for the Strichartz Fourier transform on the Heisenberg group $\mathbb{H}^n$. By exploiting the scalar-valued formulation of the transform and the framework of decreasing rearrangements, we derive weighted $L^p$-$L^q$ estimates of Pitt type. In particular, we obtain sufficient conditions for the validity of such inequalities via weighted Hardy inequalities and Calderón's interpolation method, and we also prove necessary conditions in the case of radial weights, using structural properties of Laguerre functions and zeros of Bessel function. As an application, we deduce an uncertainty principle of Heisenberg-Pauli-Weyl type in this setting and establish a Paley inequality for the Strichartz Fourier transform. We also derive Pitt's inequality using Hardy's inequality for the case $p=q=2$. These results extend the classical Euclidean theory of Pitt's inequality to the non-commutative, nilpotent setting of $\mathbb{H}^n$ for the sub-Laplacian and conformal Laplacian. Here we highlight the role of Laguerre functions in harmonic analysis on the Heisenberg group.
Read the full abstract

All authors Aparajita Dasgupta, Prerna Gulia, Sanjoy Pusti, Sundaram Thangavelu

Logic

Possible and impossible conditionals for team logics

We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements, such as preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such well-behaved conditionals exist for downward or upward closed logics, but do not typically exist for union closed, convex or intersection closed logics. We also briefly investigate conditionals satisfying weaker requirements.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Basin Metamorphosis in Coupled Phase Oscillators

We investigate the global basin structure of twisted states in nearest-neighbor coupled phase oscillators with a common phase shift $\alpha$. As $\alpha$ increases, basin boundaries become progressively more complex, with their fractal dimension growing toward that of the full ambient phase space. We conjecture that the basins eventually become riddled-like as the system approaches the limit $\alpha\to \frac{\pi}{2}$, where the dynamics becomes volume-preserving. We characterize the transient dynamics via the stabilization time of the winding number and demonstrate that it grows with system size. The scaling accelerates at larger phase shifts, transitioning from logarithmic to power-law behavior. We further analyze the dynamical origin of these long transients. Our results demonstrate how a single phase-shift governs fractal basin complexity and provide new insights into the global geometry and transient dynamics of multistable, yet non-chaotic, coupled phase oscillators.
Read the full abstract

All authors Jin Yan, Ayumi Ozawa, Hiroshi Kori, Yuzuru Sato

Classical Analysis and ODEs

Weighted boundedness for the maximal operator associated with matrices

In this paper we study the boundedness on $L^p(w)$ of the maximal operator $M_{A^{-1}}$, defined by $M_{A^{-1}}f(x)=Mf(A^{-1}x)$, that is, the maximal of Hardy-Littlewood composed with a invertible matrix $A$. We present two different results of boundedness and provide a characterization for a particular case of matrices. The main novelty lies in examples illustrating the difference between the class of weights with a matrix, $\mathcal{A}_{A,p}$, and the classical Muckenhoupt weight class, $\mathcal{A}_{p}$. Finally, we extend these results to the fractional framework, considering the fractional maximal operator $M_{\alpha, A^{-1}}$.
Read the full abstract

Information Theory

Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems

To improve the efficiency of scarce radio-frequency (RF) resources in next-generation wireless systems, an intelligent transceiver architecture based on stacked intelligent metasurfaces (SIM) has recently emerged, where multiple programmable metasurface layers are cascaded and each layer comprises passive meta-atoms that perform beamforming directly in the wave domain. In parallel, inter-band carrier aggregation enables multi-band transmission with high spectral efficiency. Their integration in multi-band multiuser downlink transmission is challenging because a single SIM phase configuration must remain effective across all subcarriers, while user scheduling and power allocation vary across scheduling intervals. To address these challenges, we propose an alternating-optimization framework that decomposes the joint design into a power-constrained precoder update and a SIM phase update. For the SIM phase subproblem, we develop a physically consistent multi-band deep-unfolding network (MBDU-Net) that unrolls projected-gradient phase updates into a compact trainable architecture. Each stage computes an analytic gradient from the cascaded SIM channel model and learns lightweight parameters, including per-stage step sizes and band-aware scaling, enabling fast convergence. Numerical results for multi-band multiuser downlink scenarios demonstrate reliable convergence and consistent sum-rate gains on unseen channel realizations.
Read the full abstract