Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 5 March

Optimization and Control

Multistage Stochastic Programming for Rare Event Risk Mitigation in Power Systems Management

High intermittent renewable penetration in the energy mix presents challenges in robustness for the management of power systems' operation. If a tail realization of the distribution of weather yields a prolonged period of time during which solar irradiation and wind speed are insufficient for satisfying energy demand, then it becomes critical to ramp up the generation of conventional power plants with adequate foresight. This event trigger is costly, and inaccurate forecasting can either be wasteful or yield catastrophic undersupply. This encourages particular attention to accurate modeling of the noise and the resulting dynamics within the aforementioned scenario. In this work we present a method for rare event-aware control of power systems using multi-stage scenario-based stochastic programming. A Fleming-Viot particle approach is used to bias the scenario generation towards rare realizations of very low wind power, in order to obtain a cost-effective control of conventional power plants that is robust under prolonged renewable energy shortfalls.
Read the full abstract

Numerical Analysis

Approximation of invariant measures for stochastic functional differential equations with infinite delay via an explicit finite-memory scheme

Owing to the intrinsic computational limitation that infinite memory cannot be stored numerically, the approximation of invariant probability measures (IPMs) for stochastic functional differential equations (SFDEs) with infinite delay remains an open problem. This paper addresses this challenge by proposing an explicit finite-memory truncated Euler-Maruyama scheme that combines memory and state truncation for such SFDEs. We establish strong convergence of the numerical segment process over any finite time horizon and obtain a convergence order arbitrarily close to $1/2$. We further prove that this numerical segment process admits a unique IPM and that its IPM converges to the exact counterpart under the $L^2$-Wasserstein metric as the step size vanishes, with an explicit convergence rate. The framework applies to both linear and superlinear coefficients.
Read the full abstract

All authors Guozhen Li, Guoting Song, Shan Huang, Xiaoyue Li, Xuerong Mao

Information Theory · Cross-listed from cs.DC

SLO-Aware Compute Resource Allocation for Prefill-Decode Disaggregated LLM Inference

Prefill-Decode (P/D) disaggregation has emerged as a widely adopted optimization strategy for Large Language Model (LLM) inference. However, there currently exists no well-established methodology for determining the optimal number of P/D hardware resources, subject to constraints on total throughput, service level objectives (SLOs), and request characteristics - specifically input and output lengths. To address this gap, we propose a hybrid approach that combines theoretical modeling with empirical benchmarking. First, we present a theoretical model for calculating P/D resource counts, which is based on total throughput requirements, request input and output lengths, as well as prefill and decode throughput. Then, to obtain the actual prefill and decode throughput under SLO constraints, we model the prefill process using M/M/1 queuing theory, deriving the achieved prefill throughput from the benchmarked maximum prefill throughput and Time-To-First-Token (TTFT). For the decode phase, we determine the decode batch sizes that meet Time-Per-Output-Token (TPOT) requirements and obtain the corresponding decode throughput through empirical measurements. Our experimental results demonstrate that the proposed method can accurately predict optimal P/D resource allocation in real-world LLM inference scenarios.
Read the full abstract

All authors Luchang Li, Dongfang Li, Bozhao Gong, Yu Zhang

Numerical Analysis

Physics-Informed Deep Learning for Industrial Processes: Time-Discrete VPINNs for heat conduction

Neural networks offer powerful tools to solve partial differential equations (PDEs). We present a Variational Physics-Informed Neural Network (VPINN) designed for parabolic problems. Our approach combines a classical time discretization with a composed loss function, which minimizes the residual's dual norm at every time step. We validate the framework by modeling the freezing of coffee extracts in an industrial cylinder. The simulation accounts for temperature-dependent properties and experimental data. It successfully captures the thermal dynamics of the process.
Read the full abstract

Combinatorics

Counting $P_3$-convex sets in graphs

We study the $P_3$-convexity, the path convexity generated by all three-vertex paths, and focus on the problem of counting the $P_3$-convex vertex sets of a graph $G$, denoted by $\noc(G)$. First, we settle the associated extremal question: we characterize the $n$-vertex graphs maximizing $\noc(G)$ among all graphs and determine the connected extremal graphs. Next, we investigate computational complexity and show that counting $P_3$-convex sets is $\#\mathsf{P}$-complete already on split graphs, even under additional structural restrictions. On the positive side, we identify two tractable subclasses, namely trees and threshold graphs, and obtain linear-time algorithms for both. Finally, we design nontrivial exact exponential-time algorithms for general graphs, combining structural decomposition, propagation rules capturing forced consequences of $P_3$-convexity, and fast counting of independent sets in auxiliary graphs. The resulting strategy becomes particularly effective on graph classes where large independent sets are guaranteed and can be found efficiently.
Read the full abstract

All authors Mitre C. Dourado, Luciano N. Grippo, Min Chih Lin, Fábio Protti

Combinatorics

Covering complete $r$-partite hypergraphs with few monochromatic components

An edge-coloring of a hypergraph is spanning if every vertex sees every color used in the coloring. In this paper, we prove that for $k \geq 2r \geq 6$, in any spanning $k$-coloring of the edges of a complete $r$-partite $r$-uniform hypergraph $H$, the vertices of $H$ can be covered by a set of at most $k-r+1$ monochromatic connected components. This proves a conjecture of Gyárfás and Király which is related to a special case of Ryser's conjecture. We also prove that for $k \in \{2,3\}$, every spanning $k$-edge-coloring of a complete bipartite graph admits a covering of its vertices using at most $k$ monochromatic components.
Read the full abstract

Analysis of PDEs

The Asymptotic Behaviour of Oldroyd-B Fluids is Almost Newtonian

Consider a viscoelastic fluid of Oldroyd-B type. It is shown that its stress tensor $\tau$ and its Newtonian deformation tensor $D(u)$ decay at the same rate, while the elastic part $\varepsilon=\tau-2\omega D(u)$ decays faster. As a consequence, the stress tensor of a viscoelastic fluid exhibits an almost Newtonian behaviour for large times.
Read the full abstract

All authors Matthias Hieber, Thieu Huy Nguyen, César J. Niche, Cilon F. Perusato

Logic

On regulated partitions

This paper considers the combinatorics of continuous and Borel rectangular partitions of free actions of $\mathbb{Z}^n$ on $0$-dimensional Polish spaces, specifically the free part $F(2^{\mathbb{Z}^n})$ of the shift action of $\mathbb{Z}^n$ on the space $2^{\mathbb{Z}^n}$. This is done through the study of a corresponding notion of regulated partitions of $\mathbb{R}^n$. The main concepts studied are the continuous and Borel regulation numbers of the partition. This is defined as the maximum number of rectangles in the corresponding regulated partition that can intersect in a point. The continuous and Borel regulation numbers $\gamma_c$, $\gamma_B$ are the minimum possible values of these numbers as we range over continuous (respectively Borel) rectangular partitions of $F(2^{\mathbb{Z}^n})$. It is shown that for $n=2$ that $\gamma_c=\gamma_B=3$, and for $n \geq 3$ that $n+2\leq \gamma_B \leq \gamma_c \leq 3\cdot 2^{n-2}$. For $n=3$ we improve this to $\gamma_c=\gamma_B=5$. This shows a striking difference between the Borel combinatorics of dimension $n=2$ and dimensions $n>2$.
Read the full abstract

Statistics Theory

Strong consistency of the local linear estimator for a generalized regression function with dependent functional data

In this study, we focus on a generalized nonparametric scalar-on-function regression model for heterogeneously distributed and strongly mixing data. We provide almost complete convergence rates for the local linear estimator of the regression function. We show that, under our conditions, the pointwise and uniform convergence rates are the same on a compact set. On the other hand, when the data is dependent, it is proved that the convergence rate can be slower than those obtained for independent data. A simulation study shows the good performance and finite sample properties of the functional local linear estimator (FLL) in comparison to the local constant estimator (FLC). In addition, a one step ahead energy consumption forecasting exercise illustrates that the forecasts of the FLL estimator are significantly more accurate than those of the FLC.
Read the full abstract

Statistics Theory

The augmented van Trees inequality

We introduce an augmented form of the van Trees inequality, that yields uniformly tighter lower bounds on the minimax squared Bayes risk of estimators compared with the classical van Trees inequality. Our augmented inequality also accommodates prior distributions whose densities need not vanish at the boundaries of their supports. We demonstrate how this refinement can be utilised for elementary proofs of a number of minimax lower bounds for nonparametric estimands, that also often attain sharper constants than those obtained by the alternative Le Cam convergence of experiments theory and the classical van Trees inequality, and in some cases obtain exact constants. As an example, our augmented van Trees inequality can be used to obtain the asymptotic minimax pointwise mean squared error when estimating the regression function in the model with normal errors: when the regression function is univariate and differentiable with Lipschitz derivative we obtain this quantity up to a constant factor of $1.37$; and in the high dimensional regime with a Hölder smooth regression function of smoothness $\beta\in(0,2]$ we obtain exact constants. Both these results do not follow from an application of the classical van Trees inequality. The flexibility of our augmented van Trees inequality accommodates lower bounds for models beyond Gaussianity, loss functions beyond the squared error loss, and we are also able to incorporate this augmentation into generalised versions of the van Trees inequality for irregular models.
Read the full abstract

Statistics Theory

Sequential Multiple Testing: A Second-Order Asymptotic Analysis

We study sequential multiple testing with independent data streams, where the goal is to identify an unknown subset of signals while controlling commonly used error metrics, including generalized familywise rates and false discovery and non-discovery rates. For these problems, procedures that are first-order optimal are known, in the sense that the ratio of their expected sample size (ESS) to the minimal achievable ESS converges to one as the error tolerance levels vanish. In this work, we develop a unified theory of second-order asymptotic optimality. We establish general sufficient conditions under which second-order Bayesian optimality implies second-order frequentist optimality for broad classes of sequential testing procedures. As a consequence, several procedures previously known to be first-order optimal are shown to be second-order optimal: for every signal configuration, the difference between their ESS and the minimal achievable ESS remains uniformly bounded as the error tolerance levels tend to zero. In addition, we derive a second-order asymptotic expansion of the minimal achievable ESS, which refines the classical first-order approximation by identifying the second-order correction term arising from a boundary-crossing problem for a multidimensional random walk. We apply this result to several commonly used error metrics.
Read the full abstract

Wednesday 4 March

Probability · Cross-listed from cs.SI

LLY Ricci Reweighting in Stochastic Block Models: Uniform Curvature Concentration and Finite-Horizon Tracking

We study curvature-driven edge reweighting for community recovery in the balanced two-block stochastic block model. Given a graph G with initial weights equal to the adjacency matrix, we iteratively update edge weights using Lin-Lu-Yau (Ollivier-type) Ricci curvature, while all transportation costs are computed in the unweighted graph metric. In a moderate-density regime we prove uniform concentration of edge curvatures and show that a single Ricci reweighting step produces a two-level weighting that amplifies within-block connectivity relative to across-block connectivity. As a consequence, spectral clustering on the reweighted graph has a strictly larger population eigengap, and we obtain corresponding non-asymptotic perturbation bounds and Davis-Kahan misclustering guarantees. We further analyze a fixed finite horizon of iterated reweighting, where the random iterates track a deterministic two-weight recursion uniformly over the time horizon. This yields a principled finite-horizon curvature flow interpretation for community detection in a canonical random graph model.
Read the full abstract

General Mathematics

Limit Cases And Strategy In Chutes and Ladders

We analyze what happens to the average duration of a game of Chutes and Ladders as the probability of rolling $\delta \in \{ 1,2,3,4,5,6\}$ approaches 100%. We utilize Markov models, and Monte Carlo simulations in Python. We also introduce strategy to the board game by allowing the player to choose whether or not they flip a coin after each die roll where if they get heads they will advance one square and if they get tails they will go back one square. The strategy the player employs to decide when to flip the coin has a significant impact on the average duration of the game. We analyze six different non-trivial strategies.
Read the full abstract

General Mathematics

Evolving Local Corrections for Global Constructions in Combinatorics

Many open problems in combinatorics admit reformulations in which a global construction can be achieved by the repeated application of small, finite correcting steps. This paper presents three computational case studies of this principle, carried out using AlphaEvolve as an experimental engine for proposing and iteratively refining such certificates. The problems we studied are: reconstruction of bipartite and planar graphs from vertex-deleted subgraphs; the Alon-Tarsi parity problem for Latin squares, approached via sign-reversing involutions built from local trades; Rota's Basis Conjecture, studied through local exchange policies on collections of bases. In these three problems the correcting steps take the form of a reconstruction rule, a parity-reversing involution, and a transversal family of bases, respectively. For each problem, we describe the experimental setup, the scoring protocols, and the outcomes of the searches, leading to concrete conjectures concerning the existence and structure of the relevant correcting steps. The aim is not to claim proofs, but rather to produce explicit algorithms and to reveal structural patterns that appear amenable to subsequent analysis by traditional mathematical methods.
Read the full abstract

General Mathematics

Arctanh Sums: Analytic Continuation and Prime-Restricted Theory

We study the arctanh sums h(k) = sum_{n=2}^\infty arctanh(n^{-k}) as a function of a complex variable k. Building on the closed-form identity h(k) = (1/2) log(g(2k)/g(k)^2) (proved in the companion preprint arXiv:2602.06244), we develop the analytic continuation and prime-restricted multiplicative theory. We prove that h extends meromorphically to Re(k) > 0 with simple poles at k = 1/(2m+1), derive Laurent expansions at its poles (including k = 1), and obtain a Mittag-Leffler decomposition encoding the Dirichlet lambda function. We also show that h has exactly one simple real zero in each inter-polar interval. Finally, for the prime-restricted analogue h_p(k) = log(zeta(k)) - (1/2) log(zeta(2k)), we establish a pi-cancellation mechanism implying unconditional transcendence of h_p(2j), and derive a product formula over the nontrivial zeros of zeta with O(|Im(rho)|^{-2}) decay.
Read the full abstract

Statistics Theory

Uniform convergence of kernel averages under fixed design with heterogeneous dependent data

We provide uniform convergence rates for kernel averages on $[0,1]$ under equally-spaced fixed design points of the form $x_{t,T}=t/T,\ t\in\{1,\dotsc, T\},\ T\in\mathbb{N}$. The rates of weak and strong uniform consistency are derived under strong mixing and moment conditions and do not require stationarity. The analysis exploits the grid structure and thus complements existing random-design results such as those of Hansen (2008) and Kristensen (2009), which rely on density-based conditioning arguments. The framework accommodates dependent triangular arrays and is particularly relevant for nonparametric methods applied to time series observed on deterministic grids. As an application, we derive uniform convergence rates for the local linear estimator in a nonparametric regression model with time-varying autoregressive errors. The theoretical results are illustrated through Monte Carlo experiments and an empirical application.
Read the full abstract

Analysis of PDEs

Upper bounds of nodal sets for solutions of bi-Laplace equations: II

We investigate the upper bounds of nodal sets for solutions of bi-Laplace equations without using frequency functions which play an essential role in the study of nodal sets in the celebrated work by Logunov \cite{Lo18}. We obtain some delicate monotonicity and propagation of smallness results by Carleman estimates. A polynomial upper bound for the nodal sets of solutions is obtained.
Read the full abstract

Differential Geometry

Elliptic genera and $SL(2,Z)$ modular forms for fibre bundles

By the family index theory, we generalize some well-known $SL(2,Z)$ modular forms to the family case and obtain some new anomaly cancellation formulas for the determinant line bundle and index gerbes, and certain results about eta invariants. Moreover, for the higher degree case, we give some anomaly cancellation formulas of residue Chern forms.
Read the full abstract

Numerical Analysis

Improving the accuracy of physics-informed neural networks via last-layer retraining

Physics-informed neural networks (PINNs) are a versatile tool in the burgeoning field of scientific machine learning for solving partial differential equations (PDEs). However, determining suitable training strategies for them is not obvious, with the result that they typically yield moderately accurate solutions. In this article, we propose a method for improving the accuracy of PINNs by coupling them with a post-processing step that seeks the best approximation in a function space associated with the network. We find that our method yields errors four to five orders of magnitude lower than those of the parent PINNs across architectures and dimensions. Moreover, we can reuse the basis functions for the linear space in more complex settings, such as time-dependent and nonlinear problems, allowing for transfer learning. Our approach also provides a residual-based metric that allows us to optimally choose the number of basis functions employed.
Read the full abstract

Probability

Estimating Graph Dynamics from Population Observations

In this paper we consider a population process evolving on a dynamic random graph. The dynamic random graph is an Erdős–Rényi graph that is resampled every time unit, independently of the previous ones, with `edge existence probability' $p$. The population process consists of $M$ individuals which reside at the vertices of the dynamic graph. At each point in time any of the $M$ individuals, supposing it resides at a vertex with $k$ neighbors, jumps to an adjacent vertex with probability $k/(k+1)$ (where this adjacent vertex is picked uniformly at random), and with probability $1/(k+1)$ it stays where it is. We suppose we observe the numbers of individuals at each of the vertices, but not the evolving random graph itself. We propose two estimators for $p$, and establish their consistency and asymptotic normality.
Read the full abstract

Representation Theory

The Kazhdan-Lusztig category of W-algebras of simply-laced Lie algebras at irrational levels

Let $\mathfrak{g}$ be a simple, simply-laced Lie algebra and $f \in \mathfrak{g}$ nilpotent. The Kazhdan-Lusztig category of the W-algebra $W^\kappa(\mathfrak{g},f)$ associated with $(\mathfrak{g},f)$ at level $\kappa \in \mathbb{C}$ is obtained from the Kazhdan-Lusztig category of the affine vertex algebra $V^\kappa(\mathfrak{g})$ via the quantum Hamiltonian reduction associated with $f$. We show that this is a braided tensor equivalence for any $f$ and any irrational level $\kappa\in \mathbb{C} \backslash \mathbb{Q}$.
Read the full abstract

Number Theory

The $p$-Dissection of a Product of Quintuple Products

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product identity. We derive explicit formulae for the $p$-dissection of $Q(q^{bm},q^p)Q(q^{bn},q^p)$, and determine sign patterns in length-$p$ arithmetic progressions of the Taylor series coefficients of the associated quotient $Q(q^{bm},q^{p})Q(q^{bn},q^p)/(q^p;q^p)_{\infty}^2$. Some combinatorial applications of the $p$-dissection formulae are also given.
Read the full abstract

All authors Taylor Daniels, Timothy Huber, James McLaughlin, Dongxi Ye

Combinatorics · Cross-listed from cs.CG

Hypercube drawings with no long plane paths

We study the existence of plane substructures in drawings of the $d$-dimensional hypercube graph $Q_d$. We construct drawings of $Q_d$ which contain no plane subgraph with more than $2d-2$ edges, no plane path with more than $2d-3$ edges, and no plane matching of size more than $2d-4$. On the other hand, we prove that every rectilinear drawing of $Q_d$ with vertices in convex position contains a plane path of length $d$ (if $d$ is odd) or $d-1$ (if $d$ is even). We also prove that if a graph $G$ is a plane subgraph of every drawing of $Q_d$ for a sufficiently large $d$, then $G$ is necessarily a forest of caterpillars. Lastly, we give a short proof of a generalization of a result by Alpert et al. [Cong. Numerantium, 2009] on the maximum rectilinear crossing number of $Q_d$.
Read the full abstract

All authors Todor Antić, Niloufar Fuladi, Anna Margarethe Limbach, Pavel Valtr

Functional Analysis

On a conjecture of $\lambda$-Aluthge transforms and Hilbert–Schmidt self-commutators

Let $A$ be a complex square matrix, and write its polar decomposition as $A=U|A|$. For $0<\lambda<1$, the $\lambda$-Aluthge transform of $A$ is defined by $$ \Delta_\lambda(A)=|A|^\lambda U|A|^{1-\lambda}. $$ In 2007, Huang and Tam conjectured that the Frobenius norm of the self-commutator is contractive under $\Delta_\lambda$: for every $0<\lambda<1$, $$ \|A^*A-AA^*\|_{F} \ \ge\ \|\Delta_\lambda(A)^*\Delta_\lambda(A)-\Delta_\lambda(A)\Delta_\lambda(A)^*\|_{F}. $$ If this inequality held, then the iterated self-commutator norms $$ \Bigl\{\bigl\|\Delta_\lambda^{\,m}(A)^*\Delta_\lambda^{\,m}(A) -\Delta_\lambda^{\,m}(A)\Delta_\lambda^{\,m}(A)^*\bigr\|_F\Bigr\}_{m\in\mathbb N} $$ would form a nonincreasing sequence and necessarily converge to $0$. In this paper we provide a counterexample, thereby disproving the conjecture. We also obtain the quantitative bounds $$ \sqrt{\frac32}\ \le\ \sup_{\substack{A\in\mathbb{M}_n(\mathbb{C}),\ A^*A\neq AA^*\\ 0<\lambda<1}} \frac{\|\Delta_\lambda(A)^*\Delta_\lambda(A)-\Delta_\lambda(A)\Delta_\lambda(A)^*\|_F}{\|A^*A-AA^*\|_F} \ \le\ 2. $$
Read the full abstract

Classical Analysis and ODEs

Riesz energy deformation through insulated strips

For compact sets in Euclidean space, Riesz energies whose exponents differ by $1$ are shown to arise as the endpoint cases of a one-parameter family of infinite-strip energies as the strip thickness increases from $0$ to $\infty$, under Neumann boundary conditions. An approach is suggested to a capacity conjecture of Pólya and Szegő.
Read the full abstract

2603.04649 · 4 Mar · Energy and kernel error estimates improved in the case q=1 as strip degenerates (t -> 0): Theorem 3.3(a): error term O(t) eliminated when q=1, using improved Proposition 4.1(d). Proposition 4.1(d): error term O(t) eliminated when q=1, by simplified proof. Proposition 5.1: O(1) part of error term eliminated from kernel estimate (13) when q=1. Corollary 5.2: error term O(1) improved to O(1/r)

Combinatorics

Metric embeddings of cubes into dense subsets of cubes

Fix $k \in \mathbb{N}, 0 < \delta < 1$. We study how large $N$ must be so that every $\delta$-dense subset $\mathcal{D} \subset \{0,1\}^N$ (meaning $|\mathcal{D}|\geq \delta 2^N$) contains the image of a metric embedding $f: \{0,1\}^k \to \mathcal{D}$. We study $3$ variants: For a $(1+\varepsilon)$-bi-Lipschitz map $f$ for a fixed $\varepsilon>0$, we show that $N = O(\varepsilon^{-2}\log(1/\delta) k^3)$. For an isometric map $f$ with arbitrary rescaling (i.e. undistorted), we show that $N = \log(1/\delta) e^{\Omega(k)}$. For an isometric map $f$ with bounded rescaling we show that $N = \exp{[\log(1/\delta)e^{\Theta(k)}]}$. Regarding the path space, we prove the density analog of a coloring theorem of Rödl–Sales. We give bounds for $(1+\varepsilon)$-bi-Lipschitz embeddings of the path $[k] = \{1,...,k\}$ into dense subsets of the path $[N] = \{1,...,N\}$, improving a bound of Dumitrescu. We prove similar bounds for the binary tree space, using the tree replicas theorem of Pach–Solymosi–Tardos. As a geometric application we obtain a non-positive Alexandrov curvature counterpart to the work of Bartal–Linial–Mendel–Naor on the nonlinear Dvoretzky problem who showed that any $\mathcal{D} \subset \{0,1\}^N$ that embeds with bi-Lipschitz distortion $<\alpha$ into a metric space of non-negative Alexandrov curvature must be small, namely, necessarily $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-2}))}$. We prove that for every $N\gtrsim \alpha^{6}\ge 1$, any $\mathcal{D} \subset \{0,1\}^N$ that embeds with distortion $<\alpha$ into some metric space of non-positive Alexandrov curvature must satisfy $|\mathcal{D}| \lesssim 2^{N(1-\Omega(\alpha^{-4}))}$ via an approach which is entirely different from that of Bartal–Linial–Mendel–Naor. We also show that nontrivial metric type and non-universality are preserved by taking finite unions of subspaces.
Read the full abstract

Probability

The coordinate change formula for the Liouville quantum gravity metric holds for all conformal maps simultaneously

Liouville quantum gravity (LQG) is, heuristically, a theory of random Riemannian geometry with Riemannian metric tensor $e^{\gamma h} (\mathrm{d} x^2 + \mathrm{d} y^2)$, where $h$ is a variant of the Gaussian free field and $\gamma > 0$ is a parameter. If $U \subset \mathbb{C}$ is an open set, $\phi \colon U \to \phi(U)$ is a conformal map, and $h^{\phi} = h \circ \phi^{-1} + Q \log|(\phi^{-1})'|$ (where $Q = Q(\gamma)$ is a parameter), then the LQG surface on $U$ defined with field $h$ is equivalent to the LQG surface on $\phi(U)$ with field $h^{\phi}$. This equivalence is meant in the sense that the area measures and distance functions on these surfaces are almost surely equivalent. It is known for the area measure that, in fact, this equivalence holds almost surely for all conformal maps $\phi$ simultaneously (Sheffield-Wang 2016). We prove the corresponding result for the distance function. This makes precise the frequently used heuristic definition that a quantum surface is a random equivalence class of domains equipped with the LQG area measure and LQG distance function.
Read the full abstract

Classical Analysis and ODEs

Elliptic integral identities derived from Coxeter's integrals

We revisit the classical integrals introduced by Coxeter, not to recalculate their well-known exact values, but to use them as a tool to derive elliptic integral identities. By embedding Coxeter's first integral into a one-parameter family $$ I(\lambda)=\int_{0}^{\pi/2} \arccos\!\left(\frac{\cos\theta}{1+\lambda\cos\theta}\right)\,d\theta, $$ and differentiating with respect to the parameter \(\lambda\), we show that the derivative $I'(\lambda)$ can be expressed as an elliptic-type integral. Integrating $I'(\lambda)$ between 0 and 2 yields the identity $$ \int_0^2 \int_0^{\pi/2} \frac{\cos^2\theta} {(1+s\cos\theta)\sqrt{(1+s\cos\theta)^2-\cos^2\theta}} \,d\theta\, ds=A-B=\frac{\pi^2}{12}, $$ where $A$ and $B$ are the first two so-called Coxeter integrals $$ A = \int_0^{\pi/2} \arccos\!\left(\frac{\cos\theta}{1+2\cos\theta}\right) d\theta, $$ and $$ B = \int_0^{\pi/2} \arccos\!\left(\frac{1}{1+2\cos\theta}\right) d\theta. $$ The derivative $I'(\lambda)$ can be expressed in terms of incomplete elliptic integrals of the first kind $F$ and of the third kind $\Pi$. This approach establishes a direct connection between classical Coxeter integrals and elliptic functions. The method highlights how well-known trigonometric integrals can serve as a bridge to explore properties and relations of elliptic integrals, offering new analytic insights beyond the original Coxeter evaluations.
Read the full abstract

Mathematical Physics

Drinfeld Correspondence in Infinite Dimensions

In this article, we establish the Drinfeld correspondence between Poisson Lie groups and their infinitesimal counterparts, Lie bialgebras, in the infinite-dimensional setting. Specifically, we extend this correspondence to regular Lie groups modeled on convenient vector spaces, with a particular focus on those modeled on nuclear Fréchet and nuclear Silva spaces. Important examples of interest include the smooth loop group $C^{\infty}(\mathbb{S}^{1}, G)$ and the analytic loop group $C^{\omega}(\mathbb{S}^{1}, G)$ of a 1-connected real Lie group $G$, as well as $\widetilde{\mathrm{Diff}^{\infty}(M)_0}$ and $\widetilde{\mathrm{Diff}^{\omega}(M)_0}$ – the universal covering groups of the identity components of the groups of smooth and real-analytic diffeomorphisms of a compact manifold $M$.
Read the full abstract

Numerical Analysis

A Cell-Average Non-Separable Progressive Multivariate WENO Method for Image Processing Applications

Accurate and efficient reconstruction techniques are essential in multiresolution analysis and image compression, particularly when the data are represented as cell averages. In this work, we present a non-separable progressive multivariate Weighted Essentially Non-Oscillatory (WENO) scheme specifically designed for cell-average data, with applications to digital image processing. The proposed method extends Harten's multiresolution framework through a non-linear WENO reconstruction adapted to the cell-average context, achieving high-order accuracy in smooth regions and stable, non-oscillatory behavior near discontinuities. We also establish theoretical results regarding the consistency and approximation properties of the method. Finally, several numerical experiments on piecewise smooth functions and digital images are presented to demonstrate its performance and validate its effectiveness against the linear Lagrange reconstruction of the same order of accuracy.
Read the full abstract

All authors Inmaculada Garcés, Pep Mulet, Juan Ruiz-Álvarez, Chi-Wang Shu, Dionisio F. Yáñez