Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 20 March
The undirected zero divisor graph of a commutative ring with unity \( R \), denoted by \( \Gamma(R) = (V(\Gamma(R)), E(\Gamma(R))) \). The vertex set \( V(\Gamma(R)) \) consists of all the non-zero zero-divisors of \( R \). The edge set \( E(\Gamma(R)) \) is defined by the set \( \{ e = a_1 a_2 \mid a_1 \cdot a_2 = 0 \text{ and } a_1, a_2 \in V(\Gamma(R)) \} \). The barycentric subdivision of $\Gamma$ is the process of subdividing each edge by inserting new vertex in the graph $\Gamma$. In this article, we have focused on the fault-tolerant metric dimension of the barycentric subdivision of zero divisor graph of the group of integers modulo \( n \), represented by \( fdim(BS(\Gamma(\mathbb{Z}_n )\), where \( n = pq \); \( p \) and \( q \) are distinct odd primes with \( q > p \). We also demonstrate that \( fdim(BS(\Gamma(\mathbb{Z}_n) \geq q - 1 \) for every \( n = pq \), where \( p \) and \( q \) are any distinct odd primes with \( q > p \).
Analysis of PDEs
Classification of self-similar singular solutions with large mass for Keller-Segel model with signal consumption
In this paper, we concentrate on investigating the self-similar singular solutions of Keller-Segel model with signal consumption ($-uv^{\alpha}$) and singular sensitivity. We perform a detailed exploration into the existence and decay rate of self-similar solutions, particularly, the permissibility of arbitrary mass for these solutions across all possible cases. Based on these findings, we can delve deeper into verifying that these self-similar solutions $(u, v)$ exhibit varying degrees of singularity depending on the value of $\alpha$ and the spatial dimension. Our analysis reveals that the component $u$ (with arbitrary mass) of the solution consistently behaves analogous to heat kernel, that is, $u$ exhibiting a Dirac $\delta$ initial singularity identical to that of the fundamental solution, and converges to $0$ in the sense of the $L^p$-norm ($p>1$) as time approaches infinity. However, the initial behavior of the other component $v$ varies significantly based on the value of $\alpha$ and the spatial dimension, exhibiting regularity (not singular), less singularity, or strong singularity (more singular than fundamental solution). Moreover, both $u$ and $v$ undergo instantaneous smoothing, becoming smooth immediately after $t>0$. This phenomenon reveals the adaptive strategies of cells in high-density aggregation environments to prevent resource depletion, reflecting an optimization process of self-organizing behavior.
Read the full abstract
Analysis of PDEs
A note on the non-existence of small non-trivial compact solutions for Euler-Poisson equation in 1D
In this short note, we prove the non-existence of slow and fast small nontrivial compact solutions for the Euler-Poisson system in $1$D. The proof is based on the virial estimate which provides local in space average decay of bounded small solutions.
Analysis of PDEs
Commutation Properties of Semi-groups for Contact Type Hamilton-Jacobi Equation
We know that there exist semi-groups for contact type Hamilton-Jacobi equations, which refers to \cite{KLJ2}. Guy Barles and Agnès Tourin give a proof of the commutation properties for normal Hamilton-Jacobi equations at \cite{GA}. In this article, we provide a proof of the commutation property of semi-groups for contact type Hamilton-Jacobi equations.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Heavy-Tailed and Long-Range Dependent Noise in Stochastic Approximation: A Finite-Time Analysis
Stochastic approximation (SA) is a fundamental iterative framework with broad applications in reinforcement learning and optimization. Classical analyses typically rely on martingale difference or Markov noise with bounded second moments, but many practical settings, including finance and communications, frequently encounter heavy-tailed and long-range dependent (LRD) noise. In this work, we study SA for finding the root of a strongly monotone operator under these non-classical noise models. We establish the first finite-time moment bounds in both settings, providing explicit convergence rates that quantify the impact of heavy tails and temporal dependence. Our analysis employs a noise-averaging argument that regularizes the impact of noise without modifying the iteration. Finally, we apply our general framework to stochastic gradient descent (SGD) and gradient play, and corroborate our finite-time analysis through numerical experiments.
Read the full abstract
Numerical Analysis
On-the-Fly ROM-Based Acceleration of SI-DSA for Implicit Time Marching of the Radiative Transfer Equation
In implicit time marching of the radiative transfer equation (RTE), the resulting linear systems are commonly solved using source iteration with diffusion synthetic acceleration (SI-DSA). Despite its widespread success, the performance of the DSA preconditioner may deteriorate when the RTE cannot be well approximated by its diffusion limit. Moreover, classical SI-DSA does not exploit low-rank structures of the solution manifold across time steps when the solution evolves smoothly. To address these limitations, we develop an on-the-fly reduced-order-model (ROM)-based acceleration for SI-DSA in implicit time marching of the RTE. Instead of relying on a diffusion approximation, the proposed approach constructs ROMs directly from the underlying kinetic formulation while exploiting low-rank structures in the temporal evolution of the solution. The method is fully offline-free and constructs ROMs to enhance both initial guesses and preconditioners on the fly during time marching. To handle streaming solution data, we design efficient and memory-lean ROM construction and adaptive update strategies based on dynamical mode decomposition, incremental low-rank singular value decomposition, and error indicators. Numerical experiments demonstrate that the proposed method consistently accelerates implicit time marching, delivering $1.4\times$ to $2.0\times$ speedup over classical SI-DSA while incurring only marginal overhead for ROM construction and updates.
Read the full abstract
Differential Geometry
Sharp Minkowski-Type Inequality in Cartan-Hadamard 3-Spaces
In this paper, we prove a sharp Minkowski-type inequality in Cartan-Hadamard 3-spaces using harmonic mean curvature flow and improve the known estimates for total mean curvature in hyperbolic 3-space. In particular, we sharpen Ghomi-Spruck's result in \cite{ghomi-spruck2023} by retaining the volume contribution in the monotonicity argument. As a corollary, we obtain a comparison theorem relating the total mean curvature of convex surfaces in Cartan-Hadamard 3-spaces to their enclosed volume.
Read the full abstract
Functional Analysis
On the BSE- property of vector valued Beurling algebra $L^1(G,\omega, \mathcal{A})$
Let $G$ be a locally compact abelian group, and let $\omega:G \to [1,\infty)$ be a measurable weight, i.e., $\omega$ is measurable, and $\omega(s+t)\leq \omega(s)\omega(t)$ for all $s, t \in G$. Let $\mathcal{A}$ be a semisimple commutative Banach algebra with a predual $\mathcal A_\ast$ such that the Gel'fand space $\Phi_{\mathcal A}\subset \mathcal{A}_\ast$. If $\omega^{-1}$ is vanishing at infinity, then we show that the Banach algebra $L^1(G,\omega,\mathcal{A})$ is a BSE- algebra if and only if $\mathcal A$ is a BSE- algebra.
Read the full abstract
Algebraic Geometry
A Dimension Bound for Symmetrizer Groups of Projective Hypersurfaces
Let $X$ be a projective hypersurface that is not a cone. The symmetrizer group of $X$ is an algebraic group that parametrizes hypersurfaces whose Jacobian ideal coincides with that of $X$. We prove that if the locus of points of multiplicity $d-1$ does not contain a line, then the nilpotent part of the Lie algebra of the symmetrizer group has dimension at most $2$, and consequently the symmetrizer group has dimension at most $\dim X+2$. Moreover, we show that if this locus has only finitely many lines, then the nilpotent part of the Lie algebra has dimension at most $4$, yielding the bound $\dim X+3$ for the symmetrizer group. To achieve this, we establish a connection between a class of singularities, called quasi-vertices, on $X$ with highly degenerate tangent cones and the unipotent part of its symmetrizer group.
Read the full abstract
Combinatorics
Induced Ramsey numbers for fans
The induced Ramsey number $r_{\mathrm{ind}}(G,H)$ is defined as the minimum order of a graph $F$ on such that any 2-coloring of its edges with red and blue leads to either a red induced copy of $G$ or a blue induced copy of $H$. Motivated by the Kohayakawa-Prömel-Rödl conjecture, we prove that a quadratic upper bound $\mathrm{r}_{\text {ind}}\left(G, F_n\right) \leq C n^2$ for fixed $G$, where $F_n$ is a graph with one central vertex, $2n$ leaf vertices, and $n$ disjoint edges. In particular, for star graphs $K_{1, \ell}$ $(\ell \leq n)$, constructive coloring and matching arguments yield $2 n+2 \ell-1 \leq \mathrm{r}_{\text {ind}}\left(K_{1, \ell}, F_n\right) \leq(\ell+n-1)(\ell+1)+1$, with the exact value $\mathrm{r}_{\text {ind}}\left(K_{1,2}, F_n\right)=3 n+4$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
A Locally Penalized Cross-Estimate Federated Method with Guarantees for Constrained Personalized Learning
Federated learning (FL) is a communication-efficient framework for solving distributed optimization problems. Standard FL methods aggregate local updates into a single global model that is shared by all agents, effectively imposing consensus. Under heterogeneous local constraints, however, a common feasible model may be overly restrictive or may not exist. Existing constrained FL methods largely retain this shared-model structure and therefore do not directly address personalization under heterogeneous agent-specific feasible sets. We study a constrained personalized FL problem that assigns a distinct feasible model to each agent while coupling the models through a collaborative objective. We propose Locally Penalized Cross-Estimate Federated Averaging (PCE-FedAvg), where each agent maintains a multi-block vector containing its own model and estimates of the other agents' models while applying the feasibility penalty only locally to its own block. The server aggregates corresponding blocks separately, thereby preserving personalization without requiring agents to explicitly disclose their local constraint sets. For any $\epsilon>0$, we establish finite-time upper and lower suboptimality bounds and agent-wise squared infeasibility bounds, yielding communication complexities of $\mathcal{O}(\epsilon^{-2})$ and $\mathcal{O}(\epsilon^{-1})$, respectively. Experiments on MNIST and CIFAR-10 support our theoretical results.
Read the full abstract
Analysis of PDEs
Blow-up of solutions to the Euler-Poisson-Darbox equation with critical power nonlinearity
In our recent precious work, we established the finite time blow up result and upper bound of lifespan estimate to the singular Cauchy problem of semilinear Euler-Poisson-Darboux equation in R^n with subcritical power type nonlinearity. By introducing an improved test function, we obtain an enhanced lower bound for the functional including the spacetime integral of the nonlinear term with an additional logarithmic growth, which finally yields the blow up result and upper bound of lifespan estimate for the corresponding Cauchy problem with "critical" nonlinear power. And this gives some partial answer to the open problem 1 posed by D'Abbicco (J. Differential Equations 286 (2021), 531-556).
Read the full abstract
Optimization and Control
Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
In this paper, we consider the nonsmooth convex optimization problems over the fixed point constraint sets of firmly nonexpansive operators. To find an optimal solution of the problem, we present an iterative method based on the hybrid steepest descent method and the idea of a delayed subgradient scheme in which allows the use of staled subgradients from the earlier iteration when updating the next iteration. We start the convergence part by deriving an upper bound for the difference of the best-achieved function values and the optimal value. After that, to ensure the convergence in iterations, we prove that there exists a subsequence of the generated sequence by the proposed method which converges to an optimal solution. Moreover, we subsequently show that the whole generated sequence converges to an optimal solution when the strict convexity of the objective function is imposed. Further, we extend the presented results to the inexact version and the centralized network system consisting of a finite number of workers and a central server. Finally, we apply the proposed method to image inpainting problems. The numerical results describe the effect of delay in many cases of objective functions.
Read the full abstract
Combinatorics
Vertex energies of splitting and shadow graphs
Graph energy has been widely investigated in spectral graph theory. However, the manner in which this energy is distributed among individual vertices has received attention only more recently, following the introduction of energy of a vertex by O. Arizmendi et al. in 2018. Since then, several studies have explored this concept. In the present work, we focus on splitting graphs and shadow graphs and study how the total energy of a graph is distributed among its vertices. We further establish explicit expressions for vertex energies in these derived structures and analyze their behavior in comparison with the underlying graph.
Read the full abstract
Information Theory
New Constructions of Polar Code Based on Refined Error Probability Analysis
This paper presents a refined analysis of the block error rate (BLER) of polar codes over symmetric binary-input discrete memoryless channels under successive cancellation (SC) and successive cancellation list (SCL) decoding. A novel expression for the BLER under SC decoding is derived directly in terms of the decoder's LLRs. Building on this formulation, we propose a polar code construction algorithm optimized for SC decoding and evaluate its performance under SC and dynamic SC flip (DSCF) decoding against established SC-optimized constructions, including Gaussian approximation (GA)-based and Tal-Vardy polar codes. Furthermore, by decomposing the BLER into path loss and path selection components, we derive a novel LLR-based expression for the path loss probability, which enables an SCL-optimized polar code construction method. The proposed constructions are evaluated under SCL decoding with list sizes 2, 4, and 8, and are compared with 5G standard polar codes, GA-based designs, and Reed-Muller polar codes. Simulation results show that the proposed SC-optimized polar codes achieve up to a 0.2 dB performance gain under DSCF decoding over the AWGN channel compared to benchmark constructions, and exhibit superior performance over binary symmetric channels. For SCL-optimized polar codes, the proposed method achieves comparable or improved performance across all considered list sizes, with gains of up to 0.4 dB relative to benchmark designs.
Read the full abstract
Algebraic Geometry
Semisimple derivations, rational slice and kernels over affine domains
Let k be an algebraically closed field of characteristic zero and let B be a finitely generated k-domain. We study semisimple derivations on B, with special emphasis on those whose eigenvalues are integers. For such derivations, after passing to the field of fractions and choosing a rational slice s with D(s) = s, we describe the kernel of D explicitly in terms of semi-invariant generators. We also obtain descriptions of the kernel on suitable localizations of B and on B itself by intersection. Several basic properties of semisimple derivations and their behavior under conjugation are also discussed
Read the full abstract
Dynamical Systems
Invariant and conditionally invariant measures for random open interval maps with countably many branches
In this paper, building on previous work, we extend the thermodynamic formalism for random open dynamical systems generated by piecewise monotone interval maps with countably many branches. Under summable and contracting assumptions on the potential, we establish the Ruelle-Perron-Frobenius type theorem for the associated random open operator and prove exponential decay of correlations. In addition, we investigate the escape rate for the hole and conditionally invariant measure for the open system.
Read the full abstract
Probability
Stochastic Averaging and Statistical Inference of Glycolytic Pathway
Many biological processes exhibit oscillatory behavior. Among these, glycolytic oscillations have been extensively studied due to their well-characterized biochemical reaction networks. However, the complexity of these networks necessitates low-dimensional ordinary differential equation (ODE) models to identify core mechanisms and perform stability analysis. While previous studies proposed reduced ODE models, these were typically introduced from deterministic descriptions rather than the underlying stochastic dynamics, which more accurately represent discrete reaction events occurring at random times. In this paper, we develop a rigorous probabilistic framework for deriving a reduced Othmer-Aldridge model of the glycolytic pathway from its stochastic formulation. The full system is modeled as a multiscale continuous-time Markov chain with different time and abundance scales. Under an appropriate scaling regime and specific structural conditions, we prove that the dynamics of the slow components are approximated by a two-dimensional ODE. The proof is technically involved due to the network's complexity and strong coupling between its components. We further consider the problem of parameter estimation when observations are limited to the slow species: fructose-6-phosphate and ADP. The reduced system yields a tractable loss function depending solely on these variables. We prove that the resulting estimators are statistically consistent when the data originate from the full stochastic reaction network. Together, these results provide a mathematically rigorous framework linking stochastic biochemical reaction networks, reduced deterministic dynamics, and statistically reliable parameter estimation.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Neural Uncertainty Principle: A Unified View of Adversarial Fragility and LLM Hallucination
Adversarial vulnerability in vision and hallucination in large language models are conventionally viewed as separate problems, each addressed with modality-specific patches. This study first reveals that they share a common geometric origin: the input and its loss gradient are conjugate observables subject to an irreducible uncertainty bound. Formalizing a Neural Uncertainty Principle (NUP) under a loss-induced state, we find that in near-bound regimes, further compression must be accompanied by increased sensitivity dispersion (adversarial fragility), while weak prompt-gradient coupling leaves generation under-constrained (hallucination). Crucially, this bound is modulated by an input-gradient correlation channel, captured by a specifically designed single-backward probe. In vision, masking highly coupled components improves robustness without costly adversarial training; in language, the same prefill-stage probe detects hallucination risk before generating any answer tokens. NUP thus turns two seemingly separate failure taxonomies into a shared uncertainty-budget view and provides a principled lens for reliability analysis. Guided by this NUP theory, we propose ConjMask (masking high-contribution input components) and LogitReg (logit-side regularization) to improve robustness without adversarial training, and use the probe as a decoding-free risk signal for LLMs, enabling hallucination detection and prompt selection. NUP thus provides a unified, practical framework for diagnosing and mitigating boundary anomalies across perception and generation tasks.
Read the full abstract
Numerical Analysis
An Adaptive Machine Learning Framework for Fluid Flow in Dual-Network Porous Media
Porous materials – natural or engineered – often exhibit dual pore-network structures that govern processes such as mineral exploration and hydrocarbon recovery from tight shales. Double porosity/permeability (DPP) mathematical models describe incompressible fluid flow through two interacting pore networks with inter-network mass exchange. Despite significant advances in numerical methods, there remains a need for computational frameworks that enable rapid forecasting, data assimilation, and reliable inverse analysis. To address this, we present a physics-informed neural network (PINN) framework for forward and inverse modeling of DPP systems. The proposed approach encodes the governing equations in mixed form, along with boundary conditions, directly into the loss function, with adaptive weighting strategies to balance their contributions. Key features of the framework include adaptive weight tuning, dynamic collocation point selection, and the use of shared trunk neural architectures to efficiently capture the coupled behavior of the dual pore networks. It is inherently mesh-free, making it well-suited for complex geometries typical of porous media. It accurately captures discontinuities in solution fields across layered domains without introducing spurious oscillations commonly observed in classical finite element formulations. Importantly, the framework is well-suited for inverse analysis, enabling robust parameter identification in scenarios where key physical quantities – such as the mass transfer coefficient in DPP models – are difficult to measure directly. In addition, a systematic convergence analysis is provided to rigorously assess the stability, accuracy, and reliability of the method. The effectiveness and computational advantages of the approach are demonstrated through a series of representative numerical experiments.
Read the full abstract
Information Theory
Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition
We study entrywise scalar quantization of two matrices prior to multiplication. Given $A\in R^{m\times k}$ and $B\in R^{k\times n}$, we quantize entries of $A$ and $B$ independently using scalar quantizers with $K_X$ and $K_Y$ levels per entry, and form $\widehat C=\widehat A\,\widehat B$. The objective is to minimize the matrix multiplication mean-squared error (MSE) $E[\|{AB-\widehat A\widehat B}\|_F^2]$ under a pair-i.i.d.\ inner-product model. In the high-resolution regime $K_X,K_Y\to\infty$, we derive a sharp $K^{-2}$ asymptotic expansion for $\mathcal{E}$, identify the exact optimal leading constants, and characterize asymptotically optimal quantization center densities in terms of conditional second moments. We then specialize to correlated Gaussian multiplicative pairs, obtaining a closed-form optimal point density \[ \lambda^\star(u)\ \propto\ \exp\!\left(-\frac{u^2}{6}\right)\bigl((1-\rho^2)+\rho^2u^2\bigr)^{1/3}, \qquad u=\frac{x}{\sigma_X}, \] with the same form for $y/\sigma_Y$, and prove a correlation-driven phase transition: the density is unimodal at the origin for $|\rho|\leq 1/\sqrt{3}$ and becomes bimodal for $|\rho|>1/\sqrt{3}$ with peaks at $u_{\mathrm{peak}}=\pm\sqrt{3-1/\rho^2}$. We show our method's applicability in synthetic experiments such as matrix multiplication quantization and least squares optimization, as well as quantization of large language model key and query activations.
Read the full abstract
Number Theory
Parry order of Parry numbers
We introduce the Parry order $\mathrm{Ord}_P(\beta)$, defined as the largest integer $n$ for which $\beta^n$ is a Parry number. This leads to a natural partition of the set of Perron numbers as follows: \[ \mathcal{P} = \left( \bigcup_{n \geq 0} H_n \right) \cup H_\infty, \] where $H_n$ is the class of Perron numbers with Parry order $n$, and $H_\infty = S \cup T$ consists exactly of all Pisot and Salem numbers. We show that a Perron number has infinitely many Parry powers if and only if it is Pisot or Salem. For every other Perron number, only finitely many powers can be Parry. We give an explicit upper bound on $\mathrm{Ord}_P(\beta)$ in terms of algebraic properties of~$\beta$. We provide explicit examples of non-Parry Perron numbers whose powers become Parry, demonstrating that several $H_n$ are non-empty and structurally rich. We give an infinite family of cubic non-Pisot numbers, all of which have finite Parry order, but where the family has unbounded Parry order. These results establish a new dynamical perspective on Perron numbers, connecting $\beta$-expansion theory with classical questions surrounding Salem numbers and Lehmer-type conjectures.
Read the full abstract
Category Theory
Induced quadratic structures of operated algebras with applications to multi-Novikov algebras
We formulate binary-quadratic induced structures for unary–binary operads by taking the arity-three part of the kernel of the substitution map for chosen induced binary operations. Our purpose is to identify all universal relations in this quadratic class; we make no claim that they generate the full kernel in every arity. For commutative associative algebras equipped with families of derivations, we determine these quadratic relations explicitly. In the noncommuting-derivation case they give the noncommuting multi-Novikov operad; imposing commutation of the derivations yields exactly the additional relations of the multi-Novikov operad. The one-derivation specialization recovers the usual Novikov operad. The calculations are self-contained at arity three and display how operator identities control induced binary-quadratic structures.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Verifiable Error Bounds for Physics-Informed Neural Network Solutions of Lyapunov and Hamilton-Jacobi-Bellman Equations
Many core problems in nonlinear systems analysis and control can be recast as solving partial differential equations (PDEs) such as Lyapunov and Hamilton-Jacobi-Bellman (HJB) equations. Physics-informed neural networks (PINNs) have emerged as a promising mesh-free approach for approximating their solutions, but in most existing works there is no rigorous guarantee that a small PDE residual implies a small solution error. This paper develops verifiable error bounds for approximate solutions of Lyapunov and HJB equations, with particular emphasis on PINN-based approximations. For both the Lyapunov and HJB PDEs, we show that a verifiable residual bound yields relative error bounds with respect to the true solutions as well as computable a posteriori estimates in terms of the approximate solutions. For the HJB equation, this also yields certified upper and lower bounds on the optimal value function on compact sublevel sets and quantifies the optimality gap of the induced feedback policy. We further show that one-sided residual bounds already imply that the approximation itself defines a valid Lyapunov or control Lyapunov function. We illustrate the results with numerical examples.
Read the full abstract
Analysis of PDEs
Diffusion bounds for non-autonomous degenerate parabolic equations
We consider possibly degenerate non-autonomous parabolic equations in $L^p$ spaces for all $1\le p\le\infty$, and prove Gaussian space-time upper bounds of the Davies-Gaffney, or integrated Nash-Aronson, type on their solutions. Our bounds cover both linear and nonlinear equations.
Read the full abstract
Thursday 19 March
Dynamical Systems
Identification of limit sets of a non-ideal system: spherical pendulum-excitation source
We investigate the long-term dynamics of a five-dimensional nonlinear system describing the non-ideal excitation of a spherical pendulum coupled to a limited-power electric motor. By analyzing the phase trajectories y(t) = (y1, y2, y3, y4, y5), we prove several structural theorems regarding the system's limit sets. First, we show that the bilinear combination y1y5 - y2y4 satisfies a closed linear differential equation, which implies its vanishing on every limit set. This leads to a fundamental algebraic identity that holds for all asymptotic states. Furthermore, we establish proportionality relations between the pairs (y1, y4) and (y2, y5) within these sets. We demonstrate that the dynamics restricted to any limit set reduce from the original five-dimensional space to an explicit three-dimensional subsystem parameterized by a single constant K. Finally, for the dissipative regime characterized by C <= -2, we prove the global asymptotic stability of the equilibrium point y* = (0, 0, -F/E, 0, 0), showing that y1^2 + y2^2 + y4^2 + y5^2 tends to zero. These results provide a rigorous basis for the structural description of limit sets and simplify the further analysis of deterministic chaos in pendulum-motor models.
Read the full abstract
General Mathematics
From Weak Nonlinear Perturbation to the Homotopy Analysis Method: A Rigorous Derivation and Theoretical Unification
The Homotopy Analysis Method (HAM) is a widely used analytical approach for solving nonlinear problems, yet its theoretical foundation lacks rigorous justification, and its intrinsic correlation with perturbation theory remains ambiguous, leading to prevalent confusion in the existing literature. This study demonstrates that the fundamental homotopy deformation equation of HAM can be naturally derived from the weak-nonlinearity perturbation theory. We construct a specific analytical expression and optimize the core parameters (the optimal auxiliary linear operator, convergence-control parameter, and auxiliary function) to mitigate the inherent strong nonlinearity of the nonlinear operator. Extending the small parameter \epsilon of perturbation theory to the interval [0,1] enables a systematic homotopy deformation process, which connects the linear auxiliary system (at \epsilon=0) with the original nonlinear problem (at \epsilon=1) and confirms HAM as a structured, adaptive generalization of classical perturbation theory. Furthermore, this work provides a rigorous proof that the Homotopy Perturbation Method (HPM) is a special case of HAM: HPM can be directly derived by fixing the optimal auxiliary linear operator as the linear component of the nonlinear system and setting the convergence-control parameter and auxiliary function to specific values, thus making HPM a degenerate form of HAM. This study clarifies the perturbation-theoretic origin of HAM, defines the hierarchical subordination of HPM to HAM, unifies the theoretical framework of homotopy-based nonlinear analytical methods, rectifies common misconceptions in the existing literature, and offers valuable guidance for the rational application, comparative analysis, and further development of such methods.
Read the full abstract
Dynamical Systems · Cross-listed from physics.ao-ph
A Threshold Model for Micrometeoroid Atmospheric Entry: Filippov Dynamics, Survival Estimates, and Survivor-Only Inverse Limits
Micrometeoroids enter Earth's atmosphere at hypervelocity speeds and experience rapid coupling between drag, heating, radiation, melting, ablation, and deceleration. This paper develops a reduced threshold model for the thermal survival boundary of spherical micrometeoroids. The model uses free molecular drag, an exponential atmosphere, projected-area heating, full-sphere radiative cooling, and a surplus-heat ablation rule at the melting temperature. The switching surface $T=T_m$ is treated as a Filippov/complementarity surface. Sustained melting occurs when the local heating-to-radiation ratio exceeds unity. Under the additional Allen–Eggers assumptions of constant radius, constant entry angle, negligible gravity during the main heating interval, and constant transport coefficients, this threshold yields the classical approximate survival scaling $r_0^{\rm crit}\sim v_0^{-3}$. An exact radius-loss identity is obtained along the prescribed Allen–Eggers trajectory, and a perturbative stability estimate explains when this expression approximates the full reduced model. The inverse problem is formulated through a transfer matrix from pre-atmospheric entry bins to observed survivor bins. Entry bins with zero survival probability lie in the survivor-only null space and require external information for reconstruction. The framework gives a compact analytical description of threshold entry survival and identifies the information lost when only surviving particles are observed.
Read the full abstract
Functional Analysis
Time-Scaled Intertwining Cocycles and Identifiability of Multi-Semigroup Mixtures on Hilbert Operator Networks
We study rigidity phenomena for time-scaled intertwining families of dissipative semigroups $\mathcal S_i(t)=e^{-tA_i}$ and prove that a network of bounded injective operators satisfying $K_{ij}\mathcal S_j(t)=\mathcal S_i(\lambda_{ij}t)K_{ij}$ and $K_{ik}=K_{ij}K_{jk}$ necessarily admits a multiplicative gauge representation $\lambda_{ij}=\tau_i/\tau_j$, if and only if the renormalized generators $\{\tau_iA_i\}$ form a common isospectral class with matching eigenspace dimensions; in particular, eigenspaces are transported isomorphically across sectors. The operators $K_{ij}$ define parallel transport in a flat Hilbert bundle over the index network, with flatness derived from the intertwining constraints rather than assumed. As an application, the mixture observable $M(t)=\sum_i w_i\mathcal B_0K_{0i}\mathcal S_i(t)\psi_i$ reduces under finite spectral support to a structured exponential sum. Under spectral separation, the modal parameters are uniquely identifiable, with sector tags determined intrinsically by the operator spectra; under eigenspace observability, active state components are uniquely recovered. Finite-window exact reconstruction holds from $2L$ samples, and the stability bound $\|\widehat\Theta-\Theta_\ast\|_{\mathcal X}\le C_{\mathrm{stab}}\kappa_{\mathrm{exp}}\varepsilon$ follows with constants explicitly controlled by the spectral geometry and observability of the network.
Read the full abstract
Rings and Algebras
Integro-derivation Dzhumadildaev algebras: from the algebra of polynomials
This paper introduces and investigates some properties of algebras constructed from the algebra of polynomials via derivation and integration operators using a process presented by Dzhumadildaev in a previous work. In particular, we discover new classes of infinite-dimensional simple conservative algebras and describe derivations of these algebras of ranks 1 and 2.