Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 16 March

Analysis of PDEs

Infinite-order multisoliton solutions to the Benjamin–Ono equation and soliton resolution

We construct a class of infinite-order multisoliton solutions of the Benjamin-Ono equation on the line, for which the initial data exhibits slow spatial decay. We prove that in the long-time asymptotics, such a solution decouples as an infinite superposition of independent soliton solutions with different velocities and no radiation term.
Read the full abstract

Information Theory · Cross-listed from physics.soc-ph

Estimating Absolute Web Crawl Coverage From Longitudinal Set Intersections

Web archives preserve portions of the web, but quantifying their completeness remains challenging. Prior approaches have estimated the coverage of a crawl by either comparing the outcomes of multiple crawlers, or by comparing the results of a single crawl to external ground truth datasets. We propose a method to estimate the absolute coverage of a crawl using only the archive's own longitudinal data, i.e., the data collected by multiple subsequent crawls. Our key insight is that coverage can be estimated from the empirical URL overlaps between subsequent crawls, which are in turn well described by a simple urn process. The parameters of the urn model can then be inferred from longitudinal crawl data using linear regression. Applied to our focused crawl configuration of the German Academic Web, with 15 semi-annual crawls between 2013-2021, we find a coverage of approximately 46 percent of the crawlable URL space for the stable crawl configuration regime. Our method is extremely simple, requires no external ground truth, and generalizes to any longitudinal focused crawl.
Read the full abstract

Probability

The Amplitude Dynamics of Impulsive Queues

In this paper, we analyze a multiserver Markovian queue with customer abandonment i.e. the Erlang-A queue uder a novel framework, i.e. the random impulsive differential equations (RIDEs). This framework captures systems that evolve continuously while experiencing sudden, discrete interventions. The combination of such framework with Erlang-A queue give rise to multiple real-life applications, such as improving efficiency at call centers and designing optimal timing to apply quantum error correction in trying to shun away from decoherence in quantum computing. We derive closed-form expressions for steady-state amplitude bounds and average queue lengths under impulse, and we identify the impulse timings that optimize system performance.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum-classical diagnostics and Bohmian inequivalence for higher time-derivative Hamiltonians

We develop a Bohmian analysis of a two-dimensional ghost Hamiltonian and its mapping to the degenerate Pais-Uhlenbeck model. Using Gaussian wavepackets, we derive the corresponding guidance equations, the centre and width evolution, and the quantum potential. We use these quantities to characterise bounded, quasi-semiclassical, spiral, and runaway regimes. The Bohmian trajectories provide a direct dynamical diagnostic of coherence, packet deformation, and quantum-classical separation. We then compare a bi-Hamiltonian pair consisting of the ghost Hamiltonian and a classically equivalent alternative formulation. While the two descriptions produce identical classical trajectories, they lead to different Bohmian trajectories and different quantum potentials evaluated along those trajectories. This demonstrates that classical equivalence need not extend to Bohmian quantum dynamics and identifies a concrete quantum ambiguity in the degenerate higher-derivative system.
Read the full abstract

Optimization and Control

Unimodal self-oscillations and their sign-symmetry for discrete-time relay feedback systems with dead zone

This paper characterizes self-oscillations in discrete-time linear time-invariant (LTI) relay feedback systems with nonnegative dead zone. Specifically, we aim to establish existence criteria for unimodal self-oscillations, defined as periodic solutions where the output exhibits a single-peaked period. Assuming that the linear part of system is stable, with a strictly monotonically decreasing impulse response on its infinite support, we propose a novel analytical framework based on the theory of total positivity to address this problem. We demonstrate that unimodal self-oscillations subject to mild variation-based constraints exist only if the number of positive and negative values of the system's loop gain coincides within a given strictly positive period, i.e., the self-oscillation is sign-symmetric. Building upon these findings, we derive conditions for the existence of such self-oscillations, establish tight bounds on their periods, and address the question of their uniqueness.
Read the full abstract

Rings and Algebras

Point varieties and point-exactness of Koszul algebras

In this paper, we introduce the point-exact condition for a Koszul algebra $A$, which is useful for characterizing the (G1) condition of $A$ in the sense of Mori. Let $B = A/(f)$, where $f \in A_2$ is a regular normal element. We show that if $A$ satisfies the (G1) condition and is point-exact up to degree $\ell \geq 2$, then $B$ also satisfies the (G1) condition and is point-exact up to degree $\ell$. Moreover, we show that skew polynomial algebras satisfy the point-exact condition.
Read the full abstract

Algebraic Topology · Cross-listed from stat.ML

Persistence Spheres: a Bi-continuous Linear Representation of Measures for Partial Optimal Transport

We improve and extend persistence spheres, introduced in~\cite{pegoraro2025persistence}. Persistence spheres map an integrable measure $\mu$ on the upper half-plane, including persistence diagrams (PDs) as counting measures, to a function $S(\mu)\in C(\mathbb{S}^2)$, and the map is stable with respect to 1-Wasserstein partial transport distance $\mathrm{POT}_1$. Moreover, to the best of our knowledge, persistence spheres are the first explicit representation used in topological machine learning for which continuity of the inverse on the image is established at every compactly supported target. Recent bounded-cardinality bi-Lipschitz embedding results in partial transport spaces, despite being powerful, are not given by the kind of explicit summary map considered here. Our construction is rooted in convex geometry: for positive measures, the defining ReLU integral is the support function of the lift zonoid. Building on~\cite{pegoraro2025persistence}, we refine the definition to better match the $\mathrm{POT}_1$ deletion mechanism, encoding partial transport via a signed diagonal augmentation. In particular, for integrable $\mu$, the uniform norm between $S(0)$ and $S(\mu)$ depends only on the persistence of $\mu$, without any need of ad-hoc re-weightings, reflecting optimal transport to the diagonal at persistence cost. This yields a parameter-free representation at the level of measures (up to numerical discretization), while accommodating future extensions where $\mu$ is a smoothed measure derived from PDs (e.g., persistence intensity functions~\citep{wu2024estimation}). Across clustering, regression, and classification tasks involving functional data, time series, graphs, meshes, and point clouds, the updated persistence spheres are competitive and often improve upon persistence images, persistence landscapes, persistence splines, and sliced Wasserstein kernel baselines.
Read the full abstract

Number Theory

Explicit formula for multi-indexed poly-Bernoulli numbers

The classical Bernoulli numbers $B_m$ can be expressed using Stirling numbers of the second kind, and M. Kaneko extended this framework by defining poly-Bernoulli numbers ${\mathbb B}_m^{(k)}$, for which explicit formulas using the Stirling numbers of the second kind and duality relations were obtained. Later, Kaneko and H. Tsumura introduced multi-indexed poly-Bernoulli numbers ${\mathbb B}_{m_1, \ldots, m_r}^{(k_1, \ldots, k_r)}$ using the multiple polylogarithm and reached their duality properties via an associated $\eta$-function. Explicit formulas for double-indexed poly-Bernoulli numbers ${\mathbb B}_{m_1, m_2}^{(k_1, k_2)}$ were obtained by Y. Baba, M. Nakasuji, and M. Sakata. In this article, we extend these results to general multi-indexed poly-Bernoulli numbers and use it to give an alternative proof of the duality of multi-indexed poly-Bernoulli numbers.
Read the full abstract

Numerical Analysis

FFT-accelerated computation of the Dirichlet-to-Neumann map for inhomogeneous exterior Helmholtz problems using the method of fundamental solutions

An efficient numerical method is proposed for computing the Dirichlet-to-Neumann (DtN) map associated with the exterior Dirichlet problem for the two-dimensional Helmholtz equation with an inhomogeneous term. The solution in the subdomain exterior to a circular artificial boundary is approximated by the method of fundamental solutions (MFS). When the source and collocation points are equally spaced on concentric circles, the coefficient matrices arising in the discretization become circulant, which enables the efficient evaluation of the discrete DtN map by the fast Fourier transform (FFT). By incorporating the transparent boundary condition (TBC) defined by the DtN map into a finite element formulation, the original exterior problem posed in an unbounded domain is reduced to an equivalent problem in a bounded computational domain, which can then be solved by the finite element method (FEM). Numerical examples show that the proposed MFS-based approach provides a highly accurate approximation of the DtN map, that the FFT-based algorithm enables the efficient computation of the resulting discrete DtN map, and that the FEM incorporating the TBC defined by the DtN map yields accurate solutions for exterior Helmholtz problems posed in unbounded domains with an inhomogeneous term.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Deep learning and the rate of approximation by flows

We investigate the dependence of the approximation capacity of deep residual networks on its depth in a continuous dynamical systems setting. This can be formulated as the general problem of quantifying the minimal time-horizon required to approximate a diffeomorphism by flows driven by a given family $\mathcal F$ of vector fields. We show that this minimal time can be identified as a geodesic distance on a sub-Finsler manifold of diffeomorphisms, where the local geometry is characterised by a variational principle involving $\mathcal F$. This connects the learning efficiency of target relationships to their compatibility with the learning architectural choice. Further, the results suggest that the key approximation mechanism in deep learning, namely the approximation of functions by composition or dynamics, differs in a fundamental way from linear approximation theory, where linear spaces and norm-based rate estimates are replaced by manifolds and geodesic distances.
Read the full abstract

All authors Jingpu Cheng, Qianxiao Li, Ting Lin, Zuowei Shen

Optimization and Control

Mitigating Renewable-Induced Risks for Green and Conventional Ammonia Producers through Coordinated Production and Futures Trading

Renewable power-to-ammonia (ReP2A), which uses hydrogen produced from renewable electricity as feedstock, is a promising pathway for decarbonizing the energy, transportation, and chemical sectors. However, variability in renewable generation causes fluctuations in hydrogen supply and ammonia production, leading to revenue instability for both ReP2A producers and conventional fossil-based gray ammonia (GA) producers in the market. Existing studies mainly rely on engineering measures, such as production scheduling, to manage this risk, but their effectiveness is constrained by physical system limits. To address this challenge, this paper proposes a financial instrument termed renewable ammonia futures and integrates it with production decisions to hedge ammonia output risk. Production and trading models are developed for both ReP2A and GA producers, with conditional value-at-risk (CVaR) used to represent risk preferences under uncertainty. A game-theoretic framework is established in which the two producers interact in coupled ammonia spot and futures markets, and a Nash bargaining mechanism coordinates their production and trading strategies. Case studies based on a real-world system show that introducing renewable ammonia futures increases the CVaR utilities of ReP2A and GA producers by 5.103% and 10.14%, respectively, improving profit stability under renewable uncertainty. Sensitivity analysis further confirms the effectiveness of the mechanism under different levels of renewable variability and capacity configurations.
Read the full abstract

Functional Analysis

Mixed Bourgain-Morrey spaces and their applications to boundedness of operators

We introduce the mixed Bourgain-Morrey spaces and obtain their preduals. The boundedness of Hardy-Littlewood maximal operator, iterated maximal operator, fractional integral operator, singular integral operator on these spaces is proved. In addition, we give a description of the dual of mixed Bourgain-Morrey spaces and conclude the reflexivity of these spaces.
Read the full abstract

Functional Analysis

The resolvent equations for the Harmonic and bi-Harmonic functional calculi in dimension five

The fine structures on the $S$-spectrum constitute a new research area that includes a class of functional calculi based on the $S$-spectrum and on integral transforms determined by the Fueter–Sce mapping theorem and the Cauchy formula for slice hyperholomorphic functions. This strategy, based on integral transforms, allows us to construct functional calculi that include harmonic and polyharmonic functional calculi. The resolvent operators in this setting do not arise directly from a Cauchy kernel, but rather from suitable manipulations of it. For this reason the corresponding resolvent equations differ substantially from those associated with the classical Cauchy kernel. In this paper, we investigate the harmonic and biharmonic resolvent equations in dimension five, as well as the corresponding product rules and Riesz projectors for these functional calculi.
Read the full abstract

Optimization and Control

A superposition approach for the ISS Lyapunov-Krasovskii theorem with pointwise dissipation

For nonlinear time-delay systems, we show that the existence of a Lyapunov-Krasovskii functional (LKF) with pointwise dissipation (i.e., dissipation in terms of the current solution norm) suffices for input-to-state stability, provided that uniform global stability can also be ensured using the same LKF. To this end, we employ elements of a recently developed stability theory in which the behavior of solutions is not assessed through the classical norm but rather through a specific LKF. As a consequence of our results, we obtain a strengthening and extension of the classical Lyapunov-Krasovskii theorem for undisturbed systems to systems with uniformly bounded disturbances. We discuss the advantages of our approach by means of an example.
Read the full abstract

All authors Andrii Mironchenko, Fabian Wirth, Antoine Chaillet, Lucas Brivadis

Analysis of PDEs

Pogorelov interior estimates for sum-of-Hessians equations

In this paper, we develop a new approach to sum-of-Hessians equations involving multiple $k$-Hessian operators of distinct orders. By exploiting the concavity of sums of Hessian operators, we derive Pogorelov estimates for the corresponding equations under the dynamic semi-convexity condition. Moreover, when the highest order is $n-1$ or $n$, we establish such estimates for admissible solutions without relying on this condition, and they are therefore optimal. As an application, when the right-hand side is identically $1$, we prove that every entire admissible solution in $\mathbb{R}^n$ with quadratic growth is necessarily a quadratic polynomial.
Read the full abstract

Optimization and Control · Cross-listed from cs.GT

Strategic Partitioning and Manipulability in Two-Round Elections

We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$, and voters select their preferred candidate from each. Provided there are no ties, the two respective winners advance to a second round, where voters choose between them according to their initial preference lists. We analyze this scenario using a probabilistic framework based on a spatial voting model with cyclically constructed preference lists and uniformly distributed ideal points. Our objective is to determine the optimal initial partition of $A$ and $B$ that maximizes a target candidate's probability of winning. We analytically evaluate this success probability and derive its asymptotic behavior as the number of candidates $n \to \infty$. A key finding is that the asymptotically optimal relative width of the main discrete cluster converges precisely to one-fifth of the total number of candidates. Finally, we provide computational results and confidence intervals derived from simulation algorithms that validate the analytical framework. Specifically, we demonstrate that the probability of the universal victory event rapidly approaches $1$ as the electorate size increases.
Read the full abstract

Optimization and Control

A Consensus-based optimization algorithm using Gaussian processes for global optimization problems in Sobolev spaces

We propose an algorithm to approximate solutions of global optimization problems in Sobolev spaces that follows the spirit of Consensus-based algorithms in finite dimensions. The main ingredient are Gaussian processes. In fact, we exploit their rich toolbox in order to draw sample functions from Sobolev spaces that satisfy initial values, boundary conditions or state constraints. Well-known marginalization properties of Gaussian processes help us to discretize the algorithm, that is stated in infinite dimensions, appropriately. We illustrate the performance of the algorithm and show its feasibility for nonlinear boundary value problems with state constraints as well as nonlinear optimal control problems constrained by a system of ordinary differential equations with several numerical results.
Read the full abstract

Algebraic Geometry · Cross-listed from hep-th

Galois Covers of Calabi-Yau Quivers and BPS State Counting

BPS quivers are central to our understanding of BPS states in 4d $\mathcal{N}=2$ supersymmetric field theories and of D-branes at Calabi-Yau threefold singularities. The two subjects are deeply interrelated through geometric engineering in Type II string theory, where a CY$_3$ quiver, also known as a 5d BPS quiver, describes fractional branes at a threefold singularity ${\bf X}$. We study the Galois cover ${\skew{2}\tilde Q}\rightarrow Q$ of any BPS quiver $Q$ by a finite abelian group $\mathbb{G}$, leading to a covering quiver ${\skew{2}\tilde Q}$. The Galois cover is determined by a $\mathbb{G}$-grading of the arrows of the quiver $Q$, which can be understood as an orbifolding procedure. In particular, if $Q$ is a CY$_3$ quiver for ${\bf X}$, then the Galois cover $\skew{2}\tilde Q$ is the CY$_3$ quiver for the orbifold singularity ${\bf X}/\mathbb{G}$. We explore such Galois covering procedures in the language of supersymmetric quiver quantum mechanics, in terms of fixed loci under $\mathbb{G}$ actions on moduli spaces of quiver representations, and in terms of homomorphisms between the Kontsevich-Soibelman algebras of $Q$ and ${\skew{2}\tilde Q}$. Our main result is an explicit covering formula for the BPS invariants of 4d $\mathcal{N}=2$ field theories, wherein the rational BPS invariant $\bar{\Omega}^Q(\gamma)$ of $Q$ is expressed as a sum of BPS invariants of $\skew{2}\tilde Q$. We derive this formula in various special cases, which include the case when $\gamma$ is a primitive charge vector, the case of general charge vectors for quivers without loops, and the case of CY$_3$ quivers for some simple geometries such as the conifold or local del Pezzo surfaces. The general formula is presented as a conjecture that can be verified in many examples.
Read the full abstract

All authors Johannes Aspman, Cyril Closset, Elias Furrer, Jan Manschot

Numerical Analysis

A scaled TW-PINN: A physics-informed neural network for traveling wave solutions of reaction-diffusion equations with general coefficients

We propose an efficient and generalizable physics-informed neural network (PINN) framework for computing traveling wave solutions of $n$-dimensional reaction-diffusion equations with various reaction and diffusion coefficients. By applying a scaling transformation with the traveling wave form, the original problem is reduced to a one-dimensional scaled reaction-diffusion equation with unit reaction and diffusion coefficients. This reduction leads to the proposed framework, termed scaled TW-PINN, in which a single PINN solver trained on the scaled equation is reused for different coefficient choices and spatial dimensions. We also prove a universal approximation property of the proposed PINN solver for traveling wave solutions. Numerical experiments in one and two dimensions, together with a comparison to the existing wave-PINN method, demonstrate the accuracy, flexibility, and superior performance of scaled TW-PINN. Finally, we explore an extension of the framework to the Fisher's equation with general initial conditions.
Read the full abstract

All authors Seungwan Han, Kwanghyuk Park, Jiaxi Gu, Jae-Hun Jung

Classical Analysis and ODEs

Lebesgue measure of distance sets with regular pins and multi-scale Mizohata-Takeuchi-type estimates

Suppose $E, F$ are Borel sets in the plane, $\dim_{\mathcal{H}} E>1$, $\dim_{\mathcal{H}} E+\dim_{\mathcal{H}} F>2$, and $F$ has equal Hausdorff and packing dimension. We prove that there exists $y\in F$ such that the pinned distance set $$\Delta_y(E):=\{|x-y|:x\in E\}$$ has positive Lebesgue measure. In particular, it settles the regular case of the distance set problem in the plane. The main ingredients of the proof consist of a multi-scale Good-Bad decomposition and a multi-scale Mizohata-Takeuchi-type estimate with arbitrary small power-loss.
Read the full abstract

2603.15328 · 16 Mar · 23 pages. V3: A proof of Lemma 3.1 is added for completeness, and a typo on $\omega_Q(T)$ in Proposition 1.2 is corrected. V2: Theorem 1.2 is relabelled to Proposition 1.2, and the technique is now named "L2 ball inflation"

Classical Analysis and ODEs

On subadditive quasi-arithmetic means

Let $f\colon \mathbb{R}_+\to\mathbb{R}$ be a continuous and strictly monotone function. In the main result of this paper, we show that, for a fixed $n\geq 2$, the $n$-variable mean $\mathscr{A}_f \colon \mathbb{R}_+^n \to \mathbb{R}_+$ defined by $$ \mathscr{A}_f(x_1,\dots,x_n):=f^{-1} \bigg( \frac{f(x_1)+\cdots+f(x_n)}n \bigg) $$ is subadditive if and only if $f$ is differentiable with a continuously semi-differentiable and nonvanishing first derivative, and there exists an $\alpha\in[0,\infty]$ such that $f''_+:=(f')'_+$ is positive on $(0,\alpha)$ and $f''_+=0$ on $[\alpha,\infty)$, furthermore, $\frac{f'}{f''_+}$ is increasing and superadditive on $(0,\alpha)$.
Read the full abstract

Probability

Small-time heat decay for stable processes on fractal drums

In this paper, we study the spectral heat content for isotropic stable processes on fractal drums (namely, open sets with fractal boundaries). The spectral heat content for subordinate killed Brownian motions by stable subordinators was investigated in \cite{PX23}, and the present work serves as a natural extension of \cite{PX23} for the spectral heat content for stable processes. Under suitable geometric conditions on the underlying domains, we show that the decay rate of the spectral heat content for stable processes differs substantially from that for subordinate killed Brownian motions when $\alpha=d-\b$, where $\b$ is the interior Minkowski dimension of the boundary of the underlying open set.
Read the full abstract

Analysis of PDEs

Riesz transforms associated with the Grushin operator with drift

We consider the Grushin operator with drift which is symmetric with respect to a measure having exponential growth. For the corresponding Riesz transforms, we study strong-type $(p, p)$, $1 < p < \infty$, and weak-type $(1, 1)$ boundedness.

Group Theory

Classification of Artin groups admitting retractions onto their parabolic subgroups

We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral Artin groups that map one of the standard generators to a standard generator. As a consequence, we show that whenever an Artin group admits retractions to parabolic subgroups, it also admits ordinary ones - that is, retractions that send each standard generator either to a standard generator or to the identity.
Read the full abstract

All authors Bruno Aarón Cisneros de la Cruz, María Cumplido, Islam Foniqi, Luis Paris

Information Theory

Rotatable Antenna Assisted Mobile Edge Computing

This paper investigates a rotatable antenna (RA) assisted mobile edge computing (MEC) network, where multiple users offload their computation tasks to an edge server equipped with an RA array under a time-division multiple access protocol. To maximize the weighted sum computation rate, we formulate a joint optimization problem over the RA rotation angles, time-slot allocation, transmit power, and local CPU frequencies. Due to the non-convex nature of the formulated problem, a scenario-adaptive hybrid optimization algorithm is proposed. Specifically, for the dynamic rotating scenario, where RAs can flexibly reorient within each time slot, we derive closed-form optimal antenna pointing vectors to enable a low-complexity sequential solution. In contrast, for the static rotating scenario where RAs maintain a unified orientation, we develop an alternating optimization framework, where the non-convex RA rotation constraints are handled using successive convex approximation iteratively with the resource allocation. Simulation results demonstrate that the proposed RA assisted MEC network significantly outperforms conventional fixed-antenna MEC networks. Owing to the additional spatial degrees of freedom introduced by mechanical rotation, the flexibility of RAs effectively mitigates the severe beam misalignment inherent in fixed-antenna systems, particularly under high antenna directivity.
Read the full abstract

All authors Ji Wang, Hao Chen, Yixuan Li, Jun Zhang, Xingwang Li, Ming Zeng, Octavia A. Dobre

Probability

Normal approximation for the polynomial functionals of correlated random field sampling along random walk path in dimension $1+1$

Let $\xi$ be the stationary occupation field generated by a Poisson system of independent simple symmetric random walks on $\mathbb Z$ in space–time dimension $1+1$. For a finite set $A\subset\mathbb Z$, we consider the classical fixed-region observables $W_N(A)$, the cumulative occupation of $A$ up to time $N$, and $D_N(A)$, the number of distinct particles visiting $A$ up to time $N$. We prove quantitative central limit theorems for both observables, with Wasserstein rate of order $N^{-1/4}$. In addition, we introduce an independent nearest-neighbour random walk $S=(S_n,\,n\ge 0)$ on $\mathbb Z$ with non-zero drift and sample the field along this ballistic path. For a fixed polynomial observable $\varphi(x)=\sum_{j=0}^k \beta_j x^j, \beta_k\neq 0$, of degree $k\in \mathbb N$, we consider the partial sums $Y_{N,\varphi}=\sum_{n=1}^N \varphi(\xi(n,S_n)).$ We prove a Wasserstein bound of order $N^{-1/2}$ for the normal approximation of the standardized $Y_{N,\varphi}$. To the best of our knowledge, this is the first quantitative normal approximation result for polynomial functionals of the Poisson occupation field sampled along a random walk path. The drift induces an effective decorrelation of the sampled environment, leading to a substantial improvement over fixed-region sampling. The proofs rely on a representation of $\xi$ as a Poisson functional on path space and on the Malliavin–Stein method for Poisson functionals.
Read the full abstract

Differential Geometry

Operations on constructible functions and generalized valuations

Alesker's theory of generalized valuations unifies smooth measures and constructible functions on real analytic manifolds, extending classical operations on functions and measures. Alesker showed that these operations agree with the sheaf-theoretic ones on constructible functions under restrictive assumptions, leaving key aspects conjectural. In this article, we close this gap by proving that the two approaches indeed coincide on constructible functions under mild transversality assumptions. Our proof is based on a comparison with the corresponding operations on characteristic cycles. As applications, we extend additive kinematic formulas from convex bodies to compact subanalytic sets in Euclidean spaces and derive new kinematic formulas on the 3-sphere.
Read the full abstract

Mathematical Physics

On Csanyi's and Arias' Functional for Ground States Energy of Multi-Particle Fermion Systems: Asymptotics

We show that Csanyi's and Arias' energy functional of the reduced one-particle density matrix is bounded from below by the Müller functional and bounded from above by the Hartree-Fock functional. We use this fact to derive an asymptotic expansion of the ground state energy of this functional which agrees with the quantum energy to third order.
Read the full abstract

Functional Analysis

Classification in Active Dimension 2 for Weighted Residual Dynamics

We study weighted residual dynamics associated with a rank-one projection in finite dimension. The iteration reduces, after finitely many steps, to a nonlinear recursion on a stabilized active subspace. We prove that this recursion can be classified when the active dimension is two: either a transverse reducing direction persists unchanged, or the coupled part collapses completely. As a consequence, we obtain a description of the limit in the active two-dimensional case and identify the threshold beyond which higher-dimensional behavior becomes more flexible.
Read the full abstract

Probability

Long-Range Correlation of the Sine$_\beta$ point Process

We study the correlations of the celebrated Sine$_\beta$ point process. This point process arises as the bulk scaling limit of $\beta$-ensembles and has a geometric description through the Brownian carousel, as shown by Valkó and Virág (2009). We establish that the averaged $k$-point truncated correlation functions decay polynomially in the limit of large separation. We show that the decay exponent is of order $1/\beta$ for large $\beta$. This is a step towards a conjecture by Forrester and Haldane regarding the exact asymptotics of the two-point correlation function, a problem recently addressed by Qu and Valkó (2025). Our proofs, which rely on a careful analysis of the coupling of diffusions associated with the Brownian carousel, hold for all $\beta >0$ and $k \geq 1$, significantly extending previous results limited to specific values of $\beta$ or $k$.
Read the full abstract