Commutative Algebra
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
We characterise Dedekind rings among not necessarily Noetherian domains by a property of their module homomorphisms. Our proof relies on a homological algebra argument.
Algebraic Geometry
Monge-Ampère measures on balanced polyhedral spaces
We study classes of convex functions on balanced polyhedral spaces and establish various structural properties, including a compactness theorem for polyhedrally plurisubharmonic functions. Using tropical intersection theory, we construct Monge–Ampère measures, first associated with piecewise affine functions, and then we extend it to polyhedrally plurisubharmonic functions. We investigate polyhedral Monge–Ampère equations on balanced polyhedral spaces via a variational approach, providing sufficient conditions for the existence of solutions as well as explicit counterexamples. Finally, we relate our framework to non-archimedean pluripotential theory and explore its connection with the non-archimedean Monge–Ampère equation.
Read the full abstract
Optimization and Control · Cross-listed from econ.TH
Optimal Savings under Transition Uncertainty and Learning Dynamics
This paper studies optimal consumption and saving decisions under uncertainty about the transition dynamics of the economic environment. We consider a general optimal savings problem in which the exogenous state governing discounting, capital returns, and nonfinancial income follows a Markov process with unknown transition probability, and agents update their beliefs over time through Bayesian learning. Despite the added endogenous state from belief updating, we establish the existence, uniqueness, and key structural properties of the optimal policy, including monotonicity and concavity. We also develop an efficient computational method and use it to study how transition uncertainty and learning interact with precautionary motives and wealth accumulation, highlighting a dynamic mechanism through which uncertainty about regime persistence shapes consumption dynamics and long-run household wealth.
Read the full abstract
Numerical Analysis
Structure-Preserving Generalized Manifold Galerkin Reduction for Port-Hamiltonian Systems
This paper considers structure-preserving model order reduction (MOR) techniques for port-Hamiltonian (pH) systems, which are typically derived from energy-based modeling. To keep favorable properties of \pH systems such as passivity in a reduced order model (ROM), we use structure-preserving methods in the reduction process. Although projection-based structure-preserving MOR methods for nonlinear pH systems based on nonlinear approximation ansatzes have recently been proposed, existing approaches typically rely on specific structures of the approximation map and the underlying pH system. To address this limitation, we propose a \MOR framework based on generalized manifold Galerkin (GMG) reduction. The resulting framework can employ general nonlinear approximation maps while preserving the pH structure. We establish sufficient conditions for structure preservation, show that the associated non-degeneracy conditions are generically satisfied. We further present linear and quadratic approximation maps within the proposed framework. Numerical examples for a linear and a nonlinear mass-spring-damper system show that the proposed \MOR methods have lower relative reduction error compared to existing methods.
Read the full abstract
K-Theory and Homology
Theorem of the heart for Weibel's homotopy $K$-theory
In this paper we prove the theorem of the heart for Weibel's homotopy $K$-theory $KH.$ Namely, if $\mathcal{C}$ is a small stable $\infty$-category with a bounded $t$-structure, then the realization functor $D^b(\mathcal{C}^{\heartsuit})\to \mathcal{C}$ induces an equivalence of spectra $KH(\mathcal{C}^{\heartsuit})\xrightarrow{\sim}KH(\mathcal{C}).$ In a certain sense this result is dual to the Dundas-Goodwillie-McCarthy theorem. We deduce the dévissage theorem for $KH$ of abelian categories, also on the level of spectra (in all degrees). More generally, we prove these results for dualizable categories with nice $t$-structures and for the so-called coherently assembled abelian categories. The proof is heavily based on another new result, which is a much stronger version of Barwick's theorem of the heart. Its special case states the following: if $\mathcal{C}$ is a small stable category with a bounded $t$-structure, such that for some $n\geq 1$ the realization functor induces isomorphisms on $\operatorname{Ext}^{\leq n}$ between the objects of $\mathcal{C}^{\heartsuit},$ then the map $K_j(\mathcal{C}^{\heartsuit})\to K_j(\mathcal{C})$ is an isomorphism for $j\geq -n-1,$ and a monomorphism for $j = -n-2.$ Moreover, we prove that these estimates are sharp, even for dg categories over a field. In particular the naive $K$-theoretic theorem of the heart fails for $K_{-3}.$
Read the full abstract
Mathematical Physics · Cross-listed from cs.LG
Group Entropies and Mirror Duality: A Class of Flexible Mirror Descent Updates for Machine Learning
We introduce a comprehensive theoretical and algorithmic framework that bridges formal group theory and group entropies with modern machine learning, paving the way for an infinite, flexible family of Mirror Descent (MD) optimization algorithms. Our approach exploits the rich structure of group entropies, which are generalized entropic functionals governed by group composition laws, encompassing and significantly extending all trace-form entropies such as the Shannon, Tsallis, and Kaniadakis families. By leveraging group-theoretical mirror maps (or link functions) in MD, expressed via multi-parametric generalized logarithms and their inverses (group exponentials), we achieve highly flexible and adaptable MD updates that can be tailored to diverse data geometries and statistical distributions. To this end, we introduce the notion of mirror duality, which allows us to seamlessly switch or interchange group-theoretical link functions with their inverses, subject to specific learning rate constraints. By tuning or learning the hyperparameters of the group logarithms enables us to adapt the model to the statistical properties of the training distribution, while simultaneously ensuring desirable convergence characteristics via fine-tuning. This generality not only provides greater flexibility and improved convergence properties, but also opens new perspectives for applications in machine learning and deep learning by expanding the design of regularizers and natural gradient algorithms. We extensively evaluate the validity, robustness, and performance of the proposed updates on large-scale, simplex-constrained quadratic programming problems.
Read the full abstract
Logic
On the Expressive Power of Inquisitive Team Logic and Inquisitive First-Order Logic
Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be expressively equivalent with first-order logic. In this article we show that, on the contrary, the expressive power of open formulas in this logic properly exceeds that of first-order logic. On the way to this result, we show that if inquisitive team logic is extended with the range-generating universal quantifier adopted in dependence logic, the resulting logic can express finiteness; as a consequence, this logic is not compact and has non-arithmetic complexity. We further extend our results to standard inquisitive first-order logic, showing that some sentences of this logic express non first-order properties of models, thus settling an open problem from the literature.
Read the full abstract
Information Theory
Coherence-Aware Over-the-Air Distributed Learning under Heterogeneous Link Impairments
Distributed machine learning (ML) over wireless networks hinges on accurate channel state information (CSI) and efficient exchange of high-dimensional model updates. These demands are governed by channel coherence time and bandwidth, which vary across devices (links) due to heterogeneous mobility and scattering, causing degraded downlink delivery and distorted uplink over-the-air (OTA) aggregation. We propose a coherence-aware federated learning (FL) framework that jointly addresses impairments on downlink and uplink with communication-efficient strategies. In the downlink, we employ product superposition to multiplex global model symbols for long-coherence (static) devices onto the pilot tones required by short-coherence (dynamic) devices for channel estimation, turning pilot overhead into payload while preserving estimation fidelity. In the proposed scheme, an orthogonal frequency-division multiplexing (OFDM) super-block is partitioned into sub-blocks aligned with the smallest coherence time and bandwidth, enabling consistent channel estimation and stabilizing OTA aggregation across heterogeneous devices. Partial model reception at dynamic devices is mitigated via previous local model filling (PLMF), which reuses prior updates. We establish convergence guarantees under heterogeneous link impairments, imperfect CSI, and aggregation noise. The proposed framework enables efficient scheduling under coherence heterogeneity; analysis and experiments demonstrate notable gains in communication efficiency, latency, and learning accuracy over conventional FL baselines.
Read the full abstract
Mathematical Physics
Low order maximally single-trace graphs as the first counterexamples to large N factorization in random tensors
We give the first and lowest order examples of 3-regular 3-edge-colored graphs that demonstrate the non-factorization of tensor model invariants in the large $N$ limit of Gaussian random tensors. The existence of such graphs has recently been proven on general grounds, but without providing explicit examples. Moreover, it was expected that such examples require graphs with a very large number of vertices. We show that the smallest such graphs have 16 vertices. The non-factorization for Gaussian random tensors is in stark contrast to the well-known large $N$ factorization for random matrices.
Read the full abstract
Classical Analysis and ODEs
Convolved Numbers of $k$-sections of the Fibonacci Sequence: Properties, Consequences
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences such as the Fibonacci sequence and its generalizations) are additionally used. Two such generalizations are convolved Fibonacci numbers $\{F_n^{(s)}\}_{n=1}^\infty$ and k-sections of the Fibonacci sequence $\{\Phi_{n,k}\}_{n=1}^\infty$ $( \Phi_{n,k}=F_{nk}/F_k).$ This article considers a further generalization of Fibonacci numbers, namely convolutions of k-sections of the Fibonacci sequence $\{\Phi_{n,k}^{(s)}\}_{n=1}^\infty$. These numbers are defined by the relations: $$ \Phi_{n,k}^{(1)}=\sum_{j=0}^{n-1}\Phi_{j+1,k}\Phi_{n-j,k\,},\qquad \Phi_{n,k}^{(s)}=\sum_{j=0}^{n-1}\Phi_{j+1,k}\Phi_{n-j,k}^{(s-1)}\,,\quad s=2,3,...$$Moreover, $\Phi_{n,1}=F_n, \Phi_{n,1}^{(s)}=F_n^{(s)}$. An explicit formula for the representation of convolutions of k-sections of the Fibonacci sequence and a Binet type formula is established:$$\Phi_{n,k}^{(s)}=5^{-s}(F_k)^{-2s-1}\sum_{j=0}^{s}(-1)^{(k-1)j}{n+2s\choose j}{n+s-1-j\choose n-1} F_{k(n+2s-2j)}.$$ Several consequences were also obtained for $F_n$ and $F_n^{(s)}$, based on the connection between the derivatives of Chebyshev polynomials of the second kind $U_n(z)$ and their derivatives, as well as the connection for convolutions of k-sections of the Fibonacci sequence with derivatives of Chebyshev polynomials of the second kind via Lucas numbers $L_k$. Note that the sequences $\{\Phi_{n,k}^{(s)}\}_{n=1}^\infty$ for $k=3,4,...$ and $s=1,2,..$ are not included in the OEIS encyclopedia.
Read the full abstract
Mathematical Physics
Observables in $\mathrm{U}(1)^n$ Chern-Simons theory
In this article, we will compute the expectation value of observables (which appear as Wilson loops) in $\mathrm{U}(1)^n$ Chern-Simons theory for closed oriented $3$-manifolds. We will show how the various topological sectors of the observable affect the expectation value and confirm that it is a topological invariant. We will also exhibit in this case as well a form of the CS duality introduced in previous works. Finally, to complete the treatment of this theory, we will compute its zero modes and the equations of motion.
Read the full abstract
Mathematical Physics · Cross-listed from gr-qc
Secondary gravitational waves against a strong gravitational wave in the Bianchi VI universe
A proper-time method for constructing models of dynamic gravitational-wave fields is presented. Using the proper-time method, analytical (not numerical) models of secondary gravitational waves are constructed as perturbative solutions of linearized field equations against the background of the exact wave solution of Einstein's equations for the vacuum in the Bianchi VI universe in a privileged wave coordinate system. Relations for the proper time of test particles against the background of a strong gravitational wave are used. The analytical form of the metric components for secondary gravitational waves is found from compatibility conditions for the field equations. From the field equations, an explicit form of ordinary differential equations and their solutions is obtained for functions included in small corrections to the metric for secondary gravitational waves. It is shown that there exists a continuum of gravitational wave parameters for which the perturbative solutions are stable.
Read the full abstract
Differential Geometry
Mass and rigidity in almost Kähler geometry
We derive an explicit formula for the ADM mass of asymptotically locally Euclidean (ALE) almost Kähler manifolds. The formula expresses the mass in terms of the total Hermitian scalar curvature and topological data associated with the underlying almost complex structure, extending a result of Hein and LeBrun in the Kähler ALE case. Our approach is based on a spin$^\mathbb {C}$ adaptation of Witten's proof of the positive mass conjecture in the spin case and is therefore distinct from previous complex-geometric methods. In dimension $4$, we prove a positive mass theorem and a Penrose-type inequality for asymptotically Euclidean (AE) almost Kähler manifolds. We also study rigidity phenomena of almost Kähler ALE manifolds. We prove that an almost Kähler-Einstein ALE manifold with nonnegative scalar curvature and certain decay assumptions is necessarily Kähler-Einstein. In particular, any four dimensional Ricci-flat almost Kähler manifold with maximal volume growth and curvature in $L^2$ is Kähler, yielding new evidence towards the Bando–Kasue–Nakajima conjecture. We also discuss analogous rigidity results for asymptotically locally flat (ALF) manifolds.
Read the full abstract
Number Theory
Congruences between Klingen-Eisenstein series and cusp forms on $\mathrm{U}_{n,n}$
In this paper, we study congruences of Hecke eigenvalues between Hermitian Klingen-Eisenstein series and cusp forms on the unitary group $\mathrm{U}_{n,n}$ defined over the rational number field $\mathbb{Q}$. We also prove the rationality of the space of Hermitian automorphic forms and the integrality of their Hecke eigenvalues.
Read the full abstract
Group Theory · Cross-listed from cs.FL
Context-Free Trees
Muller and Schupp introduced the concept of context-free graphs (originating from Cayley graphs of context-free groups). These graphs are always tree-like (i.e. quasi-isometric to a tree) and in this paper we investigate the subclass of bona fide context-free trees. We show that they have a finite-state description using multi-edge NFAs and that this specializes to certain partial DFAs in the case of deterministic graphs. We investigate this form of encoding algorithmically and show that the isomorphism problem for deterministic context-free trees is NL-complete in the rooted and the non-rooted case.
Read the full abstract
Analysis of PDEs
On the concatenability of solutions of partial differential equations
Let ${\mathcal{D}}'({\mathbb{R}}^d)$ denote the space of distributions on ${\mathbb{R}}^d$. For a linear partial different equation $p(\frac{\partial}{\partial x_1},\cdots, \frac{\partial}{\partial x_d}, \frac{\partial}{\partial t}) u=0$ (briefly $D_pu=0$) corresponding to a polynomial $p\in \mathbb{C}[\xi_1,\cdots, \xi_d,\tau]$, let $S_p:=\{u\in C(\mathbb{R}, {\mathcal{D}}'({\mathbb{R}}^d)):D_pu=0\}$. The set $S_p$ has the `concatenability property' if whenever $u_1,u_2\in S_p\cap C^1(\mathbb{R}, {\mathcal{D}}'({\mathbb{R}}^d))$ are such that $u_1(0)=u_2(0)$, their concatenation $u_1\& u_2$ (defined to be $u_1(t)$ for $t\le 0$, and $u_2(t)$ for $t\ge 0$) belongs to $S_p$. It is shown that for $p=a_0+a_1\tau+\cdots+a_{d}\tau^{d}\in \mathbb{C}[\xi_1,\cdots, \xi_d][\tau]$, where $a_0,\cdots, a_{d}\in \mathbb{C}[\xi_1,\cdots, \xi_d]$ and $d\in \mathbb{N}$, $S_p$ has the concatenation property if and only if $d=1$.
Read the full abstract
Probability
Asymptotic formulas for products of Poisson distributions
In this paper, we study the asymptotic behaviour of the product tail probability $ \mathbb{P}(\xi_1\cdots\xi_N \geqslant n), $ where $\{\xi_1,\ldots,\xi_N\}$ is a finite collection of independent Poisson random variables with positive parameters $\lambda_1,\ldots,\lambda_N$. We derive a refined Laplace-type asymptotic formula for the tail probability, based on Stirling's logarithmic approximation, a constrained saddle-point method, the Lambert function, and a careful evaluation of the constrained Gaussian prefactor. This yields an explicit approximation with an $O(\log n)$ remainder term in the exponent.
Read the full abstract
Geometric Topology
The $n$-adjacency graph for knots
A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors define a new graph $\Gamma_n$ to represent $n$-adjacency relationships between knots. We prove several results about this new object.
Read the full abstract
Information Theory
Pinching Antennas-Assisted Low-Latency Federated Learning Over Multi-User Wireless Networks
Federated learning (FL) over wireless networks is fundamentally constrained by unreliable communication links, particularly when uplink channels suffer from blockage, fading, or weak line-of-sight (LoS) conditions. Pinching-antenna systems (PASSs) offer a new physical-layer capability to dynamically reposition radiating points along a dielectric waveguide, enabling controllable LoS connectivity and significantly improved channel quality. This paper develops FedPASS, a novel framework for low-latency wireless FL assisted by PASS. We formulate a multi-objective optimization problem that jointly minimizes the end-to-end round latency and an upper bound on the FL optimality gap. The resulting formulation is a mixed-integer nonlinear program subject to practical constraints on scheduling, transmit power, local CPU frequency, and PA placement. To address the resulting computational challenges, we develop a two-tier iterative algorithm: an outer loop that updates scheduling, communication time allocation, and power control via block coordinate descent, and an inner loop that optimizes PA locations using a Gauss-Seidel-based coordinate update with grid search under spacing constraints. Numerical results on MNIST and CIFAR-10 demonstrate that FedPASS achieves accuracy comparable to idealized FL baselines while drastically reducing the total training latency compared to conventional wireless FL.
Read the full abstract
General Mathematics
Informational Cardinality: A Unifying Framework for Set Theory, Fractal Geometry, and Analytic Number Theory
This paper investigates a class of deterministic fractals whose construction is governed by arithmetic sequences. We introduce the essential fractal prime set P_{ess} , a variant of the Cantor set constructed using the sequence of prime numbers modulo 4. We compute its Hausdorff dimension, \dim_H(P_{ess}) , and analyze its geometric complexity. In contrast to the classical middle-third Cantor set C_{1/3} , we demonstrate that while both sets are uncountable and share the same cardinality, their differing fractal dimensions (dim_H(C_{1/3}) versus the computed dimension of P_{ess}) reflect a fundamental difference in their geometric complexity. Furthermore, we propose a potential connection between the density of this prime-driven fractal and the distribution of zeros of the Riemann zeta function, formalized through the construction of a fractal zero set Z_F . This framework provides a novel geometric perspective on analytic number theory, illustrating how the fine-scale structure of primes can be encoded in deterministic fractal geometries.
Read the full abstract
Combinatorics
A characterization of interval nest digraphs
A digraph consisting of a set of vertices $V$ and a set of arcs $E$ is called an interval digraph if there exists a family of closed intervals $\{I_u,J_u\}_{u \in V}$ such that $uv$ is an arc if and only if the intersection of $I_u$ and $J_v$ is non-empty. Interval digraphs naturally generalize interval graphs, by extending the classical interval intersection model to directed graphs. Several subclasses of interval digraphs have been studied in the literature-such as balanced, chronological and catch interval digraphs-each characterized by admitting interval representations that satisfy specific restrictions. Among these, interval nest digraphs are the ones that admit an interval representation in which $J_u$ is contained in $I_u$ for all vertices $u$ of $V$. In this work, we provide a complete characterization of interval nest digraphs in terms of vertex linear orderings with forbidden patterns, which we call nest orderings. This result completes the picture of vertex-ordering characterizations among the main subclasses of interval digraphs.
Read the full abstract
Probability
On the excision of Brownian bridge paths
Path transformations are fundamental to the study of Brownian motion and related stochastic processes, offering elegant constructions of the Brownian bridge, meander, and excursion. Central to this theory is the well-established link between Brownian motion and the $3$-dimensional Bessel process ${\rm BES}(3)$. This paper is specifically motivated by Pitman and Yor (2003), who showed that a ${\rm BES}(3)$ process can be constructed by excising the excursions of a Brownian path below its past maximum that reach zero and concatenating the remaining excursions. Our main result shows that a similar excision procedure, when applied to a Brownian bridge, can be related to a $3$-dimensional Bessel bridge.
Read the full abstract
Probability
Right-tail asymptotics for products of independent normal random variables
Let $X_1,\dots,X_n$ be independent normal random variables with $X_i\sim N(\mu_i,\sigma_i^2)$, and set $Z=\prod_{i=1}^n X_i$. We derive asymptotic approximations for the right tail probability $\mathbb{P}(Z>x)$ as $x\to\infty$. When at least one mean is nonzero, the asymptotic formula remains explicit and involves a finite multiplicative factor arising from admissible sign patterns (reflecting the different ways the product can be positive); it includes an explicit first relative correction term of order $x^{-1/n}$, with remaining relative error $O(x^{-2/n})$. The proof uses a boundary saddle-point/Laplace method: first a multidimensional Laplace approximation near the boundary saddle, then a one-dimensional endpoint Laplace approximation.
Read the full abstract
Number Theory
An archimedean approach to singular moduli on Shimura curves
We give a new proof of a recent generalization to Shimura curve of genus 0 of the work of Gross and Zagier in `On singular moduli'. This generalization was conjectured by Giampietro and Darmon and proved by Daas by using $p$-adic $\Theta$-functions as an analogue of the $j$-invariant. Instead of working $p$-adically, we prove this result by evaluating Green's function at CM points on the Shimura curve. Our strategy is inspired by the analytic proof of Gross–Zagier. We put a special emphasis on both the similarities and the differences with the $p$-adic proof.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding
Recent work has noted that a space-sharing argument proves the tightness of the entropic quantum Singleton bounds, which was left open in the literature for various settings involving only-quantum messages, only-classical messages, or both classical and quantum messages. Focusing on the setting of entanglement-assisted classical coding (EACC), in this letter we first elaborate upon the space-sharing argument and the tight Singleton bound for this setting, and then establish a new tight entropic Singleton bound for EACC codes with entanglement assistance distributed across a subset of encoders when only local quantum operations are allowed at each encoder.
Read the full abstract
Complex Variables
Two-Variable Compressions of Shifts, Toeplitz Operators, and Numerical Ranges
This paper studies two-variable compressions of shifts associated to rational inner functions on the bidisk; these generalize the classical compressions of the shift associated to finite Blasckhe products and are unitarily equivalent to one-variable, matrix-valued Toeplitz operators. This paper proves that a rational inner function is almost completely determined by these Toeplitz operator symbols but provides examples showing that (unlike in the one-variable case) rational inner functions are not determined by the numerical ranges of their compressed shifts. This paper also investigates related questions including methods of constructing these compressed-shift Toeplitz operators and when the associated numerical ranges are open and closed.
Read the full abstract
Information Theory
Fusion of Monostatic and Bistatic Sensing for ISAC-Enabled Low-Altitude Environment Mapping
Driven by the rapid growth of the low-altitude economy, integrated sensing and communication (ISAC) technologies are essential to meet the stringent demands for reliable connectivity and situational awareness. Within this context, multipath-based simultaneous localization and mapping has emerged as a promising approach by leveraging radio frequency (RF) multipath to reconstruct environment maps alongside agent localization. Nevertheless, existing studies largely confine themselves to bistatic non-line-of-sight links and assume purely specular reflections from smooth surfaces, overlooking the monostatic sensing capability inherent in ISAC systems and the diffuse scattering effects induced by non-ideal outdoor building facades. To address these limitations, this paper presents the first Bayesian multipath-based environment mapping framework for ISAC that integrates monostatic and bistatic measurements under non-ideal surface propagation. We establish geometric relationships linking both sensing modes to a common reflective surface, enabling their association with the same physical feature for data-level fusion. Building on this formulation, we design two complementary Bayesian frameworks with corresponding factor-graph representations, allowing flexible adaptation to different scene requirements. The effectiveness of the proposed approach is validated through synthetic RF data, demonstrating that the fusion of monostatic and bistatic links consistently yields environment maps with higher accuracy, greater robustness and faster convergence than single-link baselines.
Read the full abstract
Spectral Theory
Resonance near a doubly degenerate embedded eigenvalue
This paper extends the study of resonance phenomenon initiated by the authors in~\cite{LS} to the case of doubly degenerate embedded eigenvalues (i.e. eigenvalue of multiplicity two). A fundamentally new concept is introduced to resolve the difficulties that arise in this study, beyond the methods of \cite{LS}. We apply a differential topological technique, namely the Morse Lemma, to study the present case. This allows us to understand rank-two self-adjoint perturbations of the Laplacian on $L^{2}(\mathbb{R}^{3})$, and along with methods of \cite{LS}, we obtain asymptotic results for the spectral density near a doubly degenerate embedded eigenvalue. Importantly, we are able to easily handle the threshold eigenvalue case. \par We also analyze important properties which explain such resonance phenomenon, viz., asymptotic behaviour of the sojourn time, scattering cross-section and time delay.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Generative Adversarial Regression (GAR): Learning Conditional Risk Scenarios
We propose Generative Adversarial Regression (GAR), a framework for learning conditional risk scenarios through generators aligned with downstream risk objectives. GAR builds on a regression characterization of conditional risk for elicitable functionals, including quantiles, expectiles, and jointly elicitable pairs. We extend this principle from point prediction to generative modeling by training generators whose policy-induced risk matches that of real data under the same context. To ensure robustness across all policies, GAR adopts a minimax formulation in which an adversarial policy identifies worst-case discrepancies in risk evaluation while the generator adapts to eliminate them. This structure preserves alignment with the risk functional across a broad class of policies rather than a fixed, pre-specified set. We illustrate GAR through a tail-risk instantiation based on jointly elicitable $(\mathrm{VaR}, \mathrm{ES})$ objectives. Experiments on S&P 500 data show that GAR produces scenarios that better preserve downstream risk than unconditional, econometric, and direct predictive baselines while remaining stable under adversarially selected policies.
Read the full abstract
Information Theory
Evaluation of EMF Exposure to Throughput Ratio for Sustainable 5G Networks
This paper builds stochastic geometry frameworks for analyzing downlink electromagnetic field (EMF) exposure and efficiency in 5G multi-connectivity networks, using 5G E-UTRAN New Radio - Dual Connectivity (EN-DC) configuration as a representative use case. The Poisson point process (PPP) and the beta-Ginibre point process (beta-GPP) are used to model the spatial distribution of base stations (BSs), where beta-GPP effectively captures the repulsion observed in real deployments. We derive tractable expressions for the distribution of EMF exposure and validate the framework through both Monte Carlo simulations and real BS data from Paris. In addition to conventional metrics, we introduce the Radiated Energy per Bit Transmitted in the Downlink (REBT-DL), which accounts for throughput and received power. Results show that network configuration significantly affect exposure and REBTDL, highlighting the relevance of energy-aware deployment strategies and confirming the proposed approach as a comprehensive tool for sustainable network evaluation. The results also confirm that e̱ta}-GPP provides a more accurate fit to practical deployments than PPP.