Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 8 May

Optimization and Control · Cross-listed from eess.SY

Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability

Designing spacecraft trajectories remains challenging in the presence of stochastic effects such as maneuver execution errors and observation uncertainties. Although covariance control and belief-space planning provide useful tools for designing robust control policies and information-aware trajectories under uncertainty, practical methods remain limited for partially observable trajectory optimization problems in which trajectory design, orbit determination, and correction maneuver planning are tightly coupled. This paper presents a stochastic differential dynamic programming algorithm for such coupled problems. The proposed method optimizes the nominal control sequence and feedback gains subject to a belief-state transition model and general mission constraints, explicitly accounting for the dependence of covariance propagation on the nominal trajectory without relying on the separation principle. Numerical examples demonstrate that the proposed algorithm produces navigation-aware and uncertainty-robust solutions across a range of dynamical systems, observation models, and uncertainty levels.
Read the full abstract

Information Theory

A Log-Domain Approximation of SOCS Decoding for Turbo Product Codes

This paper studies low-complexity soft-output decoding of turbo product codes with extended Bose–Chaudhuri–Hocquenghem component codes. Recent soft-output from covered space (SOCS) decoding substantially improves the quality of extrinsic information compared with the conventional Chase–Pyndiah decoder, but its probabilistic-domain implementation is less attractive for hardware-oriented realizations. We therefore propose a log-domain approximation of SOCS based on max-log approach. The proposed soft-input soft-output rule replaces probability-domain operations with a piecewise-linear function of reliability gaps between competing Chase-II decoding list and out of the list hypotheses, which preserves compatibility with the standard iterative TPC decoding loop. Numerical results for a TPC built from (256,239) eBCH component codes show that the proposed decoder clearly outperforms the baseline Chase–Pyndiah decoder with the same list size and approaches the performance of SOCS decoder.
Read the full abstract

All authors Oleg Nesterenkov, Kirill Andreev, Alexey Frolov, Pavel Rybin

Functional Analysis

On posinormality of weighted composition-differentiation operators on $H^2(\mathbb{D})$

In this article, the posinormality and coposinormality of weighted composition-differentiation operators on Hardy space $H^2(\mathbb{D})$ are investigated. It is observed that while a composition-differentiation operator $D_{\phi,n}$ fails to be posinormal, the weighted composition-differentiation operator $D_{\psi,\phi,n}$ can be posinormal for specific choices of $\psi, \phi$. Some necessary conditions are obtained for posinormality and coposinormality of the operator $D_{\psi,\phi,n}$. Furthermore, the adjoint formula for this operator is derived which also helped us to examine some results regarding posinormality of this operator.
Read the full abstract

All authors Gour Hait, Sarita Ojha, Nirupam Ghosh, Riddhick Birbonshi

Combinatorics

Asymptotics and inequalities for the broken $k$-diamond partition function

Many papers have studied inequalities for Andrews and Paule's broken $k$-diamond partition function $\Delta_{k}(n)$ when $k=1$ or $2$. In this paper, we derive an exact formula for $\Delta_{k}(n)$ when $k\geq 1$. Building on this result, we also derive an asymptotic formula for $\Delta_{k}(n)$ with an explicit error bound. Using this formula, we prove that for $k\geq 1$ and sufficiently large $n$, $\Delta_{k}(n)$ satisfies the Turán and Laguerre inequalities of any order and exhibits asymptotic complete monotonicity. Define $n_k:=\max\left\{\left\lceil8k^{3}+\frac{k+1}{12}\right\rceil,526\right\}$. Furthermore, we show that $\Delta_{k}(n)$ is log-concave for $k\ge3$ and $n\ge n_k$. Consequently, it follows that $\Delta_{k}(a)\Delta_{k}(b)\ge\Delta_{k}(a+b)$ for $k\ge3$ and $a,b \ge n_k$.
Read the full abstract

Dynamical Systems

Computer-Assisted Proofs in Dynamical Systems: A Case Study of a Heteroclinic Orbit in the Shimizu–Morioka System

The radii polynomial approach is an a posteriori validation method based on the contraction of a quasi-Newton operator. We apply this strategy to give a computer-assisted proof of a transverse heteroclinic orbit in the Shimizu–Morioka system, validating the equilibria and eigenpairs, the local invariant manifolds via the parameterization method, and the connecting orbit via a boundary-value problem. For each subproblem we present a four-step procedure: $(i)$ zero-finding formulation, $(ii)$ approximate zero, $(iii)$ approximate inverse, and $(iv)$ bound estimates. This highlights the unifying structure behind the a posteriori validation method. Alongside the analysis, we include code snippets implemented in Julia using the RadiiPolynomial library.
Read the full abstract

Rings and Algebras

Opposite brace triples, Hopf braces and matched pairs of Hopf algebras

In this paper the category of opposite brace triples is introduced in a general braided monoidal setting. Under cocommutativity, it is proved to be isomorphic to the category of Hopf braces. Furthermore, if one considers the subcategories arising from fixing one of the underlying Hopf algebras, then these two categories are also isomorphic to the category of matched pairs over that Hopf algebra.
Read the full abstract

Algebraic Geometry

Geometry of weak contact conics to irreducible quartics with 2 nodes and 1 cusp via rational elliptic surfaces and Zariski pairs

Let $\mathcal{Q}$ be an irreducible quartic with two nodes and one cusp as its singularities and let $\mathcal{C}$ be a conic such that the intersection multiplicity at each point of $\mathcal{C} \cap \mathcal{Q}$ is even and $\mathcal{C} \cap \mathcal{Q}$ contain at least one smooth point $z_o$ of $\mathcal{Q}$. In this paper, for every $\mathcal{Q}$ we find all possible conics $\mathcal{C}$ as above via studying geometry of $\mathcal{C}$ and $\mathcal{Q}$ through that of integral sections of a rational elliptic surface which canonically arises from $\mathcal{Q}$ and $z_o \in \mathcal{C} \cap \mathcal{Q}$. As an application, we construct Zariski pairs of degree 7 and degree 8, whose irreducible components consist of $\mathcal{Q}$, $\mathcal{C}$ and line passing through two of the singular points of $\mathcal{Q}$ .
Read the full abstract

Analysis of PDEs

Gradient Catastrophe for Solutions to the Conservation Laws with Source Term

This paper studies singularity formation for conservation laws with a source term. Motivated by John (1974) and Barlin (2023), we prove finite-time blow-up under initial data conditions weaker than those in Barlin. Moreover, we show that a sufficiently small compact support length of the initial data promotes blow-up. Hence, global existence can only be achieved when the initial data have a large compact support length.
Read the full abstract

Number Theory

Anderson generating function of rank-one Drinfeld Module over rational function fields

We establish a fundamental breakthrough in rank-one Drinfeld module arithmetic by deriving explicit formulas over the integral domain $\A = H^{0}(\mathbb{P}^1-P_{\rho}, \mathcal{O}_{\mathbb{P}^1})$, which generalizes the classical polynomial ring ($N=1$) to the projective line associated with an infinite place of degree $N \geqslant 2$. This fills a longstanding gap by developing a comprehensive parallel to Carlitz module theory foundational in positive characteristic arithmetic for the understudied case of infinite places of degree $>1$. We construct Anderson generating functions for these modules and link them to the Carlitz period via Pellarin's series, exponential torsion modules, and logarithmic deformations. These constructions provide powerful tools for studying such Drinfeld modules and their associated $L$-series, central to modern number theory. A key result reveals a critical distinction from Carlitz theory: the standard Anderson generating function residue formula fails due to Galois group action. We resolve this obstruction by introducing an exponential action, enabling simultaneous study of all twisted exponential functions a major methodological advance. We further show that Anderson generating function computation involves the dual of Drinfeld modules, leading to an appropriate residue formula modification. Notably, our natural approach generalizes to arbitrary Dedekind domains, extending our results beyond $\A$ and opening new avenues in Drinfeld module theory.
Read the full abstract

Combinatorics · Cross-listed from cs.DM

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width

We prove that every class of Eulerian directed graphs of bounded carving width (equivalently of bounded degree and treewidth) is well-quasi-ordered by strong immersion. In fact, we prove a stronger result, namely that every class of Eulerian directed graphs of bounded carving width, where every vertex is additionally labeled from a well-quasi-order, fixes a linear order on its incident edges, and may impose further restrictions on how the immersion is allowed to route paths through it, is well-quasi-ordered by an adequate notion of strong immersion. To this extent, we develop a framework seemingly suited to prove well-quasi-ordering for classes of Eulerian directed graphs by (strong) immersion and present a first meta theorem in that direction. We complement our results by observing that the class of Eulerian directed graphs of unbounded degree is not well-quasi-ordered by strong immersion, even if we assume the treewidth of the class to be at most two. We conclude with a dichotomy result, proving for a very restricted class of Eulerian directed graphs of unbounded degree that it is not well-quasi-ordered by strong immersion, but it is well-quasi-ordered by weak immersion.
Read the full abstract

Optimization and Control

Data-Driven Contextual-Aware Uncertainty Set for Robust Dispatch of Power Systems

Both the level of conservativeness and the computational burden in robust optimization are critically influenced by uncertainty set design. However, contextual side information is rarely exploited in robust dispatch of power systems characterized by irregular data distributions, which hinders the explicit characterization of the relationship between covariates and uncertain parameters. To address this issue, a data-driven method for constructing contextual-aware uncertainty set is proposed in this letter. Based on a conditional Gaussian mixture model, a set of covariates is leveraged as side information to design uncertainty sets tailored to historical data exhibiting irregular distributions. The resulting set is formulated as a union-of-subsets formulation, and a mixed integer linear reformulation is adopted to describe the worst-case realization across all subsets. Finally, the effectiveness of the proposed method is demonstrated through numerical experiments applied to robust unit commitment.
Read the full abstract

All authors Zhaojun Ruan, Yulin Liu, Le Fu, Libao Shi

Mathematical Physics · Cross-listed from physics.chem-ph

On the single-Hessian Gaussian wavepacket dynamics

Single-Hessian Gaussian wavepacket dynamics (GWD) significantly reduces the computational burden of Heller's local harmonic GWD, while maintaining comparable accuracy in approximating vibronic spectra. Here, we provide a new, symplectic derivation of the equations of motion of single-Hessian GWD and show that, unlike the local harmonic version, this method conserves the non-canonical symplectic structure on the manifold of Gaussian wavepackets and$-$for bounded dynamics in smooth potentials$-$avoids the drift of energy. Our numerical results suggest that, despite being much more efficient than the local harmonic variant, the single-Hessian GWD exhibits the same $\mathcal{O}(\hbar)$ asymptotic error in averages of observables. To further accelerate numerical simulations, we implement high-order time-stepping geometric integrators that are time-reversible and conserve the norm and symplectic structure exactly, regardless of the time step. In addition, we present explicit expressions for the exact evolution of the width of a single-Hessian Gaussian wavepacket in a general potential, as well as for the exact evolution of the whole wavepacket in a global harmonic potential. Using on-the-fly ab initio Gaussian wavepacket dynamics on the first excited-state surface of ammonia, we numerically confirm the conservation of geometric properties by these integrators and demonstrate that high-order integrators can enhance both accuracy and computational efficiency. We also compute the photoelectron spectrum of the difluorocarbene anion and the absorption spectrum of methylamine, and find that, in comparison with experiment, single-Hessian GWD outperforms global harmonic models and matches the accuracy of local harmonic GWD. Finally, we identify which spectral features are sensitive to the choice of reference Hessian.
Read the full abstract

Algebraic Geometry

Modularity of Feynman Integrals and Factorization of Appell F2 Systems

Certain Feynman integrals can be expressed as periods of differential forms on Calabi–Yau manifolds. We provide a mathematical proof of a result of Duhr and Maggio on the modularity of the two-dimensional conformal traintrack integral. Our approach is based on a factorization of the associated Picard-Fuchs system into a tensor product of Gauss hypergeometric systems via a gauge transformation due to Clingher, Doran and Malmendier.
Read the full abstract

Dynamical Systems

Non-intrusive spectral submanifold model reduction for geometrically nonlinear rotating structures with Coriolis and centrifugal forces

Rotating structures are widely observed in engineering applications such as turbomachinary and wind turbine. These rotating structures, particularly for blades made by lightweight materials, can undergo large deformation in operations and display complex nonlinear dynamics under the coupling interaction of geometric nonlinearity, Coriolis effect and centrifugal force. Finite element (FE) methods provide a powerful and accurate modeling approach for capturing the complex nonlinear dynamics for realistic rotating structures, yet its high-dimensionality causes significant challenge to efficient prediction for the nonlinear vibration. Here, we present a non-intrusive spectral submanifold (SSM) model reduction for these FE models of rotating structures. We use COMSOL to establish FE models and simulate these FE models to verify the accuracy of SSM-based reduction. We first compute nontrivial static equilibrium induced by the centrifugal force and then construct non-intrusively SSM based reduced-order model (ROM) anchored at the equilibrium. These SSM-based ROMs enable efficient and accurate extraction of backbone and forced response curves. We use a suite of examples with increasing complexity to demonstrate the effectiveness of the SSM reduction, including a rotating beam, a twisted plate, a rotor with two disks, and an internally resonant fan with three blades. The obtained results also highlight the significant effects of Coriolis force on the nonlinear vibration of rotating structures.
Read the full abstract

All authors Hejun Gao, Yiliang Wang, Yan Qing Wang, Jie Yuan, Mingwu Li

Numerical Analysis

Kolmogorov $\varepsilon$-entropy of numerical solutions for scalar conservation laws with convex flux

Building on the information-theoretic perspective of P.~D.~Lax [Proc.\ Sympos., Math.\ Res.\ Center, Univ.\ Wisconsin, 1978], we establish a two-sided quantitative compactness estimate for numerical solutions of scalar conservation laws with a uniformly convex flux, expressed in terms of Kolmogorov $\varepsilon$-entropy. We prove that, under specific grid constraints, conservative, monotone finite-difference schemes satisfying a discrete one-sided Lipschitz condition (OSLC) preserve the $1/\varepsilon$ Kolmogorov entropy scaling of the corresponding exact entropy solution set, matching the bounds obtained by De~Lellis and Golse [Comm.\ Pure Appl.\ Math.\ 58 (2005)] and by Ancona, Glass, and Nguyen [Comm.\ Pure Appl.\ Math.\ 65 (2012)]. Specifically, the upper bound follows from the discrete OSLC, while the lower bound relies on a uniform approximation argument on a bounded-variation precursor class. Our results show that prototypical first-order methods are high-resolution in Lax's sense. Finally, we abstract the lower bound mechanism into a general transfer principle, discuss implications for information recovery via post-processing, and indicate directions for future work.
Read the full abstract

Information Theory

UMVUE-Type Estimators under Bregman Losses

We study unbiased estimation under Bregman losses and develop an extension of the classical theory of uniformly minimum variance unbiased estimators (UMVUEs). Exploiting bias–variance-type decompositions for Bregman divergences, we consider two natural loss functions, $D_{\varphi}(\theta,\hat{\theta})$ and $D_{\varphi}(\hat{\theta},\theta)$, and their corresponding notions of unbiasedness. We show that the latter formulation reduces to the classical setting, whereas the former yields a different framework in which unbiasedness is characterized in the dual space induced by $\nabla\varphi$. For the nontrivial case, we establish analogs of the Rao–Blackwell and Lehmann–Scheffé theorems, providing a systematic construction of type-I Bregman UMVUEs.
Read the full abstract

Probability

A note on the equivalence of super-Poincaré inequality

In this paper we will study the equivalence between super-Poincaré inequality and some log-Sobolev type inequalities, including weak log-Sobolev inequality and super log-Sobolev inequality. The explicit relations between associated rate functions will also be established.

Mathematical Physics

Volume-Independent Spectral Stability of Energy-Truncated Effective Hamiltonians in Quantum Spin Systems

We prove a volume-uniform effective-Hamiltonian theorem for bounded finite-range quantum spin systems on possibly infinite lattices. For any finite target region, we construct an energy-truncated Hamiltonian and prove a volume-uniform spectral-overlap bound controlling the leakage of its low-energy spectral subspace into the high-energy spectral subspace of the original Hamiltonian. The bound may contain non-exponential spectral-window terms, but its cutoff-dependent remainder decays exponentially in the cutoff. In finite volume, this yields stability of low-lying eigenvalues, with eigenvalue errors controlled by the exponentially small cutoff-dependent remainder. In infinite volume, we prove the corresponding spectral-overlap estimate in the GNS representation of an infinite-volume ground state. Thus, for bounded finite-range interactions, we extend and strengthen the effective-Hamiltonian mechanism of Arad, Kuwahara, and Landau by replacing the finite-volume operator-norm formulation with a volume-uniform spectral-overlap formulation applicable in the thermodynamic limit.
Read the full abstract

Numerical Analysis

Newton's method for optimal transport problem on graphs

In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on the resulting nonlinear systems encounters two potential difficulties: (i) if the graph contains cycles, edge variables are not unique, and (ii) there is no guarantee that the density variables remain positive. To address these challenges, we introduce a finite-difference-type Newton method that eliminates cycle-induced redundancies through a spanning-tree gauge, resulting in a reduced set of independent variables and a well-posed, sparse linear system. For the lattice graph arising from the continuous optimal transport problem, density positivity can also be guaranteed by using an upwind discretization subject to a CFL-type condition. We further demonstrate the versatility of the proposed scheme by applying it to a range of problems, including optimal transport on lattices and random graphs, inverse optimal transport problems, and social network analysis.
Read the full abstract

All authors Qujiangxue Chen, Jianbo Cui, Luca Dieci, Haomin Zhou

Statistics Theory

Self-normalized tests for multistep conditional predictive ability

This paper proposes self-normalized tests for multistep conditional predictive ability in forecast comparison. By normalizing the sample mean of the transformed loss differential using functionals of its cumulative sum (CUSUM) process, specifically an adjusted-range normalizer for scalars and a matrix normalizer for vectors, our approach avoids direct estimation of the long-run covariance matrix. Consequently, it eliminates the need for the ad hoc bandwidth, kernel, and lag-truncation choices required by traditional methods. We establish the asymptotic theory for these statistics, deriving pivotal null limiting distributions and proving test consistency. Monte Carlo simulations show that the proposed tests effectively mitigate the finite-sample size distortions associated with traditional heteroskedasticity and autocorrelation consistent (HAC) methods, while retaining strong empirical power against conditional predictability alternatives.
Read the full abstract

Algebraic Topology · Cross-listed from cs.LG

Have Graph – Will Lift? The Case for Higher-Order Benchmarks

After a somewhat rocky start, geometry and topology have established a foothold in machine learning. Message passing, either on graphs or higher-order complexes, is one of the main drivers of geometric deep learning, and paradigms that were once considered to be firmly in the realm of the abstract-like sheaves-have been "tamed" to serve as novel inductive biases for model architectures in topological deep learning. The veritable diversity of models, however, is in stark contrast to the scarcity of suitable benchmark datasets. As a result, researchers often resort to lifting existing graph datasets to include higher-order information. In this opinion paper, I want to encourage the community to also source new datasets, which may be used to prop up the foundations of our research field.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Convex Optimization with Nested Evolving Feasible Sets

Convex Optimization with Nested Evolving Feasible Sets (CONES) is considered where the objective function \(f\) remains fixed but the feasible region evolves over time as a nested sequence \(S_1 \supseteq S_2 \supseteq \cdots \supseteq S_T\). The goal of an online algorithm is to simultaneously minimize the regret with respect to hindsight static optimal benchmark and the total movement cost $M_\cA(T)$ while ensuring feasibility at all times. CONES is an optimization-oriented generalization of the well-known nested convex body chasing (NCBC). When the loss function is convex, we propose a lazy-algorithm and show that it achieves $O(T^{1-\beta}), O(T^\beta)$ simultaneous regret and movement cost for any $\beta \in (0,1]$, over a time horizon of $T$. When the loss function is strongly convex, we propose a Frugal algorithm that simultaneously achieves zero regret and a movement cost of $O(\log T)$. To complement this, we show that any online algorithm with $o(T)$ regret has a movement cost of $\Omega\left(\sqrt{\frac{\log{T}}{\log \log T}}\right)$.
Read the full abstract

Combinatorics

Counting LEGO configurations

We discuss the problem of counting certain LEGO structures, primarily those comprising parallel $w \times 1$ tiles. These can be combined, as a single LEGO structure, by interlocking the tiles. %Alternatively, if the interlocking condition is relaxed, so that tiles can also be placed end-to-end, a greater number of possible configurations results. We also study the historically earlier problem of counting the number of ways to combine $2 \times 4$ LEGO tiles, which in this case gives a 3-dimensional structure. In all cases the number of configurations is dominated by an exponential growth term, $\mu^n$ where $n$ is the number of tiles. We present an algorithm for counting these various LEGO configurations, and use the data to estimate the asymptotics. We analyse the data so generated, and conjecture that, for the two-dimensional structures, the number of possible configurations grows like $A(w)\mu(w)^n/n,$ and we give numerical estimates for $A(w)$ and $\mu(w)$ for $w < 11,$ while for the three-dimensional structure the number of possible configurations is conjectured to grow like $A\mu^n/n^{3/2},$ where $\mu = 117.25 \pm 0.05.$ We also study the sequences that arise when we fix the number of tiles $n,$ and vary the tile size $w.$ We prove that the sequences are polynomials of degree $n-1,$ and we give these explicitly for $n=1 \ldots 14.$
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

QuadNorm: Resolution-Robust Normalization for Neural Operators

Normalization layers in neural operators usually compute statistics by uniformly averaging discrete grid values, making the normalization itself discretization-dependent and thereby a source of transfer error across different resolutions or meshes. To enable discretization robustness, we introduce a quadrature normalization family that replaces existing uniform averaging in normalization layers with numerical quadrature: QuadNorm and BlendQuadNorm. On endpoint-inclusive uniform grids, the proposed quadrature moments are $O(h^2)$-consistent across discretizations, meaning that their cross-resolution mismatch decays quadratically with grid spacing. A transfer-error bound then predicts how normalization-induced mismatch scales with both the resolution gap and network depth. The experiments show the same gap- and depth-scaling trends predicted by the transfer-error bound. On Darcy, QuadNorm delivers the best cross-resolution performance at every tested target resolution from $64^2$ to $256^2$; on real-data benchmarks, Transolver with QuadNorm achieves nearly resolution-invariant transfer. The largest gains appear on nonperiodic PDEs and nonspectral architectures, where native-resolution improvements also emerge. We also validate BlendQuadNorm, which stays close to LayerNorm behavior and serves as a conservative default for periodic FNO settings. These results identify normalization as a previously overlooked source of resolution dependence in neural operators.
Read the full abstract

All authors Bum Jun Kim, Makoto Kawano, Yusuke Iwasawa, Yutaka Matsuo

Probability

Moderate Deviation Principle for a Stochastic Approximation Process

In this paper, we investigate a stochastic approximation procedure $\left(X_n\right)_{n\ge 0}$ taking values in $R$. The process is adapted to a filtration $(F_n)_{n\ge 0}$ and satisfies the recursion $X_{n+1}=X_n+\frac{b}{n+1}\big[g(X_n)+U_{n+1}\big]$, where $b>0$, $g:R \to R$ is a function and $\left(U_n\right)_{n\ge 1}$ is a sequence of bounded martingale differences adapted to the filtration $(F_n)_{n\ge 1}$. We establish the moderate deviation principle for the stochastic process $(X_n)_{n\ge 0}$. As auxiliary results, we also obtain the exponential inequality for $(X_n)_{n\ge 0}$ and the moderate deviation principle for weighted sums of bounded martingale differences.
Read the full abstract

Numerical Analysis

Solving Convolution-type Integral Equations using Preconditioned Neural Operators

Convolution-type integral equations arise from various fields, e.g., finite impulse response filters in signal processing and deblurring problems in image processing. When solving these equations, conventional numerical methods, like the multigrid method, can only efficiently solve the low-frequency components in the error, but not the high-frequency components. In this paper, we apply neural operators to address this issue. By adopting a preconditioning approach, we propose a novel training strategy that trains neural operators to solve the high-frequency components efficiently. Then, we combine the neural operators with some classical iterative solvers, like the weighted Jacobi method, to obtain an efficient hybrid iterative algorithm for the integral equations. We analyze the generalization error of our training strategy and the convergence of the hybrid iterative algorithm. We test our algorithms on large-scale and ill-conditioned linear systems discretized from one- and two-dimensional convolution-type integral equations. Our proposed algorithm significantly outperforms the multigrid method and the preconditioned conjugate gradient method in both iteration numbers and computational time.
Read the full abstract

Combinatorics

Independent Locating-Dominating Sets in Pseudotrees

An ILD-set in a connected graph is a subset $S$ of vertices such that it is both independent and locating-dominating. The independent locating-dominating number of a graph G is the minimum cardinality of an ILD-set set of $G$. A well-known fact is that any graph with girth at least 5 has an ILD-set, but that is not clear for graphs with girth 3 and 4. In this work, we prove that there are graphs with no ILD-sets for any order $n\geq 9$ and girth 4, also showing some sufficient conditions for a bipartite graph to contain an ILD-set. Moreover, we focus our attention on trees and on unicyclic graphs, showing that every tree and every unicyclic graph contains ILD-sets, whenever in the latter case, it is twin-free. Finally, a number of bounds, realization theorems and algorithms to find an ILD-set in those families of graphs are provided.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.AO

Global Analytical Solution of the Identical Kuramoto Model for N=3 via Koopman Eigenfunctions

The Kuramoto model is a paradigmatic model of collective synchronization in coupled oscillator systems. Although its mathematical properties have been extensively investigated, explicit phase trajectories from arbitrary initial conditions have been available only for the simplest case, N = 2. In this study, we provide a global analytical solution for the phase trajectories of the all-to-all coupled Kuramoto model with three identical oscillators (N = 3). We construct Koopman eigenfunctions from products of observables whose growth rates, weighted by the exponents, sum to a constant, and obtain a nontrivial constant of motion from the ratio of two such eigenfunctions. Using their explicit exponential time dependence, we reduce trajectory reconstruction to time-dependent quartic equations and recover the phase trajectories. The same construction also yields Koopman eigenfunctions for the Kuramoto-Sakaguchi model with arbitrary phase lag and for the N = 4 all-to-all and ring-coupled systems. These results provide a concrete example in which Koopman eigenfunctions are used not only to characterize but also to explicitly solve a widely studied nonlinear model.
Read the full abstract