Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 29 April
We consider the free boundary problem for relativistic plasma–vacuum interfaces in two and three spatial dimensions. The plasma flow is governed by the equations of ideal relativistic magnetohydrodynamics, while the vacuum magnetic and electric fields satisfy Maxwell's equations. The plasma and vacuum magnetic fields are tangential to the interface, which moves with the plasma flow. This yields a nonlinear, multidimensional hyperbolic problem with a free boundary that is characteristic of variable multiplicity. We identify a quantitative stability condition and establish the linear stability of three-dimensional relativistic plasma–vacuum interfaces in the sense that the variable-coefficient linearized problem satisfies energy estimates in anisotropic Sobolev spaces. In estimating tangential derivatives, we exploit an intrinsic cancellation effect to convert the boundary term into an instant integral. We then separate the estimate involving spatial derivatives from that involving time derivatives, so that the instant integral can be mainly absorbed by the instant energy under the stability condition. Moreover, we prove the local-in-time existence and uniqueness of solutions to the nonlinear problem in two-dimensional space, provided that the plasma and vacuum magnetic fields do not vanish simultaneously at any point of the initial interface. The proof combines the solvability and tame estimate of the linearized problem with a suitable modified Nash–Moser iteration. In particular, to establish its solvability, the two-dimensional linearized problem is reduced to a transport equation for the interface function and a hyperbolic boundary problem with maximally nonnegative boundary conditions.
Analysis of PDEs · Cross-listed from eess.SY
Spectral Boundary Observer for Counter-Flow Heat Exchangers
We consider a system of two coupled first-order linear hyperbolic partial differential equations modeling heat transport in a counter-flow heat exchanger: one equation describes the transport of a hot fluid, and the other the transport of a cold fluid in the opposite direction. For this system, we design a boundary observer that uses only the temperature of the cold fluid measured at one boundary. Our approach is spectral: by assigning the spectrum of the operator governing the observation error dynamics to a prescribed region within the open left-half complex plane, we can freely tune the convergence rate of the observation error to zero in the $L^2$ norm. The main technical contribution is the proof that spectral stability, that is, the location of the spectrum in the open left-half plane, is equivalent to $L^2$ exponential stability of the origin for the observation error dynamics. This equivalence is established by showing that the operator governing the observation error dynamics satisfies the so-called spectral mapping property.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Largest eigenvalue and top eigenvector statistics of large Euclidean random matrices
Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix ensembles, their entries are strongly correlated through the geometry of the underlying random points, making their analytical treatment challenging. While global spectral properties such as the spectral density are relatively well understood, much less is known about extremal eigenvalues and the associated eigenvectors, despite their central role in applications. Here we address the problem of characterising the largest eigenvalue and the corresponding top eigenvector of large Euclidean random matrices with a generic symmetric kernel. For vectors in any dimension $d\geq 1$ drawn independently from a common distribution, we show that both quantities can be computed within a unified replica-based framework. In the large-$N$ limit, the replica saddle-point equations reduce to an eigenvalue problem for a Fredholm integral operator determined by the kernel and by the underlying distribution. We then specialise this general formulation to the quadratic distance kernel, for which the Fredholm problem reduces to a finite set of $d+2$ self-consistent equations. In this case, we obtain an explicit expression for the average largest eigenvalue, fully determined by low-order moments of the underlying distribution, and an analytical characterisation of the density of the top eigenvector's components. We further perform extensive numerical simulations that confirm these predictions. More broadly, our work provides a general framework to access extremal spectral properties of Euclidean random matrices.
Read the full abstract
Commutative Algebra
Rota-Baxter Operators on Dual Quaternion Algebra
The purpose of this paper is to determine all Rota-Baxter operators on dual quaternion algebra $\mathcal{H}_d$ over the reals.
Functional Analysis
Maximal Algebras of Block Toeplitz Matrices with Entries in the Schur Algebra
The classification of maximal algebras of square block Toeplitz matrices is a considerably more difficult problem and has received relatively little attention in the existing literature. In this work, we approach the problem under the assumption that the entries belong to the Schur algebra. Within these settings, we obtain a complete classification of all maximal algebras of such block Toeplitz matrices.
Read the full abstract
Mathematical Physics · Cross-listed from physics.flu-dyn
Constitutive Modelling of Korteweg Fluids Using Liu's Method
The paper studies constitutive modelling of Korteweg fluids. Thermodynamic consistency, i.e. compatibility with entropy balance law, is achieved using Liu's method of multipliers. Appropriate constitutive assumptions facilitated inclusion of the capillary effects in the specific entropy. Korteweg stresses are derived from the equilibrium conditions – vanishing of the entropy production and its minimization in equilibrium. Material parameter in Korteweg stresses is allowed to depend on temperature, which turns out to be consistent with kinetic-theory results and leads to cross-coupling of mechanical and thermal effects. The generalized Gibbs' relation, which inherits the capillary effects, is derived as consequence, which is a peculiar feature of the Liu's method.
Read the full abstract
Information Theory
Joint Transceiver Orientation Optimization for Rotatable-Antenna MIMO Capacity Maximization
Conventional multiple-input multiple-output (MIMO) systems mainly rely on fixed antenna arrays, which limits their capability to adapt the effective channel matrix to the propagation environment. Rotatable antennas (RAs), which enable mechanical or electronic adjustment of antenna boresight directions, introduce a new orientation-domain degree of freedom for channel reconfiguration. In this paper, we investigate an RA-aided MIMO communication system for channel capacity enhancement. We first establish an orientation-dependent MIMO channel model. Then, we formulate a capacity maximization problem by jointly optimizing the transmit covariance matrix and the transmit/receive RA orientations under practical spherical-cap constraints. To solve this non-convex problem, we develop an alternating optimization algorithm, where the transmit covariance matrix is updated via eigenmode transmission and water-filling, while each RA orientation is optimized through a Riemannian Frank-Wolfe method. We further investigate the low-SNR regime and derive simplified designs for multiple-input single-output (MISO) and single-input multiple-output (SIMO) special cases. Numerical results show that the proposed RA-aided MIMO design significantly improves the channel capacity compared with the fixed-orientation benchmark, demonstrating the benefits of orientation-domain channel reconfiguration.
Read the full abstract
Mathematical Physics · Cross-listed from gr-qc
Power-Law Approach of the Stress-Energy Tensor to the Unruh State after Gravitational Collapse
We establish the rate at which the renormalized stress–energy tensor of a massless minimally coupled scalar field in the in-vacuum state of a collapsing null-shell spacetime approaches the corresponding Unruh-state value. At finite exterior radius, we establish the upper bound \[ |\Delta\langle T_{\mu\nu}\rangle|\leq C(r)\,t_s^{-3} \] from the Cauchy-surface decomposition of the Hadamard difference and the branch-cut structure of the retarded Green function. At future null infinity, we show that the leading coefficient in the late-time expansion \[ \Delta\langle T_{uu}\rangle\sim C_{uu}\,u_s^{-3} \] is nonzero, by computing the branch-cut residue explicitly at small frequency and using the Planck suppression of the thermal spectrum at large frequency to show that the dominant contribution to $C_{uu}$ has a definite sign. The result gives \[ \Delta\langle T_{uu}\rangle\big|_{\Iscr^+}(u_s) \sim C_{uu}\,u_s^{-3}, \qquad u_s\to\infty, \] with $C_{uu}\neq 0$. The exponent is determined by the $\omega^2\ln\omega$ branch-point singularity in the Wronskian of the $\ell=0$ radial wave equation, the same structure responsible for Price's law. The sign $C_{uu}<0$ is supported by a physical argument and by the numerical mode data of Gholizadeh Siahmazgi, Anderson, and Fabbri. The result confirms their conjecture that the approach is a power law. We conjecture that the same mechanism gives an analogous $t_s^{-7}$ bound for gravitational perturbations ($\ell_{\min}=2$), though the extension to the spin-2 case involves gauge issues not addressed here.
Read the full abstract
Dynamical Systems
Primitive Two-Dimensional Words and Iterated Pedal Triangles via Symbolic Coding
The notion of a two-dimensional word arises naturally in the study of combinatorics on words, while the iterative construction of pedal triangles results in a rich dynamical system in the study of geometry. At first, these two classes of objects seem to be unrelated. However, it is known that for all $n \geq 1$, the number of primitive two-dimensional words of dimension $2 \times n$ over a binary alphabet agrees with the number of triangles whose first similar pedal triangle is their $n$th pedal triangle. We construct a finite four-symbol coding of the sorted pedal map and use the resulting branch itineraries to give a bijection between these two classes.
Read the full abstract
Analysis of PDEs
On the monotonicity of affine quermassintegrals
Lutwak's affine quermassintegral theory is a foundational component of modern affine Brunn–Minkowski theory. Developed in the 1980s, it provides affine analogues of the classical quermassintegrals and has led to a rich family of sharp affine isoperimetric inequalities. A central question in this program, going back to Lutwak's 1988 work, is an Alexandrov–Fenchel-type monotonicity principle for the normalized $L^{-n}$-moment quermassintegrals $I_{k,-n}$. In one form, this principle predicts that \[ I_{m,-n}(K)^{1/m}\ge I_{k,-n}(K)^{1/k}, \qquad 1\le m<k\le n . \] The question was recorded in Gardner's 2006 book Geometric Tomography as part of its problem list, and the comparison with the top dimension, $k=n$, was established by Milman and Yehudayoff in their 2023 JAMS paper. We show that the proposed monotonicity does not persist in the full range. More precisely, for every triple of integers $m,k,n$ satisfying $1\le m<k\le n-1$ and $n>(m+2)(k+2)-2$, there exists an origin-symmetric $C^2_+$ convex body $K\subset\mathbb R^n$ such that \[ I_{m,-n}(K)^{1/m} < I_{k,-n}(K)^{1/k}. \] The example is obtained from the Euclidean ball by an arbitrarily small degree-four spherical harmonic perturbation. On the positive side, we prove that the endpoint chain is true in dimension three: for every convex body $K\subset\mathbb R^3$, \[ I_{1,-3}(K)\ge I_{2,-3}(K)^{1/2}\ge I_{3,-3}(K)^{1/3}=1. \] The equality cases in both non-trivial inequalities are exactly ellipsoids, up to translation and nonsingular affine transformations.
Read the full abstract
Probability
Sharp One-Dimensional Sub-Gaussian Comparison in Convex Order
We prove that any random variable $X$ whose moment generating function is point-wise upper bounded by that of $ G \sim \mathcal{N}(0,1) $ must be dominated by $ G/\mathbb{E}[|G|] $ in convex order, meaning $ \mathbb{E}[f(X)] \le \mathbb{E}[f(G/\mathbb{E}[|G|])] $ for all convex $f$. This is sharp as witnessed by $ X \sim \mathrm{Unif}(\{-1,1\}) $ and $ f(x) = |x| $.
Read the full abstract
Dynamical Systems
Beyond Linear Additive and Hill Functions: A General Logistic Reformulation of Delay-Coupled Gene Regulatory Networks with Equilibrium Analysis, Hopf Bifurcation, and Lipschitz Stability
Hill functions, dominant in gene regulatory network modeling, carry fundamental limitations: at non-integer cooperativity exponents, routine when fitting dose-response data, derivatives diverge at the origin, complex arithmetic corrupts ODE trajectories, and zero output at zero activation traps models in off-states. This paper employs logistic-based models that are globally $C^\infty$, real-valued, and strictly positive at zero concentration, resolving all three pathologies while preserving sigmoidal dynamics. Using the delay-coupled two-gene mutual-activation and self-repression network of Vinoth et al.\ as a concrete model, we analyze two reformulations: linear additive activation with logistic self-repression, and a fully sigmoidal form with both terms logistic. A closed-form matching relation $\lambda = n/\theta$ follows from equating slopes at half-maximal points. Closed-form parameters of the weighted logistic formulation are derived by matching basal rates and local slopes to the Hill-linear hybrid model. The unique biologically feasible equilibrium is computed in each case; it is lower in the weighted logistic case, the reduction arising from saturation of the bounded activation term. In the delay-free case ($\tau=0$), local asymptotic stability holds in both formulations since the Jacobian trace is strictly negative for all positive parameters; stability persists for $\tau\in(0,\tau_c)$ and is lost via Hopf bifurcation at the critical delay $\tau_c$. Numerical solution of the full transcendental system locates $\tau_c$, with higher-order bifurcations characterised numerically in each case. Replacing linear additive with weighted logistic activation substantially reduces both the global Lipschitz constant of the right-hand side and that of its Jacobian, permitting larger integration steps.
Read the full abstract
Information Theory · Cross-listed from cs.GT
Information Requirements for Service Allocation and Aggregate Verification
A service system may use the same categories to assign standard allocations and to check whether each service is fulfilled. Finer categories can match individual needs more closely, but they divide the observations available for monitoring. We study this conflict for a fixed menu from which participants select by declaring a category, with fulfilment assessed from each category's aggregate outcomes during a fixed period. We relate allocation loss to variation in preferred allocations within categories and identify conditions under which aggregate observations preserve the verification performance of individual records. For nested refinements under stated utility and observation assumptions, an allocation-loss tolerance and a per-category detection target define a feasibility band. Categories must be fine enough to provide suitable allocations but sufficiently populated to support verification. A source-dependent lower bound on declaration entropy and a minimum contributor requirement give necessary information and population constraints. For an explicit finite population with quadratic utility and binary service outcomes, we prove the exact feasible range across all categorical designs and exhibit designs attaining the information lower bound at specified tolerances. The results provide conditions for choosing categories jointly for allocation and verification.
Read the full abstract
Combinatorics
A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets and their neighborhoods, showing that the undirected case requires nontrivial global constraints absent in the directed setting.
Read the full abstract
Numerical Analysis
Deep Policy Iteration for High-Dimensional Mean-Field Games with Regenerative Reformulation
This paper develops a deep policy iteration method for high-dimensional finite-horizon mean-field games (MFG). We reformulate the game as a regenerative problem with deterministic cycles, which allows policy evaluation (PE), policy improvement (PI), and population measure estimation to be carried out cycle by cycle. Within this formulation, we approximate the population measure by a particle system and update it using a one-step random mapping induced by the Euler-Maruyama discretization of the state dynamics. This update transports a mini-batch of particles from one cycle to the next, avoiding sequential trajectory simulation over the entire time horizon at each iteration. The PE and PI subproblems are formulated through the relation between consecutive cycles, with adversarial training used for evaluation and averaged optimization used for improvement. The resulting method is efficient and scalable in high dimensions, as it avoids the direct solution of the coupled Hamilton-Jacobi-Bellman and Fokker-Planck system, the full simulation of trajectories to estimate the population measure, the explicit computation of conditional expectations in policy evaluation, and pointwise optimization in policy improvement. Numerical experiments demonstrate that the proposed method effectively handles dimensions up to 10,000.
Read the full abstract
Information Theory
Input Distribution Design for Ranging-Oriented OFDM-ISAC Systems Under Frequency-Selective Fading
The implementation of the \ac{isac} feature in \ac{6g} networks is most likely to be based on the framework of \ac{ofdm}. Input distribution design, or constellation design, is a crucial technique in \ac{ofdm}-\ac{isac} systems enabling a favorable balance between communication rate and sensing performance. In this treatise, we propose a computationally efficient input distribution design approach for \ac{ofdm}-\ac{isac} under frequency-selective channels, following the theoretical framework of capacity distortion. We highlight that under practical sensing constraints, the optimal strategy is to treat the kurtosis of constellations as a resource, and allocate it appropriately over subcarriers.
Read the full abstract
Category Theory
Aggregation functions as lax morphisms of quantales
We will generalize the concept of aggregation function for mathematical structures as a certain function between quantales. In fact, these functions turn to be exactly the lax morphism of quantales. This provides a global framework for the study of aggregation functions. As a consequence of our theory, we are able to deduce several known results about the aggregation of metrics and fuzzy metrics.
Read the full abstract
Differential Geometry
When all parallel sets of a $ C^1 $-hypersurface are nowhere $ C^1 $-regular
We prove a necessary and sufficient condition for a $ C^1 $-hypersurface to have all parallel sets nowhere $ C^1 $-regular. As a corollary, we deduce that for a generic $ C^1 $-regular convex body all interior parallel bodies have nowhere $ C^1 $-regular boundaries.
Information Theory
Locality for Codes over the Integers
In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ and derive a Singleton-like bound for locally recoverable codes. We also propose some code constructions with locality, including integer analogs of Tamo–Barg codes.
Read the full abstract
Logic
A note on quantitative stability in Hilbert spaces
We study stability theory in Hilbert spaces quantitatively. We prove that the inner product on the unit ball is $(k,\epsilon)$-stable for all $k\ge \exp(\pi/\epsilon)$, and it is not $(k,\epsilon)$-stable for $k\le \exp(\log 2/\epsilon)$, showing that the growth is necessarily exponential in $1/\epsilon$. We then analyze how stability scales under nonlinear connectives applied to the inner product. In particular, for power-type predicates $f(x,y)=\langle x,y\rangle_+^\beta$ with $\beta<1$ we obtain upper and lower bounds of the form $\exp(C\epsilon^{-1/\beta})$, and for $\beta>1$ and integer powers $\langle x,y\rangle^d$ we retain the bilinear scale $\exp(C/\epsilon)$.
Read the full abstract
Optimization and Control
Induced Stackelberg Equilibrium Seeking via Iterative Tikhonov Regularization
Existing methods for learning Stackelberg equilibria typically assume that the followers' (variational, generalized) Nash equilibrium is unique. However, in the presence of multiple equilibria, without a selection convention, the problem may become ill-posed, thus leading standard algorithms to potentially fail to converge. This paper addresses this issue by introducing an optimal selection at the lower-level game, hereby defining a Stackelberg game with induced equilibrium selection. To this end, we enable the leader to augment the followers' game with an additional vanishing term that acts as an incentive. We then propose a follower-agnostic zeroth-order method, whereby the leader converges to a solution of the resulting problem by iteratively probing the followers and jointly updating its decision variable and the incentive term.
Read the full abstract
Numerical Analysis
Robust Model-Based Iteration for Passive Gamma Emission Tomography
Passive Gamma Emission Tomography (PGET) is an International Atomic Energy Agency -approved technique for verifying spent nuclear fuel assemblies prior to geological disposal. Reconstructing the emission and attenuation maps from PGET measurements is a nonlinear ill-posed inverse problem, currently solved with a Levenberg-Marquardt (LM) scheme that requires 10-20 iterations to achieve sufficient accuracy. We propose an accelerated iterative solver that combines the LM algorithm with a Deep Gauss-Newton step, in which a learned operator refines the update proposed by the deterministic algorithm at each iteration. A safeguard condition based on the trust-region model ensures that the accelerated iterates perform no worse than LM and retain convergence to a critical point of the regularized objective. Within this framework we compare three architectures for the learned component: an encoder-decoder-style Convolutional Neural Network, Fourier Neural Operators, and Wavelet Neural Operators. Each is trained on a small set of coarsely simulated 9x9 assemblies. Experiments on simulated and real measurements from Finnish nuclear power plants show that the proposed scheme reaches LM-quality reconstructions in roughly one third of the iterations, while revealing architecture-dependent trade-offs in robustness against out-of-distribution inputs.
Read the full abstract
Information Theory
Source-Side Sufficiency for the Information Bottleneck: Exact Reduction and Finite-Block Equivalence
The input side of the Information Bottleneck may contain task-irrelevant variation that still costs rate. We identify this cost exactly. Let T be a source and C a relevance variable. Suppose the deterministic statistic Z = phi(T) satisfies C-Z-T. For any encoder p(X|T), its conditional average over the fibres of phi preserves I(X;C) and lowers the rate by I(X;T|Z). The reverse pullback preserves both coordinates. These maps establish equality of the relevance-rate curves and Lagrangian infima on standard Borel spaces for every tradeoff parameter. They also characterise all attained optima. Every full-source minimiser factors through Z, and every reduced minimiser pulls back to T. When C is finite and distortion is logarithmic loss, replacement of T^n by Z^n also preserves the optimal remote distortion at every blocklength and message budget. The operational rate-distortion functions are therefore equal.
Read the full abstract
Information Theory
Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
In the Internet-of-Things (IoT) era, efficient functionality integration is essential to address the growing demands of communication, computation, and sensing. Signal-level integrated sensing, computing, and communication (Sig-ISCC) is envisioned, where a single waveform simultaneously supports sensing, computing and communication via over-the-air computation (AirComp). Meanwhile, federated learning (FL) is widely regarded as a promising distributed machine learning framework that enables network intelligence in a privacy-preserving and secure manner, and exhibits strong synergy with AirComp, which alleviates the communication bottleneck of FL. In this paper, we study uplink Sig-ISCC design for AirComp-FL with joint target detection. We formulate the joint power and receive-scaling control problem, where edge devices' transmitted signals should serve both sensing and AirComp purposes. The goal is to minimize the AirComp aggregation distortion subject to a joint target-detection requirement. Although the resulting problem is non-convex in the original variables, we show that it admits an equivalent convex reformulation after a suitable variable transformation. By exploiting analytical optimality properties, we develop a robust, optimal, and polynomial-time-complexity algorithm that efficiently achieves the optimal transmit powers and receive scaling factor. Simulation results validate the optimality and numerical robustness of the proposed algorithm and show its superior FL performance compared to baseline methods.
Read the full abstract
Information Theory
Distributed Multi-View Vision-Only RSSI Estimation
Received Signal Strength Indicator (RSSI) estimation is essential for wireless link management, yet conventional feedback-based approaches incur uplink overhead, suffer from measurement instability, and are subject to inherent feedback loop latency, rendering proactive adaptation infeasible. Although vision-based approaches have been explored, existing methods remain limited by hardware dependency or auxiliary inputs, and lack the spatial diversity needed to resolve camera-side NLoS conditions. To address these limitations, we propose MulViT-TF, a vision-only RSSI estimation framework that exploits distributed multi-view observations through Transformer-based fusion, achieving complementary spatial coverage without any auxiliary sensing inputs. Experimental results across two distinct indoor scenes demonstrate that MulViT-TF achieves RMSE reductions of up to 26.3% and improves the 3dB error coverage by up to 13.8 percentage points over the best-performing single-view baseline, while using fewer FLOPs and parameters.
Read the full abstract
Commutative Algebra
Analysis of the weight Diagram Associated with Foliations on the $\mathbb{CP}^{2}$
Optimization and Control
Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable properties. The fundamental properties of this class are first developed, including its stability under standard calculus operations, growth conditions, and the absence of spurious critical points, which together imply a benign global geometry with no saddle points. Motivated by these properties, a class of proximal-point algorithms (HiPPA) with high-order regularization of order $p>1$ is introduced. Conditions are identified under which the iterates converge globally to minimizers, and a unified convergence analysis is provided with explicit rates and iteration complexity bounds under appropriate regularity assumptions. The results reveal a sharp transition in behavior with respect to the order $p$: for $p\in(1,2)$, the method achieves local linear convergence with complexity $\mathcal{O}(\log(\varepsilon^{-1}))$ when initialized sufficiently close to a minimizer; for $p=2$, it attains global linear convergence with the same complexity; and for $p>2$, it exhibits superlinear convergence with complexity $\mathcal{O}(\log\log(\varepsilon^{-1}))$, where $\varepsilon>0$ denotes the target accuracy. The theory is complemented with preliminary numerical experiments on selected machine learning problems, which illustrate the effectiveness of the proposed methods and are consistent with the theoretical findings.
Read the full abstract
Group Theory
On the existence and properties of Alexandroff paratopological groups
We study groups endowed with Alexandroff topologies and show that no non-discrete Alexandroff topology can turn a group into a topological group. This settles negatively the basic existence problem for Alexandroff topological groups. Motivated by this obstruction, we turn to the broader setting of Alexandroff paratopological groups. We establish several fundamental properties of these spaces regarding to connections and compact-like properties among others. As applications, we address two addapted classical open questions within our framework concerning feebly bounded subsets in paratopological groups, proving that connected non-compact Alexandroff paratopological groups offer a positive solution both for products of feebly bounded sets and for the feebly boundedness of $B^2$ when $B$ is a feebly bounded subset.
Read the full abstract
Complex Variables
$\mathcal H$-Harmonic Bergman-Besov Spaces on the Real Hyperbolic Ball
Using characterizations in terms of various differential operators, including partial, normal, and tangential derivatives, we extend the family of Bergman spaces of $\mathcal H$-harmonic functions on the real hyperbolic ball from the range $\alpha>-1$ to all $\alpha\in\mathbb R$. We then generalize several properties of Bergman spaces; projection, duality, atomic decomposition, and inclusion relations, to this extended family.
Read the full abstract
Commutative Algebra
On the binary relations defined using GD1 and 1GD inverses over infinite dimensional vector spaces
The purpose of this article is to study certain binary relations of endomorphisms over infinite dimensional vector spaces defined by GD1 and 1GD generalized inverses. In order to do so, these generalized inverses are studied over arbitrary vector spaces (namely, infinite dimensional ones) using finite potent endomorphisms. We characterize them in terms of the AST decomposition of a finite potent endomorphism and we obtain algorithms for their respective computation. This theory is then used to characterize the GD1 and 1GD binary relations for finite potent endomorphisms in terms of the AST decomposition and to prove that they define partial orders in the set of finite potent endomorphisms, thus, completing the theory of these generalized inverses for matrices.