Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 21 March

Optimization and Control · Cross-listed from cs.LG

Centrality-Based Pruning for Efficient Echo State Networks

Echo State Networks (ESNs) are a reservoir computing framework widely used for nonlinear time-series prediction. However, despite their effectiveness, randomly initialized reservoirs often contain redundant nodes, leading to unnecessary computational overhead and reduced efficiency. In this work, we propose a graph centrality-based pruning approach that interprets the reservoir as a weighted directed graph and removes structurally less important nodes using centrality measures. Experiments on Mackey-Glass time-series prediction and electric load forecasting demonstrate that the proposed method can significantly reduce reservoir size while maintaining, and in some cases improving, prediction accuracy.
Read the full abstract

Functional Analysis

Nuclear Weighted composition operators between different $L^p$-spaces

We provide complete characterisations of nuclear weighted composition operators between two distinct $L^p(\mu)$-spaces, where $1\leq p<\infty$. As a consequence, when the underlying measure space is non-atomic, the only nuclear weighted composition operator between $L^p(\mu)$-spaces is the zero operator.
Read the full abstract

Functional Analysis

Nuclear weighted conditional expectation operators

We provide a characterisations of nuclear weighted conditional expectation operators between different $L^p(\mu)$-spaces. As a consequence, when the underlying measure space is non-atomic, the only nuclear weighted conditional expectation operator between different $L^p(\mu)$-spaces is the zero operator.
Read the full abstract

Analysis of PDEs

Approximation Analysis of a Parabolic-Parabolic Chemotaxis Model with Logarithmic Nonlinearity

We consider the Keller-Segel system with logical source \begin{align*} \begin{cases} u_t = \nabla \cdot (\phi(u)\nabla u) - \nabla \cdot (\psi(u)\nabla v)+f(u), & x \in \Omega, \; t > 0, v_t = \Delta v - v + u, & x \in \Omega, \; t > 0, \end{cases} \end{align*} in a smooth bounded domain \(\Omega \subset \mathbb{R}^n\) with \(n \geq 2\), the Neumann initial-boundary value problem admits a globally defined, uniformly bounded classic solution for all sufficiently regular non-negative initial data \(u_0\) and \(v_0\). In the first equation, assume that \(\phi\) and \(\psi\) are dominated by a logarithmic function and a polynomial respectively. The logical source \(f\) representing the natural growth and decay of cells satisfies \(f \in W^{1,\infty}_{\mathrm{loc}}(\Omega)\) and \(f(0) \geq 0\). Then we will see that the unique solution \(u \in C^{2,1}((\overline{\Omega}) \times [0,T] )\) and \(v \in W^{1,q}([0,T] ; C^{2,1}(\overline{\Omega}))\).
Read the full abstract

All authors Shijun Li, Yashuang Zhao, Shaopeng Xu, Shengjun Li

Statistics Theory · Cross-listed from stat.ME

Continuity of the Solution of a Non-Parametric Bayesian Statistical Calibration Procedure

Recent work has developed a non-parametric Bayesian approach to the calibration of a computer model, which abstractly amounts to the inversion of a pushforward of stochastic input parameters by a smooth map. The framework has been used in several complex scientific applications, motivating our investigation on the continuity of the solution operator with respect to the distribution on the input parameters. We demonstrate that the solution operator for this approach is uniformly continuous in the total variation metric and weakly continuous for a broad class of distributions.
Read the full abstract

Algebraic Geometry

Lagrangian classes in K-theory

For a $(-1)$-shifted Lagrangian in a critical locus, we construct a homomorphism from the $K$-group of matrix factorisations of the critical locus to the $K$-group of the Lagrangian, partially answering the Joyce-Safronov conjecture. The key step is the construction of a specialisation functor for categories of matrix factorisations along the deformation to the normal cone. Any $(-2)$-shifted symplectic space is a $(-1)$-shifted Lagrangian of a point, whose $K$-group is $\mathbb{Z}$. The image of $1\in \mathbb{Z}$ under the above homomorphism is the virtual structure sheaf. We prove that two equivalent critical models of a given critical locus induce homomorphisms that commute via Knörrer periodicity. When a torus acts on the Lagrangian, we further prove a localisation formula, namely the commutativity of the homomorphisms associated with the Lagrangian and its fixed locus.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

Sinkhorn Based Associative Memory Retrieval Using Spherical Hellinger Kantorovich Dynamics

We propose a dense associative memory for empirical measures (weighted point clouds). Stored patterns and queries are finitely supported probability measures, and retrieval is defined by minimizing a Hopfield-style log-sum-exp energy built from the debiased Sinkhorn divergence. We derive retrieval dynamics as a spherical Hellinger Kantorovich (SHK) gradient flow, which updates both support locations and weights. Discretizing the flow yields a deterministic algorithm that uses Sinkhorn potentials to compute barycentric transport steps and a multiplicative simplex reweighting. Under local separation and PL-type conditions we prove basin invariance, geometric convergence to a local minimizer, and a bound showing the minimizer remains close to the corresponding stored pattern. Under a random pattern model, we further show that these Sinkhorn basins are disjoint with high probability, implying exponential capacity in the ambient dimension. Experiments on synthetic Gaussian point-cloud memories demonstrate robust recovery from perturbed queries versus a Euclidean Hopfield-type baseline.
Read the full abstract

Dynamical Systems

Polynomial Random Dynamical Systems with Complete Connections and the Probability of Tending to Infinity

We study polynomial random dynamical systems with complete connections on the Riemann sphere. In this framework, the choice of the next polynomial map is governed by a state-dependent rule that may have memory. This framework includes i.i.d. random dynamics and non-i.i.d. Markovian models as special cases. For each initial state, we define the probability that the corresponding random orbit tends to infinity. We prove that this escaping probability is locally constant on the Fatou set and becomes continuous on the whole Riemann sphere when all kernel Julia sets are empty. We also formulate the associated product-space transition operator and use it to obtain continuity with respect to both the spatial and state variables. We further introduce stationary-averaged escaping probabilities with respect to stationary distributions of the induced state chain. Under the same kernel-emptiness assumption, these averaged escaping probabilities are continuous. We also give a sufficient condition under which the stationary-averaged escaping probability is everywhere positive and not identically equal to 1. Finally, we present examples illustrating phenomena specific to this framework, including reinforcement-induced discontinuity, recovery of continuity under truncation, and genuinely mixed escaping behavior produced by stationary averaging.
Read the full abstract

Analysis of PDEs

Global conservative weak solutions and global strong solutions for a class of weakly dissipative nonlinear dispersive wave equations

In this paper, we study the global existence of solutions of the Cauchy problem for a class of weakly dissipative nonlinear dispersive wave equations $u_t-u_{xxt}+(f\left(u\right))_x-(f\left(u\right))_{xxx}+\left(g\left(u\right)+\frac{f^{\prime\prime}\left(u\right)}{2}u_x^2\right)_x+\lambda\left(u-u_{xx}\right)=0$. This includes the weakly dissipative Camassa-Holm equation and the weakly dissipative hyperelastic rod wave equation as special cases. Specifically, we establish three global existence results: one concerning the energy conservative weak solutions in a time-weighted $H^1$ space, and the other two concerning strong solutions, which include the cases of small initial data and sign-changing initial data. Our results recover and extend many known results for several classical models.
Read the full abstract

Information Theory · Cross-listed from cs.NI

Hierarchical Reinforcement Learning for Next Generation of Multi-AP Coordinated Spatial Reuse

In next generation of Wi-Fi networks Multiple Access Point Coordination (MAPC) is poised to significantly enhance the network performance by enabling a set of Access Points (APs) to coordinate with each other through advanced coordinating schemes so that to reduce inter-AP contention and congestion. This paper focuses on defining a framework to facilitate the coordination across multi-APs when these employ Coordinated Spatial Reuse (C-SR). In this case, the coordinating APs may need to reciprocally adjust their scheduling strategy, power control and link adaptation to meet specific Quality of Service (QoS) requirements, which by using classical approaches leads to high overhead due to negotiations needed across APs, and requires complex solutions in order to properly optimize the network across all the parameters in play. In this matter, a two layer Multi-Armed Bandit (MAB) algorithm has been proposed to optimize such a network while preserving the fair use of resources across all nodes. The validity of this holistic approach is confirmed by system level simulations, which show that the proposed algorithm not only improves the network in terms of sum-throughput, but also allows to enhance fairness, making this a robust solution for next-generation of Wi-Fi networks.
Read the full abstract

All authors Ziru Chen, Salvatore Talarico, Qing Xia, Xihan Peng, Xing Hao, Lin X. Cai

Representation Theory

Singular equivalences and homological conjectures

The fact that each finite-dimensional algebra over a field is isomorphic to the centralizer of two matrices, has suggested to investigate representation theoretical problems of finite-dimensional algebras through the centralizer algebras of matrices. Therefore the first natural question is to study the problems for the centralizer algebra of one matrix, called a centralizer matrix algebra. In this paper we give an elementary and explicit approach to the singularity categories and singular equivalences of centralizer matrix algebras, and verify the Auslander–Reiten and Cartan determinant conjectures for centralizer matrix algebras. Consequently, all historical homological conjectures (the finitistic dimension, Wakamatsu tilting, tilting (projective) complement, strong Nakayama, generalized Nakayama and Nakayama conjectures) are true for centralizer matrix algebras over fields. Moreover, we prove some homological invariants of singular equivalences of centralizer matrix algebras.
Read the full abstract

Dynamical Systems

Predictability of Observables of Dynamical Systems

We study the evolution of observables of dynamical systems. For linear systems, we show that observables satisfy a closed differential equation whose minimal order is determined by the dynamical system and observation operator. This yields a minimal order closure and an equivalent discrete delay representation of the observable dynamics. For nonlinear systems we introduce the notion of diminishing ambiguity, which provides a framework under which the instantaneous observable dynamics can be approximately determined from sufficiently long output history, resulting in delay differential equation representation. These results clarify when observable dynamics can be inferred from past history without knowledge of the dynamical system and its full state.
Read the full abstract

Information Theory

Effective Rank Analysis and Optimization of Flexible Antenna-Enabled Wireless Systems: Movable Antennas or Pinching Antennas?

Flexible antenna technology has recently emerged as a key enabler for next-generation wireless communications, which can effectively exploit the spatial degrees of freedom (DoF). However, existing conventional metrics (e.g., spectral and energy efficiency) cannot directly measure the variability for different flexible antenna structures for the spatial DoF. To objectively analyze and compare the spatial DoF of different flexible antennas, the effective rank is introduced as a metric for two major flexible antenna technologies, i.e., movable antenna (MA) and pinching antenna (PA)-enabled wireless systems, optimizing their antenna positions over multi-time slots. However, the inherent non-convexity and high computational complexity of the resulting effective rank maximization problems in MA and PA systems render them hard to solve. To circumvent these problems, we propose the graph attention implicit quantile network (GAIQN) and multi-agent graph attention Q-network (MAGAQN) algorithms to enhance the effective rank of MA and PA systems through antenna positioning, respectively. Meanwhile, the novel top-k action selection methods are designed to ensure collision-free between multiple MAs on the two-dimensional array plane or multiple PAs on the same waveguide. Simulation results validate the effectiveness and advancement of our proposed GAIQN and MAGAQN algorithms compared with benchmarks, which enhance the effective rank by at least 1.6% and 1.3%, respectively, while consistently ensuring collision-free between flexible antennas. Besides, under the same number of flexible antennas, the MA system supports a higher effective rank than the PA system, whereas the PA system offers greater stability in terms of achievable spatial DoF.
Read the full abstract

Group Theory

Criteria for existence of semigroup homomorphisms and projective rank functions

Let $P,$ $S,$ and $T$ be semigroups, $f:P\to S$ and $g:P\to T$ semigroup homomorphisms, and $X$ a generating set for $S$ (possibly infinite). Clearly, a <i>necessary</i> condition for there to exist a homomorphism $S\to T$ making a commuting triangle with $f$ and $g$ is that for every relation $f(p) = w(x_1,\,\dots\,,\,x_n)$ holding in $S$, with $p\in P,$ $w$ a semigroup word, and $x_1,\,\dots\,,\,x_n \in X,$ there exist $t_1,\,\dots,\,t_n\in T$ satisfying $g(p) = w(t_1,\,\dots\,,\,t_n).$ Under what assumptions will that also be sufficient? We show that one such family of assumptions is that (i) every element of $S$ is a divisor some element of $f(P),$ (ii) $T$ is right and left cancellative, (iii) $T$ is power-cancellative, i.e, $x^d = y^d \implies x = y$ for $d > 0,$ and (iv) a certain technical condition which, in particular, holds if $T$ admits a semigroup ordering with the order-type of the natural numbers. As an application, we obtain an elementary criterion for the existence of an integer-valued rank function on finitely generated projective modules over a ring.
Read the full abstract

2603.20628 · 21 Mar · 5 pages. Copy at http://math.berkeley.edu/~gbergman/papers may be updated more frequently than arXiv copy. I welcome feedback on whether these results are known/of interest. (I wrote a version of this in 1990, but at that time didn't decide to clean it up, as I now have done, and see about publishing it.)

Numerical Analysis

On Optimal Convergence Rates for the Nonlinear Schrödinger Equation with a Wave Operator via Localized Orthogonal Decomposition

In this paper, we develop a Localized Orthogonal Decomposition (LOD) method for the two-dimensional time-dependent nonlinear Schrödinger equation with a wave operator. We prove that our method preserves conservation laws and admits a unique numerical solution; furthermore, we obtain unconditional (i.e., time-step restriction-free) optimal-order superconvergent \(L^p\) error estimates. To complement the theoretical analysis, we present a series of numerical simulations that verify the analytical results and further illustrate structural aspects of the problem.
Read the full abstract

Statistics Theory

Cross-Correlation Periodograms with Decaying Noise Floor for Power Spectral Density Estimation

We present a statistical analysis of a variant of the periodogram method that forms power spectral density estimates by cross-correlating the discrete Fourier transforms of adjacent time windows. The proposed estimator is closely related to cross-power spectral methods and to a technique introduced by Nelson, which has been observed empirically to improve detection of sinusoidal components in noise. We show that, under a white Gaussian noise model, the expected contribution of noise to the proposed estimator is zero and that the estimator is unbiased under certain window alignment conditions. This contrasts with classical estimators where averaging reduces variance but not expected noise. Moreover, we derive closed-form expressions for the variance and prove an upper bound on the expected magnitude of the estimator that decreases as the number of windows increases. This establishes that the proposed method achieves a noise floor that decays with averaging, unlike standard nonparametric spectral estimators. We further analyze the effect of taking the absolute value to enforce nonnegativity, providing bounds on the resulting bias, and show that this bias also decreases with the number of windows. Theoretical results are validated through numerical simulations. We demonstrate the potential sensitivity to phase misalignment and methods of realignment. We also provide empirical evidence that the estimator is robust to other types of noise.
Read the full abstract

Numerical Analysis · Cross-listed from eess.SP

Sparse stability diagrams of LSCF method via strategic pole destabilization using orthogonal matching pursuit

In various engineering fields including mechanical, aerospace, and civil engineering, the identification of modal parameters, including natural frequencies, damping ratios, and mode shapes, is crucial for determining the vibration characteristics of engineered structures. A common method for identifying the modal parameters of structures involves experimental modal analysis using frequency response functions (FRFs) obtained from forced vibration tests. The least squares complex frequency (LSCF) domain method is a widely-used frequency-domain curve-fitting method for the FRFs using the polynomials of high order, which can extract modal parameters with high accuracy. However, increasing the polynomial order tends to result in the generation of non-physical spurious poles that need to be eliminated from the stability diagrams. To overcome this issue, we propose a method that strategically destabilize the stable yet spurious poles of the characteristic polynomials by making their coefficients as sparse as possible, via orthogonal matching pursuit (OMP). This results in sparse stability diagrams because unstable poles can be eliminated from the diagrams. In this paper, the proposed method is first applied to a numerically-obtained FRFs of a rectangular plate using finite element model, and its validity is discussed. Then, the method is applied to experimentally-obtained FRFs of rectangular plates with low-damping and with high-damping. Furthermore, to confirm its applicability to industrial applications with realistic complexity, it has also been applied to the FRFs of the electric machine's stator core used for electric vehicles. Based on the results, we have confirmed that the spurious roots can be eliminated from the stability diagrams without compromising accuracy for the cases considered.
Read the full abstract

Probability

Asymptotic Results for Spectrally Positive Compound Poisson Processes

Finite excursions away from zero of a spectrally positive compound Poisson process with a negative drift can always be decomposed into two parts lying above and below zero, respectively. This paper is concerned with the asymptotic relationships among the lengths and heights of these two parts. Our results state that both their lengths and heights are asymptotically strongly dependent and exhibit a scale symmetry.
Read the full abstract

Numerical Analysis

A posteriori analysis of a virtual element approach on polytopal meshes for the buckling eigenvalue problem

We introduce a novel residual-based a posteriori error estimator for the conforming $C^1$ Virtual Element Method (VEM) applied to the buckling eigenvalue problem, incorporating nonlinear plane stress effects in both two and three dimensions. The estimator is fully computable on general polyhedral meshes and implemented within the open-source vem++ library. Its reliability is rigorously justified via bounds on the residual equation using polynomial projections, stabilisation contributions, and interpolation estimates, while efficiency is ensured through the use of bubble function arguments. Comprehensive numerical experiments in 2D and 3D illustrate the estimator's optimal accuracy and robustness, highlighting its potential for predictive analysis of complex plate structures.
Read the full abstract

Combinatorics

A Hopf algebra on nonplanar binary forests

We equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion of admissible cuts. We show that the terms in this coproduct have an additional combinatorial interpretation in terms of subsets of leaves, which facilitates the construction of Hopf algebra morphisms involving this Hopf algebra, and creates a connection with a Hopf algebra of Bruned used in the renormalization of stochastic processes. Finally, we show that this Hopf algebra is dual to the universal enveloping algebra of a Lie algebra arising from a pre-Lie operator on binary trees based on edge-insertion.
Read the full abstract

Numerical Analysis

Applying acceleration to Krylov subspace eigenvalue solvers

In this paper, we apply acceleration to the inverse-free preconditioned Krylov subspace method introduced by Golub and Ye, which solves the symmetric generalized eigenvalue problem for the algebraically smallest eigenvalue. As the method is an improvement on steepest descent, we consider acceleration based on Nesterov accelerated steepest descent and Polyak's heavy-ball method. We extend acceleration to the block version of the Krylov subspace method and prove convergence for a more generalized choice of subspace. We present numerical results demonstrating the effect of fixed and safeguarded-adaptive choice of the momentum parameter, which show convergence in fewer outer iterations compared with LOBPCG with the same subspace size and generally fewer iterations than the base method when solving for multiple clustered eigenvalues with small dimension size. We also provide an explanation for the acceleration seen from implementing Polyak's heavy-ball method, including justifying the given parameter range.
Read the full abstract

Information Theory · Cross-listed from cs.LG

Neural collapse in the orthoplex regime

When training a neural network for classification, the feature vectors of the training set are known to collapse to the vertices of a regular simplex, provided the dimension $d$ of the feature space and the number $n$ of classes satisfies $n\leq d+1$. This phenomenon is known as neural collapse. For other applications like language models, one instead takes $n\gg d$. Here, the neural collapse phenomenon still occurs, but with different emergent geometric figures. We characterize these geometric figures in the orthoplex regime where $d+2\leq n\leq 2d$. The techniques in our analysis primarily involve Radon's theorem and convexity.
Read the full abstract

All authors James Alcala, Rayna Andreeva, Vladimir A. Kobzar, Dustin G. Mixon, Sanghoon Na, Shashank Sule, Yangxinyu Xie

Friday 20 March

Optimization and Control

The Geometry of Admissible Short Selling in Discrete-Time Stochastic Portfolio Theory

While discrete-time Stochastic Portfolio Theory (SPT) provides a robust framework for market analysis, existing work on functional generation has predominantly focused on long-only portfolios defined on the entire unit simplex. This paper extends the geometric framework of functional generation to the broader class of bankruptcy-proof long-short portfolios defined on local market state spaces. We establish that, within this admissible setting, pseudo-arbitrage is fully characterized by the concavity of the generating function on the market state space, thereby relaxing the usual global domain requirement. A central contribution of this work is a geometric characterization of the short-selling mechanism. We prove that the presence of short selling is equivalent to the negativity of the maximal concave extension of the generating potential. This phenomenon is linked to the steepness of the logarithmic gradient as the market approaches a zero boundary nested inside the simplex. To systematically exploit this mechanism, we introduce the barycentric scaling transformation, a constructive methodology that maps classical long-only generating functions onto restricted domains to engineer admissible strategies with controlled short-selling exposure. Finally, through the analysis of specific shrunken portfolios, we identify a geometric phase transition: under suitable boundary conditions, admissible strategies exhibit a long-only core and a short-selling region in a qualitative sense (without asserting an exact partition of the state space). This provides a unified geometric perspective on relative arbitrage beyond the long-only constraint.
Read the full abstract

Optimization and Control

Hardness of some optimization problems over correlation polyhedra

We prove the NP-hardness, using Karp reductions, of some problems related to the correlation polytope and its corresponding cone, spanned by all of the $n\times n$ rank-one matrices over $\{0,1\}$. The problems are: membership, rank of the decomposition, and a “relaxed rank” obtained from relaxing the zero-norm expression for the rank to an $\ell_1$ norm. While membership and rank are natural problems for any matrix cone, the relaxed rank problem occurs in some signal processing and statistical applications.
Read the full abstract

All authors Alberto Caprara, Fabio Furini, Claudio Gentile, Leo Liberti, Andrea Lodi

Optimization and Control

Preventive Maintenance of a Two-Unit Priority Standby System with Repair

Optimal maintenance policies play an important role in the reliability analysis of repairable systems. This paper examines a two-unit priority standby system with a repair facility, where the priority unit is subject to preventive maintenance. In the general case, we derive necessary and sufficient conditions under which maintenance increases the mean time to system failure. When the hazard rate of the priority unit has either a bathtub-shaped or an upside-down bathtub-shaped form, we establish conditions for the existence of both a threshold time, beyond which maintenance improves the mean time to system failure, and the optimal maintenance time. Expressions to find these quantities are provided in terms of the hazard rate and the mean residual life function. Furthermore, stochastic ordering techniques are used to compare two independent systems under this model, along with their respective threshold times and optimal maintenance times.
Read the full abstract

Representation Theory

$D$-bialgebras, dendrification and embeddings into AWB of almost Poisson algebras

An algebra with bracket (AWB for short) is an associative algebra endowed with a bilinear bracket satisfying a Leibniz-type compatibility condition, as introduced in \cite{casas}. It can be viewed as a noncommutative generalization of an almost Poisson algebra; indeed, when the associative product is commutative and the bracket is skew-symmetric, one recovers the notion of an almost Poisson algebra. In this paper, we introduce the notion of {almost Poisson Drinfel'd bialgebras ($D$-bialgebras)} as an analogue of Poisson $D$-bialgebras, and we establish the equivalence between matched pairs, Manin triples, and almost Poisson $D$-bialgebras. Furthermore, we define a new algebraic structure, called {almost tridendriform Poisson algebras}, which can be regarded as the underlying algebraic structures associated with relative Rota-Baxter operators on almost Poisson algebras. Finally, we show that every almost Poisson algebra can be embedded into an algebra with bracket (AWB) via averaging operators, and more generally via relative averaging operators associated to a given representation of the almost Poisson algebra.
Read the full abstract

Analysis of PDEs

A mathematical model for colloids deposition in porous media combined with a moving boundary at the microscale: Solvability and numerical simulation

We study a reaction-diffusion model posed on two distinct spatial scales that accounts for diffusion, aggregation, fragmentation, and deposition of populations of colloidal particles within a porous material. In this model, the macroscopic transport of the particles is described by an effective equation whose transport coefficients are determined by cell problems posed on the underlying pore scale. The internal pore geometry can change over time due to deposition or detachment of colloidal particles. We represent the evolving microstructure as solid cores whose phase boundaries can grow or shrink over time. As deposition progresses, neighbouring growing cores may come into contact, leading to local clogging of the pore space. We investigate how such evolving microstructures influence the effective transport and storage properties of porous layers. We establish basic analytical results concerning the weak solvability of the resulting multiscale evolution problem, which takes the form of a strongly non-linear parabolic system, in the non-clogging regime. For the numerical approximation of weak solutions we propose a two-scale finite element discretization. Numerical experiments illustrate how local clogging affects the effective dispersion tensor and quantify the resulting trade-off between transport efficiency and storage capacity.
Read the full abstract

Analysis of PDEs

Corrigendum to "Optimal time-decay estimates for an Oldroyd-B model with zero viscosity [J. Differential Equations, 306(2022), 456–491]"

The present note is to make minor correction on the assumption of Theorem 1.2 and its proof in our paper [arXiv:2111.02059, Jinrui Huang, Yinghui Wang, Huanyao Wen and Rizhao Zi, J. Differential Equations, 306(2022), 456–491].
Read the full abstract

All authors Jinrui Huang, Yinghui Wang, Huanyao Wen, Ruizhao Zi

Differential Geometry

Helicoidal surfaces of non-lightlike frontals in Lorentz-Minkowski 3-space

In this paper, we define two types of helicoidal surfaces of non-lightlike frontals in Lorentz-Minkowski 3-space and investigate when they become lightcone framed base surfaces. Moreover, by constructing appropriate diffeomorphic transformations and using the criteria of $(i,j)$-cusps and $(i,j)$-cuspidal edges, we establish identification theorems for the singular types of both 1-type and 2-type helicoidal surfaces on their singular loci.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Lindblad-Deformed Spectral Geometry: Heat-Kernel Asymptotics and Effective Spectral Dimension

We introduce a Lindblad-deformed spectral geometric framework in which bounded dissipative data deform a standard spectral triple through the Dirac operator D_gamma = D - igammaSigma, where Sigma = (1/2) sum_k L_k^dagger L_k is constructed from Lindblad jump operators {L_k}. The associated positive operator Q_gamma = D_gamma^* D_gamma = D^2 + gamma^2 Sigma^2 - i*gamma [D, Sigma] is identified as the correct spectral-geometric observable. For smooth endomorphism-valued Lindblad data, Q_gamma is of Laplace type and admits a standard heat-kernel asymptotic expansion with dissipation-modified even Seeley-DeWitt coefficients. For the scalar deformation L = sqrt(gamma) f with f in C^infty(M) real-valued, we prove that the first-order Duhamel correction to the heat trace K_gamma(sigma) = Tr(exp(-sigma Q_gamma)) vanishes identically, so that the first nontrivial dissipative effect appears at order gamma^4. We identify the exact Duhamel-level decomposition of the O(gamma^4) correction into a direct W_2 insertion and a quadratic W_1 x W_1 term. In the round S^2 model we determine the explicit deformed operator and extract the leading local asymptotic contribution of the W_2 sector. We define the effective scale-dependent spectral dimension d_{s,eff}(sigma,gamma) = -2 d/d(log sigma) log K_gamma(sigma) and identify its leading perturbative deformation.
Read the full abstract