Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 21 April

Mathematical Physics · Cross-listed from gr-qc

A Lagrangian framework for canonical analysis for the Holst model with $\beta = 0$

We perform a canonical analysis of the Holst model for General Relativity, within the framework laid out in arXiv:2401.07307 and arXiv:2010.07725, distinguishing our approach by setting the Barbero parameter to $\beta=0$ and leaving the lapse and shift functions unconstrained. The $\beta = 0$ choice is of particular interest because it is viable across all dimensions, providing a necessary foundation for extending the Loop Quantum Gravity formalism beyond $3+1$ dimensions. Through field decomposition and the projection of the field equations, we derive a system of 37 equations (10 differential constraints, 21 algebraic constraints, and 6 evolution equations) exactly matching the 37 field components to be determined. Moreover, leaving the gauge unfixed reveals that three equations, which are typically identically satisfied under normal evolution, are actually differential constraints whose triviality depends on specific gauge choices. The resulting framework remains fully consistent with the standard $3+1$ decomposition of the Einstein equations without requiring any constraints on the lapse and shift functions.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.PS

Generalized PT-symmetric nonlinear Dirac equation: exact solitary waves solutions, stability and conservation laws

We derive an exact solitary wave solution for the $\PTb$-symmetric nonlinear Dirac equation with a scalar-scalar interaction. We consider a power-law nonlinearity of the form $|\bar{\Psi}\,\Psi|^{k}\,\Psi$ for positive values of $k$. The system's energy is conserved despite the presence of a gain-loss term, which is quantified by the parameter $\Lambda$. We show that the $\PTb$-transition point is defined by the solution's existence condition and is independent of the nonlinearity exponent $k$. Furthermore, momentum is conserved, although neither the canonical momentum nor the charge is a conserved quantity. A notable result is that the stationary solution, obtained from the continuity equations, exhibits nonzero momentum in its rest frame. We also derive a moving soliton solution, where the gain-loss parameter allows the soliton's velocity to be precisely chosen so that the moving soliton possesses zero momentum. Finally, we establish that the presence of a gain-loss mechanism and higher-order nonlinearity restrict the stability domain of the solutions.
Read the full abstract

All authors Fernando Carreño-Navas, Siannah Peñaranda, Renato Alvarez-Nodarse, Niurka R. Quintero

Numerical Analysis

Symplectic Error of Implicit Symplectic Integrators: A Qualitative Structural Analysis

We study how inexact nonlinear solvers lead to a loss of exact symplecticity in the Symplectic Euler (SE) and Stormer-Verlet (SV) schemes when applied to general nonseparable Hamiltonian systems. These schemes are implicit and require nonlinear solvers in practice. Here, we consider a fixed number $M$ of fixed-point iterations (FPI). While SE is exactly symplectic under exact solves, a finite $M$ gives only pseudo-symplecticity. Compared to previous results, we provide a more qualitative, block-wise characterization of the induced pseudo-symplecticity by analyzing the resulting perturbations to the matrix of symplectic structure $J$. We prove that the perturbed matrix $\tilde{J}$ is skew-symmetric, that one diagonal block vanishes identically (depending on the SE variant), and that the remaining blocks are $O(h^{M+1})$ perturbations of their counterparts in $J$, with time step $h$. A quadratic Hamiltonian example shows these bounds are sharp. Extending to compositions, we quantify how SV inherits distinct decay orders across different blocks of the symplectic defect. As a corollary, we show that the perturbation of volume preservation in phase space arises solely from the off-diagonal blocks of $\tilde{J}$, and we bound the induced energy error along trajectories. Numerical experiments on a tokamak magnetic-field Hamiltonian, where q-implicit SE is fully nonlinear (requiring FPI) but p-implicit SE is linearly implicit, confirm the sharpness of the theory and highlight the gap to the exactly symplectic counterpart.
Read the full abstract

Numerical Analysis

Comparison of model order reduction techniques with one-shot procedure for topology optimization for thermal applications

Density-based topology optimization has become a powerful method for automatically generating optimized designs in a wide variety of applications. However, it comes with a large computational cost when solving the physical model requires large-scale simulations. Here, we investigate the use of model order reduction (MOR) techniques to accelerate the simulations in the context of thermal design applications. We project the governing and the adjoint equations onto a low-dimensional subspace by constructing two distinct reduced bases – one for the forward state and one for the adjoint system – using solution snapshots from previous design iterations. These snapshots are generated using either the high-fidelity solver or inaccurate fast solvers, such as the one-shot method \citep{amir2024one}. Additionally, we demonstrate that properly selecting the stopping criterion for the iterative linear solver is crucial for the effective use of reduced models. In our 3D example, the proposed framework reduces the overall total simulation time relative to the high-fidelity workflow by a factor up to $3$ when combined with high-fidelity solves and a factor up to $16$ when combined with the one-shot method. Moreover, we find that the reduced order model approach is able to achieve a speed up of $1.54$ with respect to the one-shot method.
Read the full abstract

All authors Luis Fernando Cusicanqui Lopez, Ramadan Krasniqi, Florian Feppon, Karl Meerbergen

Information Theory

Uplink Signal Detection For Large-Scale MIMO-ISAC Systems

Next-generation wireless communication systems are unifying large-scale multiple-input multiple-output (MIMO) and integrated sensing and communication (ISAC) to enhance sensing and communication performance. In this paper, the signal detection problem for MIMO-ISAC systems is modeled as a mixed-integer least squares (MILS) problem. To solve it efficiently, we propose a projection-based neighborhood search-aided alternating direction method of multipliers (P-NS-ADMM) detection scheme. By theoretical analysis, we demonstrate that P-NS-ADMM achieves the same received diversity order as maximum likelihood (ML) detection. For further complexity reduction, an iteration-based NS-ADMM (I-NS-ADMM) is proposed to remove the complex projection operation. Complexity analysis shows its complexity advantage compared with P-NS-ADMM. Moreover, to better estimate the sensing signals for I-NS-ADMM, a flexible mechanism of ADMM iterations is given. Finally, simulations demonstrate the proposed NS-aided ADMM detection schemes have significant performance advantages in terms of both BER and NMSE.
Read the full abstract

All authors Jian Wang, Qiqiang Chen, Zheng Wang, Fan Liu, Yili Xia, Yongming Huang, Chau Yuen

Commutative Algebra

The reciprocal complement of a surface

We study the reciprocal complement $\mathcal{R}(D)$ of a two-dimensional finitely generated $K$-algebra $D$ by linking it with the properties of a surface with coordinate ring $D$. We give several sufficient criteria to have $\dim\mathcal{R}(D)=2$, and we use them to show several explicit examples; in particular, we determine the dimension of $\mathcal{R}(D)$ when $D$ is the quotient of $K[X,Y,Z]$ by an irreducible polynomial of degree $2$. We also study the integral closure of the localizations of $\mathcal{R}(K[X,Y])$.
Read the full abstract

Classical Analysis and ODEs

Multiparameter Marcinkiewicz integrals and a resonance theorem

We prove pointwise relations between some multiparameter square functions on $\bold R^n$.

Mathematical Physics · Cross-listed from cond-mat.mes-hall

Emergence of rigid Polycrystals from atomistic Systems with general Interactions

We investigate the formation of polycrystalline structures in a class of particle systems. The atomistic energy is modeled as a sum of particle energies that favor atoms being locally isometric to a reference lattice. The discrete frame invariant energy allows for particle configurations in which no underlying lattice is assumed a priori. We prove a discrete-to-continuum limit for configurations with finite surface-energy scaling by means of $\Gamma$-convergence. The resulting continuum theory is described by piecewise constant fields encoding the local orientation of the configuration. The limiting energy is concentrated on grain boundaries, corresponding to the interfaces between regions where the microscopic configuration has constant orientation. The associated energy density depends on the orientations of the two grains as well as on the normal to the interface. Due to our assumptions on the rigid interactions, solid-solid phase transitions with interpolating boundary layers are not energetically favorable; the energy density therefore decomposes into twice the energy density for solid-vacuum transitions.
Read the full abstract

Symplectic Geometry

Bott-integrable contact forms with large systolic ratio

We show that there is no universal upper bound for the systolic ratio of Bott-integrable contact forms on closed 3-manifolds, thus providing further evidence for the relative flexibility of integrable contact forms. For the proof, we study piecewise linear approximations of Lutz forms and establish integrability of a `plug' constructed by Abbondandolo, Bramham, Hryniewicz and Salomão for pushing up the systolic ratio.
Read the full abstract

Information Theory

Reliable Remote Inference from Unreliable Components: Joint Communication and Computation Limits

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a committed/no-bypass receiver closure, task-relevant information can affect the final estimate only by passing through a budgeted collection of vulnerable primitives unless an explicit protected bypass is modeled. Modeling each vulnerable primitive as a memoryless noisy channel yields a baseline supply–demand converse: the task-relevant information needed to attain a target distortion cannot exceed the smaller of the total information supplied by the communication channel and the total information supplied by the vulnerable compute budget. Our main converse shows that committed intermediate interfaces create additional first-order serial cuts and receiver-internal computation-graph cuts, captured in general by a receiver-internal compute min-cut converse. In particular, the twofold loss in the symmetric two-stage hard-separation special case is not inherent to unreliable receiver computation but induced by hard-separation under the committed/no-bypass closure. This extra first-order tax is therefore closure-dependent rather than universal. On the converse side, if downstream modules retain soft visibility to the raw channel output, the converse reduces to the single-bottleneck supply, up to any explicitly reserved soft-path budget. Under a separate stronger protected-support closure with reliable decoder and control support, we establish achievability results for task-direct and serial hard-separation constructions. For the fully noisy-logic regime, we obtain only a conservative depth-dependent converse, and matched achievability remains open.
Read the full abstract

Numerical Analysis

Preconditioners for the Onsager-Stefan-Maxwell equations for multicomponent diffusion

The Onsager-Stefan-Maxwell (OSM) equations are an important model of mass transport in multicomponent flows with multiple chemical species. They describe the coupling of diffusive fluxes between species, accounting for their interactions through frictional and thermodynamic driving forces. In this work we propose an augmented Lagrangian preconditioner and prove its discretization-robustness for a Picard linearization of the stationary OSM equations in the isobaric, isothermal, ideal gaseous setting. For the Newton linearization we employ the augmented Lagrangian preconditioner as a block diagonal smoother inside a monolithic geometric multigrid iteration and combine with vertex star Schwarz methods. This strategy is shown to be applicable in a wide variety of settings which incorporate cross-diffusion, nonideal mixing, thermal, pressure, convective, and electrochemical effects. We demonstrate robustness or mild dependence with respect to mesh refinement and polynomial degree of the proposed monolithic preconditioning strategy for different types of multicomponent flows in several applications: cross-diffusion in the human airways, separation of gases under a temperature gradient, nonideal mixing of benzene and cyclohexane, and electrolytic transport in a Hull cell undergoing electroplating.
Read the full abstract

Optimization and Control

Exact Quadratic Penalty Function for Symplectic Eigenvalue Problem

The symplectic eigenvalue problem for symmetric positive-definite (spd) matrices plays a crucial role in various scientific fields, including quantum mechanics and control theory. This paper introduces a trace-penalty minimization method, which transforms the symplectic eigenvalue problem into the unconstrained minimization of the trace-penalty function. We prove the equivalence between the penalty problem and the original constrained optimization problem under mild conditions, in the sense that the second-order stationary points of the trace-penalty function correspond to the solutions of the symplectic eigenvalue problem. Moreover, we develop an algorithm to minimize the trace-penalty function efficiently, which follows the scheme of gradient methods, together with the Barzilai-Borwein (BB) adaptive step-size rule and non-monotone line-search technique. Numerical experiments demonstrate that the proposed algorithm outperforms a wide range of existing methods, such as Riemannian gradient-based methods, in terms of computational efficiency and convergence rate for dense, sparse, and sparse-add-low-rank matrices. These numerical results further demonstrate the great potential of our proposed algorithm, especially in solving large-scale symplectic eigenvalue problems.
Read the full abstract

Rings and Algebras · Cross-listed from cs.SC

SignatureTensors.jl: A Package for Signature Tensors in Julia

We introduce SignatureTensors.jl, a new package for computing signature tensors of paths in julia. We present its core functionality and demonstrate its use through illustrative examples. The package is compatible with the computer algebra system OSCAR, enabling both exact and numerical computations with signatures.
Read the full abstract

Differential Geometry

On Ricci forms of canonical metrics over noncompact complex manifolds

In this paper, we study several types of geometric problems related to the Ricci curvature on noncompact complex manifolds, such as the existence of Kähler-Einstein metrics on complete Kähler manifolds with negative Ricci curvature, which can be seen as an improvement of the main theorem in Cheng-Yau [4]; the existence of canonical Hermitian metrics with prescribed Ricci curvature on complete Hermitian manifolds, which can be regarded as noncompact versions of the Gauduchon conjecture on certain complete complex surfaces. Our method can also be used to construct Hesse-Einstein metrics in affine differential geometry.
Read the full abstract

Probability

Split merge dynamics for expanding intervals and point processes on the real line

We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then merging pairs of subintervals at the break points of the old partition. The nth partition then comprises n+1 subintervals with n break points. When I n = [0, 1] is constant, the empirical distribution of these points was shown to converge weakly to a singular probability supported in {0, 1} in a previous article. When the length of the intervals is regularly varying with a positive index, we show in this article that the limit can be absolutely continuous. In the last part we extend the split merge dynamics to partitions of R. In this case we characterize invariant distributions and show that special instances of split merge dynamics for expanding intervals converge to these invariant measures vaguely in distribution.
Read the full abstract

Algebraic Topology

Whitehead torsion and the kernel of assembly

For a topological space that is homeomorphic to a finite simplicial complex, we prove that the Bartels–Nikolaus assembly functor has a fully faithful right adjoint. Using this, we define for each such topological space $X$ a Whitehead category, whose K-theory is canonically identified with the Whitehead spectrum of $X$; and for a homotopy equivalence between two such spaces, we define an object in the Whitehead category of $X$ called the torsion cosheaf of the map, whose K-theory class recovers the classical Whitehead torsion.
Read the full abstract

Algebraic Geometry

Generalized algebraic Morse inequalities and Hasse-Schmidt jet differentials

This is a remastered and expanded version of a an earlier preprint of the author, in which we give a fully algebraic proof of an important theorem of Demailly, stating the existence of many Green-Griffiths jet differentials on a complex projective manifold of general type. To this end, we introduce a new algebraic version of the Morse inequalities, which we use in our proof as an algebraic counterpart to Demailly's and Bonavero's holomorphic Morse inequalities. This new version also applies to positive characteristic, giving the existence of Hasse-Schmidt jet differentials for a smooth projective variety of general type over an arbitrary algebraically closed field.
Read the full abstract

Probability

Stochastic $\Sigma$-convergence in Orlicz setting and Applications

This paper aims to extend the concept of stochastic $\Sigma$-convergence to the framework of Orlicz-Sobolev spaces in order to deals with coupled stochastic and deterministic homogenization problems in this type of spaces. Thus, this concept is a combination of both well-known $\Sigma$-convergence [Acta Math. Sinica, English Series 30(9) 1621-1654] and stochastic two-scale convergence in the mean schemes [Asympt. Anal. (2025) 142, 291-320]. An application to the stochastic-deterministic homogenization (in the context of ergodic $H$-supralgebra) of a class of highly oscillatory minimizations problems involving integral functionals with convex and nonstandard growth integrands is also given, and some concrete homogenization problems following varied structure hypothesis are deduce from this latter.
Read the full abstract

All authors Joel Fotso Tachago, Hubert Nnang, Franck Tchinda Takougoum, Jean Louis Woukeng

Geometric Topology

Floer homotopy type and eta invariants of Seifert $3$-manifolds fibering over $\mathbb{RP}^2$

We compute the Floer homology and Seiberg-Witten Floer homotopy type of Seifert rational homology $3$-spheres which fiber over $\mathbb{RP}^2$. We show that they are all $L$-spaces and their Floer homotopy type is a suspension of $S^0$. Additionally, we compute the Ozsváth-Szabó $d$-invariants, or equivalently the Seiberg-Witten $\delta$-invariants for such $3$-manifolds. This is done by computing the eta invariant of spin$^c$-Dirac operators associated to spin$^c$-connections covering the adiabatic connection, a certain metric connection distinct from the Levi-Civita connection. It turns out that this eta invariant involves a contribution given by the eta invariant of an orbifold pin$^c$-connection on the orbifold base of the Seifert fibration, which we also compute.
Read the full abstract

Functional Analysis

A Durrmeyer-type variant of Grünwald Interpolation Operators

In this paper, we construct a Durrmeyer-type variant of Grünwald interpolation operators on the space $L^p[0,{\pi}]$. We prove their fundamental properties, including boundedness and convergence in the $L^p$-norm. We establish the convergence results using a Korovkin-type theorem in the setting of Banach function spaces. Furthermore, we obtain quantitative estimates for the convergence by means of the modulus of continuity and an appropriate $K$-functional.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.SI

Canonical separating coordinates in the generalized cubic Hénon-Heiles systems

We study the three classical integrable generalized cubic Hénon–Heiles systems – Kaup–Kupershmidt, KdV$_5$, and Sawada–Kotera – from the viewpoint of bi-Hamiltonian geometry and separation of variables. On the standard symplectic manifold $T^*\mathbb R^2$, we construct compatible Poisson deformations $P_1=L_XP_0$, compute the associated recursion operators $N=P_1P_0^{-1}$, and analyze the action of $N^*$ on the codistribution generated by the first integrals. This yields the corresponding control matrices, whose eigenvalues provide the separating coordinates. For the generalized Kaup–Kupershmidt case we carry out the construction explicitly: we determine a deformation vector field, the compatible Poisson tensor, the torsionless recursion operator, the control matrix, the separating coordinates, and, crucially, the conjugate momenta. We then derive the separated relations and write the Hamilton equations in canonical separated variables, thus decomposing the original Hamiltonian system into two separated subsystems. To the best of our knowledge, this explicit derivation of the separating variables and, in particular, of the conjugate momenta for the generalized Kaup–Kupershmidt system is new. For the KdV$_5$ and Sawada–Kotera cases we show how the same bi-Hamiltonian scheme applies, emphasizing both the common geometric mechanism and the features peculiar to each system. In this way, the three generalized cubic Hénon–Heiles systems are treated within a unified framework based on compatible Poisson structures, recursion operators, control matrices, and Darboux–Nijenhuis coordinates.
Read the full abstract

Probability

Entrance measures and dynamics for time-inhomogeneous McKean-Vlasov stochastic differential equations

In this paper, we study the entrance measures of time-inhomogeneous McKean-Vlasov SDEs. The existence is obtained in great generality, where the system can be expanding globally and/or degenerate for numerous number of time intervals. When the parameters are periodic/quasi-periodic in time, we obtain the existence of periodic/asymptotic quasi-periodic measures. In this case, a double-lift of the random dynamical system first to a dynamical system on cylinder and then on the graph of reparameterized process living on the cylinder is introduced. The double-lifted system gives to a continuous dynamical system over probability measures on the cylinder, and the lifted multi-parameter measure of the asymptotic quasi-periodic measure can then lead to an invariant measure of the lifted semigroup.
Read the full abstract

Probability

Growing random planar network with oriented branching and fusion

We consider a growing planar network where a tip grows at constant speed, branches at constant rate and inactivates when it meets a branch already created. We only consider here orthogonal branching occurring always in the same direction. This yields a spatial branching property to the growing network. The connected components of the network then form a branching process of rectangles with double immigration. Using a spine approach for a typical rectangle and coupling arguments, the study is boiled down to a one dimensional stick breaking model with aging. We can then prove long time convergence of empirical measure of the family of rectangles after polynomial rescaling. The limiting distribution and speed of convergence can be explicitly described. The proofs also rely on the description of common ancestor of rectangles in the branching structure with double immigration.
Read the full abstract

Combinatorics

Counting sunflowers in hypergraphs with bounded matching number and Erdős Matching Conjecture in the $(t,k)$-norm

It is well known that Erdős Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. As a generalization, it is natural to ask for the maximum number of copies of subhypergraphs. Given integers $r\geq2$ and $k\ge 1$, let $S_{r-1,k}^r$ denote the $r$-uniform hypergraph with hyperedges $\{e_1, \dots, e_k\}$ such that there exists an $(r-1)$-set $T$ with $e_i \cap e_j = T$ for $1\le i < j \le k$. We determine the maximum number of copies of $S_{r-1,k}^r$ in an $r$-uniform hypergraph with bounded matching number, and characterize all extremal hypergraphs. An interesting phenomenon is that the extremal numbers and extremal hypergraphs are exactly the same for all $k\ge 1$. Our main tool is the shifting method. By establishing an injection, we prove that the shifting operation does not decrease the number of copies of $S_{r-1,k}^r$ for all $k\geq1$, thereby answering a question raised by Wang and Peng (2026). Moreover, we present a counting method for estimating the number of copies of $S_{r-1,k}^r$ in arbitrary $r$-uniform hypergraphs. Counting the number of copies of $S_{r-1,k}^r$ in $r$-uniform hypergraphs is closely related to Turán problems in the $(r-1,k)$-norm proposed by Chen, Il'kovič, León, Liu and Pikhurko. The $(r-1,k)$-norm of an $r$-uniform hypergraph $\mathcal{H}$ is the sum of the $k$-th power of the degrees $d_{\mathcal{H}}(T)$ over all $(r-1)$-subsets $T \subseteq V(\mathcal{H})$. Combining our established result with that of Frankl (2013), and utilizing the Newton expansion of powers and Stirling numbers of the second kind, we show that Erdős Matching Conjecture in the $(r-1,k)$-norm holds, which generalizes the result of Brooks and Linz concerning the $(r-1,2)$-norm case. As a consequence, we obtain a version of the classical Erdős–Ko–Rado theorem in the $(r-1,k)$-norm.
Read the full abstract

Optimization and Control · Cross-listed from eess.IV

Deep Image Prior for photoacoustic tomography can mitigate limited-view artifacts

We study the deep image prior (DIP) framework applied to photoacoustic tomography (PAT) as an unsupervised reconstruction approach to mitigate limited-view artifacts and noise commonly encountered in experimental settings. Efficient implementation is achieved by employing recently published fast forward and adjoint algorithms for circular measurement geometries. Initialization via a fast inverse and total variation (TV) regularization are applied to further suppress noise and mitigate overfitting. For comparison, we compute a classical TV reconstruction. Our experiments comprise simulated PAT measurements under limited-view geometries and varying levels of added noise as well as experimental measurements together with using a digital twin for quality assessment. Our findings suggest that DIP framework provides an effective unsupervised strategy for robust PAT reconstruction even in the challenging case of a limited view geometry providing improvement in several quantitative measures over total variation reconstructions.
Read the full abstract

All authors Hanna Pulkkinen, Jenni Poimala, Leonid Kunyansky, Janek Gröhl, Andreas Hauptmann

Group Theory

On minimal non-sofic and $\omega$-non-sofic groups

We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong structural restrictions. In particular, we show that if $G$ is a minimal non-sofic group and $M$ is a finitely generated residually finite maximal normal subgroup of $G$, then $M$ is central and $G$ is a perfect central extension of a finitely generated non-amenable simple group. On the other hand, we show that locally graded non-sofic groups are necessarily $\omega$-non-sofic. More precisely, such groups contain finitely generated non-sofic subgroups admitting strictly decreasing chains of finitely generated normal subgroups whose intersection is nontrivial and lies in the profinite residual. Finally, using results on existentially closed groups, we prove that the existence of a non-sofic group implies the existence of a countable existentially closed non-sofic group whose centralizers form a densely ordered chain of non-sofic subgroups of order type $(\mathbb{Q},\leq)$. In particular, we show that if a non-sofic group exists, then the class of $\omega$-non-sofic groups is non-empty. Moreover, we prove that the existence of a non-sofic group implies the existence of a non-sofic group of unbounded exponent.
Read the full abstract

Analysis of PDEs

Bifurcations in Isoperimetric Problems with Nonlocal Interactions

We study isoperimetric problems modeled on the liquid drop model, with nonlocal interactions under a volume constraint. While balls are natural critical points, we show that, for an unbounded sequence of radii, non-spherical solutions bifurcate from the family of balls. These new solutions lie arbitrarily close to balls and can have arbitrarily large volume. Conversely, at radii outside this sequence, no bifurcation occurs, and nearby solutions are trivial, arising only from rigid motions.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

The Flat Critical Branch Between Nariai and Bertotti-Robinson Geometries as a Solution of Cosmological Einstein-Maxwell Theory

We analyze a class of product geometries of the form $\mathbb{R}^{1,1}\times \Sigma_2$ supported by electric, magnetic, or dyonic flux in the Einstein-Maxwell-$\Lambda$ theory. These spacetimes belong to a unified family of direct products $(dS_2,\mathbb{R}^{1,1},AdS_2)\times \Sigma_2$ distinguished solely by the sign of the Lorentzian curvature of the two-dimensional factor. We focus on the critical configuration for which the Lorentzian curvature vanishes. At this balance point between the cosmological curvature and the Maxwell stress, the longitudinal geometry becomes exactly flat while the transverse sphere radius is fixed algebraically by the conserved flux. We refer to this geometry as the critical Maxwell flux string: a homogeneous flux-supported geometry curved only in the transverse directions and invariant along a two-dimensional null worldvolume. It represents the algebraic midpoint interpolating between the Nariai $(dS_2\times S^2)$ and Bertotti-Robinson $(AdS_2\times S^2)$ spacetimes. A qualitative structural change occurs precisely at this midpoint. The spacetime is Petrov type-D with constant scalar curvature invariants, placing it in the degenerate Kundt/CSI class. Because the curvature structure reduces any polynomial rank-two tensor to a linear combination of the metric and the Maxwell stress tensor, the same configuration solves a broad class of algebraic higher-curvature gravity theories. In this sense, the critical flux string and its aligned deformations constitute almost universal solutions.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

Analytical Extraction of Conditional Sobol' Indices via Basis Decomposition of Polynomial Chaos Expansions

In uncertainty quantification, evaluating sensitivity measures under specific conditions (i.e., conditional Sobol' indices) is essential for systems with parameterized responses, such as spatial fields or varying operating conditions. Traditional approaches often rely on point-wise modeling, which is computationally expensive and may lack consistency across the parameter space. This paper demonstrates that for a pre-trained global Polynomial Chaos Expansion (PCE) model, the analytical conditional Sobol' indices are inherently embedded within its basis functions. By leveraging the tensor-product property of PCE bases, we reformulate the global expansion into a set of analytical coefficient fields that depend on the conditioning variables. Based on the preservation of orthogonality under conditional probability measures, we derive closed-form expressions for conditional variances and Sobol' indices. This framework bypasses the need for repetitive modeling or additional sampling, transforming conditional sensitivity analysis into a purely algebraic post-processing step. Numerical benchmarks indicate that the proposed method ensures physical coherence and offers superior numerical robustness and computational efficiency compared to conventional point-wise approaches.
Read the full abstract