Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 3 May

Operator Algebras

Factors with prescribed number of invariant subalgebras not arising from subgroups

For any given integer $n\geq 1$, we construct i.c.c. groups $G$ such that the II$_1$ factors $L(G)$ have exactly $n$-many $G$-invariant von Neumann subalgebras not arising from subgroups.

Information Theory

Walsh Spectrum and Boomerang Properties of Locally-APN Niho Functions

Recently, the Walsh spectrum and boomerang properties of special power functions have aroused widespread research interest, owing to their important applications in cryptography and information security. In particular, locally-APN functions may offer superior resistance against differential cryptanalysis compared to other functions of equivalent differential uniformity. Up till now only a small number of locally-APN functions have been studied. In this paper, we show that a Niho type power function is locally-APN if and only if its Walsh spectrum takes four values in \(\{-p^m, 0, p^m, 2p^m\}\). Equivalently, the associated cyclic codes have four nonzero weights: $p^{m-1}(p-1)(p^m + k)$ for $k = 0, 1, -1, -2$. Moreover, we also study properties of Niho type locally-APN power functions, including their differential spectrum, Walsh spectrum, Feistel Boomerang Connectivity Table(FBCT for short) and second-order zero differential spectra.
Read the full abstract

Rings and Algebras

Poisson $n$-Lie algebras: constructions and the structure of solvable algebras

In this paper, we develop a construction of Poisson $n$-Lie algebras that generalizes the Jacobian $n$-Lie construction. Using the Grassmann–Plücker relations, we derive necessary and sufficient conditions under which the resulting bracket defines a Poisson $n$-Lie algebra. We also prove that suitable quotients of tensor products of Poisson algebras carry natural Poisson $n$-Lie structures. Conversely, we give a tensor-type procedure that associates a Poisson algebra to a given Poisson $n$-Lie algebra. The quotient and converse constructions thus provide two systematic methods for relating Poisson algebras to Poisson $n$-Lie algebras. We further establish analogues of Engel's theorem and Lie's theorem and characterize solvability and nilpotency of Poisson $n$-Lie algebras in terms of their underlying associative and $n$-Lie structures. We introduce hypo-nilpotent ideals and investigate maximal such ideals in finite-dimensional solvable Poisson $n$-Lie algebras. Finally, we prove that the generalized eigenspaces of multiplication operators are ideals.
Read the full abstract

Probability · Cross-listed from q-bio.PE

Emergent population dynamics of random walkers with cooperative reproduction and spatial selection

We extend the $N$ branching Brownian motions model of population invasion to higher-order asexual reproduction. Increasing reproduction order leads to qualitative changes: invasion fronts generically cease to exist beyond binary reproduction; and in the binary case itself, their speed becomes diffusion-independent. Ternary reproduction shows critical behavior, with collapse into a strongly localized `invasion bullet' in the supercritical regime, diffusive spreading in the subcritical regime, and a continuous family of fronts at criticality. These results suggest that the dominance of division and binary reproduction in nature reflects fundamental constraints on invasion dynamics.
Read the full abstract

Combinatorics

Hypergraph extensions of the Alon–Frankl Theorem and rainbow Turán problems

Given a graph $F$, the $r$-expansion $F^{(r)+}$ of $F$ is the $r$-uniform hypergraph obtained from $F$ by inserting $r-2$ new distinct vertices in each edge of $F$. Recently, Alon and Frankl (JCTB, 2024) and Gerbner (JGT, 2023) studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. Gerbner, Tompkins and Zhou (EJC, 2025) considered the analogous Turán problems on hypergraphs with bounded matching number. In this paper, we study hypergraph extensions of the Alon–Frankl Theorem. More precisely, we determine the maximum number of hyperedges in an $n$-vertex $r$-uniform hypergraph containing neither a matching $M^r_{s+1}$ nor the expansion $K_{\ell+1}^{(r)+}$ of the clique $K_{\ell+1}$ for all small $s<\frac{\ell^2-1}{2}$ and all sufficiently large $s$, respectively. This result partly confirms a conjecture proposed by Gerbner, Tompkins and Zhou (EJC, 2025). As a key tool, we determine the rainbow hyper-Turán number for expansions of cliques, which is defined as the maximum sum of size of a sequence of hypergraphs $\mathcal{H}_1,\dots,\mathcal{H}_k$ that contains no rainbow copies of expansions of cliques with given size. It extends the result of Keevash, Saks, Sudakov and Verstraëte (AAM, 2004), which determined the rainbow Turán number of cliques in the graph case. These results shows a correlation between the hyper-Turán problem and the rainbow hyper-Turán number.
Read the full abstract

Numerical Analysis

Error analysis of a divergence-preserving mixed finite element scheme for the incompressible Hall–magnetohydrodynamic equations

The incompressible Hall-magnetohydrodynamics (Hall–MHD) system presents substantial analytical and computational challenges due to its stiff, highly nonlinear Hall term and the strict requirement that the magnetic field remains solenoidal. In this paper, we study a Voigt-regularised Hall–MHD system, which is of independent analytical interest and provides a physically consistent, well-posed regularisation of the original model. We propose, analyse, and implement a structure-preserving, linear, fully discrete finite element method for this regularised problem. Using finite element exterior calculus and a mixed formulation, the spatial discretisation enforces the divergence-free condition on the magnetic field exactly, while a skew-symmetric, linearly implicit time discretisation yields unconditional energy stability. We establish optimal convergence rates for the Voigt-regularised problem and, additionally, derive error estimates for the unregularised Hall–MHD system, with the Voigt regularisation playing a crucial role in the non-resistive regime. Finally, numerical simulations in both 2.5D and 3D corroborate the theoretical results and demonstrate the physical fidelity of the scheme.
Read the full abstract

Combinatorics

Two-place Laplacian matching root integral variations are impossible

Wang, Cui, and Cioabă introduced the Laplacian matching root integral variation of a graph and proved that it cannot occur in one place. They also showed that the two-place variation is impossible for connected graphs satisfying $g(G)/c(G)>7/6$, where $g(G)$ is the girth and $c(G)$ is the dimension of the cycle space, and conjectured that no connected graph admits such a two-place variation. In this paper, we confirm this conjecture. The proof combines a structural relation obtained in their paper with two new power-sum identities for Laplacian matching roots.
Read the full abstract

Information Theory · Cross-listed from cs.GT

The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions

Existing auto-bidding algorithms in digital advertising often treat the value of an ad opportunity as the revenue obtained when an ad is shown and/or clicked, and bid accordingly. This can lead to wasteful spending because the true value is the marginal gain from paid exposure: even without winning a sponsored slot, an advertiser may still earn revenue via an organic search result (e.g., on Google or Amazon). Motivated by recent work, we model ad value as a treatment effect–the outcome difference between winning and losing the auction–and study online learning for bidding in second-price (Vickrey) auctions under this causal perspective. We develop algorithms that attain rate-optimal regret under several feedback models. A key ingredient exploits the information revealed by the second-price payment rule, which strictly improves regret relative to analogous learning problems in first-price auctions.
Read the full abstract

All authors Yuxiao Wen, Zihao Hu, Yanjun Han, Yuan Yao, Zhengyuan Zhou

Dynamical Systems

A Perron-Volterra Lyapunov function for mathematical epidemiology reaction networks (MERN) with non-interacting rank-one strains

This paper introduces a general framework for analyzing global asymptotic stability (GAS), competitive exclusion, coexistence, and persistence in mathematical epidemiology reaction networks. The authors construct Perron-Volterra Lyapunov functions to yield competitive-exclusion GAS partitions of the parameter space. This applies to bilinear m-strain models with non-interacting, irreducible rank-one infection blocks. The parameter space splits into at most m+1 generic partition sets where either the disease-free equilibrium (DFE) is GAS, or one dominant strain is GAS. Coexistence only occurs on non-generic tie surfaces with equal reproduction numbers. The method integrates chemical reaction networks and mathematical epidemiology through five pillars: * Siphon Sets: Forward-invariant boundary faces are defined by siphon sets, with the DFE face being the intersection of minimal siphons. * Metzler Jacobians: Transversal blocks on siphon faces are Metzler, emphasizing their Perron eigenvectors. * Next-Generation Matrices: Defined via regular splittings on siphon faces to determine invasibility via spectral radii. * Invasion Relays: Link eigenvalue crossings to emergent positive branches. * Lyapunov Construction: Combines Volterra entropy for resident variables with Perron-weighted linear functionals for invading blocks. A second GAS partition is provided for two-strain models with increasing concave incidence. The approach is algorithmically implemented in the Mathematica package EPIDCRN to recursively compute eigenvectors and build Lyapunov functions.
Read the full abstract

All authors Adenane Rim, Avram Florin, Miruna Beldiman, Halanay Andrei-Dan

Combinatorics

A bibasic double sum extension of a $q$-binomial theorem arising out of subspace enumeration

We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.

Combinatorics

Vertex-primitive $s$-arc-transitive Cayley digraphs

Determining an upper bound on $s$ for vertex-primitive $s$-arc-transitive digraphs has been an open problem of considerable interest since a question asked by Praeger in 1990. Although much progress has been made and an upper bound is conjectured to be $2$, a complete classification for $s=2$ remains out of reach. In this paper, we prove that the tight upper bound on $s$ for finite vertex-primitive $s$-arc-transitive Cayley digraphs is exactly $2$. Furthermore, we completely characterize the structure of these digraphs when $s=2$.
Read the full abstract

All authors Jing Jian Li, Yong Tang Shi, Yu Wang, Binzhou Xia

Algebraic Geometry

Fixed point locus of Moduli spaces of Sheaves on Toric DM stacks

Extending work of Klyachko, Perling and Kool we develop a combinatorial description of torsion free toric sheaves in any dimension on smooth toric DM stacks. We investigate their basic properties and under certain conditions recover some known results on smooth toric varieties. The action of the torus lifts to the moduli of torsion free modified Gieseker stable sheaves on the smooth DM stack, and we express its fixed point locus explicitly in terms of certain finer invariants called characteristic functions. These techniques will be exploited to compute topological invariants of the moduli of modified stable torsion free sheaves on smooth toric DM stacks.
Read the full abstract

Algebraic Topology

Weights of circle actions on oriented manifolds with isolated fixed points

For an action of the circle group $S^1$ on a compact oriented manifold with isolated fixed points, there is a claim that weights at the fixed points occur in pairs. This phenomenon holds for other types of $S^1$-manifolds, e.g., (almost) complex, symplectic, and unitary manifolds. A known proof of this claim assumes that the isotropy submanifolds are orientable. However, this assumption does not hold in general. In this note, we prove the claim without relying on that assumption.
Read the full abstract

Analysis of PDEs

Stability estimates for systems of nonlocal balance laws with memory

In this work, we investigate entropy solutions for a class of systems of nonlocal {balance laws in which the convective flux and the source involves terms where the state variable convolved with kernels} in both spatial and temporal variables. This formulation captures the dependence of the flux on the solution within its spatial neighborhood (spatial nonlocality) as well as on its past states (temporal nonlocality), thereby incorporating memory effects. The resulting systems are coupled through these nonlocal interactions. We establish stability estimates for entropy solutions with respect to perturbations in the flux, the spatial and temporal kernels, and the initial data for the corresponding initial value problems. Finally, we present numerical experiments to illustrate the theoretical results and to highlight the influence of memory and source terms on the solution dynamics.
Read the full abstract

All authors Aekta Aggarwal, N. K. Aswini, Sarvesh Kumar, Ganesh Vaidya

Differential Geometry

Equiaffine immersion, projective flatness and quasi-Codazzi structure

In the present paper, we study an extended theory of statistical manifolds in application to affine differential geometry. Any smooth hypersurface $M \subset \mathbb{R}^{n+1}$ with a transverse vector field $\xi$ naturally admits a symmetric $(0, 2)$-tensor $h$ and a torsion-free connection $\nabla$ on $M$ so that $\nabla h$ is totally symmetric. Here $h$ may be degenerate (i.e., not a pseudo-Riemannian metric) in general. As a generalization of classical theorem due to Weyl, Radon, Nomizu, Kurose and others, we show, roughly saying, that $M$ with $\xi$ is equiaffine if and only if $(h, \nabla)$ defines a quasi-Codazzi structure, previously introduced by the author, and it admits a projectively flat dual connection with symmetric Ricci contraction. This is a direct consequence from our quasi-Codazzi theory, which is built in a more general context as a submanifold theory in para-Hermitian geometry.
Read the full abstract

Quantum Algebra

Relative braid group symmetries on quantum supersymmetric pairs of type sAIII

We introduce the relative Coxeter groupoid and construct intrinsic relative braid group symmetries for quantum supersymmetric pairs of type sAIII. These symmetries are constructed by establishing new intertwining properties of quasi $K$-matrices, which generalize the earlier non-super construction of Wang and the second author. We derive explicit formulas for these symmetries and prove that they satisfy the braid relations in the relative Coxeter groupoid.
Read the full abstract

Analysis of PDEs

Relaxation dynamics of the Inertial Winfree model

We prove two synchronization theorems for the second-order (inertial) Winfree model of coupled oscillators. The first result is a pathwise oscillator-death theorem with explicit smallness thresholds on the natural frequencies, initial velocities, and inertia, scaling as $R_0^{3/2}$ in the initial order parameter $R_0$. The second result is a qualitative zero-inertia synchronization statement: under generic initial data, if the intrinsic and initial velocity spreads are small compared to $\kappa$ and the inertia $m$ is small, then the limiting order parameter can be made arbitrarily close to 2. The proof of the first result is organized around three mechanisms, namely inertial gradient flow and the Łojasiewicz theorem, an initial layer argument, and an order-parameter bootstrapping argument. The proof of the second result involves approximation to the first-order case via a quantitative Tikhonov theorem.
Read the full abstract

Combinatorics

On tree decompositions whose trees are subgraphs

Fix $k \in \mathbb{N}$ and let $G$ be a connected graph with treewidth at most $k$. We say that $xy \notin E(G)$ is a {\em $k$-ghost-edge} of $G$ if for every tree decomposition $(T, \cB)$ of $G$ with width at most $k$, both $x$ and $y$ are contained in a bag of $(T, \cB)$. Moreover, if $G$ does not contain any $k$-ghost-edges, then $G$ is {\em $k$-ghost-free}. Hickingbotham proposed a conjecture that every connected $k$-ghost-free graph $G$ has a tree decomposition $(T, \cB)$ with width at most $k$ such that $T$ is a subgraph of $G$. In this paper, we prove that Hickingbotham's conjecture is false for all $k\geq3$.
Read the full abstract

Number Theory

Numbers in a Beatty sequence which are orders only of cyclic, abelian or nilpotent groups

Let \(C(x)\), \(A(x)\), and \(N(x)\) denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding \(x\), respectively. Their asymptotic formulas have been established in recent work by Pollack and Just. In this paper, by adapting the methods of Pollack and Just, we study the distribution of these numbers in Beatty sequences \(\mathcal{B}_{\alpha,\beta} = ([\alpha n + \beta])_{n=1}^{\infty}\), where \(\alpha > 1\) is an irrational number of finite type and \(\beta\) is a fixed real number. We prove that the counting functions \(\#C^*(x)\), \(\#A^*(x)\), and \(\#N^*(x)\) for cyclic, abelian, and nilpotent numbers in Beatty sequences satisfy asymptotic formulas that differ from those of Pollack and Just only by a factor \(1/\alpha\).
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Adaptive Targeted Maximum Likelihood Estimation of the Mean Potential Outcome under a Treatment Rule

Estimating the mean counterfactual outcome under a treatment rule is a central problem in causal inference and policy evaluation. Standard estimators, including inverse probability weighting (IPW), augmented IPW (AIPW), and targeted maximum likelihood estimation (TMLE), can become unstable under practical positivity violations because their targeting or weighting steps depend on inverse propensity scores. We propose an adaptive targeted maximum likelihood estimation (A-TMLE) framework that uses a data-adaptive working model for the conditional average treatment effect (CATE). This working model induces a projected policy-value parameter, which coincides with the nonparametric mean potential outcome when the CATE is well represented by the adaptive basis. We derive the efficient influence function for the projected parameter and characterize its second-order remainder. We also introduce a regularized TMLE that targets the nonparametric policy value using a stabilized targeting covariate obtained by projecting the standard TMLE clever covariate onto the score space induced by the CATE working model. We quantify the first-order plug-in bias of regularized TMLE relative to the nonparametric target. The resulting targeting steps avoid direct inverse propensity score weighting, improving stability under limited overlap. In simulations, A-TMLE and regularized TMLE achieve lower mean squared error and improved coverage compared with IPW, AIPW, and standard TMLE under practical positivity violations, while remaining competitive when treatment overlap is strong. A real-data application to the Right Heart Catheterization study illustrates that the adaptive estimators produce stable policy-value estimates with substantially shorter confidence intervals than IPW and AIPW.
Read the full abstract

Numerical Analysis

Maxwell à la Helmholtz: Direct boundary integral equations for 3D scattering by perfect electric conductors via Helmholtz operators

This paper is the direct-formulation companion to [Burbano-Gallegos, Pérez-Arancibia, and Turc, ESAIM: M2AN, 60(1):273–315, 2026], which developed indirect combined-field-only boundary integral equations (BIEs) for time-harmonic electromagnetic scattering by smooth perfectly electrically conducting (PEC) obstacles, relying entirely on Helmholtz boundary integral operators. Here we exploit the same equivalence between the Maxwell PEC scattering problem and a pair of vector Helmholtz boundary value problems – one for the electric field and one for the magnetic field – to derive direct BIE formulations whose unknowns are the Dirichlet and Neumann traces of the total fields, decomposed into their normal and tangential surface components. These unknowns carry direct physical meaning: in particular, the magnetic-field formulation yields the surface electric currents as part of its solution. The mixed regularity of the two field-trace components requires introducing a tailored product Hölder space, a distinctive feature absent from the indirect approach. We prove that the resulting Direct Electric and Magnetic Combined-Field-Only Integral Equations (D-ECFOIE and D-MCFOIE) are uniquely solvable at all frequencies, and introduce Calderón-type regularizations (RD-ECFOIE and RD-MCFOIE) that render them of the Fredholm second kind. We further examine the low-frequency breakdown affecting the electric-field formulation and introduce a modified equation that enforces the physical charge-conservation constraints, which restores numerical accuracy and well-conditioned linear systems for frequencies arbitrarily close to zero. Numerical experiments, performed using a high-order Nyström solver based on the Density Interpolation Method and implemented in the Julia package Inti.jl, validate the accuracy and robustness of the proposed formulations across a range of geometries and frequencies.
Read the full abstract

Classical Analysis and ODEs

The strong version of nonlinear Carleson conjecture fails

In the context of the Dirac equation with square-summable potential, we study the Jost solutions and prove that the maximal function associated with the argument of the transmission coefficient is unbounded. We also show that the strong version of the nonlinear Carleson conjecture fails for Dirac equations and Krein systems.
Read the full abstract

Classical Analysis and ODEs

Exact Loop Controllers for ReLU Realization of Homogeneous Curve Refinements

We study homogeneous refinement operators \((V\gamma)(t)=\sum_{j\in\mathbb Z}A_j\gamma(Mt-j)\), acting on compactly supported continuous piecewise linear curves \(\gamma:\mathbb R\to\mathbb R^p\), where \(M\ge2\) and only finitely many matrices \(A_j\in\mathbb R^{p\times p}\) are nonzero. We prove that the iterates \(V^n\gamma\) admit exact ReLU realizations of fixed width and depth \(O(n)\). The main new ingredient is an exact loop controller for the residual dynamics. Instead of propagating scalar residual surrogates, the construction transports the residual orbit by a forward-exact state on a polygonal loop. Scalar factors and digit selectors are then recovered from this loop state by complementary CPwL readouts. The loop seam is not removed, but its remaining ambiguity is confined to the final readout/selector stage, where it is harmless because the scalar atom is supported away from the seam. This gives a homogeneous \(M\)-ary vector-valued extension of the scalar binary refinable-function construction with a more geometric controller architecture. We also record crude exponential bounds on the network weights and biases. Affine forcing terms are handled by expanding affine iterates into finite sums of homogeneous iterates, giving exact fixed-width realizations with depth \(O(n^2)\), and anchored open curves reduce to compactly supported defects with affine anchor mismatch. We also describe homogeneous polygonal generators, including dragon-type examples and a self-intersecting Hilbert-type prototype in arbitrary dimension. The extended version includes stage-dependent forcing, finite-state stacking reductions, and further geometric constructions such as Koch-, Gosper-, Morton-, and connector-based Hilbert-type variants.
Read the full abstract

Functional Analysis · Cross-listed from cs.CR

Limit Properties at Critical Indices of Linear Canonical Riesz Potentials and Their Applications to Security of Multi-Image Encryption

In this article we introduce the linear canonical Riesz potential (for short, LCRP) and give its symbol in terms of linear canonical transforms. Driven by image processing, we establish the convergence/divergence of these LCRPs for different kinds of functions. Concretely, for grating functions, we prove that their classical Riesz potentials diverge, whereas their LCRP converge due to the key role of chirp functions. For the characteristic function ${\mathbf 1}_P$ of a convex polygon $P$, we show that the limit of its Riesz potential at any non-boundary point $\boldsymbol{x}$ equals ${\mathbf 1}_P(\boldsymbol{x})$, but its limit at the boundaries differ from ${\mathbf 1}_P$, while it is known that, for any Schwartz function $f$, the limit of its Riesz potential at any point $\boldsymbol{x}$ always equals $f(\boldsymbol{x})$. Based on these and the inverse operator of the LCRP (namely the linear canonical Laplacian operator), we propose an asymmetric cascaded LCRP method for the multi-image encryption and create an efficient and secure cryptosystem. Systematic security evaluations, including sensitivity, statistical, noise attack, and occlusion attack analyses, demonstrate its robustness and its security. Even for a single image, the proposed method is more efficient than the known encryption approach based on the fractional Riesz potential. The novelty of these results lies in that the convergence and the divergence of LCRTs at the critical indices, respectively, for “good" Schwartz functions and for “bad" discrete image functions essentially affect the security of image encryption and decryption.
Read the full abstract

Number Theory

Archimedean arithmetic Siegel–Weil formula for general weights over Shimura curves

We prove an averaging formula for the canonical archimedean height pairing of special divisors with weights over orthogonal and unitary Shimura curves in terms of derivatives of Whittaker functions.

Saturday 2 May

Probability · Cross-listed from cs.AI

Right-Sizing Communication and Recommendation Set Size in AI-Assisted Search

We model the interaction between a user and an AI driven recommendation system. The user initiates the process by conveying preference information through a costly and noisy message. The AI assistant, acting as a Bayesian agent, interprets the user's message to form a posterior belief about their true preferences and make product recommendations. In particular, it determines how many recommendations to present so as to maximize the user's expected utility from their final choice, while accounting for the search cost induced by the size of the recommendation set. We use mutual information based cost functions to model the two distinct costs incurred by the user during the interaction: (i) a communication cost, which increases with the precision of their preference message, and (ii) a search cost, which increases with the size of the recommendation set provided by the AI assistant. We study products and preferences which live in d dimensional space, and ask how the user's expected payoff can be maximized. For large d, we characterize how optimal message precision and recommendation set size depend on the cost parameters, under two distinct distributions from which recommendations can be sampled from the product universe: (i) Bayes' posterior belief, and (ii) an optimized tilted distribution. Under the posterior sampling scheme (i), we identify a hybrid regime, in which an efficient interaction policy requires jointly optimizing the amount of information (in bits) conveyed by the user and the number of recommendations provided by the AI assistant. In the tilted sampling scheme (ii), our results show that the optimal interaction policy uses only one of communication and search, favoring whichever of them is less costly.
Read the full abstract

General Mathematics

A Quadratic-Form Representation of the Scalar Casimir Trace from Codimension-Three Riesz Reduction

Under a prescribed heat-regularized Gaussian source covariance, we give a quadratic-form representation of the scalar Casimir trace associated with a codimension-three Riesz reduction. For a product operator $L_M=L_B-\Delta_\perp$, with $L_B$ positive self-adjoint and bounded below, transverse reduction of the ambient Riesz operator $L_M^{-s}$ produces the brane multiplier $L_B^{m/2-s}$, up to an explicit Gamma-function constant. The exponent $s=1+m/2$ is therefore the critical Riesz exponent for obtaining the ordinary brane Green operator $L_B^{-1}$; in codimension three this gives $s=5/2$. Using this induced Green kernel, we prescribe a Gaussian generalized scalar source with covariance proportional to $L_B^{3/2}e^{-\tau L_B}$. The expectation of its quadratic Green-kernel energy is then exactly the heat-regularized scalar Casimir trace \[ \frac{\hbar c}{2} \operatorname{Tr}\!\left(L_B^{1/2}e^{-\tau L_B}\right). \] With the same finite-part prescription, the identity specializes in the Dirichlet parallel-plate geometry to the standard scalar finite part. We also record a deterministic flat Green-energy calibration at the plate scale. Within the plate-compatible rectangular aspect-ratio family, the cubical cell is selected by spectral, heat-trace, and Green-energy extremal criteria, and the associated comparison coefficient is the corresponding extremal calibration value. The construction is a scalar spectral representation theorem; no electromagnetic, gravitational, brane-dynamical, or fundamental-constant identification is asserted.
Read the full abstract

Probability · Cross-listed from cond-mat.stat-mech

Breakdown of Adiabatic Scaling and Noise-induced Functional Synchronization in Deeply Quiescent Excitable Systems

Coherence resonance (CR) characterizes noise-induced regularity in excitable systems, yet its evaluation in quiescent biological media is often obscured by flattened energy landscapes and complex nonlinear dynamics. In this study, we investigate the stochastic dynamics of a 3D Sherman-Rinzel-Keizer (SRK) model driven by multiplicative Feller noise. We show that traditional extremal evaluations of CR encounter a "bathtub effect", a broad resonance valley that can lead to statistical inaccuracies. To address this, we propose a logarithmic centroid extraction method, which filters out stochastic jitter and recovers the underlying adiabatic Kramers scaling with high linearity. Furthermore, we identify the physical boundary where this adiabatic approximation breaks down under the strong-noise limit. Extending our analysis to gap-junction coupled systems, we observe a noise-induced transition from sub-threshold physiological shivering (characterized by statistical correlation but negligible functional output) to macroscopic functional synchronization. Our results provide a mathematical framework for extracting optimal noise intensities in broad energy valleys and offer insights into how quiescent biological systems utilize stochastic fluctuations for functional recovery.
Read the full abstract

Commutative Algebra

The $i$-extended ideal-based cozero-divisor graph of a commutative ring

Let R be a commutative ring with identity and let J be an ideal of R. In this paper, we introduce and investigate the notion of the i-extended ideal-based cozero-divisor graph of R. This graph, denoted by $\overline{\Gamma''}_{Ji}(R)$, is a simple graph of R whose vertex set is ${x \in R \ J : xR + J \not= R}$. Two distinct vertices $x$ and $y$ are adjacent if and only if $x^m \not \in y^nR+J$ and $y^n \not \in x^mR+J$ for some positive integers m and n with $n\leq i$ and $m\leq i$.
Read the full abstract

Functional Analysis

Dissipation and c-Entropy in Nevanlinna-Pick Interpolation

We study interpolation L-systems realizing finite Nevanlinna-Pick data sets and analyze their structural and quantitative characteristics. Explicit formulas are derived for the c-entropy and dissipation coefficient, two intrinsic invariants that describe the dissipative structure of interpolation L-systems. These quantities depend only on the geometric placement of interpolation nodes in $\mathbb{C}_+$, attaining maximal finite values for purely imaginary nodes. The interpolation model $\Theta_\Delta$ and its unitary equivalents reveal that these invariants form a direct link between analytic interpolation data and the dynamical properties of L-systems. Particular attention is given to symmetric configurations, where the impedance function admits an explicit rational representation and a natural physical interpretation in terms of equivalent $LC$-networks.
Read the full abstract