Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 27 March

Metric Geometry

Peel neighborhoods

We introduce the canonical, parameter-free, and efficiently computable notion of peel neighborhoods in a finite metric space of strict negative type. Using a soft threshold to upper bound their radius or cardinality allows peel neighborhoods to be computed at scale, enabling useful microscopic descriptions of geometry and topology. As an example of their utility, peel neighborhoods enable efficient and performant estimates of local dimension and detections of singularities in samples from stratified manifolds.
Read the full abstract

Numerical Analysis

Boundary neuron method for solving partial differential equations

We propose a boundary neuron method with random features (BNM-RF) for solving partial differential equations. The method approximates the unknown boundary function by a shallow network within the boundary integral formulation. With randomly sampled and fixed hidden parameters, the computation reduces to a linear least squares problem for the output coefficients, which avoids gradient based nonconvex optimization. This construction retains the dimensionality reduction of boundary integral equations and the linear solution structure of the random feature method. For elliptic problems, we establish convergence analysis by combining kernel-based method with random feature approximation, and obtain error bounds on both the boundary and the interior solution. Numerical experiments on Laplace and Helmholtz problems, including interior and exterior cases, show that the proposed method achieves competitive accuracy relative to the boundary element method and favorable performance relative to boundary integral neural networks in the tested settings with only few neurons. Overall, the proposed method provides a practical framework for combining boundary integral equations with neural network for problems on complex geometries and unbounded domains.
Read the full abstract

All authors Ye Lin, Wentao Liu, Young Ju Lee, Jiwei Jia

Information Theory

USAM: A Unified Safety-Age metric for Timeliness in Heterogeneous IoT Systems

Massive Internet-of-Things (IoT) deployments must simultaneously support monitoring, control, and safety-critical communication over shared wireless infrastructure. Classical timeliness metrics, such as Age of Information and its variants, quantify the freshness of received updates but do not account for deterministic safety timing requirements that arise in cyber-physical systems. Consequently, freshness-oriented metrics may indicate satisfactory performance even when worst-case timing guarantees required by functional safety standards are violated. This paper introduces the Unified Safety–Age Metric (USAM), a safety-aware timeliness metric that integrates information freshness, deadline reliability, and deterministic response-time feasibility into a single architecture-aware performance measure. We consider heterogeneous IoT traffic served by a gateway with intermittent receiver readiness and analyze system behavior in the ultra-sparse regime typical of massive machine-type communications. The analysis shows that, as device activity decreases, queueing delays become negligible and system timeliness becomes dominated by infrastructure readiness and deterministic response-time constraints. In this regime, feasibility is determined primarily by the receiver duty cycle rather than by average traffic load. Numerical results illustrate the safety-blindness of classical freshness metrics and demonstrate that USAM explicitly captures the feasibility boundary imposed by heterogeneous traffic requirements. The proposed framework provides a foundation for analyzing safety-aware communication architectures in large-scale IoT systems.
Read the full abstract

Analysis of PDEs · Cross-listed from physics.flu-dyn

Stability of nonlinear dissipative systems with applications in fluid dynamics

Nonlinear partial differential equations are central to physics, engineering, and finance. Except in a limited number of integrable cases, their solution generally requires numerical methods whose cost becomes prohibitive in high-dimensional regimes or at fine resolution. Nonlinear phenomena such as turbulence are notoriously difficult to predict because of their extreme sensitivity to small variations in initial conditions, except when certain stability conditions are fulfilled. Indeed, stability allows us to achieve reliable approximate dynamics, since it determines whether small perturbations remain bounded or are amplified, potentially leading to markedly different long-term behavior. Here, we investigate the stability of dissipative partial differential equations with second-order nonlinearities. By analyzing the time evolution of solution norms in Sobolev spaces, we establish a sufficient condition for stability that links the characteristics of the linear dissipative operator, the quadratic nonlinear term, and the external forcing. The resulting criterion is expressed as an explicit inequality that guarantees stability for a wide range of initial conditions. As an illustration, we apply the framework to fluid-dynamical models governed by nonlinear partial differential equations. In particular, for the Burgers equation, the condition admits a natural interpretation in terms of the Reynolds number, thereby directly linking the stability threshold to the competition between viscous dissipation and inertial advection. We further demonstrate the scope of the approach by extending the analysis to the KPP-Fisher and Kuramoto-Sivashinsky equations.
Read the full abstract

All authors Javier Gonzalez-Conde, Daniel Isla, Sergiy Zhuk, Mikel Sanz

Representation Theory

New directions in the study of prime ideals in rational, nilpotent Iwasawa algebras

Let G be a nilpotent p-valuable (compact p-adic Lie) group. There is an ongoing investigation into the prime ideals of its completed group algebra (Iwasawa algebra), and there remains an open conjecture that they can all be proved to have a canonical standard form. We very this conjecture for several new classes of nilpotent groups, including those corresponding to the positive subalgebra of almost all classical and exceptional types, curiously excluding those of type C.
Read the full abstract

Analysis of PDEs

Global well-posedness for nonlinear generalized Camassa-Holm equation

We establish local and global well-posedness for the Cauchy problem of a generalized Camassa-Holm equation where orders of the momentum and the nonlinearity can be arbitrarily high. More precisely, we consider the equation \begin{equation*} m_t + m_x u^p + b m u^{p-1}u_x = -(g(u))_x + (b+1)u^p u_x, \quad m = (1-\partial_x^2)^k u, \end{equation*} where $p \geq 1$, $k \geq 1$ are arbitrary, $b$ is a real parameter, and $g(u)$ is a smooth function. %The standard Camassa-Holm equation corresponds to $k=1$, $p=1$, $b=2$, and $g(u)=0$. The local well-posedness is shown by using Kato's semigroup approach, where we treat the nonlinearity directly using commutator estimates and the fractional Leibniz rule without having to transform it in any specific differential form. This well-posedness is obtained in the phase space $H^s$ for $s > 2(k-1) + 3/2$, which is consistent with the results for the classical Camassa-Holm equation. We also prove the global existence of solutions by obtaining conserved quantity and applying the same idea from our local theory.
Read the full abstract

Mathematical Physics

Noether symmetry groups, locally conserved integrals, and dynamical symmetries in classical mechanics

Several aspects of the connection between conserved integrals (invariants) and symmetries are illustrated within a hybrid Lagrangian-Hamiltonian framework for dynamical systems. Three examples are considered: a nonlinear oscillator with time-dependent frequency (one degree of freedom); geodesics of a spheroid (two degrees of freedom); Calogero-Moser-Sutherland system of interacting particles (three degrees of freedom). For each system, a local generalization of Liouville integrability is shown. Specifically, the variational point symmetries in a Lagrangian setting lead to corresponding locally conserved integrals which are found to commute in the Poisson bracket imported from the equivalent Hamiltonian setting. Action-angle variables are then introduced in the Lagrangian setting, which leads to explicit integration of the Euler-Lagrange equations of motion locally in time.
Read the full abstract

Optimization and Control

Optimal Parlay Wagering and Whitrow Asymptotics: A State-Price and Implicit-Cash Treatment

For independent multi-outcome events under multiplicative parlay pricing, we give a short exact proof of the optimal Kelly strategy using the implicit-cash viewpoint. The proof is entirely eventwise. One first solves each event in isolation. The full simultaneous optimizer over the entire menu of singles, doubles, triples, and higher parlays is then obtained by taking the outer product of the one-event Kelly strategies. Equivalently, the optimal terminal wealth factorizes across events. This yields an immediate active-leg criterion: a parlay is active if and only if each of its legs is active in the corresponding one-event problem. The result recovers, in a more transparent state-price form, the log-utility equivalence between simultaneous multibetting and sequential Kelly betting. We then study what is lost when one forbids parlays and allows only singles. In a low-edge regime and on a fixed active support, the exact parlay optimizer supplies the natural reference point. The singles-only problem is a first-order truncation of the factorized wealth formula. A perturbative expansion shows that the growth-rate loss from forbidding parlays is $\OO(\eps^4)$, while the optimal singles stakes deviate from the isolated one-event Kelly stakes only at cubic order. This yields a clean explanation of Whitrow's empirical near-proportionality phenomenon: the simultaneous singles-only optimizer is obtained from the isolated eventwise optimizer by an event-specific cubic shrinkage, so the portfolios agree through second order and differ only by a small blockwise drag.
Read the full abstract

Statistics Theory

Statistical inference for extremal directions in high-dimensional spaces

In multivariate extreme value statistics, the first step in understanding the dependence structure of extremes is identifying the directions in which they occur. The novelty of this paper is the analysis of high-dimensional extreme value models in which both the model dimension and the number of bias directions go to infinity as the number of observations tends to infinity; we estimate the number of extremal directions. To address the curse of dimensionality, we extend and investigate the information criteria (AIC, BICU, BICL, QAIC and MSEIC) from the fixed-dimensional case (Butsch and Fasen-Hartmann, 2025a; Meyer and Wintenberger, 2023), which employ the concept of sparse regular variation that is closely related to multivariate regular variation, for the estimation of the number of extremal directions. For all information criteria, we derive sufficient conditions for consistency. Unlike in the fixed-dimensional case, where only the Bayesian information criteria (BICU and BICL) and the QAIC are consistent, the AIC and MSEIC are also consistent in high dimensions under certain model assumptions. We compare the performance of the different information criteria in a simulation study that includes a detailed analysis of the model assumptions and the necessary and sufficient conditions for consistency.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Structure Constants from Q-Systems and Separation of Variables

We introduce a novel method to compute structure constants from Q-functions in the scalar sector of planar N=4 super Yang-Mills (SYM) and related theories. The method derives from operatorial as well as functional separation of variables, and the structure constants are expressed as determinants of matrices whose entries are integrals over products of Q-functions. In this framework, each operator is twisted by an external angle, mirroring the cusped Maldacena-Wilson loop. The structure constants of local single-trace operators in N=4 SYM are recovered in the untwisting limit, where we obtain a one-to-one correspondence between our key building blocks and those of the Hexagon formalism. Retaining appropriate twists, our structure constants also perfectly match those of the orbifold points of N=4 SYM. Our results thus far are valid at leading order in the weak-coupling expansion, but their formulation in terms of Q-functions provides a natural starting point for including loop corrections. Many of the methods we develop in this work apply more generally to the computation of correlation functions in integrable models.
Read the full abstract

All authors Till Bargheer, Carlos Bercini, Gabriel Lefundes, Paul Ryan

Logic

Ultrahomogeneity of monounary algebras

A structure is ultrahomogeneous if every isomorphism between finitely generated substructures can be extended to an automorphism of the structure. The aim of this paper is to provide an explicit description of ultrahomogeneous monounary algebras of arbitrary cardinalities. We also show that a monounary algebra is ultrahomogeneous if and only if it is 1-ultrahomogeneous. These results are then viewed in the context of a several related concepts, including $\omega$-categoricity, homomorphism-homogeneity, (partial-)homogeneity, and transitivity.
Read the full abstract

Information Theory

Function-Based Minimal Linear Codes over Galois Rings $\mathrm{GR}(p^{n}, \ell)$: Minimality Criteria and Infinite Constructions

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural characterization, we further generalize the function-based minimality criteria introduced by Wu et al. (Cryptogr. Commun. 14, 875-895, 2022) from the finite field setting to the framework of Galois rings. The transition from fields to rings introduces substantial algebraic challenges due to the presence of zero divisors and the richer module structure of $\mathrm{GR}(p^{n},\ell)$. By exploiting Frobenius duality and the chain structure of Galois rings, we derive refined necessary and sufficient conditions ensuring that linear codes arising from functions over $\mathrm{GR}(p^{n},\ell)$ are minimal. As an application of these criteria, we construct several infinite families of minimal linear codes over Galois rings, thereby significantly generalizing the constructions of Wu et al. to the ring setting. Our results provide a unified framework that connects minimality theory, module duality over Frobenius rings, and function-based code constructions.
Read the full abstract

All authors Biplab Chatterjee, Sihem Mesnager, Ratnesh Kumar Mishra, Makhan Maji, Kalyan Hansda

Mathematical Physics · Cross-listed from quant-ph

Rotating-Wave and Secular Approximations for Open Quantum Systems

We derive a nonperturbative bound on the distance between evolutions of open quantum systems described by time-dependent generators. We show how this result can be employed to provide an explicit upper bound on the error of the rotating-wave approximation in the presence of dissipation and decoherence. We apply the derived bound to the strong-coupling limit in open quantum systems and to the secular approximation used to obtain a master equation of the Gorini-Kossakowski-Lindblad-Sudarshan form from the Redfield master equation.
Read the full abstract

All authors Daniel Burgarth, Paolo Facchi, Giovanni Gramegna, Kazuya Yuasa

Analysis of PDEs

Geometrical bounds for the torsion and the first eigenvalue of the Laplacian with Robin boundary condition

In this paper, we deal with functionals involving the torsion and the first eigenvalue of the Laplacian with Robin boundary conditions (to which we refer as Robin Torsion and Robin Eigenvalue), with other geometrical quantities, in the class of convex sets. Firstly, we prove an upper bound for the Robin Torsion in terms of the $L^1$ and $L^2$ norms of the distance function from the boundary, which allows us to prove a generalization of the Makai inequality involving the Robin Torsion, the Lebeasgue measure, and the inradius of a convex set. Subsequently, we prove quantitative estimates for the Robin Makai functional and for the Robin Pólya functionals, which link the Lebesgue measure and the perimeter with the Robin Torsion and the Robin Eigenvalue respectively. In particular, we prove that the optimal values of all these shape functionals are achieved by slab domains.
Read the full abstract

Geometric Topology

Simon's knot genus problem and Lewin $3$-manifold groups

We provide a positive answer to an old problem of Jonathan K. Simon: if $K$ and $K'$ are two knots such that there is an epimorphism from the knot group of $K$ to the knot group of $K'$, then the genus of $K$ is greater than or equal to the genus of $K'$. This result follows from our proof of a conjecture of Friedl and Lück. Specifically, we show that any map between admissible $3$-manifolds that induces an epimorphism on the fundamental groups and an isomorphism on the rational homologies yields an inequality of Thurston norms. Under these conditions, we also establish new upper bounds on the number of faces of the Thurston norm ball of the target manifold. To resolve Friedl and Lück's conjecture, we prove that locally indicable $3$-manifold groups are Lewin groups, thereby confirming a conjecture of Jaikin-Zapirain within the class of $3$-manifold groups. As a further consequence of our methods, we show that the crossed product of a division ring and a torsion-free $3$-manifold group that is virtually free-by-cyclic is a pseudo-Sylvester domain.
Read the full abstract

Algebraic Geometry

A categorical Torelli theorem for quartic del Pezzo surfaces

We solve categorical Torelli problem for quartic del Pezzo surfaces. That is, we prove that a del Pezzo surface of degree $4$ can be canonically reconstructed from its Kuznetsov component, which is the orthogonal subcategory to the structure sheaf in the derived category of the surface. Our methods work in equivariant setting and over arbitrary perfect fields. Using recent theory of atomic semi-orthogonal decompositions arXiv:2512.05064, we conclude that two minimal quartic del Pezzo surfaces are birational if and only if they are isomorphic. We also verify that the Kuznetsov component of a minimal quartic del Pezzo surface is semi-orthogonally indecomposable, confirming a conjecture by Auel and Bernardara.
Read the full abstract

Commutative Algebra

Modules of logarithmic derivations in weighted projective spaces and applications to free divisors

We introduce a weighted version of the module of logarithmic derivations of a divisor in weighted projective space, and provide a generalization of Saito's criterion for freeness in terms of weighted multiple eigenschemes (wME-schemes). Freeness of the nonstandard Z-graded module allows one to consider big families of free divisors in affine and standard projective space, i.e. when the module of logarithmic derivations of the divisor is free over the respective coordinate rings. We present a method to identify and construct these new families of free divisors in affine and projective space in any dimension, and give numerous explicit examples.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

On merge-models

Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an “almost sparse” way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent example is given by twin-models, which are bounded twin-width tree-ordered weakly sparse representations of structures with bounded twin-width derived from contraction sequences. In this paper, we develop this perspective further. First, we show that twin-models can be chosen such that they preserve linear clique-width or clique-width up to a constant factor. Then, we introduce merge-models, a natural analog of twin-models for merge-width. Merge-models represent binary relational structures by tree-ordered weakly sparse structures. The original structures can then be recovered by a fixed first-order interpretation. A merge-model can be constructed from a merge sequence. Then, its radius-$r$ merge-width will be, up to a constant factor, bounded by the radius-$r$ width of the merge sequence from which it is derived. Finally, we show that twin-models arise naturally as special cases of merge-models, and that binary structures with bounded twin-width are exactly those having a loopless merge-model with bounded radius-$r_0$ merge-width (for some sufficiently large constant $r_0$).
Read the full abstract

All authors Hector Buffière, Yuquan Lin, Jaroslav Nešetřil, Patrice Ossona de Mendez, Sebastian Siebertz

Information Theory · Cross-listed from eess.SP

Beam-Coherence-Aware Two-Stage Digital Combining for mmWave MU-MIMO Systems

This paper considers a wideband millimeter-wave MIMO system with fully digital transceivers at both the base station and the user equipment (UE), focusing on mobile scenarios. To reduce the baseband processing burden at the UE, we propose a two-stage digital combining architecture, where the received signals are compressed from $K$ antennas to dimension $N_{\mathrm c}$ before baseband processing. The first-stage combining matrix exploits channel geometry and is updated on the beam-coherence timescale, which is longer than the channel coherence time, while the second stage is updated per channel coherence time. We develop a pilot-based channel estimation framework tailored to the proposed two-stage digital combining architecture, leveraging maximum likelihood estimation. Furthermore, we propose a time-domain method that exploits the finite delay spread to reconstruct the full channel from a reduced number of pilot subcarriers. Precoding and combining schemes are designed accordingly, and spectral efficiency expressions with imperfect channel state information are derived. Numerical results show that the proposed time-domain approach outperforms hybrid beamforming while reducing pilot overhead. We further demonstrate that the framework extends to multi-user MIMO and retains its performance advantages. These results highlight the potential of two-stage fully digital transceivers for future wideband systems.
Read the full abstract

All authors Yasaman Khorsandmanesh, Emil Bjornson, Joakim Jalden, Bengt Lindoff

Classical Analysis and ODEs

Local dyadic fractional Sobolev spaces: paraproducts, commutators, and the algebra property

We characterize the boundedness and compactness of dyadic paraproducts on local dyadic fractional Sobolev spaces, $H^s$. We apply this result to establish the algebra property for $H^s$ when $s \in (\frac{1}{2},1)$ and to deduce the boundedness and compactness of commutators with the Haar shift on $H^s$. Our conditions are stated in terms of new dyadic fractional $\text{BMO}^s$ and $\text{CMO}^s$ conditions involving the dyadic fractional Sobolev capacity, and our proof uses a new dyadic fractional version of the Carleson embedding theorem.
Read the full abstract

Optimization and Control

A Canceling Heuristic for the Directed Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is one of the classic and hard problems in combinatorial optimization. We develop a new heuristic that uses a connection between Minimum Cost Flow Problems and the TSP to improve on a given suboptimal tour, such as a local optimum found using a classic heuristic. Minimum Cost Flow Problems can be solved efficiently through linear programming or combinatorial algorithms based on cycle canceling. We investigate the potential of flow-canceling in the context of the TSP. Through a restriction of the search space to cycles and circulations that alternate between arcs in- and outside of the tour, practical results exhibit that only a low number of subtours is created, and a lightweight patching step suffices for a high success rate and gap closure towards an optimum.
Read the full abstract

Optimization and Control

Incomplete pairwise comparison matrices and their applications

Incomplete pairwise comparison matrices are increasingly employed to save resources and reduce cognitive load by collecting only a subset of all possible pairwise comparisons. We present their graph representation and some completion algorithms, including the incomplete eigenvector and incomplete logarithmic least squares methods, as well as a lexicographical minimisation of triad inconsistencies. The issue of ordinal violations is discussed for matrices generated by directed acyclic graphs and the best–worst method. We also show a reasonable approach to generalise the inconsistency threshold based on the dominant eigenvalue to the incomplete case, and state recent results on the optimal order of obtaining pairwise comparisons. The benefits of using incomplete pairwise comparisons are highlighted by several applications.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

The Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic Approaches

Buffer zones are essential in production systems to decouple sequential processes. In dense floor storage environments, such as space-constrained brownfield facilities, manual operation is increasingly challenged by severe labor shortages and rising operational costs. Automating these zones requires solving the Buffer Storage, Retrieval, and Reshuffling Problem (BSRRP). While previous work has addressed scenarios where the focus is limited to reshuffling and retrieving a fixed set of items, real-world manufacturing necessitates an adaptive approach that also incorporates arriving unit loads. This paper introduces the Multi-AMR BSRRP, coordinating a robot fleet to manage concurrent reshuffling, alongside time-windowed storage and retrieval tasks, within a shared floor area. We formulate a Binary Integer Programming (IP) model to obtain exact solutions for benchmarking purposes. As the problem is NP-hard, rendering exact methods computationally intractable for industrial scales, we propose a hierarchical heuristic. This approach decomposes the problem into an A* search for task-level sequence planning of unit load placements, and a Constraint Programming (CP) approach for multi-robot coordination and scheduling. Experiments demonstrate orders-of-magnitude computation time reductions compared to the exact formulation. These results confirm the heuristic's viability as responsive control logic for high-density production environments.
Read the full abstract

All authors Max Disselnmeyer, Thomas Bömer, Laura Dörr, Bastian Amberg, Anne Meyer

Dynamical Systems

Statistical warning indicators for abrupt transitions in dynamical systems with slow periodic forcing

There is growing interest in anticipating critical transitions in natural systems, often pursued through statistical detection of early warning signals associated with dynamical bifurcations. In stochastic dynamical systems, such signals commonly rely on manifestations of critical slowing down. However, we still need additional development for the underlying theory for critical transitions in non-autonomous systems. This extension is relevant for natural systems, whose behaviour often emerges from seasonal periodic forcing. In this study, we systematically investigate the feasibility of anticipating the termination of oscillatory behavior in a bistable system with slow periodic forcing. In this setting, existing approaches of estimating linear characteristics of the return map fail in practical scenarios due to the unfavourable time-scale separation. Instead, we propose two statistical indicators for the anticipation of critical transitions in the periodic behaviour: (i) conventional early warning indicators, such as increasing variance and autocorrelation, evaluated across system cycles, and (ii) indicators derived from the phase of the seasonal forcing. By statistically comparing their predictive performance, we find that phase-based indicators provide the strongest early warning capability. Our results offer guidance for the detection of critical transitions in periodically forced systems and, more broadly, systematically extend early-warning signs towards non-autonomous dynamical systems.
Read the full abstract

All authors Florian Suerhoff, Andreas Morr, Sebastian Bathiany, Niklas Boers, Christian Kuehn

Analysis of PDEs

Blowup analysis of a Camassa-Holm type equation with time-varying dissipation

This paper is concerned with the local well-posedness, wave breaking, blow-up rate for a Camassa-Holm type equation with time-dependent weak dissipation. Firstly, we obtain the local well-posedness of solutions by using Kato's theory. Secondly, by using energy estimates, characteristic methods, and comparison principles, we derive two blowup criteria involving both pointwise gradient conditions and mixed amplitude-gradient conditions, and prove the blowup rate is universally $-2$. Our results extend wave breaking analysis to physically relevant variable dissipation regimes.
Read the full abstract

Information Theory

Security-Spectral Efficiency Tradeoff in STAR-RIS RSMA: A Max-Min Fairness Framework

Simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) enable full-space coverage but also expose wireless transmissions to security from multiple spatial directions. This paper investigates a STAR-RIS-assisted secure RSMA system where both internal and external eavesdroppers may coexist in the transmission and reflection regions. In such a scenario, the RSMA common stream simultaneously serves legitimate users, impairs external eavesdroppers, and avoids assisting internal eavesdroppers, leading to a challenging trade-off between spectral efficiency and confidentiality. To address this issue, we formulate a max-min fairness problem under secrecy constraints and develop an iterative algorithm to jointly optimize transmit beamforming and STAR-RIS phase shifts. Simulation results demonstrate that the proposed scheme improves spectral efficiency while maintaining confidentiality.
Read the full abstract

All authors Huiyun Xia, Yijie Mao, Sai Xu, Shuai Han, Hongbo Zhu

History and Overview of Mathematics

Mathematical methods and human thought in the age of AI

Artificial intelligence (AI) is the name popularly given to a broad spectrum of computer tools designed to perform increasingly complex cognitive tasks, including many that used to solely be the province of humans. As these tools become exponentially sophisticated and pervasive, the justifications for their rapid development and integration into society are frequently called into question, particularly as they consume finite resources and pose existential risks to the livelihoods of those skilled individuals they appear to replace. In this paper, we consider the rapidly evolving impact of AI to the traditional questions of philosophy with an emphasis on its application in mathematics and on the broader real-world outcomes of its more general use. We assert that artificial intelligence is a natural evolution of human tools developed throughout history to facilitate the creation, organization, and dissemination of ideas, and argue that it is paramount that the development and application of AI remain fundamentally human-centered. With an eye toward innovating solutions to meet human needs, enhancing the human quality of life and expanding the capacity for human thought and understanding, we propose a pathway to integrating AI into our most challenging and intellectually rigorous fields to the benefit of all humankind.
Read the full abstract

Combinatorics

Monotone Property Thresholds

This paper was originally written by the authors circa 2005 but was never submitted for publication. The present version corrects minor errors, adds references to work published since the original draft, and includes a section discussing further research directions. The core framework – the property function $\psi_G$, the density function $\varphi^\psi_\mu$, and all threshold results – is unchanged from the original.
Read the full abstract

Numerical Analysis

Hyperelastic constitutive model discovery with differentiable finite elements and structure-preserving neural networks

The discovery of constitutive laws from experimentally accessible measurements is a central problem in nonlinear computational mechanics. Many data-driven constitutive identification approaches rely either on paired strain-stress data or on full-field displacement measurements, both of which are difficult to obtain in realistic three-dimensional settings. We present a differentiable finite element framework for the discovery of hyperelastic material laws from partial observations, including boundary-only displacement measurements and global reaction forces. The method embeds the nonlinear finite element equilibrium problem directly into the learning loop, so that candidate strain-energy densities are assessed through the deformation fields and reactions they induce. This formulation enforces mechanical equilibrium as a constraint and allows the loss function to be evaluated only at observed locations. To ensure physical admissibility and promote numerical solvability throughout training, the constitutive response is represented by Hyperelastic Neural Networks, a structure-preserving neural class that enforces residual energy and stress-free conditions, frame indifference, isotropic material symmetry, polyconvexity, coercivity, and controlled volumetric growth by construction. The resulting PDE-constrained learning problem is solved using a quasi-Newton strategy combined with continuation and solver-aware backtracking. Numerical experiments in two- and three-dimensional finite elasticity demonstrate accurate recovery of hyperelastic isotropic responses from boundary-only data, robustness to measurement noise, and generalization across geometries, loading conditions, and boundary conditions.
Read the full abstract

Numerical Analysis

A Theory of Relaxation-Based Algebraic Multigrid

Algebraic multigrid (AMG) methods derive their optimal efficiency from the interplay between a relaxation process and a corresponding coarse grid correction. In many standard formulations, relaxation and coarse-graining are analyzed and treated as largely separate of one another. Here we propose an alternative theoretical approach centered entirely on the relaxation process, which exposes its fundamental role in the coarse-graining of the fine-scale problem. By treating the relaxation of the error as a dynamical system and applying a dimensional-reduction procedure analogous to the Mori-Zwanzig-Nakajima formalism, we derive exact expressions for the coarse-level equations and the interpolation operations, as well as a natural way of computing complementary transfer operators. We illustrate the unifying nature of this framework by recovering several well-known results for general non-symmetric systems, including ideal and optimal restriction and interpolation, as well as the limiting case of exact elimination. We further emphasize the pivotal importance of compatible-relaxation and identify dynamical corrections that naturally arise in our theory, which have the potential to enhance the convergence, robustness, and adaptivity of future algebraic multigrid methods.
Read the full abstract