Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 4 May

Commutative Algebra

Frobenius identities for the volume map on Cohen–Macaulay rings

We study the volume map on Artinian quotients of Cohen-Macaulay algebras in characteristic $p$, and the interaction between it and the action of Frobenius on resolutions. This allows us to provide a general, conceptual way to understand Parseval-Rayleigh identities, curious inhomogeneous identities on the volume map which were developed for the proof of the Ohsugi-Hibi conjecture. This general perspective gives a new approach to generic Lefschetz theory. We use this perspective to do the following: we give sufficient conditions for anisotropy and the Hard Lefschetz property for generic Artinian reductions of graded Gorenstein rings; we study the codimension-$3$ Gorenstein quotient of a polynomial ring by the ideal generated by Pfaffians, proving a Parseval-Rayleigh identity and deriving anisotropy and Hard Lefschetz in characteristic $2$; we deduce the $g$-theorem for simplicial spheres and the Ohsugi-Hibi conjecture following previous work of Adiprasito, Papadakis, and Petrotou; and we provide further examples of Parseval-Rayleigh identities for Gorenstein rings.
Read the full abstract

All authors Karim Alexander Adiprasito, Eric Katz, Ryoshun Oba, Stavros Argyrios Papadakis, Vasiliki Petrotou

Mathematical Physics

A Complete Classification of Low-Order Conservation Laws for a Generalized Fifth-Order KP Family

A complete classification of local conservation laws with multipliers of differential order at most two is obtained for a generalized fifth-order Kadomtsev–Petviashvili family. The classification is carried out by the direct multiplier method and concerns nonlinear members of the family, with the conservation laws expressed locally in the original dependent variable. It is first shown, uniformly in the parameters, that every multiplier of differential order at most two reduces to first order. The resulting determining equations yield one generic case and two exceptional nonlinear cases. In the generic case, the multipliers involve four arbitrary functions of time. One exceptional case admits an additional multiplier depending on the first longitudinal derivative and involves five arbitrary functions of time, while the other has an enlarged zeroth-order multiplier family involving eight arbitrary functions of time. Representative conserved densities and spatial fluxes are derived for all three cases. The generic nonzero densities represent mass and transverse moment-type quantities. The first exceptional case admits the longitudinal gradient-energy density $\tfrac12 u_x^2$, whereas the second admits higher longitudinal moment densities. No multiplier proportional to $u$ occurs within the classified low-order local family, and hence no $L^2$-type density arises within this classification. The corresponding conserved integrals are obtained under appropriate boundary conditions or sufficient weighted spatial decay.
Read the full abstract

Analysis of PDEs

Gradient estimates for degenerate elliptic measure data problems with double phase

We study nonlinear elliptic equations modeled on \[ -\mathrm{div}\,(|Du|^{p-2}Du+a(x)|Du|^{q-2}Du) = \mu, \] where $2\le p<q<\infty$, $a(\cdot) \ge 0$, and $\mu$ is a signed Borel measure with finite total mass. We prove local Calderón–Zygmund type gradient estimates for SOLA (Solutions Obtained as Limits of Approximations) by finding new and natural assumptions on $p$, $q$ and $a(\cdot)$.
Read the full abstract

Numerical Analysis

Structure-preserving LDG methods for linear and nonlinear transport equations with gradient noise

We develop local discontinuous Galerkin (LDG) methods for conservation laws with heterogeneous stochastic fluxes, where the Stratonovich-driven transport terms may be linear or nonlinear. Such equations arise, for example, in simplified turbulence models, mean field games, and fluctuating hydrodynamics. Starting from the Itô formulation, we construct semi-discretizations that build the cancellation mechanism of transport noise into the numerical method. At the discrete energy level, the second-order Stratonovich-Itô correction is balanced by the quadratic variation, up to numerical flux terms, so that the hyperbolic stability structure is retained. Suitable numerical fluxes yield discrete energy conservation or energy dissipation, valid either pathwise or in expectation. The resulting high-order schemes are proved well posed through stability estimates combined with a Khasminskii-type argument, without imposing linear growth assumptions. Numerical experiments confirm stability and high-order accuracy.
Read the full abstract

Dynamical Systems

Random dynamics of plane polynomial automorphisms

Let $\mu$ be a finitely supported probability measure on the group of automorphisms of $\mathbb{A}^2_\mathbb{C}$. If the group generated by the support of $\mu$ is non-elementary and contains only loxodromic elements, we show the existence of dynamical Green functions associated to random products. We derive consequences for $\mu$-stationary measures: they are compactly supported, and we can apply Roda's theorem to show stiffness when the action is non-dissipative.
Read the full abstract

Optimization and Control

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem

We study the maximum $k$-colorable subgraph (M$k$CS) problem, which consists in finding a largest $k$-colorable induced subgraph in a given graph. We consider a Semidefinite Programming (SDP) relaxation for the M$k$CS problem and regard its resulting upper bound as a graph parameter. We present several properties of this graph parameter, from which we obtain that the M$k$CS problem is solvable in polynomial time for $k$-perfect graphs. We further derive two novel families of valid inequalities to strengthen the SDP relaxation. The first family reduces to a family of inequalities for the Boolean quadric polytope when $k = 1$, and the second family generalizes the family of rank inequalities for binary linear programming formulations of the stable set problem. We efficiently solve the strengthened SDP relaxation using a cutting-plane algorithm that is based on the Alternating Direction Method of Multipliers (ADMM). Extensive computational experiments show that the obtained upper bounds outperform the best upper bounds from the literature. To complement our SDP-based upper bounds, we propose an integer ADMM variant that uses an exact Binary Semidefinite Programming (BSDP) formulation of the M$k$CS problem to produce high-quality feasible solutions. To the best of our knowledge, this is the first application of the ADMM to compute integer solutions to a BSDP problem.
Read the full abstract

Numerical Analysis

A Finite Element Method for Elliptic Hemivariational Inequalities in Non-isotropic and Heterogeneous Semipermeable Media

This work investigates finite element approximations for a general class of elliptic hemivariational inequalities arising in semipermeable media. The proposed model incorporates non-isotropic and heterogeneous diffusion coefficients, alongside both interior and boundary semipermeability terms, extending the isotropic and homogeneous framework examined by Han (2019). The existence and uniqueness of solutions are rigorously established. An optimal a priori error estimate for the linear finite element approximation is derived under appropriate solution regularity assumptions. Numerical experiments are presented to corroborate the theoretical analysis and to confirm the optimal convergence rates for the non-isotropic and heterogeneous case.
Read the full abstract

Logic · Cross-listed from cs.LO

Glivenko's theorems from an ecumenical perspective

In this paper, we revisit Glivenko's theorems, foundational results relating classical and intuitionistic logic, from an ecumenical perspective. We begin by discussing the historical context and significance of Glivenko's original contributions, and then examine their extensions and reinterpretations within ecumenical logical frameworks. Our analysis focuses on three ecumenical systems: Prawitz's natural deduction system NE; the system NEK, closely related to one introduced by Krauss in an unpublished manuscript; and the ECI system proposed by Barroso-Nascimento.
Read the full abstract

Statistics Theory · Cross-listed from eess.SP

The interplay of signal-to-noise ratio and variance misspecification in Gaussian mixtures

We study estimation and clustering in Gaussian mixture models under variance misspecification. Observations are generated with true variance $\sigma^2$, while the component means are estimated using a likelihood with variance $\tau^2$, yielding a family of mismatched likelihood functions parameterized by the ratio $\rho=\tau/\sigma$. We show that the interplay between $\rho$ and the signal-to-noise ratio (SNR) induces a sharp phase diagram. Under correct specification ($\rho=1$), maximum likelihood recovers the true means, independently of the SNR. However, once the model is misspecified, two different regimes emerge. Under under-smoothing ($\rho<1$), the estimated Gaussian means are displaced from the truth, and in low SNR this discrepancy grows as the SNR decreases: for every fixed $\rho<1$, the squared error scales as $\mathrm{SNR}^{-1}$. Under over-smoothing ($\rho>1$), the fitted likelihood blurs the cluster separation, causing distinct component means to collapse towards the overall mixture center once $\rho^2$ exceeds a threshold of the form $1 + \lambda\,\mathrm{SNR}$, where $\lambda$ depends on the geometry of the true means. We further show that the hard assignment objective arises as the limit $\tau\to 0$ of the same mismatched likelihood family, and derive corresponding low- and high-SNR results for hard-assignment mean estimation and latent-label recovery. Furthermore, in low SNR, Bayes-optimal clustering is close to random guessing, and the hard-assignment target remains far from the true means. These results show that in low-SNR applications, even mild variance misspecification or hard-assignment procedures can induce substantial bias, whereas in high SNR these effects are largely absent.
Read the full abstract

Algebraic Topology

The relative join operad and polyhedral products

An inclusion of nonvoid simplicial complexes induces an arrow of polyhedral products. Applying Ayzenberg's polyhedral join to both complexes gives a symmetric relative join operad. Its endpoint suboperads recover Abramyan–Panov substitution and Ayzenberg composition. Neither endpoint operad nor either relative join operad is finitely generated. The suboperad with nonvoid lower complex arises as the nonempty power-set quotient of the subset-inclusion operad. When tensoring preserves colimits of nonempty finite diagrams, the suboperad acts on arrows by polyhedral colimits up to coherent natural isomorphism. The action induces a set-operad algebra on isomorphism classes of arrows. The dual construction produces Stanley–Reisner quotient arrows, and the colimit action refines Eldridge's loop-space decomposition to arrows. PL ball–boundary pairs form a suboperad of the relative join operad, and minimal interior faces give an operad morphism. Principal pairs have odd-dimensional spherical moment-angle homotopy fibers and yield a closure result for Eldridge's loop-space class.
Read the full abstract

2605.02440 · 4 May · 24 pages. Substantially revised and retitled. Develops the relative join operad and its action on polyhedral-product arrows, with applications to Stanley-Reisner quotient maps, PL ball-boundary pairs, and a relative refinement of Eldridge's loop decomposition

Algebraic Geometry · Cross-listed from cs.RO

Higher-Order Flexible Configurations of Planar Parallel Manipulators Constructed by Averaging

This paper investigates singular configurations of planar 3-RPR parallel manipulators, which result from applying the averaging technique to solution pairs of their direct kinematic problem. Without computing the zeros of the corresponding degree 6 polynomial we parametrize the input pairs and determine their relative orientation in a way that the flexion order of the averaged configurations increases. Moreover, the obtained results are visualized for concrete examples. The presented methodology can also be used for studying the spherical and spatial analogues of planar 3-RPR parallel manipulators.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Aging Record Statistics in Saturating Self-Interacting Random Walks

The record age tau_k, defined as the time between the k-th and k+1-st record-breaking events, is a central observable of extreme-value statistics. In Markovian processes, the absence of memory makes tau_k independent of k. How memory breaks this invariance and induces aging, meaning a dependence of tau_k on k, remains a fundamental question, closely connected to widely observed aging phenomena in non-Markovian dynamics. In this Letter, we derive the exact asymptotic distribution of tau_k for saturating self-interacting random walks, a broad class of non-Markovian processes. We uncover two asymptotic regimes, in agreement with recent scaling predictions: at short times (tau much smaller than k squared), record statistics are governed by the geometry of the explored region, while at long times (tau much larger than k squared), memory effects become subdominant and reduce to nontrivial prefactor corrections. Our exact result provides a rare analytic window beyond scaling theory and extends to a framework that fully quantifies aging dynamics in the presence of saturating self-interaction.
Read the full abstract

Probability

Scaling limit of the range of tree-valued branching random walks in random environmen

We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton–Watson (GW) tree with offspring distribution $\nu$. The transition probabilities of the BRW are those of a critical biased random walk on $\bT$: namely, the probability to move from $x$ to one of its $k_x$ children is $1/(\mathtt{m}_\nu+k_x)$ and the probability to move from $x$ to the direct parent of $x$ is $\mathtt{m}_\nu/(\mathtt{m}_\nu+k_x)$. Here $\ttm_\nu$ stands for the mean of $\nu$. The BRW is indexed by a critical GW tree conditioned to have $n$ {vertices} and whose offspring distribution is in the domain of attraction of an $\alpha$-stable law with $\alpha \ino (1, 2]$. We denote by $\cR_n$ the range of the BRW, i.e., ~the set of all sites in $\bT$ visited by the BRW. Under a moment assumption for $\nu$, we prove that if we view $\cR_n$ as a random subtree of $\bT$ equipped with its graph distance $d_{\mathtt{gr}}$ and with its occupation measure $\ttm^{_{(n)}}_{{\mathtt{occ}}}$ then there exists a scaling sequence $s_n \! \to \! \infty$ such that conditionally given the environment $\bT$, the measured metric space $(\cR_n, s_n^{-1}d_{\mathtt{gr}} , \frac{_1}{^n}\ttm^{_{(n)}}_{{\mathtt{occ}}} )$ weakly converges in the Gromov–Hausdorff–Prokhorov sense to a random measured compact real tree introduced by Curien, Le Gall & Miermont in \cite{CuLGMi13} called the Brownian cactus with $\alpha$-stable branching mechanism. This work extends in random environment the result from D., K., Lin & Torri \cite{DuKhLiTo22} which deals with the case where $\bT$ is a regular tree.
Read the full abstract

Number Theory

On the Sum of a Prime and a Number that is not Square-Free

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First, we prove the result holds unconditionally for every odd $n > 24$. Second, assuming the Generalised Riemann Hypothesis for Dirichlet $L$-functions, we prove the result holds for every $n > 24$. We also discuss the obstruction which prohibits us from proving the result unconditionally for every $n > 24$.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Functional Renormalization Group for a Rank-4 Renormalizable Tensorial Group Field Theory with Derivative Necklace Couplings

We apply the functional renormalization group to an Abelian Group Field Theory extended beyond the branched-polymer (melonic) sector by including interactions that are subdominant from a power-counting perspective but enhanced by derivative couplings. Focusing on a rank-4 model, we consider a class of non-melonic interactions with a necklace structure. Due to their index contraction pattern, their leading-order behavior is analogous to that of large-N random matrix models and is associated with a planar graph structure. Within this setting, we identify the emergence of a nontrivial ultraviolet fixed point, reminiscent of mechanisms previously observed in matrix models, and discuss its reliability within the present truncation. The robustness of this fixed point will be further investigated through modified Ward identities, following strategies previously developed in the melonic sector.
Read the full abstract

Probability

Large time behavior of critical marked Hawkes processes with heavy tailed marks and related branching particle systems

We study large time behavior of critical marked Hawkes processes and related branching particle systems. In case of marked Hawkes processes we assume that the kernel function has multiplicative form and the marks corresponding to the events are nonnegative and are assigned independently from a common distribution. This distribution is in the normal domain of attraction of a $(1+\beta)$-stable law with $0<\beta<1$. Moreover, we assume that the mean number of events triggered by a single event is equal to $1$ (criticality). We show that, as the time is speeded up, if $\beta$ is small enough then, the event counting process, appropriately normalized, converges to a spectrally positive $1/(1+\beta)$ stable Lévy process. The convergence holds in law in the Skorokhod space of càdlàg functions equipped with $M_1$ topology. We also study a borderline case. The present paper complements the results of [A.Talarczyk:“A generalized central limit theorem for critical marked Hawkes processes”, arXiv:2504.11612], where the same model was studied in case of “large” $\beta$. We employ techniques involving a branching representation of marked Hawkes processes. This approach allows to study more general branching processes with branching mechanism in the normal domain of attraction of $(1+\beta)$-stable law.
Read the full abstract

Information Theory

Reduced-Feedback Hybrid Precoding for Wideband mmWave MIMO-OFDM Systems via Hierarchical Interpolation

In this paper, we propose a feedback-efficient hybrid precoding framework for wideband millimeter-wave (mmWave) multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. To reduce the hardware cost of radio-frequency (RF) chains and the feedback burden associated with frequency-selective digital precoding, frequency-flat analog precoders and combiners are first constructed from the dominant angle-of-arrival (AoA) and angle-of-departure (AoD) directions associated with the strongest propagation paths. For digital precoding, a shared quantized codebook is designed using the Lloyd algorithm, and a binary-search-based hierarchical interpolation method is developed to identify codeword switching locations between adjacent pilot subcarriers. By avoiding exhaustive codeword comparisons over all intermediate subcarriers, the proposed method reduces online search complexity and enables compact digital-precoder feedback. For the considered system configuration, the proposed method achieves a worst-case feedback reduction of approximately 98.34% relative to full-grid per-subcarrier feedback. Simulation results further demonstrate competitive spectral efficiency and bit error rate (BER) performance, low computational cost, and robustness under imperfect effective channel state information (CSI).
Read the full abstract

All authors Po-Heng Chou, Jia-Qing Lin, Wei-Chen Lin, Wan-Jen Huang, Ronald Y. Chang

Information Theory

Capacity-Aware Multi-UE Handover Optimization for LEO Satellite Networks Using Dueling DDQN

Frequent handovers and finite satellite capacity make multi-user mobility management challenging in low Earth orbit (LEO) satellite networks. This paper develops a capacity-aware multi-user handover framework based on a double deep Q-network (DDQN) with a dueling architecture. Both training and evaluation employ sequential user equipment (UE) processing with shared satellite occupancy, while action masking excludes invisible or capacity-infeasible satellites. The state incorporates satellite visibility, achievable link quality, remaining capacity, previous association, short-term visibility, and time information. A fixed multi-criteria reward balances throughput, blocking, handover cost, connection persistence, and short-term visibility, while expert trajectories are used only for replay-buffer initialization. Simulations under different UE densities and satellite capacities show that the proposed framework maintains high average throughput per UE and low blocking rates with moderate handover frequency. Ablation results show that removing the remaining-capacity vector has only a limited effect on performance when sequential occupancy tracking and feasible-action masking are retained.
Read the full abstract

All authors Po-Heng Chou, Chiapin Wang, Chung-Chi Huang, Kuan-Hao Chen, Chien-Yu Chen

Information Theory

Cross-Domain Radiomap Prediction for Multi-Scatterer Environment: A Spherical-Wave-Based Approach

Radiomap prediction has found extensive applications in network planning and optimization. The radiomap is implicitly determined by electromagnetic (EM) wave propagation. The evolution of wireless communication toward higher frequency spectra has highlighted the effect of mesoscopic (i.e. wavelength-comparable scale) scatterers, which is negligible in the sub-6 GHz spectrum. To address this challenge, we develop a linear forward channel model to capture the propagation behavior in the multi-scatterer environment. The proposed model utilizes spherical-wave mode expansion to track the source radiation pattern, including scattering from a single scatterer and interactions among multiple scatterers. Both phenomena are represented as a superposition of spherical-wave modes, effectively capturing the multipath effect from a wave-based perspective. This forward model is then employed to formulate an inverse optimization problem, where the scattering responses and scatterer locations are jointly learned from sparse field measurements. Simulation results demonstrate that the proposed model accurately reconstructs and extrapolates the radiomap in both the spatial and the beam domain, further enables frequency-domain channel interpolation.
Read the full abstract

All authors Wenli Li, Bin Wang, Haiyan Fan, Yujie Zhang, Guangxu Zhu, Yi Zhang

Analysis of PDEs

Zero-viscosity limit of the chemotaxis-Navier-Stokes equations with the Navier-slip boundary condition

The interplay of chemotaxis and diffusion of nutrients or signaling chemicals in bacterial suspensions can produce a variety of structures with locally high concentrations of cells, including phyllotactic patterns, filaments, and concentrations in fabricated microstructures, which is described by the chemotaxis-Navier-Stokes flow by Tuval et al. in 2005. Dombrowski et al. also observed that Bacterial flow in a sessile drop related to those in the Boycott effect of sedimentation can carry bioconvective plumes, viewed from below through the bottom of a petri dish, and the horizontal "turbulence" white line near the top is the air-water-plastic contact line. It's interesting to verify these turbulent phenomena mathematically. For varying chemotactic and velocity viscosities, we derive the boundary layer equations of the chemotaxis-Navier-Stokes system rigorously in a two-dimensional half-space under the Navier-slip boundary condition and obtain the vanishing viscosity limit of the 2D chemotaxis-fluid coupled system in the anisotropic conormal Sobolev spaces.
Read the full abstract

Dynamical Systems

Modeling sequential cognitive states via population level cortical dynamics

In this work, we present a mathematical model for cyclic and sequential patterns of brain activity, combining heteroclinic dynamics with discrete neural-field models. We first show that spatial-discrete neural-field equations with biologically realistic equilibria cannot support heteroclinic cycles. On the other hand, heterocline dynamics often arise in Lotka-Volterra-type systems, but these equations do not directly correspond to neuronal processes. To address this, we use a version of the Universal Approximation Theorem to approximate any target dynamics by a neural network interpretable as a high-dimensional Amari-type neural-field system. When the target dynamics contains a heteroclinic cycle, the approximating vector field generates a periodic trajectory that closely follows the heteroclinic connection. As a case study, we consider the cognitive processes underlying focused-attention meditation. We show how the model reproduces sequential transitions among cognitive states and we conclude providing a neural interpretation of the approximating dynamics.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

ZNO: Stable Rational Neural Operators in the Z-Domain for Discrete-Time Dynamics

We introduce the Z-Domain Neural Operator (ZNO), a causal neural operator whose layers are stable low-rank multiple-input multiple-output (MIMO) rational filters parameterized directly in the $z$-plane. ZNO addresses a limitation of existing operator learning methods, many of which are primarily tailored for continuous-time problems, while a large class of system-identification problems is intrinsically discrete-time. The $z$-domain form expresses stability as a unit-disk pole constraint and makes learned discrete-time poles directly readable. The model combines low-rank channel mixing, smooth stable pole reparameterization, causal recurrence, and an optional short finite impulse response (FIR) branch in a single $z$-domain rational recurrent layer. Across controlled discrete system-identification experiments, ZNO's advantage is most evident when the target dynamics are stable rational systems with lightly damped poles near the unit circle. Under matched parameter budgets, ZNO is not uniformly dominant; however, with validation-selected configurations, the same architecture can achieve the lowest mean error across the controlled tasks. A five-bin difficulty sweep over near-unit-circle / long-memory dynamics shows that ZNO has the lowest mean error across memory regimes, from short (approximately 10 steps) to long (approximately 100-200 steps). On five public nonlinear system-identification benchmarks, ZNO is competitive with neural operator and state-space baselines, achieving the lowest mean error on benchmarks whose dynamics align with stable rational discrete-time filters, while classical or state-space baselines remain preferable on some systems. These results position ZNO as a strong model for stable rational discrete-time dynamics, especially in near-unit-circle and long-memory regimes, but not as a universal replacement for specialized system-identification methods.
Read the full abstract

Optimization and Control

Optimizing Travel Time and Regenerative Energy for Periodic Timetables

Regenerating braking energy is one major pathway to make rail traffic energy-efficient. It is therefore desirable to design timetables that exploit this feature. However, timetables that allow to regenerate energy are often bad for the passengers. We hence formulate and analyze a bicriteria optimization problem (PESP-Passenger-Energy) to find periodic railway timetables that maximize the regenerated energy in terms of the brake-traction overlap time and minimize the travel time of the passengers. Our model extends the Periodic Event Scheduling Problem (PESP) and offers a rich combinatorial theory. We investigate its computational complexity on one-station networks, building on matchings and Hamiltonian paths. Besides showing its NP-hardness even for a single objective, we identify several polynomial-time solvable special cases. Finally, we provide two case studies, underlining the practicability of our model, and analyzing the Pareto front.
Read the full abstract

All authors Sarah Roth, Sven Jäger, Niels Lindner, Anita Schöbel

Mathematical Physics

On the Ultraviolet Problem for the Ground State Energy of the Translation-Invariant Pauli–Fierz Model at Zero Total Momentum

We study the ground state energy of the Pauli–Fierz model in the absence of external potentials. We consider the fiber decomposition of the Pauli–Fierz operator with respect to the spectral values, $p$, of the total momentum operator and focus on the case $p = 0$. The corresponding variational problem is analyzed to estimate the dependence of the ground state energy on the ultraviolet cutoff $\Lambda$. We employ a Bogoliubov–Hartree–Fock approximation using pure, quasifree states generated by Bogolubov transformations (parametrized by a positive Hilbert–Schmidt operator $z$) and Weyl transformations (parametrized by a vector $\eta$) applied to the vacuum. We prove that the resulting energy functional is not a convex function of $\eta$ and $z$. We identify the non-convex term and remove it from the energy functional. The modified functional retains the full interaction term and is shown to be strictly convex. We study the ground state of the modified functional and prove the existence of a unique minimizer. Furthermore, we construct an explicit partial minimizer (with respect to $\eta$, for fixed $z$), which allows us to eliminate $z$ and reduce the minimization problem to a single variable, $\eta$. Finally, we estimate the minimum of the modified energy functional in terms of the ultraviolet cutoff $\Lambda$ and demonstrate that, up to a constant factor, it grows asymptotically as $\Lambda^{3/2}$, as $\Lambda \to \infty$.
Read the full abstract

Analysis of PDEs

Sharp regularity for a class of degenerate/singular fully nonlinear elliptic equations with Hamiltonian terms

We investigate the regularity of the viscosity solutions to a class of degenerate/singular fully nonlinear elliptic equations with Hamiltonian terms. To overcome the difficulty caused by the simultaneous presence of the general degenerate/singular gradient terms and Hamiltonian terms, we analyze the coupled interplay between the degeneracy/singularity law and the growth of Hamiltonian terms and establish lower regularity results. Finally, we obtain sharp interior $C^{1,\alpha}$ regularity estimates via a geometric tangential method.
Read the full abstract

All authors Wentao Huo, Xiaofeng Jin, Lingwei Ma, Zhenqiu Zhang

Logic · Cross-listed from cs.LO

Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV

In A Study of Spinoza's Ethics (1984, {\S}17), Jonathan Bennett argues that the demonstration of Proposition V of Spinoza's Ethica contains identifiable invalid moves and that, even granted those moves, "cannot yield more than the conclusion that two substances could not have all their attributes in common" – while Spinoza concludes that they cannot share any. Bennett doubts that any valid reconstruction is available from Spinoza's stated resources without importing further commitments. Michael Della Rocca (Spinoza, 2008, ch. 2) responds that the proposition can be derived if the Principle of Sufficient Reason (PSR) is committed substantively. The debate has remained at the level of prose argument for forty years. This paper provides the first machine-checked evidence in the debate. We formalise Ethica Pars I in Lean 4, encoding Bennett's reading of Spinoza's stated axioms as a typeclass and Della Rocca's substantive PSR as an extension class. The derivation attempt yields a partial result – substances sharing all attributes are identical – but cannot reach the full "sharing-any-attribute -> identity" content of Proposition V, mechanically tracking Bennett's own all-attributes ceiling. A four-element counter-model satisfying both axiom sets while falsifying Proposition V's content establishes the irreducibility against this specific augmentation. A second counter-model establishes the analogous result for axiom A15, a load-bearing universality clause for Spinoza's Proposition XIV. Bennett's diagnosis receives its first kernel-checked counter-model against the Della-Rocca PSR-substance reconstruction (the non-derivability claim itself a meta-logical consequence of kernel consistency); stronger PSR variants and the broader narrative claim against the full Section I + II + A1–A7 register remain open as future mechanical projects.
Read the full abstract

Optimization and Control

A Real-Time Scalable Heuristic DSS Framework for Capacity-Constrained Retail Allocation under Supply Chain Uncertainty

The rapid proliferation of omnichannel retail strategies has fundamentally transformed store replenishment operations in uncertain supply chain environments. With retail stores increasingly acting as hybrid fulfillment centers, pooled inventory allocation must absorb uncertain order realizations, constrained receiving capacities, dynamic vehicle limits, multi-tiered product priorities, and planner-controlled outbound warehouse preferences. This study frames this commercial reality as an extended constrained variant of the Multidimensional Knapsack Problem (MKP). Recognizing that exact optimization techniques such as Mixed-Integer Linear Programming (MILP) are computationally prohibitive in large-scale real-time settings, we propose a real-time scalable heuristic embedded in a computationally efficient Decision Support System (DSS) framework based on set-oriented cumulative filtering. The framework evaluates cumulative flow-through deductions, third-party logistics routing integrations, category-specific volume caps, warehouse activation filters, and user-defined warehouse priority ranks. An extensive case study within a large retail network covering 212,278 order records from June 2025 to April 2026 demonstrates the impact of the proposed methodology. Using January 2026 as the go-live cutoff, weighted ship-to-order ratio improved from 54.1% to 67.8%, weighted same-day coverage improved from 24.3% to 37.8%, and store-days with order volumes above store limits were reduced by 48.6%. These findings indicate that the proposed real-time scalable heuristic and computationally efficient DSS framework provide practical, uncertainty-aware allocation support for volatile retail supply chains.
Read the full abstract

Information Theory · Cross-listed from cs.CR

Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives

Local differential privacy (LDP) has emerged as a gold-standard framework for privacy-preserving data analysis. However, characterizing the optimal privacy-utility trade-off (PUT) and the corresponding optimal LDP channels remains largely fragmented, relying on problem-specific, case-by-case analyses. In this work, we develop a unified theoretical framework that systematically characterizes the optimal PUT and optimal LDP channels for general privacy-preserving statistical decision-making problems. We first identify key functional properties of Bayesian and minimax risks as functions of the LDP channel, including the data processing inequality (DPI), direct-sum quasi-convexity (or additivity), concavity, and symmetry invariance. Leveraging these properties, we reduce the optimization domain required to compute the optimal PUT. To this end, we reinterpret the existing result implying the one-to-one correspondence between maximal LDP channels under the Blackwell order and a finite-dimensional polytope, through an alternative convex geometric derivation. This result renders the optimal PUT computationally tractable via vertex enumeration or linear programming. Furthermore, when the underlying problem exhibits symmetries characterized by a transitive group action, we show that the optimal PUT can be computed by comparing finitely many values, rather than optimizing over a high dimensional polytope. Our framework applies broadly beyond risk minimization, encompassing the maximization of information-theoretic measures. We demonstrate the efficacy of our theoretical framework by recovering or strengthening several known results, and deriving exact analytic expressions for the optimal PUTs in specific tasks that were previously unaddressed.
Read the full abstract

Combinatorics

A Characterization for Spectral and Trace Positivity of Matrix Words

In this paper, we provide a complete structural characterization of which words in noncommuting matrix variables and their formal transposes universally evaluate to matrices with nonnegative eigenvalues or nonnegative trace, regardless of the dimension or entries of the substituted matrices. Crucially, we establish that in this pure monomial setting, both spectral and trace positivity exhibit an exact rigidity phenomenon analogous to Hermitian-square representations. This contrasts sharply with the broader polynomial setting, where tracial rigidity is known to fail even for approximation. Furthermore, we establish that this structural rigidity extends seamlessly to the complex and infinite-dimensional domains. We show that the exact same purely combinatorial conditions completely characterize matrix words evaluated over complex matrices, bounded operators on arbitrary Hilbert spaces, and positive tracial states on $C^*$-algebras and von Neumann algebras. As one application of our main theorems, we fully resolve open questions initially posed by Lieb and Pierce, and later conjectured by Hillar and Johnson, concerning the underlying algebraic structure of the summands in Bessis-Moussa-Villani (BMV) trace polynomials from quantum statistical mechanics. We achieve these results by establishing a surprising connection to graph theory, leading to a matrix analogue of the positive graph conjecture posed by Camarena, Csóka, Hubai, Lippner, and Lovász.
Read the full abstract

Information Theory · Cross-listed from eess.SP

The AECM Algorithm for Deterministic Maximum Likelihood Direction Finding in the Presence of Gaussian Mixture Noise

Gaussian mixture noise can model non-Gaussian noise and also be used when outliers are present in measurements. For deterministic maximum likelihood direction finding in Gaussian mixture noise, the Space-Alternating Generalized Expectation-maximization (SAGE) algorithm, an extension of the expectation-maximization algorithm, was applied and designed by Kozick and Sadler twenty odd years ago, which simultaneously updates DOA estimates at each iteration and cannot properly converge under unequal signal powers. In this paper, the Alternating Expectation-Conditional Maximization (AECM) algorithm, an extension of the SAGE algorithm, is applied and designed, which utilizes multiple less informative versions of the complete data and the golden section search method to update DOA estimates at each iteration sequentially (one by one). Theoretical analysis reveals that the AECM algorithm possesses nearly the same computational complexity of each iteration as the SAGE algorithm. However, simulation results prove that the AECM algorithm exhibits faster stable convergence and is more attractive in computation. Importantly, the AECM algorithm, unlike existing subspace based robust DOA estimation methods, can still be used when signals are coherent.
Read the full abstract