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)

Monday 13 April

Mathematical Physics

Feynman's linear divergence problem

First, we consider generalized wave and scattering operators and derive modifications of commutation relations (between scattering operators and unperturbed operators) when the corresponding deviation factors behave as $\exp\{i t {\mathcal C}_{\pm}\}$ for $t\to \pm \infty$. Then, we construct so called secondary generalized scattering operators for the related case of linear divergence in QED, which gives a positive answer (in that case) to the well-known problem of J. R. Oppenheimer regarding scattering operators in QED: "Can the procedure be freed of the expansion in $\varepsilon$ and carried out rigorously?"
Read the full abstract

Analysis of PDEs

Sharp Interface Limit for a Mass-Conserving Navier-Stokes/Allen-Cahn System with Different Viscosities

We perform a rigorous examination of the sharp interface limit of a coupled Navier-Stokes and mass-conserving Allen-Cahn system in a two-dimensional, bounded, and smooth domain as the parameter $\varepsilon > 0$, representing the thickness of the diffuse interface, tends to zero. We prove the convergence of solutions from the mass-conserving Navier-Stokes/Allen-Cahn system to those of its sharp interface limit. In this limit, the interface evolves according to mass-conserving mean curvature flow with a convection term and is coupled to a two-phase Navier-Stokes system with surface tension. Our approach entails the construction of an approximate solution for the limiting system through the use of matched asymptotic expansions, complemented by a special ansatz for the leading-order term. In order to estimate the error between this approximate solution and the exact solution, we employ a refined spectral estimate for the linearized Allen-Cahn operator near the approximate solution.
Read the full abstract

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

Loop-dependent entangling holonomies in localized topological quartets

A spectrally isolated quartet can admit a local two-qubit description at each point in parameter space and still acquire a loop holonomy outside the local subgroup $\mathrm{U}(2)\otimes\mathrm{U}(2)$. We study this question in three localized topological settings, a BHZ ribbon, a spinful SSH chain, and a BBH corner quartet. On a fixed quartet, changing only the loop can move the holonomy from almost local to entangling. In BHZ, co-rotating and counter-rotating edge-field loops have nearly the same eigenphase data, but only the counter-rotating loop yields an Ising-like entangler. SSH gives a controlled-rotation example in a numerically stable edge quartet. BBH shows the same issue in a higher-order corner quartet. Standard Berry data, including Berry phases, Chern numbers, determinant phases, and eigenphase spectra, do not separate these cases. The main diagnostic is the distance from the loop holonomy to the extracted local subgroup. Canonical two-qubit coordinates are used only after reduction failure has been identified. The quartet is the smallest setting in which this question can be tested explicitly. The same subgroup-reduction problem extends to any isolated multiplet with pointwise product type $D=\prod_{\alpha}d_\alpha$, where the relevant local subgroup is the embedded product group $G_{\mathbf d}=\mathrm{Im}[\prod_{\alpha}U(d_\alpha)\to U(D)]$. In the terminology of Ref.[arXiv:2601.13764], these examples realize loop-dependent entangling gluing.
Read the full abstract

Information Theory

ISAC-Enabled Non-Terrestrial Networks for 6G: Design Principles, Standardization, Performance Tradeoffs, and Use Cases

Non-Terrestrial Networks (NTN) have emerged as a key enabler to fully realize the vision of integrated, intelligent, and ubiquitous connectivity in 6G systems. However, several operational challenges, including severe Doppler effects, interference, and latency, hinder the seamless integration of NTN and Terrestrial Networks (TN). In this context, Integrated Sensing and Communication (ISAC), which unifies sensing and communication functionalities within a common framework, offers great potential to address these challenges while enabling new network capabilities. Due to its complementary functionalities, ISAC can play a pivotal role in enhancing NTN performance, although its practical adoption requires a fundamental rethinking of existing architectural and standardization frameworks. Motivated by this need, this article examines key aspects of ISAC-enabled NTN, including architectural design principles, application scenarios, standardization challenges, and key performance tradeoffs. Finally, a representative case study is presented to illustrate major technical challenges and highlight promising future research directions for ISAC-enabled NTN.
Read the full abstract

All authors Muhammad Ali Jamshed, Rohit Singh, Malik Muhammad Saad, Aryan Kaushik, Wonjae Shin, Miguel Dajer, Alain Mourad

Analysis of PDEs

A game-theoretical interpretation for a doubly nonlinear parabolic equation

We introduce a game-theoretical framework for the doubly nonlinear parabolic equation \[ |\partial_t u|^{p-2} \partial_t u - \Delta_p u = 0. \] where $\Delta_p u = \nabla \cdot ( |\nabla u |^{p-2} \nabla u)$ with $p>2$ is the standard $p-$Laplacian. A key feature to our approach is a new asymptotic mean value formula (AMVF) for the $p-$Laplacian that is robust even when the gradient vanishes and is independent of the sign of the $p-$Laplacian. This new AMVF leads naturally to a dynamic programming principle (DPP) whose solutions converge to the viscosity solution of the boundary value problem for the differential equation. In addition, solutions to the DPP coincide with value functions for a stochastic, two-players, zero-sum game that we introduce and analyze here.
Read the full abstract

Optimization and Control

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements

We study computational aspects of a key problem in robust statistics – the penalized least trimmed squares (LTS) regression problem, a robust estimator that mitigates the influence of outliers in data by capping residuals with large magnitudes. Although statistically attractive, penalized LTS is NP-hard, and existing mixed-integer optimization (MIO) formulations scale poorly due to weak relaxations and exponential worst-case complexity in the number of observations. We propose a new MIO formulation that embeds hyperplane arrangement logic into a perspective reformulation, explicitly enforcing structural properties of optimal solutions. We show that, if the number of features is fixed, the resulting branch-and-bound tree is of polynomial size in the sample size. Moreover, we develop a tailored branch-and-bound algorithm that uses first-order methods with dual bounds to solve node relaxations efficiently. Computational experiments on synthetic and real datasets demonstrate substantial improvements over existing MIO approaches: on synthetic instances with 5000 samples and 20 features, our tailored solver reaches a 1% gap in 1 minute while competing approaches fail to do so within one hour. These gains enable exact robust regression at significantly larger sample sizes in low-dimensional settings.
Read the full abstract

Optimization and Control

Risk-Constrained Kelly for Mutually Exclusive Outcomes: CRRA Support Invariance and Logarithmic One-Dimensional Calibration

We study the finite mutually exclusive outcome version of risk-constrained Kelly optimization with explicit state prices. The market has outcome probabilities $p_i>0$, state prices $q_i>0$, terminal wealths $W_i=c+x_i/q_i$, and a drawdown-surrogate constraint \[ \sum_{i=1}^n p_i W_i^{-\lambda}\le 1,\qquad \lambda>0. \] For constant relative risk aversion utility, we work primarily in the standard overround regime $\sum_i q_i>1$, where every optimizer is necessarily non-full-support. Under the usual unique likelihood-ratio prefix hypothesis for the unconstrained problem, we prove that the constrained optimizer has exactly the same active set. Thus, in the regime where the prefix theorem is meaningful, the risk constraint deforms the funded wealth profile but does not change the active set. The support is therefore invariant across both the CRRA parameter and the drawdown-surrogate parameter. We then isolate the logarithmic case $\gamma=1$. Once the common active prefix is known, the constrained problem reduces to a one-dimensional outer calibration together with independent one-dimensional inner equations on the active states. In this case we prove existence, uniqueness, and monotonicity for the inner solves, derive a complete calibration theorem, and record the resulting structured algorithm. We treat the fair and subfair regimes only as boundary cases: full-support phenomena can occur there, so the overround prefix theory no longer yields a parallel exact description of comparable sharpness. A numerical example illustrates how the risk constraint alters the funded wealth profile while leaving support unchanged.
Read the full abstract

Numerical Analysis

Asymptotic-Preserving and Well-Balanced Linearly Implicit IMEX Schemes for the Anelastic Limit of the Isentropic Euler Equations with Gravity

We consider the compressible Euler system with anelastic scaling, modeling isentropic flows under the influence of gravity. In the zero-Mach-number limit, the solution of the compressible Euler system converges to a variable density anelastic incompressible limit system. In this work, we present the design and analysis of a class of higher-order linearly implicit IMEX Runge-Kutta schemes that are asymptotic preserving, i.e., they respect the transitory nature of the governing equations in the limit. The presence of gravitational potential warrants the incorporation of the well-balancing property. The scheme is developed as a novel combination of a penalization of a linear steady state, a finite-volume balance-preserving reconstruction, and a source term discretization preserving steady states. The penalization plays a crucial role in obtaining a linearly implicit scheme, and well-balanced flux-source discretization ensures accuracy in very low Mach number regimes. Some results of numerical case studies are presented to corroborate the theoretical assertions.
Read the full abstract

Commutative Algebra

Finite Generation in Polynomial Semirings

We study the semiring $\mathbb{N}_0[\alpha]$ as an additive monoid where $\alpha$ is a positive real algebraic number. In the atomic case, the atoms of $\mathbb{N}_0[\alpha]$ are precisely the powers $\alpha^n$ up to a certain nonnegative integer $n$, and finite generation is governed by divisibility of the minimal polynomial by a negative-tail polynomial. Our first main result gives a complete characterization when the minimal polynomial has the form $\mathfrak{m}_\alpha(X)=p_\alpha(X)-c$ with $c\in\mathbb{N}$. Our second main result shows that finite generation forces $\alpha$ to be a weak Perron number. As an application, we analyze cubic minimal polynomials and obtain a partial classification of rank-$3$ monoids $\mathbb{N}_0[\alpha]$ by generation and factorization type, including coefficient constraints, non–length-factoriality results for a large family, and examples with prescribed numbers of atoms.
Read the full abstract

Information Theory · Cross-listed from cs.CL

Phonological distances for linguistic typology and the origin of Indo-European languages

We show that short-range phoneme dependencies encode large-scale patterns of linguistic relatedness, with direct implications for quantitative typology and evolutionary linguistics. Specifically, using an information-theoretic framework, we argue that phoneme sequences modeled as second-order Markov chains essentially capture the statistical correlations of a phonological system. This finding enables us to quantify distances among 67 modern languages from a multilingual parallel corpus employing a distance metric that incorporates articulatory features of phonemes. The resulting phonological distance matrix recovers major language families and reveals signatures of contact-induced convergence. Remarkably, we obtain a clear correlation with geographic distance, allowing us to constrain a plausible homeland region for the Indo-European family, consistent with the Steppe hypothesis.
Read the full abstract

All authors Marius Mavridis, Juan De Gregorio, Raul Toral, David Sanchez

Numerical Analysis

A tensor-based exponential integrator for diffusion–reaction equations in common curvilinear coordinates

In this paper, we study a tensor-based method for the numerical solution of a class of diffusion–reaction equations defined on spatial domains that admit common curvilinear coordinate representations. Typical examples in 2D include disks (polar coordinates), and in 3D balls or cylinders (spherical or cylindrical coordinates) as well as spheres for problems involving the Laplace–Beltrami operator. The proposed approach is based on a carefully chosen finite difference discretization of the Laplace operators that yields matrices with a structured representation as sums of Kronecker products. For the time integration, we introduce a novel split variant of the exponential Euler method that effectively handles the stiffness and avoids the severe time step size restriction of classical explicit methods. By exploiting the peculiar form of the obtained discretized operators and the chosen splitting strategy, we compute the needed action of the $\varphi_1$ matrix function through suitable tensor-matrix products in a $\mu$-mode framework. We demonstrate the efficiency the approach on a wide range of physically relevant 2D and 3D examples of $N$-coupled diffusion–reaction systems generating Turing patterns with up to $10^6$ degrees of freedom.
Read the full abstract

Optimization and Control

Decision-Aware Predictions for Right-Hand Side Parameters in Linear Programs

This paper studies an integrated learning and optimization problem in which a prediction model estimates the right-hand-side parameters of a linear program (LP) using a contextual vector. Considering that such a prediction alters the feasible region of the LP, we aim to estimate the constraint set to contain the optimal solution of the underlying LP, given by the true right-hand side parameters. We propose formulations for training a prediction model by minimizing the decision error while accounting for feasibility, measured by a collection of historical primal and dual solutions. Our analysis identifies conditions under which a resulting predicted feasible region contains the true solution, and whether the latter solution achieves optimality for the predicted problem. To solve the alternative training problems, we employ existing LP and nonconvex programming solution methods. We conduct numerical experiments on a synthetic LP and a network optimization problem. Our results indicate that the proposed methods effectively implement the desired feasibility, compared to standard regression models.
Read the full abstract

Spectral Theory

Spectral properties of the Dirichlet-to-Neumann map for the Helmholtz equation

The study of the Dirichlet-to-Neumann map and the associated Steklov problem for the Laplace equation has been a central topic in spectral geometry over the past decade. In this survey, we consider a more general framework in which the Laplace equation is replaced by the Helmholtz equation. We examine how the properties of the Dirichlet-to-Neumann eigenvalues and eigenfunctions depend on the parameter in the Helmholtz equation and describe new phenomena arising when this parameter is nonzero, as opposed to the Laplace case. In particular, we present various eigenvalue inequalities, analyse spectral asymptotics in different regimes, and investigate nodal domains and other features of eigenfunctions. We also discuss applications where the Helmholtz parameter plays an essential role, as well as challenges encountered in the numerical computation of the Dirichlet-to-Neumann spectrum.
Read the full abstract

Combinatorics

The number of induced paths in outerplanar graphs

Let $P_k$ denote the path with $k$ vertices, and $\mathrm{ex}_{\mathcal{OP}}(n,H^{\mathrm{ind}},\emptyset)$ be the maximum number of induced copies of $H$ in an $n$-vertex outerplanar graph. In this paper, we determine the exact value of $\mathrm{ex}_{\mathcal{OP}}(n,P_3^{\mathrm{ind}},\emptyset)$ for all $n$, and give an asymptotic value of $\mathrm{ex}_{\mathcal{OP}}(n,P_4^{\mathrm{ind}},\emptyset)$. For general $k$, Matolcsi and Nagy proved that $\lim_{k\to \infty} {\left( \mathrm{ex}_{\mathcal{OP}}(n, P_{k+1},\emptyset)\right)^{1/k}} =4$. In the induced case, we prove that \[ fib(k-1)\frac{{(n-2k+3)}^2}{4} \le \mathrm{ex}_{\mathcal{OP}}(n, P_{k+1}^{\mathrm{ind}},\emptyset) \le fib(k+1) \binom{n}{2}, \] where $fib(k)$ is the Fibonacci number. This implies that $\lim_{k\to \infty} {\left( \mathrm{ex}_{\mathcal{OP}}(n, P_{k+1}^{\mathrm{ind}},\emptyset)\right)^{1/k}} = \frac{\sqrt{5}+1}{2}\approx 1.618$.
Read the full abstract

All authors Yichen Wang, Ervin Győri, Casey Tompkins, Xiamiao Zhao

Analysis of PDEs

Asymptotics as $s\searrow 0$ of the nonlocal nonparametric Plateau problem with obstacles

In this paper, we introduce a functional and a geometric setting for an obstacle problem for nonlocal minimal graphs. In particular we study existence of solutions, a priori estimates, and we prove the equivalence of the two settings. We then observe a striking stickiness phenomena when the fractional parameter is small and the data at infinity is not too large: the nonlocal minimal graphs adhere entirely to the obstacle and leave the remainder of the domain asymptotically empty. We thus provide a class of examples where continuity of nonlocal minimal graphs across the boundary and across the obstacle may fail.
Read the full abstract

Mathematical Physics · Cross-listed from cs.LG

Generative Path-Finding Method for Wasserstein Gradient Flow

Wasserstein gradient flows (WGFs) describe the evolution of probability distributions in Wasserstein space as steepest descent dynamics for a free energy functional. Computing the full path from an arbitrary initial distribution to equilibrium is challenging, especially in high dimensions. Eulerian methods suffer from the curse of dimensionality, while existing Lagrangian approaches based on particles or generative maps do not naturally improve efficiency through time step tuning. We propose GenWGP, a generative path finding framework for Wasserstein gradient paths. GenWGP learns a generative flow that transports mass from an initial density to an unknown equilibrium distribution by minimizing a path loss that encodes the full trajectory and its terminal equilibrium condition. The loss is derived from a geometric action functional motivated by Dawson Gartner large deviation theory for empirical distributions of interacting diffusion systems. We formulate both a finite horizon action under physical time parametrization and a reparameterization invariant geometric action based on Wasserstein arclength. Using normalizing flows, GenWGP computes a geometric curve toward equilibrium while enforcing approximately constant intrinsic speed between adjacent network layers, so that discretized distributions remain nearly equidistant in the Wasserstein metric along the path. This avoids delicate time stepping constraints and enables stable training that is largely independent of temporal or geometric discretization. Experiments on Fokker Planck and aggregation type problems show that GenWGP matches or exceeds high fidelity reference solutions with only about a dozen discretization points while capturing complex dynamics.
Read the full abstract

Optimization and Control

Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers

Artificial intelligence (AI) is moving increasingly beyond prediction to support decisions in complex, uncertain, and dynamic environments. This shift creates a natural intersection with operations research and management science (OR/MS), which has long provided methodological foundations for sequential decision making under uncertainty. At the same time, deep learning advances, including feedforward neural networks, recurrent architectures, transformers, large language models (LLMs), and deep reinforcement learning, have expanded data-driven modeling for large-scale decisions. This tutorial presents an OR/MS-centered perspective on deep learning for sequential decision making under uncertainty, bridging neural architectures and OR/MS approaches to decision making. Its premise: deep learning complements optimization rather than replacing it. Deep learning brings adaptability and scalable approximation, whereas OR/MS provides the mathematical rigor to represent constraints, recourse, uncertainty, and decision quality. The tutorial reviews key decision making foundations, connects them to the major neural architectures in modern AI, and organizes the field around three central themes: predict-then-optimize and decision-aware learning, learning-based decision generation under constraints for continuous and discrete problems with temporal coupling, and deep reinforcement learning for sequential and combinatorial decision making. Impact spans supply chains, service systems, healthcare and epidemic response, agriculture, energy, environmental sustainability, and autonomous operations. This tutorial frames these developments as part of a shift from predictive AI toward decision-capable AI, highlighting OR/MS's role in shaping the next generation of integrated learning–optimization systems.
Read the full abstract

Combinatorics

Stability for the Anti-Ramsey Number of Matchings

Let $n, r, s$ be three positive integers such that $n\geq 2s+5$. Let $K_r$ denote the complete graph of order $r$. Given a graph $F$, the anti-Ramsey number $ar(n,F)$ is defined as the minimum number $C$ such that any edge-coloring of $K_n$ with exactly $C$ colors contains a rainbow copy of $F$. Let $H$ be an edge-colored graph on $K_n$ with at least $g(n,s)$ colors, where \[ g(n,s)=\max\left\{ \binom{n}{2} - \binom{n - s + 1}{2} + 5, \binom{2s - 1}{2} + n + 1 \right\}. \] In this paper, we establish a stability type result for the anti-Ramsey number of matchings. Specifically, if $H$ does not have a rainbow matching of size $s+2$, then $H$ contains either a monochromatic complete graph $K_{n-s}$ or a monochromatic $K_{n - 2s - 1} \vee \overline{K_{2s + 1}}$.
Read the full abstract

Analysis of PDEs · Cross-listed from cs.AI

Lectures on AI for Mathematics

This book provides a comprehensive and accessible introduction to the emerging field of AI for mathematics. It covers the core principles and diverse applications of using artificial intelligence to advance mathematical research. Through clear explanations, the text explores how AI can discover hidden mathematical patterns, assist in proving complicated theorems, and even construct counterexamples to challenge conjectures.
Read the full abstract

Dynamical Systems

Reparametrizing the relativistic Kepler equation: a bridge to Levi-Civita-type models

We establish a link between different relativistic variants of the Kepler problem. In particular, we show that solutions of the special relativistic model with fixed energy can be reparameterized as solutions of a generalized Kepler equation with an additional $1/r^2$ term in the gravitational potential. This yields a dynamics of the same type as the Levi-Civita correction, up to different coefficients.
Read the full abstract

Combinatorics

Forbidding matching as trace in uniform hypergraphs

We say a hypergraph $\mathcal{H}$ contains a hypergraph $\mathcal{G}$ as trace if there exists a vertex subset $S \subseteq V(\mathcal{H})$ such that $|S| = |V(\mathcal{G})|$ and $\{e \cap S: e \in E(\mathcal{H})\}$ contains $\mathcal{G}$ as a sub-hypergraph. We use $\mathrm{ex}_r(n, \mathrm{Tr}_r(\mathcal{G}))$ to denote the maximum number of hyperedges in an $r$-uniform hypergraph on $n$ vertices not containing $\mathcal{G}$ as a trace. The study of Turán numbers for traces was initiated by Mubayi and Zhao who studied the case when $\mathcal{G}$ is a complete graph. Let $M_{s+1}$ denote the graph of a matching with $s+1$ edges. In this paper, we give the upper bound of $\mathrm{ex}_r(n, \mathrm{Tr}_r(M_{s+1}))$ which is sharp asymptotically. When $r=3$, we give the exact value of $\mathrm{ex}_3 (n, \mathrm{Tr}_3 (M_{s+1}))$. We also consider the generalized Turán number in the case of matching. That is, the maximum number of copies of clique $\mathcal{K}_t^r$ in hypergraphs forbidding $\mathrm{Tr}_r (M_{s+1})$ as a trace. We give an upper bound which is sharp asymptotically and when $r=3$, we give the exact value. The Turán number of forbidding a matching and the other graph is another well studied topic initiated by Alon and Frankl. We also consider an analogue problem for the trace version, i.e., forbidding trace of matching and trace of complete graph as subgraphs.
Read the full abstract

All authors Yichen Wang, Xin Cheng, Ervin Győri, Xiamiao Zhao

Information Theory

Improved Characterization of the Memory-Rate Tradeoff for Demand-Private Coded Caching With Multiple Demands

We consider a coded caching problem with multiple demands under a privacy constraint. In this problem, a server with access to $N$ files serves $K$ users over a shared link, and each user requests $L$ distinct files. The privacy constraint requires that each user obtain no information about the demands of the other users. We first propose a new achievable scheme for arbitrary $N$, $K$, and $L$ by applying a novel transformation to a suitable non-private coded caching scheme. We then derive a new converse bound, and show that the proposed scheme is order optimal within a multiplicative factor of $6$ of this bound. Finally, for the case of two users, we completely characterize the optimal memory-rate tradeoff for arbitrary $N$ and $L$ through three new achievable schemes and matching converse bounds.
Read the full abstract

All authors Qinyi Lu, Nan Liu, Wei Kang, Chunguo Li

2604.11492 · 13 Apr · 22 pages, 2 figures. Extended version prepared for journal submission. The conference version was accepted at IEEE GLOBECOM 2026; for the version corresponding to the conference paper, see v2. This version contains substantial new results; the title and author list have been updated

Statistics Theory · Cross-listed from stat.ML

ADD for Multi-Bit Image Watermarking

As generative models enable rapid creation of high-fidelity images, societal concerns about misinformation and authenticity have intensified. A promising remedy is multi-bit image watermarking, which embeds a multi-bit message into an image so that a verifier can later detect whether the image is generated by someone and further identify the source by decoding the embedded message. Existing approaches often fall short in capacity, resilience to common image distortions, and theoretical justification. To address these limitations, we propose ADD (Add, Dot, Decode), a multi-bit image watermarking method with two stages: learning a watermark to be linearly combined with the multi-bit message and added to the image, and decoding through inner products between the watermarked image and the learned watermark. On the standard MS-COCO benchmark, we demonstrate that for the challenging task of 48-bit watermarking, ADD achieves 100% decoding accuracy, with performance dropping by at most 2% under a wide range of image distortions, substantially smaller than the 14% average drop of state-of-the-art methods. In addition, ADD achieves substantial computational gains, with 2-fold faster embedding and 7.4-fold faster decoding than the fastest existing method. We further provide a theoretical analysis explaining why the learned watermark and the corresponding decoding rule are effective.
Read the full abstract

Probability

Berry-Esseen bounds for estimators of entropy and diversity indices on countable alphabets

In the present paper, we derive Berry-Esseen bounds for the estimation of diversity indices on countable alphabets. A general non-asymptotic convergence rate is established for the plug-in estimator of a wide class of indices, including Simpson's index and Reńyi's entropy. For the practically crucial case of Shannon entropy, we provide explicit Berry-Esseen bounds for the standard plug-in estimator, as well as for two widely used bias-corrected variants, the Miller-Madow and the jackknife estimators.
Read the full abstract

Mathematical Physics · Cross-listed from astro-ph.CO

Emergence of Complex Web Structures

Complex structures often emerge from initially homogeneous or weakly correlated states. We address the apparent tension between this ordering and entropy growth through a unified framework combining semi-microscopic phase-space dynamics, transport geometry, information theory, and coarse-grained effective modeling. The key point is that entropy depends on the level of description: a coarse-grained spatial field may become more ordered as structure forms, even while the full phase-space description becomes more complex through shell crossing, multistreaming, and the activation of velocity degrees of freedom. Using a Lagrangian–Eulerian transport map, we show how density amplification is governed by the Jacobian of the deformation and how anisotropic collapse arises from the eigenvalues of a hierarchy of deformation tensors. Long-range interaction or information flow is encoded in the displacement field, so that nonlocality enters directly through transport. We connect this geometric description to a maximum-entropy Gaussian baseline and show how nonlinear transport and nonlocal coupling generate scale coupling, higher-order correlations, and non-Gaussianity. We then formulate a Landau–Ginzburg description in which the growth of seed anisotropies is interpreted as the activation of lower effective free-energy branches, providing a coarse-grained realization of self-organization. Applied to generated cosmological fields, this framework indicates that the nonlocal tidal level becomes relevant already at moderate overdensity. Although cosmological structure formation is the main realization considered here, the framework is intended more broadly as a mesoscopic language for systems in which transport, anisotropy, nonlocality, and self-organization are central.
Read the full abstract

Commutative Algebra

Strong persistence index and fluctuations in colon powers of monomial ideals

Let $I$ be an ideal in a commutative Noetherian ring $R$. We say that a positive integer $\ell_0$ is the strong persistence index of $I$ if $\ell_0$ is the smallest integer such that $(I^{\ell+1} :_R I) = I^{\ell}$ for all $\ell \geq \ell_0$. The first aim of this paper is to study this notion for monomial ideals. We also introduce the notion of fluctuation in colon powers if there exist positive integers $a < b < c$ such that at least one of the following cases occurs: (i) $(I^{a} : I) = I^{a-1}$, $(I^{b} : I) \neq I^{b-1}$, but $(I^{c} : I) = I^{c-1}$. (ii) $(I^{a} : I) \neq I^{a-1}$, $(I^{b} : I) = I^{b-1}$, but $(I^{c} : I) \neq I^{c-1}$. The second purpose of this work is to study this phenomenon for monomial ideals.
Read the full abstract

Rings and Algebras

Symmetric operads of GK-dimension one

We prove that there is no finitely generated symmetric operad of Gelfand-Kirillov dimension strictly between 1 and 2 that answers an open question posted in 2020. We also classify finitely generated prime symmetric operads of Gelfand-Kirillov dimension 1.
Read the full abstract

All authors Yu Li, Zihao Qi, Yongjun Xu, James J. Zhang, Zerui Zhang, Xiangui Zhao

Mathematical Physics

Passive two-plateau relaxation from Tricomi confluent hypergeometric kernels

Anomalous relaxation with memory spectra arises in disordered solids, soft matter, biological tissues and electrochemical interfaces. Fractional-order models capture broad power-law behaviour efficiently, but they can obscure spectral structure and are not always convenient for passive realisation or finite-dimensional simulation. We introduce a non-fractional passive framework based on the Tricomi confluent hypergeometric function, combined with a bounded Moebius normalisation that enforces prescribed low-frequency and high-frequency plateaux while preserving a broad dispersive transition. The resulting family contains the Debye and Cole-Cole responses as exact subcases, while extending them to asymmetric two-plateau dispersive laws with independently tunable low- and high-frequency exponents. For an admissible parameter range, we prove that the bounded block admits a Stieltjes representation with nonnegative spectral density, implying complete monotonicity, passivity, causality and compatibility with standard circuit and state-space descriptions. Building on this structure, we derive a passive Gauss-Stieltjes discretisation leading to Foster-type rational approximations and first-order state-space realisations with positive poles and residues. Numerical experiments show convergence of these finite-dimensional approximations across moderate-memory and long-tail regimes, enabling passive reduced-order representations of broad-memory responses. The framework is then validated on broadband dielectric data and battery electrochemical impedance spectra. In tissues, multi-block Tricomi mixtures improve complex-domain fitting accuracy relative to classical Cole-Cole baselines while preserving interpretable modal structure.
Read the full abstract

Mathematical Physics

Finite-difference zeta readout of one-loop operator spectra

For a positive elliptic operator $A$, the logarithmic zeta determinant $\ln\det_{\zeta}A=-\zeta_{A}'(0)$ combines UV information encoded by local heat-kernel coefficients with finite contributions determined by the full spectrum. We introduce a finite-difference zeta readout based on $\zeta_{A}(0)$ and $\zeta_{A}(q-1)$, defining a one-parameter meromorphic family whose node-coalescence limit $q\to 1$ recovers the standard logarithmic zeta determinant. The parameter $q$ fixes the Mellin evaluation point $s=q-1$, organising genuine poles, regular local special values, generic full-spectrum values, and the logarithmic determinant limit along a common coordinate, while simultaneously determining the spectral weight $\lambda^{-q}$ in the $q$-dependent variational response. In relative spectral problems, this coordinate distinguishes systems retaining a leading local hierarchy from those in which the entire local power-law hierarchy cancels, illustrated respectively by a reflectionless soliton and a twisted circle. In four dimensions, the framework recovers the standard local scale response at $q=1$, governed by the heat-kernel coefficient $a_{4}$, whereas at generic regular values of $q$ it retains finite mass-sensitive information beyond the local hierarchy. The construction thereby provides a unified analytic framework for comparing local UV structure, finite full-spectrum information, variational response, and relative spectral behaviour within fixed operator spectra.
Read the full abstract