Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 22 April
Let \(G\) be a finite simple graph and let \(T\) be its Hashimoto operator on the directed-edge space. We show that edge reversal induces a canonical symmetric/antisymmetric splitting under which \(T\) acquires an explicit \(2\times 2\) block form. The diagonal blocks are \(\tfrac12 L(G)\) and \(-\tfrac12 A(G)\), where \(L(G)\) is the line-graph adjacency and \(A(G)\) is the antisymmetric line-graph adjacency, while the off-diagonal block is the mixed incidence product \(M=|D|^\top D\). This identifies the ordinary and antisymmetric line-graph sectors as the two canonical diagonal sectors of Hashimoto theory and isolates a mixed sector linking them. A Schur-complement argument then gives a factorization \[ \det(I-wT)=\det\!\bigl(I-\tfrac w2 L(G)\bigr)\,C_G(w), \] where \(C_G(w)\) is an explicit correction determinant built from the antisymmetric and mixed sectors. We show that the trivial roots \(w=\pm1\) localize on canonical edge subspaces, and that for line-graph-cospectral pairs all remaining Ihara separation is forced into the correction sector. Although the raw mixed block \(M\) depends on edge orientation, its natural gauge-invariant shadows, including \(MM^\top\), \(M^\top M\), and \(M^\top L^kM\), define a canonical matrix package attached to the graph. In the regular case these collapse to adjacency-side data, but in the irregular case they need not. As an application, we exhibit irregular non-isomorphic graphs that are adjacency-cospectral and line-graph-cospectral yet are separated by the correction sector, and we find further examples where the gauge-invariant mixed shadows separate even when the scalar Ihara polynomial does not. This isolates new irregular edge-space invariants in Hashimoto–Ihara theory.
Differential Geometry
Blow-up phenomena for the constant Q/R-curvature equation
Let $n\ge 25$ be an integer. In this paper, we construct a Riemannian metric $g_{0}$ on $\mathbb{S}^n$, smooth for $n\geq 26$ and of class $C^9$ but not $C^{10}$ for $n=25$, with the property that the set of metrics in the conformal class of $g_{0}$ having positive scalar curvature and positive constant quotient $Q/R$ is non-compact. Equivalently, we construct families of solutions exhibiting blow-up behavior for the following equation \begin{align*} P _{g_{0}}u- \frac{ (n+2 )(n-4 )}{4} u^{ \frac{2}{n-4}} L_{g_{0}}u^{ \frac{n-2}{n-4}} =0, \quad u>0\quad\text{on} \ \mathbb{S}^{n}, \end{align*} where $P _{g_{0}}$ is the Paneitz operator and $ L_{g_{0}}=-\Delta_{g_{0}} +\frac{n-2}{4(n-1 )}R_{g_{0}} $ is the conformal Laplacian of $ g_{0}$.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Amortized Vine Copulas for High-Dimensional Density and Information Estimation
Modeling high-dimensional dependencies while keeping likelihoods tractable re- mains challenging. Classical vine copulas provide an explicit dependence structure but require repeated, costly bivariate fitting. We propose Vine Denoising Copula (VDC)1, an amortized estimator for simplified vines on continuous data. VDC trains a single bivariate denoising network on simulated copulas and reuses it across all vine edges. For each edge, the network maps an empirical histogram to a density grid, and iterative proportional fitting approximately enforces uniform grid marginals. The predicted densities and cached conditional transforms support stan- dard vine recursion, likelihood evaluation, sampling, and information estimation. This retains the classical vine factorization while replacing repeated per-edge fitting with reusable neural inference. Across synthetic and real-data benchmarks, VDC combines accurate bivariate density estimation, competitive information estimates, and faster high-dimensional vine fitting after pretraining. Performance varies across datasets; finite grid resolution and conditional prediction remain limitations. The explicit fitted structure supports edge- and tree-level information decomposition, making repeated dependence analysis more practical.
Read the full abstract
Analysis of PDEs
On the Sadowsky functional for anisotropic ribbons
The equilibrium shape of a thin, elastic, inextensible ribbon minimizes its bending energy. It has been shown that, as the width of the ribbon tends to zero, the bending energy Gamma-converges to the so called Sadowsky functional. In this paper we consider geometrically frustrated anisotropic ribbons with a possibly curved reference configuration. We prove that the Gamma-convergence remains valid under prescribed affine boundary conditions, including, in particular, those satisfied by a Möbius strip.
Read the full abstract
Representation Theory
Unitary highest weight modules for $\mathfrak{su}(p, q)$ and $\mathfrak{so}^{*}(2n)$ with fixed integral infinitesimal character
We classify unitary highest weight modules with a given integral infinitesimal character for the real Lie algebras $\mathfrak{su}(p,q)$ and $\mathfrak{so}^*(2n)$. We treat both regular and singular cases. For $\mathfrak{su}(p,q)$ we identify the unitarizable modules in the Hasse diagrams of the highest weight orbit. Analogous results for the other Hermitian Lie algebras were given in our earlier publications.
Read the full abstract
Geometric Topology
Real bordered Floer homology
Fix a 3-manifold $Y$ with boundary $F\amalg F$ and an orientation-preserving involution $\tau: Y\to Y$ exchanging the boundary components, with nonempty fixed set. To an appropriate kind of Heegaard diagram for $Y$, we describe how to associate a module over the bordered Heegaard Floer algebra of $F$. These modules satisfy a gluing, or pairing, theorem, and extend the "hat" variant of Guth-Manolescu's real Heegaard Floer homology, $\widehat{HFR}(Y,\tau)$. Using these modules, we give a practical algorithm to compute $\widehat{HFR}(Y,\tau)$ for real 3-manifolds $(Y,\tau)$ with connected fixed set.
Read the full abstract
Differential Geometry
Submetry onto one-dimensional space
We provide the full classification of equidistant decomposition of a two-dimensional Euclidean plane and a two-dimensional sphere.
Information Theory
Improved Chase-Pyndiah Decoding for Product Codes with Scaled Messages
We propose an enhanced Chase-Pyndiah decoder that scales extrinsic messages based on decoder confidence of the component decoder, achieving a 0.1 dB gain over the original with negligible complexity increase.
Category Theory
Injectivity paucity in AB5 categories of oversize chains
We construct examples of abelian categories with no non-zero injective (or projective) objects satisfying Grothendieck's AB5 condition. The procedure combines Rickard's examples of AB5 categories without products but some non-trivial injectives (also addressing an apparent gap in the literature) with a 2-functorial construct attaching to any category $\mathcal{C}$ that of $\mathcal{C}$-objects equipped with set-indexed families of endomorphisms.
Read the full abstract
Analysis of PDEs
Periodic homogenization of convolution type operators with irregular Lévy type tails
We establish the homogenization results for a class of nonlocal operators of convolution type with integrable jumping kernel $p$ multiplied by rapidly oscillating periodic or locally periodic coefficients. The associated measure $p(z)dz$ is assumed to belong to the domain of attraction of a symmetric $\alpha$-stable law. We also assume that $p$ satisfies a pointwise Lévy type lower bound and an averaged annular upper bound for points bounded away from the origin, and that the local $L^1$ oscillation of $p$ decays faster at infinity than its local $L^1$-norm. Under these assumptions, we prove the resolvent convergence of the nonlocal operators and explicitly determine the corresponding homogenized nonlocal operator, which is shown to be comparable to the fractional Laplacian. The proof relies on compactness arguments and a refined analysis based on the annular integral upper bound and an $\varepsilon$-cube decomposition.
Read the full abstract
Mathematical Physics
The tentacles landscape: geometric properties of high-dimensional basins of attraction
Basins of attraction in multistable high dimensional dynamical systems are expected to have universal features but very little has been proved rigorously. We consider phase oscillators coupled according to a cycle graph, $\dot\theta_i = f(\theta_{i+1}-\theta_i) + f(\theta_{i-1}-\theta_i)$, with coupling $f$ that is $C^1$, odd, $2\pi$-periodic, and strictly increasing on $(-\pi,\pi)$. We prove the full “octopus” picture of the basins of attraction observed numerically by Zhang and Strogatz [Phys.\ Rev.\ Lett.\ 127 (2021) 194101] and, beyond this model, across a wide family of high-dimensional multistable systems. In our case, we have a family of stable equilibria that can be indexed by their winding number $q \in \mathbb Z\cap(-n/2,n/2)$. Basin volumes obey a Gaussian law $\mu(\mathcal K_q)=\sqrt{6/(\pi n)}\,e^{-6q^2/n}(1+o(1))$ in the winding number. The distance from a uniform sample to its attractor, when divided by $\sqrt n$, concentrates at $\sqrt{\pi^2/3}\approx 1.814$. Along almost every straight line through any twisted state, the ray enters every other basin infinitely many times, with frequencies given by the basin volumes. The inscribed ball at a twisted state has radius $({\pi}/{\sqrt2})(1-{2|q|}/{n})$ for every $n$, while as $n\to\infty$, a typical ray travels distance $(\pi/2)\sqrt{n/\log n}$ before first leaving the basin: the head of the octopus is sharply anisotropic.
Read the full abstract
Numerical Analysis
Construction of Laguerre pseudospectral differentiation matrices
In this paper, we present a stable and efficient approach for constructing Laguerre pseudospectral differentiation matrices. The proposed method reformulates the off-diagonal entries and computes all required quantities simultaneously using an existing fast algorithm that also generates the collocation nodes. For the diagonal entries, a closed-form expression is employed to improve numerical accuracy. This construction avoids the catastrophic cancellation present in classical formulations and yields an all-in-one procedure for generating differentiation matrices. Numerical experiments demonstrate improved robustness and sustained high accuracy for significantly larger numbers of collocation points compared to standard implementations.
Read the full abstract
Optimization and Control
Reliability as a Design Principle: A Systematic Review and Integrated Framework for Renewable-Based Microgrids
Reliable operation is a central motivation for deploying renewable-based microgrids. This paper presents a systematic rapid review that positions reliability as the central organizing principle for microgrid design. Specifically, this review systematically synthesizes recent literature to examine how planning assumptions, optimization formulations, operational flexibility mechanisms, and reliability assessment frameworks jointly shape reliability outcomes. The synthesis shows that reliability in renewable-based microgrids is governed primarily by chronological, time-coupled energy adequacy rather than installed capacity alone, with Dunkelflaute events emerging as a key determinant of adequacy failure. Reliability outcomes are shaped by the joint interaction of resource portfolios, storage operating policies, and state trajectories, network features, and protection feasibility under inverter-dominated operation. The review further demonstrates that reliability indices inherited from conventional power systems are poorly suited for renewable-based microgrids, as they compress performance into single dimensions and obscure temporal, spatial, and service-critical risk concentrations. Across optimization practice, reliability is increasingly embedded through multi-objective and constrained formulations; however, persistent gaps remain in representing correlated renewable scarcity, mission-profile-dependent component reliability, and interruption valuation (e.g., value of lost load and customer damage functions) in a consistent and decision-relevant manner. Overall, this review consolidates planning factors, optimization approaches, reliability evaluation methods, and metric suitability into an integrated roadmap for reliability-centered microgrid planning, and outlines future directions toward state-aware, service-oriented planning and assessment frameworks.
Read the full abstract
Combinatorics
Intersecting families with bounded intersections
Let $\mathcal F\subset 2^{[n]}$ be an $s$-uniform family such that every two distinct sets have a nonempty intersection but intersect in at most $k$ elements. By the well-known Ray-Chaudhuri–Wilson theorem, since the intersections can take at most $k$ different values, we have $|\mathcal F|\leq \binom{n}{k}$. We give a stronger upper bound under our assumptions above, when $n$ is large enough compared to $s$ (and $k+1<s$): $|\mathcal F|\leq \frac{\binom{n-1}{k}}{\binom{s-1}{k}}$. This is a special case of an old theorem of Deza, Erd\H os and Frankl, but our proof is simpler and gives a better threshold for $n$. Furthermore, we prove a generalization of the Erd\H os–Ko–Rado theorem for non-uniform families. Let $\mathcal F\subset \binom{[n]}{k}\cup\binom{[n]}{k+1}\cup\dots\cup\binom{[n]}{s}$, $3\leq k\leq s$, be a family such that for every two distinct sets the size of the intersection is between 1 and $k-1$ and $n$ is large enough then $|\mathcal F|\leq {n-1 \choose k-1}$. Mathematics Subject Classification (2020): 05D05 Keywords: intersecting families, uniform families, Ray-Chaudhuri–Wilson theorem, Erd\H os–Ko–Rado theorem
Read the full abstract
Representation Theory
Representation Cohomology of a Small Category
Let $C_\bullet$ be a simplicial object in the category $Cat$ of small categories. For a field $k$, taking the Grothendieck groups of isomorphism classes of $kC_n$-modules gives rise to a cochain complex, whose cohomology, which we refer to as representation cohomology, is the object studied in this article. In particular, to any small category $C$, we associate a simplicial object in $Cat$, where for each $n\ge 0$ the objects of the level $n$ category are the simplices of the nerve of $C$. The basic properties of the resulting representation cohomology of these simplicial objects and certain subobjects are then studied in detail. We present some general theoretical computations in favourable cases.
Read the full abstract
Mathematical Physics
A semiclassical approach to spectral estimates for random Landau Schrodinger operators
We prove spectral properties for random Landau Schrödinger operators on $L^2(\mathbb{R}^2)$ with bounded, random potentials supported in a square $\Lambda_L \subset \mathbb{R}^2$ of side length $L>0$, using semiclassical pseudodifferential calculus. The semiclassical parameter $h$ is the inverse of the magnetic field strength $B > 0$. By means of the Grushin method, we are led to the analysis of an effective Hamiltonian on $L^2 (\mathbb{R})$, the principal term of which is a sum of certain compact, self-adjoint pseudodifferential operators. By analyzing these operators, we prove semiclassical Wegner and Minami estimates for the random Landau Schrodinger operator in energy intervals in the spectral bands around each Landau level.
Read the full abstract
Number Theory
Non-vanishing of the $p$-adic constant for mock modular forms associated to a newform with real Fourier coefficients
Let $F^{+}$ be a mock modular form associated to a normalized newform $g$. K. Bringmann et. al. obtained a $p$-adic modular form starting from $F^{+}$ by adding a suitable linear combination of Eichler integrals of $g(q)$ and $g(q^{p})$. We denote the coefficients of the Eichler integrals of $g(q)$ and $g(q^{p})$ by $\gamma_{g}$ and $\delta_{g}$. These constants are important in the $p$-adic theory of mock modular forms, but relatively little is known about them at present. For instance, K. Bringmann et. al. raised the question of whether $\delta_{g}$ vanishes when $g$ has CM by an imaginary quadratic field in which $p$ is inert. In previous work, the non-vanishing of $\delta_{g}$ has been proved mainly when $g$ is associated to an elliptic curve. In higher weight, only one example was known for which $\delta_{g}\neq 0$. In this paper, we show that $\delta_{g}\neq 0$ under mild assumptions when all the Fourier coefficients of $g \in S_{k}(\Gamma_{0}(N), \chi)$ are real, without assuming that $g$ has CM. In particular, this provides a class of higher-weight examples for which $\delta_{g}\neq 0$.
Read the full abstract
Dynamical Systems
Transient Stability of Nonlinear Stochastic Dynamics: A Finite-Amplitude Logarithmic Measure Framework
Spacecraft guidance, navigation, and control systems operating during mission-critical phases such as atmospheric entry, powered descent, and planetary landing require reliable assessment of finite-time transient behavior under stochastic uncertainty. Existing stochastic stability frameworks primarily characterize asymptotic or infinitesimal behavior and therefore provide limited insight into finite-amplitude transient amplification over operationally relevant time horizons. This paper develops a finite-amplitude logarithmic measure for nonlinear Itô stochastic differential equations, extending classical matrix measures from infinitesimal to finite-amplitude perturbation evolution. The proposed framework establishes finite-time mean and variance bounds for logarithmic perturbation growth, derives Chernoff-type probabilistic bounds on transient amplification, and shows that mean transient stability does not necessarily guarantee finite-time pathwise safety. The theory is further extended to projected stochastic dynamics, leading to a transient-risk index that quantitatively balances deterministic contraction and diffusion-induced variability for transient-risk-aware system design. The proposed framework is validated through Monte Carlo simulations and flight-like lunar descent telemetry. The results demonstrate substantially improved prediction of nonlinear transient growth compared with classical Jacobian-based approaches and successfully distinguish trajectories exhibiting similar nominal behavior but significantly different transient-risk characteristics. The proposed framework provides a unified methodology for finite-time transient stability analysis, probabilistic transient-risk assessment, and transient-risk-aware guidance, navigation, and control of nonlinear stochastic aerospace systems.
Read the full abstract
Probability
Macroscopic loops in the random loop model on sparse random graphs
We study the random loop model with crosses and bars on sparse random graphs. Our main objective is to prove the existence of macroscopic loops, in the sense that a loop visits a positive proportion of the vertices. We develop a deterministic drift method on arbitrary finite graphs based on three ingredients: a local split–merge–rewire analysis for the loop number, an exact differential identity for the partition function, and a slice estimate reducing the relevant same-loop insertion volume to induced edge counts of small vertex sets. This yields a general criterion in terms of a small-set sparsity condition on the underlying graph. We then verify this condition for random regular graphs, sparse Erdős–Rényi graphs, and simple bounded-degree configuration models, obtaining averaged lower bounds on the probability of a macroscopic loop whenever the edge density exceeds an explicit threshold depending on the loop weight \(\theta\) and the cross parameter \(u\). For integer values of \(\theta\), a trace representation of the partition function implies log-convexity, which upgrades the averaged bounds to pointwise-in-time results away from the threshold time.
Read the full abstract
Numerical Analysis
Constrained Optimal Polynomials for Quantum Linear System Solvers
Quantum linear system solvers typically realize the inverse map as a polynomial transformation of the spectrum, so their practical cost hinges on implementing this transformation at a low polynomial degree. We introduce constrained optimal polynomials as a framework for this task, drawing on classical Krylov subspace theory. Within this framework, we develop two classes of solvers. Constrained Uniform Polynomial (CUP) solvers optimize the tradeoff between approximation accuracy and block encoding normalization under a uniform spectral model consistent with the available bounds. Constrained Adaptive Polynomial (CAP) solvers retain this structure but replace the uniform model with a probability measure reconstructed from spectral moments via a maximum entropy ansatz, where the moments are extracted from QSVT measurements. Numerical experiments under hardware and stochastic noise show that these methods achieve lower error than standard QSVT-based and Chebyshev-iteration-type solvers, particularly in noise-limited regimes. CUP offers robust performance under generic spectra, while CAP provides further improvement when the spectral structure can be exploited.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Approximate Simulation-based Hierarchical Control of Nonlinear Systems
Controlling complex dynamical systems to satisfy sophisticated specifications remains a significant challenge in modern engineering. A promising approach to this problem is the approximate simulation-based hierarchical control (ASHC) technique. In this method, a simplified representation of the complex system, called the abstract system, is first designed and controlled. An interface function is then designed to translate the control law into the input of the complex system, thereby achieving approximate control synthesis. However, most existing results in ASHC are only for linear systems. This paper proposes a constructive method for solving the ASHC problem for nonlinear systems. To this end, we propose invariance equation-based methods to achieve the two classical requirements of the ASHC technique, namely the bounded output discrepancy and the $m$-relation. We then study the solvability conditions of the problem and summarise the overall design procedures. We illustrate the results with a practical example, providing step-by-step solutions to the ASHC problem of a DC-to-DC Ćuk converter.
Read the full abstract
Optimization and Control
A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
The inexact adaptive stepsizes for the conjugate gradient method and the quasi-Newton method are very rare. The exact stepsizes in the gradient method, the conjugate gradient method and the quasi-Newton method for strictly convex quadratic optimization have a unified framework, while the unified framework for inexact adaptive stepsizes in the gradient method, the conjugate gradient method and the quasi-Newton method for strictly convex quadratic optimization still remains unknown. Based on the above observations, we propose a unified framework for inexact adaptive stepsizes in the gradient method, the conjugate gradient method and the quasi-Newton method for strictly convex quadratic optimization, which is called approximately optimal stepsize. The global convergence and the convergence rate of the gradient method with the approximately optimal stepsize are established by exploring the relation between the approximately optimal stepsize and the famous Barzilai-Borwein (BB) stepsizes. Some numerical results are presented, which confirm the remarkable numerical advantage of the gradient method, the conjugate gradient method and the quasi-Newton method with the unified framework for inexact adaptive stepsizes. Some open problems about the gradient method, the conjugate gradient method and the quasi-Newton method with approximately optimal stepsize are raised.
Read the full abstract
Logic
An unusual example of a universal automorphism group
Let $M$ be a Fraïssé structure (a countably infinite ultrahomogeneous structure). We refer to the class of structures embeddable in $M$ as the $\omega$-age of $M$. We consider the following two properties of $M$: we say that $M$ has a universal automorphism group if, for each $A$ in the $\omega$-age of $M$, there is an embedding $\textrm{Aut}(A) \to \textrm{Aut}(M)$, and we say that $M$ has group-extensible $\omega$-age if, for each $A$ in the $\omega$-age of $M$, there is an embedding $A \to M$ such that each automorphism of the image extends to an automorphism of $M$ and the extension map preserves group composition. It is immediate that if $M$ has group-extensible $\omega$-age, then $M$ has a universal automorphism group. We give an example of a Fraïssé structure with a universal automorphism group whose $\omega$-age is not group-extensible, showing that the above two properties are not equivalent.
Read the full abstract
Information Theory · Cross-listed from stat.ML
Decentralized Machine Learning with Centralized Performance Guarantees via Gibbs Algorithms
In this paper, it is shown, for the first time, that centralized performance is achievable in decentralized learning without sharing the local datasets. Specifically, when clients adopt an empirical risk minimization with relative-entropy regularization (ERM-RER) learning framework and a forward-backward communication between clients is established, it suffices to share the locally obtained Gibbs measures to achieve the same performance as that of a centralized ERM-RER with access to all the datasets. The core idea is that the Gibbs measure produced by client~$k$ is used, as reference measure, by client~$k+1$. This effectively establishes a principled way to encode prior information through a reference measure. In particular, achieving centralized performance in the decentralized setting requires a specific scaling of the regularization factors with the local sample sizes. Overall, this result opens the door to novel decentralized learning paradigms that shift the collaboration strategy from sharing data to sharing the local inductive bias via the reference measures over the set of models.
Read the full abstract
Quantum Algebra
On the cohomology of finite tensor categories
It has been conjectured that finite tensor categories have finitely generated cohomology. We show that this is equivalent to finitely generated Hochschild cohomology for the endomorphism algebras of the projective generators.
Dynamical Systems
Co-State Based Data Fusion and Risk Aware Filtering for Spacecraft Navigation and Hazard Prediction
This paper develops a co-state based fusion frame work for spacecraft navigation, consistency monitoring, and hazard forecasting. A differential algebraic co-state is introduced as an instantaneous Lagrange multiplier that enforces measurement dynamics compatibility at the differential level and provides a physically interpretable signal of geometric inconsistency. On a longer time scale, co-state and innovation trajectories are used to learn a continuous time Markov generator governing transitions between coarse behavioural regimes, enabling intrinsic probabilistic risk forecasting through mode probabilities and mean first-passage time (MFPT). The resulting architecture unifies geometric projection, stochastic inference, and probabilistic risk assessment in a single online pipeline without requiring predefined fault models, labelled failure data, or heuristic thresholds. The framework is demonstrated on real lunar powered-descent telemetry, where it detects structural internal model inconsistency significantly earlier than physical divergence or statistical inconsistency in an Extended Kalman Filter (EKF). The results show that geometric inconsistency, stochastic drift, and probabilistic risk rise coherently prior to failure, yielding interpretable and operationally meaningful early-warning capability for autonomous landing systems.
Read the full abstract
Numerical Analysis
A topological decoupling of modified nodal analysis including controlled sources
We derive a topological decoupling of the equations of modified nodal analysis (MNA) to a semi-explicit index one differential-algebraic equation. The decoupling explicitly allows for controlled sources, which play a crucial role in engineering design workflows. Furthermore, the proof is constructive and provides a graph-based algorithmic framework for the computation of the decoupling, enabling its application to a variety of industry problems. These include the generation of consistent initial conditions, model order reduction, (scientific) machine learning, as well as speeding up conventional circuit simulation. In addition, the decoupling preserves the structure of MNA, i.e. the resulting systems remain sparse and key parts remain positive definite. We illustrate the decoupling using multiple examples, including some of the most common subcircuits containing controlled sources. Lastly, we also provide a first software implementation of the decoupling.
Read the full abstract
Numerical Analysis
Weakly convergent fixed point iterations for weakly sequentially non-expansive mappings
Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that a suitable contraction property can be verified. However, such conditions are typically too restrictive for more complex nonlinear equations that lack key structural features such as monotonicity or convexity. In this paper, we develop a general framework for the weak convergence of fixed point iterations based on asymptotic bounds. In particular, we introduce and exploit a weak sequential non-expansiveness property, which is significantly weaker than the global Lipschitz assumptions commonly employed in this context. This approach permits to extend classical convergence results to a broader class of mappings in general (reflexive) Opial spaces, without relying on additional geometric assumptions such as uniform convexity.
Read the full abstract
Analysis of PDEs
Short-wave signal versus indirect prey-taxis
We address short-wave asymptotics for one class of quasi-linear second-order PDE systems involving the cross-diffusion described by the so-called Patlak-Keller-Segel law. It is common to employ these equations for modeling the predator-prey community with the prey-taxis, which means the interactions of two species of particles or cells through which the species called "predators" is capable of moving directionally while searching for the other species called "prey." However, we suppose the predators to be sensitive not to the prey density but to a cue produced by the prey. Additionally, the production of the cue is assumed to be sensitive to the intensity of an external field, which is independent of the community state. This is what we call the external signal. It can be due to the spatiotemporal inhomogeneity of the environment arising from natural or artificial reasons. We assume that the external signal takes a general short-wave form and construct a complete formal asymptotic expansion for the short-wave solutions (modulo solving a chain of the so-called slow systems) with no restrictions on the spatial dimension or kinetics of inter- or intra-specific reactions. Further, we apply the short-wave asymptotic to studying the stability or instability induced by the external signal following Kapitza's theory for the upside-down pendulum. Applying the general results to some special classes of external signals, we get examples of suppressing the taxical transport, examples of the robustness of the species equilibrium to the signal up to a very strong stabilization or, oppositely, destabilization and blurring the borderline in the parametric space between the areas of stability and instability of this equilibrium.
Read the full abstract
Mathematical Physics
Superintegrable 2D systems in magnetic fields with a parabolic type integral
We consider the problem on the existence of two dimensional superintegrable systems in the presence of a magnetic field in the two dimensional Euclidean space. We assume the existence of two integrals of motion, besides the Hamiltonian, that are quadratic polynomials in the momenta. This problem was already studied in the cases where one integral is of Cartesian or polar type [J. Bérubé, and P. Winternitz, J. Math. Phys., 45(5): 1959-1973, 2004]. We continue the investigation by assuming that one of the integrals is of parabolic type and the second integral is of elliptic or (”non-standard”) parabolic type, confirming so far that, on the Euclidean plane, the only two dimensional superintegrable system with quadratic integrals is the one with constant magnetic field and constant electrostatic potential.