Mathematical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 11 March
We propose a novel indicator function for reconstructing acoustic sources from multi-frequency near-field measurements. The theoretical basis is established by a formula relating the scattered field to the source function through the Radon transform. Such a representation enables us to recover the source function directly. The efficiency and robustness of the novel indicator function are verified by several numerical examples.
Probability
Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph
We study pairwise negative correlation for three families of uniform spanning-subgraph measures on the complete graph. In Part~I, we consider the uniform probability measure on connected spanning subgraphs and prove pairwise negative correlation for all sufficiently large complete graphs. In Part~II, we study the uniform measure on spanning forests with a prescribed number of connected components and prove pairwise negative correlation for every fixed number of components when the number of vertices is sufficiently large. In Part~III, we consider connected spanning subgraphs with prescribed excess and establish the analogous result for every fixed excess. The three parts are self-contained and are intended as separate manuscripts.
Read the full abstract
Dynamical Systems
Discrete averaging for discrete time dynamical systems
In this paper we develop the theory of discrete averaging designed to study discrete time dynamical systems defined by iterates of a map. The discrete averaging uses weighted averages over a segment of trajectory to find an autonomous vector field that approximates the original map. The method provides a simple and effective tool for finding adiabatic invariants, both numerically and analytically. It is capable of strengthening various theorems of the classical averaging theory because it eliminates two intermediate steps used in the classical averaging: the suspension procedure that assigns a rapidly oscillating flow to the map and time-dependent coordinate changes that eliminate the dependence on time. We discuss two applications of the discrete averaging - to the dynamics of a near-identity map and to the dynamics of a map in a neighbourhood of a resonant fixed point. We show that the discrete averaging provides explicit uniform bounds for approximation errors. We also show that the discrete averaging can be used to establish domain of validity of adiabatic approximations in numerical experiments.
Read the full abstract
Commutative Algebra
Vertex Dismissibility and Scalability of Simplicial Complexe
We study three nonpure extensions of vertex decomposability, shellability, and Cohen-Macaulayness at the minimum facet dimension. For $b=\operatorname{indim}\Delta$, strong vertex dismissibility gives a deletion-link recursion on the complex itself in which deletion does not decrease $b$, while vertex dismissibility and scalability require the pure initial skeleton $\Delta^{[b]}$ to be vertex decomposable and shellable, respectively. We prove that a join is strongly vertex dismissible exactly when both factors are strongly vertex dismissible. We also show that strong vertex dismissibility implies that every skeleton $\Delta^k=\Delta^{[k]}$, $k\le b$, is vertex decomposable. When $\operatorname{indim}\Delta\leq1$, weak connectedness is equivalent to vertex dismissibility, scalability, and initially Cohen-Macaulayness over some, equivalently every, field. For quasi-forests, these conditions are also equivalent to strong vertex dismissibility. Our main graph result classifies independence complexes of pseudoforests by showing that strong vertex dismissibility, vertex dismissibility, scalability, and initially Cohen-Macaulayness over some or every field are equivalent and are characterized by a componentwise independent domination criterion. Finally, we connect the combinatorial properties of the pure initial skeleton with algebraic properties of its Alexander dual, focusing on vertex splittability, linear quotients, and linear resolutions in fixed degree.
Read the full abstract
Numerical Analysis
Computing and Optimizing the $H^2$-norm of Delay Differential Algebraic Systems
We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption of a finite strong $H^2$-norm. Furthermore, we prove convergence if the rational approximation of the exponential underlying the discretization is well-behaved and the discretization is stability preserving. Numerical results suggest that, for multiple delays, the method converges at cubic rate in the discretization degree for systems of retarded type and linearly for those of neutral type. In the single delay case, we note geometric convergence of the $H^2$-norm for systems of both retarded and neutral type when a symmetric basis is chosen. Explicit formulas are derived for the gradient of the approximation with respect to system parameters and delays. These allow us to compute the entire gradient using only about double the computational time of approximating the $H^2$-norm alone. We illustrate how these can be used to synthesize robust feedback controllers and stable approximate models. The article is concluded by a discussion of how the presented results extend and improve for approximations based on splines. We note acceleration of the convergence rate by about two orders for such a choice. Finally, we prove that a Lanczos tau method using a spline based on Legendre orthogonal polynomials preserves stability and guarantees convergence of the $H^2$-norm.
Read the full abstract
Combinatorics · Cross-listed from cs.FL
The complexity of smooth words over binary alphabets
Smooth sequences over an alphabet of positive integers $\{a,b\}$ are sequences that are infinitely derivable, the emblematic example being the Oldenburger-Kolakoski sequence $\kappa$ over $\{1,2\}$. The main way to study their language is to consider a finite version of smooth sequences called smooth words. In this paper we prove that the smooth words are exactly the factors of smooth sequences and we make progress towards the conjecture that the complexity of smooth words over $\{a,b\}$ grows like $\Theta\left(n^{\log(a+b)/\log((a+b)/2)}\right)$: we prove the lower bound over any alphabet and the upper bound over even alphabets, and we improve the known upper bound over odd and mixed alphabets. We also provide a dichotomy that links the language, the morphicity and the factor complexity of $\kappa$.
Read the full abstract
Geometric Topology
Special alternating links of minimal unlinking number
For any link in the 3-sphere, there is a natural lower bound for the unlinking number in terms of the classical signature. We prove that if this lower bound is sharp for a special alternating link $L$, then the unlinking number of $L$ is necessarily realized by crossing changes in any alternating diagram for $L$. As an application, we compute new values of the unknotting numbers for some special alternating knots with crossing number 11 and 12.
Read the full abstract
Numerical Analysis
Efficient design of continuation methods for hyperbolic transport problems in porous media
Full-physics modeling of multiphase flow in porous media, e.g., for carbon storage and groundwater management, requires the nonlinear coupling of various physical processes. Industry standard nonlinear solvers, typically of Newton-type, are not unconditionally convergent and computationally expensive. Homotopy continuation solvers have recently been studied as a robust and versatile alternative. They tackle challenging nonlinear problems by first solving a simple auxiliary problem and then tracing a solution curve towards the more complex target problem. Robustness and efficiency of the method depends on the iterative numerical curve tracing algorithm as well as on careful design of the auxiliary problem. We assess the traceability of the solution curve for different choices of the auxiliary problem. For the Buckley-Leverett equation, modeling two-phase flow in one dimension, we exemplarily compare the previously introduced vanishing-diffusion and linear constitutive laws homotopy continuation, and a new approach based on the entropy solution of the problem. This provides insight toward systematically and robustly designing homotopy continuation methods for solving complex multiphase flow in porous media.
Read the full abstract
Classical Analysis and ODEs
An invitation to dimension interpolation
A fractal is an object exhibiting complexity at arbitrarily small scales. In order to study and characterise fractals, one is often interested in quantifying how they fill up space on small scales. This gives rise to various notions of fractal dimension. However, even for the simplest examples, the different definitions of dimension may completely disagree about the answer. In this expository article I will examine this phenomenon and use it to discuss and motivate dimension interpolation. Dimension interpolation views these classical notions as boundary points of continuous families of dimensions, thus transforming isolated numerical answers into a coherent geometric picture.
Read the full abstract
Combinatorics
On the leading and penultimate leading coefficients for NRS(2) applied to a cubic polynomial
We prove that the leading and penultimate leading coefficients in $u_3$ of the “error" terms of NRS(2) applied to a cubic polynomial $f(z) =\sum_{i=0}^3 a_i z^i=\prod_{i=1}^3 (1-u_iz)$ with starting point $(-\frac{a_1}{a_2}, -\frac{a_1}{a_2})$ are positive-coefficient polynomials in $u_1$ and $u_2$. Our proof for the leading coefficients simplifies that of \cite{DeFranco} and extends to the penultimate leading coefficients as well.
Read the full abstract
Group Theory
On the Product of Coninvolutory Affine Transformations
A complex matrix is called coninvolutory if $T\overline{T}=I$. In this paper, we study decompositions of affine transformations in $\mathrm{Aff}(n,\mathbb{C})=\mathrm{GL}(n,\mathbb{C})\ltimes \mathbb{C}^n$ into products of coninvolutions. We prove that an affine transformation $g$ is a product of two coninvolutions in $\mathrm{Aff}(n,\mathbb{C})$ if and only if its linear part $L(g)$ is $c$-reversible; that is, $L(g)$ is conjugate to $\overline{L(g)}^{-1}$ in $\mathrm{GL}(n,\mathbb{C})$. Equivalently, $g$ is conjugate to $\overline{g}^{-1}$ in $\mathrm{Aff}(n,\mathbb{C})$. We further characterize elements that are products of three coninvolutions via consimilarity and show that every $g=(A,v)\in \mathrm{Aff}(n,\mathbb{C})$ with $|\det(A)|=1$ can be expressed as a product of at most four coninvolutions.
Read the full abstract
Combinatorics
Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
We study connectivity functions, that is, integer-valued symmetric submodular functions on a finite ground set attaining $0$ on the empty set. For a connectivity function $f$ on an $n$-element set $V$ and an integer $k\ge 0$, we show that the family of all sets $X\subseteq V$ with $f(X)=k$ admits a polynomial-size representation: it can be described by a list of at most $O(n^{4k})$ items, each consisting of a set to be included, another set to be excluded, and a partition of remaining elements, such that the union of some members of the partition and the set to be included are precisely all sets $X$ with $f(X)=k$. We also give an algorithm that constructs this representation in time $O(n^{2k+7}\gamma+n^{2k+8}+n^{4k+2})$, where $\gamma$ is the oracle time to evaluate $f$. This generalizes the low rank structure theorem of Bojańczyk, Pilipczuk, Przybyszewski, Sokołowski, and Stamoulis [Low rank MSO, arXiv, 2025] on cut-rank functions on graphs to general connectivity functions. As an application, for fixed $k$, we obtain a polynomial-time algorithm for finding a set $A$ with $f(A)=k$ and a prescribed cardinality constraint on $A$.
Read the full abstract
Information Theory
Two-Layer Stacked Intelligent Metasurfaces: Balancing Performance and Complexity
Stacked intelligent metasurfaces (SIMs) have emerged as a powerful paradigm for wave-domain signal processing, enabling fine-grained control over electromagnetic (EM) propagation in next-generation wireless systems. However, conventional multi-layer SIMs often suffer from excessive structural complexity, high computational overhead, and significant power attenuation across layers, limiting their performance. In this paper, we first characterize SIMs from the perspectives of functionality, application, and layer configuration, revealing the inherent trade-offs between signal processing flexibility and power efficiency. Then, two representative 2-layer architectures, the meta-fiber-connected SIM (MF-SIM) and the flexible intelligent layered metasurface (FILM), are introduced, each advocating a distinct 2-layer SIM design philosophy. Moreover, we identify several open challenges in topology optimization for MF-SIM, shape control for FILM, and hybrid 2-layer architectures. Finally, case studies considering 2-layer MF-SIM and FILM assisted point-to-point multiple-input multiple-output (MIMO) and multi-user communication systems validate that properly designed 2-layer SIMs can significantly reduce power loss and optimization burden while maintaining good signal processing performance, offering a promising pathway toward practical SIM-enabled 6G systems.
Read the full abstract
Differential Geometry · Cross-listed from stat.CO
A Python implementation of some geometric tools on Kendall 3D shape space for practical applications
This work addresses the challenge of analyzing geometric structures using Kendall's 3D Shape Space. While Riemannian geometry provides a robust framework for shape analysis (independent of scale, position, and orientation) the transition from theoretical manifolds to practical computational workflows remains difficult. Although Geomstats is currently the leading Python library for manifold-based statistics, it lacks specific utilities required for advanced 3D shape analysis. This article introduces tools designed to bridge this gap, translating complex mathematical abstractions into efficient, accessible software solutions for researchers.
Read the full abstract
Dynamical Systems
Admissibility approach to nonuniform exponential dichotomies roughness with nonlocal perturbations
Nonuniform exponential dichotomy serves as an important characteristic of nonuniform hyperbolicity, while admissibility of function classes is often used to characterize nonuniform exponential dichotomy. In this paper, we investigate the preservation of nonuniform exponential dichotomy under certain nonlocal perturbations. By utilizing the concept of admissibility of a pair of function classes, we establish sufficient conditions to ensure that the dichotomy results are consistent with those in the homogeneous situation. These results need to satisfy a smallness integrability condition.
Read the full abstract
Algebraic Geometry
Real Line Congruences of Trilinear Birational Maps
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and thus easy to evaluate. These mappings have recently been analyzed, and a classification over the field of complex numbers has been obtained. The parameter lines of trilinear mappings form three two-parameter families of straight lines, and thus it is promising to analyze these mappings with the tools provided by the field of line geometry, which is a classical branch of higher geometry. Indeed, in the birational case, the three families of lines form space-filling line congruences associated with rational mappings that can be used to parameterize certain algebraic surfaces. Moreover, the three systems are closely related. In this paper, we present a classification, over the field of real numbers, of the parametric line congruences arising from trilinear birational maps.
Read the full abstract
Probability · Cross-listed from cs.DS
Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
Efficiently locating rare targets requires balancing the exploration of novel space with the exploitation of local vicinities. While this tradeoff is well-documented in simplified environments, its behavior in realistic three-dimensional environments remains unclear. Here we analyze intermittent Lévy walks in three dimensions and show that search efficiency becomes strongly dependent on target geometry, with volume, surface area, and elongation governing performance across the Lévy spectrum. Against this geometric complexity, the Cauchy walk ($\mu = 2$) emerges as a robust, near-optimal solution across a wide range of target geometries. Specifically, we prove that for convex targets of surface area $\Delta$ in a domain of volume $n$, the optimal expected detection time scales as $n/\Delta$, and that the Cauchy walk achieves this scaling up to polylogarithmic factors, while other Lévy strategies are suboptimal in different geometric regimes. Our findings provide a theoretical framework for biological movement patterns, including marine predator foraging and immune surveillance, and inform the design of efficient search algorithms for engineered systems such as autonomous nanoscale explorers.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Graph Symmetry Organizes Exceptional Dynamics in Open Quantum Systems
Exceptional points (EPs), indicative of parity-time (PT) symmetry breaking, play a central role in non-Hermitian physics, yet most studies begin from deliberately engineered effective Hamiltonians whose parameters are tuned to exhibit exceptional behavior. In realistic open quantum systems, however, dynamics are governed by Lindblad superoperators whose spectral structure is high-dimensional, symmetry-constrained, and not obviously reducible to minimal non-Hermitian models. A general framework for discovering exceptional dynamics directly from microscopic dissipative models has been lacking. Here we introduce a symmetry-resolved approach for identifying and characterizing exceptional points directly from the full Liouvillian generator. Correlated dissipation induces graph symmetries that decompose Liouville space into low-dimensional invariant sectors, within which minimal non-Hermitian blocks govern the onset of EPs and PT-breaking behavior. We further introduce a numerical diagnostic - the exceptional-point strength $\mathcal{E}$ - based on eigenvector conditioning, which quantifies proximity to defective dynamics without requiring analytic reduction. Applied to tight-binding models with correlated dephasing and relaxation, the method reproduces analytically predicted exceptional seams and reveals universal scaling of $\mathcal{E}$ near EP manifolds. More broadly, the framework enables systematic discovery of hidden exceptional structure in complex or high-dimensional open systems and is naturally compatible with matrix-free and tensor-network implementations for scalable many-body applications.
Read the full abstract
Combinatorics
Central limit theorems for high dimensional lattice polytopes: symmetric edge polytopes
We investigate symmetric edge polytopes generated by Erdős–Rényi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are governed by graph-theoretic structure. Focusing on the number of polytope edges and on the number of edges in unimodular triangulations, we derive precise asymptotics for expectations and variances and establish central limit theorems with explicit rates of convergence. Our analysis combines a detailed combinatorial-geometric study of the graph configurations determining the facial structure with the discrete Malliavin–Stein method for normal approximation. In particular, we identify a distinguished parameter value at which the leading variance term cancels, producing an atypical fluctuation regime. To the best of our knowledge, the results obtained here constitute the first distributional limit theorems for random lattice polytopes
Read the full abstract
Spectral Theory
Anderson localization of long-range quasi-periodic operators via Dynamical Rigidity
We establish Anderson localization for long-range quasi-periodic operators with large trigonometric potentials and Diophantine frequencies, the proof is based on a novel dynamical rigidity argument.
Differential Geometry
Rigidity of Critical Point Metrics under some Ricci curvature constraints
A critical point metric is a critical point of the total scalar curvature functional restricted to the space of constant scalar curvature metrics on a closed manifold with unit volume. It was conjectured in 1980's that every critical point metric must be Einstein. In this paper, we prove that this conjecture is true if the norm of the traceless Ricci operator $|\widetilde{Ric}|$ is constant. For $3$-dimensional case, we prove that the conjecture is true, if the traceless Ricci operator satisfies $tr((\widetilde{Ric})^3)\geq -\frac{R}{12}|\widetilde{Ric}|^2$, where $R$ denotes the scalar curvature. where R denotes the scalar curvature.
Read the full abstract
Dynamical Systems
Complexity function and entropy of induced maps on hyperspaces of continua
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems. We also provide a simple criterion for $f$ that implies $C(f)$ has infinite topological entropy.
Read the full abstract
Optimization and Control
Practical Regularized Quasi-Newton Methods with Inexact Function Values
Many practical optimization problems involve objective function values that are corrupted by unavoidable numerical errors. In smooth nonconvex optimization, quasi-Newton methods combined with line search are widely used due to their efficiency and scalability. These methods implicitly assume accurate function evaluations and thus may fail to converge in noisy settings. Developing fast and stable quasi-Newton methods for such scenarios is therefore crucial. To address this issue, we propose a novel noise-tolerant regularized quasi-Newton method equipped with a relaxed Armijo-type line search, designed to remain stable under inaccurate function evaluations. By combining a regularization parameter update rule inspired by Objective-Function-Free Optimization and the AdaGrad-Norm method, we prove an order-optimal $\mathcal{O}(\varepsilon^{-2})$ complexity bound under errors in function values. We performed extensive experiments on the CUTEst benchmark collection with artificially noisy objective function evaluations, as well as with low-precision floating-point arithmetic (64-, 32-, and 16-bit). The results demonstrate stable performance under reduced precision and function-value noise while retaining practical convergence speed and computational cost.
Read the full abstract
Differential Geometry
A Cheng-type Eigenvalue-Comparison Theorem for the Hodge Laplacian
We consider the class of closed Riemannian $n$-manifolds with Ricci curvature and injectivity radius bounded below by uniform constants, and an upper bound on the diameter. We establish a uniform upper bound for the eigenvalues of the Hodge Laplacian acting on differential forms on Riemannian manifolds in this class, similar to the classical eigenvalue comparison theorem proved by Cheng for the Laplace-Beltrami operator acting on smooth functions. This extends earlier work of Dodziuk and Lott, which required sectional curvature bounds in addition to bounds on other geometric quantities. As an application, we obtain uniform eigenvalue estimates for the connection Laplacian acting on $1$-forms.
Read the full abstract
Numerical Analysis
Realizability-preserving finite element discretizations of the $M_1$ model for dose calculation in proton therapy
We present a deterministic framework for proton therapy dose calculation based on finite element discretizations of the energy-dependent $M_1$ moment model. The nonlinear $M_1$ system is derived from the Fokker–Planck equation for charged particles and closed using an entropy-based approximation of the second moment. Energy is treated as a pseudo-time coordinate. The zeroth and first moments of the proton fluence are evolved backward in energy. To ensure hyperbolicity and physical admissibility, we employ a monolithic convex limiting (MCL) strategy. Representing the standard continuous Galerkin discretization in terms of auxiliary `bar' states, we construct a nonlinear scheme that is provably invariant domain preserving (IDP) w.r.t. convex realizable sets consisting of all admissible states. The realizability of the bar states is enforced using the MCL technology for homogeneous hyperbolic systems. The forcing induced by stiff scattering is incorporated using Strang-type operator splitting. We use an explicit strong-stability-preserving Runge–Kutta method for the radiation transport subproblem and exact integration in the forcing steps, which guarantees the IDP property. The deposited dose is defined as the integral of a weighted zeroth moment over a bounded energy range. It is accumulated during the backward-in-energy evolution. Numerical experiments demonstrate that the proposed Strang-MCL method produces accurate and physically consistent dose distributions.
Read the full abstract
Algebraic Topology
$RO(C_p \times C_p)$-graded cohomology of universal spaces and the coefficient ring
We compute the $RO(C_p \times C_p)$-graded Bredon cohomology of equivariant universal and classifying spaces associated to families of subgroups, with coefficients in the constant Mackey functor $\underline{\mathbb{F}_p}$. An explicit description of the resulting coefficient ring, including its multiplicative structure, is obtained. These computations are then applied to the study of lifts of cohomology operations via the Bredon cohomology of equivariant complex projective spaces.
Read the full abstract
Algebraic Geometry
Motives, cohomological invariants and the Freudenthal magic square
We investigate cohomological invariants and motivic invariants of semisimple algebraic groups arising in the Freudenthal magic square. Besides, we show that if the Rost invariant of a strongly inner group of type $E_7$ is a sum of at most two symbols modulo $2$, then it is isotropic over an odd degree field extension, and use this fact to give a different proof of a result of Petrov and Rigby. Moreover, we give a motivic interpretation of a result of Garibaldi and Petersson about a cohomological invariant of degree $5$ for certain groups of type $^2E_6$ which detects their isotropy.
Read the full abstract
Differential Geometry
Existence of Hermitian metrics with prescribed Hermitian-Yang-Mills tensors I
In this paper, we solve the prescribed Hermitian-Yang-Mills tensor problem. Let $ E $ be a holomorphic vector bundle over a compact Kähler manifold $(M,\omega_g) $. Suppose that there exists a smooth Hermitian metric $ h_0 $ on $E$ such that the Hermitian-Yang-Mills tensor $ \Lambda_{\omega_g}\left(\sqrt{-1} R^{h_0}\right) $ is positive-definite. Then for any positive-definite Hermitian tensor $ P\in \Gamma\left(M,E^*\otimes \overline E^*\right) $, there exists a unique smooth Hermitian metric $ h $ on $E$ such that $$\Lambda_{\omega_g} \left(\sqrt{-1} R^h\right)=P.$$ The proof is based on a new comparison theorem for Hermitian-Yang-Mills tensors. Inspired by these results, we have also derived quantitative Chern number inequalities that apply to both holomorphic vector bundles and compact Kähler manifolds.
Read the full abstract
Combinatorics
Anti-Ramsey forbidden poset problems
A family $\mathcal{G}$ of sets is a weak copy of a poset $P$ if there is a bijection $f:P\rightarrow \mathcal{G}$ such that $p\leqslant q$ implies $f(p)\subseteq f(q)$. If $f$ satisfies $p\leqslant q$ if and only if $f(p)\subseteq f(q)$, the $\mathcal{G}$ is a strong copy of $P$. We study the anti-Ramsey numbers $\mathrm{ar}(n,P), \mathrm{ar^*}(n,P)$, the maximum number of colors used in a coloring of $2^{[n]}$ that does not admit a rainbow weak or strong copy of $P$, respectively. We establish connections to the well-studied extremal numbers $\mathrm{La}(n,P)$ and $\mathrm{La^*}(n,P)$ and determine asymptotically $\mathrm{ar^*}(n,T)$ for all tree posets $T$ and $\mathrm{ar^*}(n,O_{2k})$ for all crown posets $O_{2k}$.
Read the full abstract
Combinatorics
Maximum Inverse Sum Indeg Index of Trees and Unicyclic Graphs with Fixed Diameter
The bond incident degree (BID) index of a graph \(G\) is defined as \(\BID(G) = \sum_{u_1u_2\in E(G)} f(d(u_1), d(u_2))\), where \(f(x,y)=f(y,x)\) is a real-valued function. In this paper, using graph transformation methods, we establish the maximum bond incident degree indices of trees and unicyclic graphs with a fixed diameter for the inverse sum indeg (ISI) index. The ISI index corresponds to the function \(f(x,y) = \frac{xy}{x+y}\). We prove that for trees \(T \in \mathbb{T}_{n,d}\) with \(d \geq 3\) and \(n \geq d+3\), the maximum ISI index is attained by the tree \(T_{n,d}^*\). For unicyclic graphs, we characterize the extremal graphs for diameters \(d=2\), \(d=3\), and \(d \geq 4\). Specifically, the maximum ISI index is achieved by \(S_n^+\) for \(d=2\), by \(C_n^*\) for \(d=3\), and by \(\mathcal{U}_{n,d}\) for \(d \geq 4\).