Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 27 April
The long-standing Nakai Conjecture asks whether differential operators detect singularities on algebraic varieties. On a smooth variety over a field of characteristic zero, the ring of differential operators is generated by first order derivations. Nakai asked whether the converse holds. In this paper, we prove that for the coordinate ring of an isolated weighted homogeneous hypersurface singularity, there always exists a second order derivation that is not generated by first order derivations. This verifies the Nakai Conjecture for isolated weighted homogeneous hypersurface singularities.
Complex Variables
Newman's Tauberian theorem, the Riemann-Lebesgue Lemma, and abstract analytic number theory
We give a generalized and effective version of Bekehermes' improvement of Newman's Tauberian theorem. To do so we prove an effective version of the Riemann-Lebesgue Lemma for functions of bounded $p$-variation. We apply our Tauberian theorem to abstract analytic semigroups and prove a version of the prime number theorem as well as an estimate for Mertens' function with explicit error term.
Read the full abstract
Group Theory
Colored Stallings graphs and Counterexamples to Stallings equalizer conjecture
The famous Stallings equalizer conjecture has remained open for more than 40 years, which states that, for any free group \(F_n\) of rank \(n\ge 2\), any free group \(F\), and any two monomorphisms $g,h:F_n\to F,$ the equalizer $\Eq(g,h)=\{w\in F_n\mid g(w)=h(w)\}$ satisfies $\rk \Eq(g,h)\le n.$ The only known case is $n=2$, due to A. D. Logan in 2022. By introducing the notion of colored Stallings graphs, we show that for every integer \(n\ge 2\) there exist monomorphisms $g,h:F_n\longrightarrow F_2$ such that$\rk\Eq(g,h)\ge 2n-2.$ This disproves Stallings equalizer conjecture for $n\ge 3$.
Read the full abstract
Commutative Algebra
Finite projective dimension and a question of Jorgensen
This paper studies finite projective dimension of finitely generated modules over a Noetherian local ring, by means of spectral sequence methods related to generalized local cohomology. Our main goal is to address a question raised by D. Jorgensen over fifteen years ago, concerning a prescribed bound (via Ext vanishing) for projective dimension over a complete intersection local ring. We obtain similar results involving other homological dimensions as well. Also we make use of weakly full ideals to derive further criteria for prescribed bound on projective dimension.
Read the full abstract
Information Theory
Fisher Information and Dynamical Sampling I
Information theory is a powerful framework to capture aspects of dynamical systems with multiple degrees of freedom. Mathematically, the dynamics can be represented as a continuous curve $\mathcal{C}$ on a suitable hyperplane in flat space and the Fisher information provides the norm of an infinitesimal displacement along this curve. In many applications, however, we do not have direct access to $\mathcal{C}$. Instead, we have to reconstruct the latter from a time-series of measurements (obtained as samples of size $n$), which are represented by an ordered set of points $\widehat{\mathcal{C}}$ on the same hyperplane. In this work, we calculate the bias of the Fisher information for large $n$, which provides a quantitative estimation for how accurately the dynamics of a system can be reconstructed from a given set of sampled data. Based on this result, we show that a clustering of the degrees of freedom reduces the bias and thus improves the accuracy with which the new system can be described with the same data. Inspired by a recent proposal for such a clustering, we provide a quantitive assessment of the loss of information, which allows to estimate how much information about the dynamics of a system can reliably be extracted based on a given set of data. We illustrate our findings in the case of a simple compartmental model. Although the latter is inspired by epidemiology, the results of this work are applicable to very general dynamical models with multiple degrees of freedom.
Read the full abstract
Geometric Topology
On the nonexistence of good involutions on symplectic quandles
We investigate a necessary and sufficient condition for the existence of good involutions on symplectic quandles, which are defined on free $R$-modules equipped with an antisymmetric bilinear form. In particular, we discuss the nonexistence of such good involutions under various algebraic conditions.
Read the full abstract
Algebraic Geometry
On Maximal Symmetries of Toric Varieties over Fields of Characteristic Zero
In this paper, we study complete simplicial toric varieties admitting faithful actions of large symmetric groups. First, we correct a recent classification result by Esser, Ji, and Moraga concerning $4$-dimensional toric varieties with $S_6$-actions over the complex numbers $\mathbb{C}$, providing the complete list of such varieties. Second, we extend the study of maximal symmetric group actions to non-closed fields $k$ of characteristic zero satisfying a certain arithmetic condition (such as $\mathbb{Q}$ or $\mathbb{R}$). Over such fields, we reveal a striking rigidity in dimensions $n \neq 2$, where the maximal symmetric action uniquely restricts the variety to the projective space $\mathbb{P}^n_k$. In sharp contrast, for dimension $n=2$, we discover and classify an infinite family of split and non-split toric surfaces admitting faithful $S_4$-actions by utilizing the equivariant Minimal Model Program and Galois descent.
Read the full abstract
Mathematical Physics
Torus one-point functions in critical loop models
We show that in critical loop models, torus 1-point functions can be expressed in terms of sphere 4-point functions at a different central charge. Unlike in the Moore–Seiberg formalism, crossing symmetry on the sphere therefore implies modular covariance on the torus. We systematically compute torus 1-point functions in critical loop models, using a numerical bootstrap approach. We focus on the 1-point functions of the 6 simplest primary fields, which give rise to 10 solutions of modular covariance equations. Such 1-point functions are infinite linear combinations of conformal blocks. The coefficients are products of double Gamma functions, times polynomial functions of loop weights. For each solution, we determine the first 6 to 12 polynomials.
Read the full abstract
Statistics Theory
Posterior Invariance of Multiplicative Contrasts under Margin Constraints in Contingency Tables
Measures of association in contingency tables, such as odds ratios and their generalizations, are often studied under different sampling schemes that either fix or leave random the margins of the table. While classical results show that certain odds ratios are unaffected by constraining the margins, it is less clear when this invariance holds more generally. This paper studies posterior inference for a broad class of multiplicative contrasts of multinomial cell probabilities, which we refer to as generalized odds ratios, and addresses exactly when fixing a margin alters inference about them. We consider Bayesian inference under multinomial sampling and under models in which partition sums of the table are fixed in advance, and assume that the marginal and conditional parameters are independent a priori. Under additional mild assumptions, we show that the posterior distribution of a generalized odds ratio is invariant to fixing a margin if and only if the coefficients defining the contrast sum to zero within the margin.
Read the full abstract
Optimization and Control · Cross-listed from cs.DS
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
Computing approximate Karush–Kuhn–Tucker (KKT) points for constrained nonconvex programs is a fundamental problem in mathematical programming. Interior-point trust-region (IPTR) methods are particularly attractive for such problems because they maintain strictly feasible iterates throughout the iterative process and converge to a first-order and second-order KKT solution. Their scalability, however, is limited by the repeated computation of trust-region search directions. In this paper, we propose an approximate first-order IPTR framework that addresses this bottleneck by replacing exact trust-region subproblem solves with an approximate projector maintained through low-rank updates. The resulting method preserves feasibility and the global convergence guarantees of standard IPTR schemes while substantially reducing the per-iteration cost. We further extend the framework to obtain approximate second-order KKT points using only first-order information by integrating a gradient-based negative-curvature routine, thus avoiding explicit Hessian computations. We conduct numerical experiments to demonstrate the scalability of our approximate first-order IPTR framework in large-scale settings, where it achieves up to a $2.48\times$ speedup over the existing first-order IPTR algorithm.
Read the full abstract
Functional Analysis
Integral representation of polynomial local functionals on convex functions
Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of smooth polynomial local functionals, which is based on a Paley–Wiener–Schwartz-type classification of the Goodey–Weil distributions associated to these functionals under support restrictions. As an application, density results for various families of Monge–Ampère-type operators are established.
Read the full abstract
Optimization and Control
Scheduling and Routing in the Flexible Job Shop with Heterogeneous Transbots and Zoning: A Constraint Programming Approach
Coordinating production and material transfers is increasingly important in modern manufacturing systems equipped with mobile transfer robots, known as transbots. This study considers a flexible job shop environment in which heterogeneous transbots transport parts between machines. The shop floor is partitioned into zones, with each transbot assigned to a specific zone, and inter-zone movements are facilitated through designated handoff points. These zoning constraints, transbot heterogeneity, and inter-zone handoffs give rise to a challenging variant of the flexible job shop problem with embedded transbot-routing features, resulting in substantial computational complexity. Motivated by a real manufacturing setting, two constraint programming formulations that integrate production scheduling with transbot routing are proposed: an arc-based formulation that explicitly models machine-to-machine transfers, and an operation-embedded formulation that embeds transfer decisions directly within the operation scheduling structure, leading to tighter synchronization between production and transportation decisions. Both formulations capture machine flexibility, zoning restrictions, handoff coordination, and collision-free path planning. To efficiently solve the resulting problem, a book-and-release strategy is proposed. It coordinates transbot movements without enforcing rigid routing patterns. Computational experiments on case study-adapted benchmark-based demonstrate that the proposed formulations generate high-quality solutions with strong computational performance. The generation of instances is described in detail to support future work in this emerging area.
Read the full abstract
Number Theory
Linear Bounds for Differentiable Limits of Weak Pair Correlation Functions
For $s \geq 0$ and a parameter $0 < \beta < 1$, the weak pair correlation function $f_{N,\beta}(s)$ for the first $N \in \mathbb{N}$ elements of a sequence $(x_n)_{n \in \mathbb{N}} \subset[0,1]$ is evidently non-decreasing in $s$. Moreover, it satisfies $\lim_{N \to \infty} f_{N,\beta}(0) = 0$ if the elements of $(x_n)_{n \in \mathbb{N}}$ are distinct. Beyond these basic observations, little is known in general about the behavior of the limiting function. In this note, we investigate the situation in which the limit $f_\beta(s)=\lim_{N\to\infty} f_{N,\beta}(s)$ exists for all $s\ge 0$ and is differentiable in a neighborhood of the origin. Under these assumptions, we establish the bounds $2s \le f_\beta(s) \le f'_\beta(0)\, s,$ thereby providing general constraints on the limiting function.
Read the full abstract
Optimization and Control
Heterogeneous-Horizon Exact-Weight Local SGD
We study adaptive aggregation for heterogeneous local SGD in convex finite-sum optimization, allowing heterogeneous local horizons, minibatch sizes, gradient noise, and participation. We introduce HEW-Local SGD, a corrected local-SGD method that chooses nodewise server weights by minimizing an explicit one-round upper bound on the next objective value. This yields an exact local-control formulation with a threshold simplex update, separable amplitude updates, and a one-step guarantee under arbitrary predictable participation. We also introduce two post-local variants: a corrected heterogeneous method and a simpler homogeneous specialization. We establish one-step guarantees and global benchmark-style convergence results. In the regimes where comparison is appropriate, the theory matches the qualitative communication-efficient picture of recent LocalSGD/SCAFFOLD analyses, while also giving explicit guarantees for unequal local horizons.
Read the full abstract
Combinatorics
Separation profiles of free products
We deduce from a theorem of Dvorak–Norin that the separation and treewidth profiles of graphs are asymptotically equivalent, resolving a question of Huang–Hume–Kelly–Lam. As an application, we calculate the separation profiles of Cayley graphs of tree-graded graphs in terms of their pieces. Examples of tree-graded graphs include Cayley graphs of free products of finitely generated groups.
Read the full abstract
Combinatorics
A representation-theoretic interpretation of the Schur expansion of two-row genomic Schur functions
Genomic Schur functions were introduced by Pechenik and Yong in connection with the $K$-theory of Grassmannians. Pechenik proved that genomic Schur functions admit a positive expansion in the basis of fundamental quasisymmetric functions and, for partitions with two parts, a positive expansion in the Schur basis. Later, Kim and Yoo constructed $0$-Hecke modules associated with genomic Schur functions and conjectured that the latter expansion admits a representation-theoretic interpretation in terms of $0$-Hecke modules. In this paper, we prove the conjecture of Kim and Yoo, thereby obtaining a representation-theoretic interpretation of the Schur expansion in the two-row case.
Read the full abstract
Operator Algebras
Dynamics in large scale geometry
We investigate the large scale geometry of certain metric spaces through the lens of dynamics. Our approach establishes a close connection between large scale dynamical phenomena and operator algebras by characterizing various large scale dynamic behaviors in terms of GNS representations of the uniform Roe algebras arising from natural canonical states. Our dynamical systems are given by the Stone-Čech boundary of metric spaces together with their inverse semigroup of partial translations. This defines a space of orbits and we characterize Hausdorffness and $T_1$-ness of this space by the failure of coarse embeddability of certain metric spaces. Surprisingly, while the orbit space has very weak separation properties, we show that it satisfies a certain ”localized version” of Urysohn's lemma. We show that the topology of the space of orbits and quasi-orbits are given by the space of irreducible representations of uniform Roe algebras and by the space of their primitive ideals, respectively. As a highlight of the theory developed herein, we provide classes of spaces such that the prime ideals of their uniform Roe algebras are primitive. This is the case for instance of spaces whose orbit space is $T_1$.
Read the full abstract
Algebraic Geometry
Second gonality of smooth aCM curves on quartic surfaces in $\mathbb{P}^3$
For a smooth irreducible curve $C$, its second gonality $d_2$ is defined to be the minimum integer $d$ such that $C$ admits a linear series $g_d^2$. In this paper, we compute the second gonality of a smooth aCM curve $C$ lying on a smooth quartic surface in $\mathbb{P}^3$, whose Clifford index is computed by a net on $C$.
Read the full abstract
Analysis of PDEs
Multiple positive solutions with prescribed masses for a coupled Schrödinger system: mass mixed and Sobolev critical coupled case
The aim of this paper is to establish multiple positive normalized solutions $(u,v,\lambda_1,\lambda_2)\in H^1(\mathbb{R}^N,\mathbb{R}^2)\times \mathbb{R}^2$ to the following coupled Schrödinger system involving Sobolev critical exponent: $$ \begin{cases} -\Delta u+\lambda_1 u=\mu_1|u|^{p-2}u+\nu\alpha|u|^{\alpha-2}u|v|^\beta, x\in \mathbb{R}^N,\\ -\Delta v+\lambda_2 v=\mu_2|v|^{q-2}v+\nu\beta|v|^{\beta-2}v|u|^\alpha, x\in \mathbb{R}^N,\\ \int_{\mathbb{R}^N}|u|^2\mathrm{d}x=a, \int_{\mathbb{R}^N}|v|^2\mathrm{d}x=b, \end{cases} N\geq 3, $$ where $\mu_1,\mu_2, \nu, a, b>0$. We are particularly interested in the mass mixed case that $2<p, q<2+\frac{4}{N}, \alpha>1, \beta>1$, and $\alpha+\beta=2^*:=\frac{2N}{N-2}$. For sufficiently small $\nu>0$, we demonstrate that the above system admits two positive solutions, one of which serves as a local minimizer, and the other as a mountain pass solution. By developing some new technical lemmas on the interaction estimates, we are managed to resolves Soave's open problem [J. Funct. Anal., 2020, Remark 1.1] within the context of the system case. Notably, our existence result holds true for all dimensions $N\geq 3$. Our results also significantly extend the result of Gou and Jeanjean [Nonlinearity, 2018, Theorem 1.1] to the Sobolev critical coupled case and removing the hypothesis “either $p,q\leq \alpha+\beta-\frac{2}{N}$ or $|p-q|\leq \frac{2}{N}$" for $N\geq 5$. Additionally, we also establish a sequence of properties for the local minimizer, including local uniqueness, continuity with respect to the small parameter $\nu$, and the limiting profiles for $\nu\rightarrow 0^+$.
Read the full abstract
Information Theory
Sub-Nyquist Sampling for Reaching Theoretical Minimal Sampling Rate Boundary
Wideband spectrum sensing motivates sub-Nyquist sampling architectures that exploit spectral sparsity, yet in blind scenarios where subband locations are unknown, existing schemes require sampling rates at least twice the theoretical minimum. To this end, we propose a dual-frequency aliasing wideband converter (DAWC), which partitions the multiband spectrum into non-uniform frequency intervals and selectively samples only a subset of them, requiring no prior knowledge of subband locations. We demonstrate that under mild conditions on the signal and the system, DAWC achieves perfect subband localization and waveform reconstruction at the theoretical minimum rate. Moreover, we introduce an innovative side-information-aided subspace pursuit (MSSP) algorithm exploiting the common support structure inherent in the signal column submatrices for exact recovery of the spectrum support set. Based on the restricted isometry property (RIP), we provide stable recovery guarantees for MSSP in the presence of noise. Numerical simulations show that the proposed scheme achieves superior spectrum recovery accuracy compared to state-of-the-art methods.
Read the full abstract
Differential Geometry
The linear Elasticity complex: a natural formulation
We reformulate the Elasticity complex and Saint-Venant's compatibility condition using the generalized differential complex of Dubois-Violette-Henneaux. This is just a slight and natural modification of the de Rham complex to take account of the index symmetry of the tensors involved. An integrating formula to recover the displacement from the strain and similar to the Poincaré formula is provided. Finally, a Hodge star operator and a dual complex is introduced, which allows to recover stress potentials in dimensions 2 and 3.
Read the full abstract
Analysis of PDEs
Lie symmetry analysis of the nonlinear generalized heat equation for varying cross-section geometry
We study the nonlinear generalized heat equation $C(u)u_t=\frac{1}{z^{\nu}}\left(K(u)z^{\nu}u_z\right)_z$, where $C(u)$ and $K(u)$ are temperature-dependent thermal coefficients and $\nu>0$ is a geometric parameter describing the varying cross-section geometry. By applying the classical Lie symmetry method, we derive the determining equations and perform a complete classification of the admitted Lie point symmetries according to the functional dependence between $C(u)$ and $K(u)$. The analysis shows that the symmetry structure splits naturally into two principal cases: $C(u)/K(u)$ non-constant and $C(u)/K(u)=\beta$ constant. In the first case, only the basic symmetries are admitted for arbitrary coefficients, whereas additional generators appear under special compatibility relations. In the second case, the equation can be transformed to a linear radial heat equation by the substitution $v=\int K(u)du$, yielding an extended symmetry algebra. For each case, we construct the infinitesimal generators, commutator tables, one-parameter transformation groups, and corresponding invariant reductions. Invariant and similarity solutions are obtained and then specialized to several physically relevant subclasses, including power-law, exponential-type, and linear constitutive coefficients. The results provide a unified symmetry-based model for the analysis of generalized nonlinear heat equations in non-Cartesian geometries.
Read the full abstract
Combinatorics
Note on polychromatic coloring of hereditary hypergraph families II
We extend a recent construction concerning polychromatic colorings of hereditary hypergraph families. For every integer $h\ge 4$ we construct a $(2h-1)$-uniform hypergraph which has no polychromatic $3$-coloring, but all of whose $h$-heavy restricted subhypergraphs are $2$-colorable. Together with the previously known case $h=3$, this gives examples with uniformity $2h-1$ for every $h\ge 3$. The construction is based on complements of suitable $h$-uniform hypergraphs on $3h-1$ vertices. For $h\ge 9$ we prove existence by a simple probabilistic argument; the remaining cases $4\le h\le 8$ are certified by a short exhaustive computer check, whose fully reproducible description and source code are included in the appendix.
Read the full abstract
Differential Geometry
The moduli space of Higgs pairs
In this paper, we study the moduli space of Higgs pairs, which can be considered as a generalization of holomorphic pairs. Higgs pairs are an example of quiver bundles. We introduce the notion of $\tau$-stability of Higgs pairs for $\tau\in\mathbb{R}$ and establish the Kobayashi-Hitchin correspondence for Higgs pairs. The differential-geometric objects corresponding to stable Higgs pairs is called the vortex equations for Higgs bundles. We analyze the moduli space of stable Higgs pairs when the base space of vector bundle is a compact Riemann surface and obtaine the following results. Firstly, we prove that the moduli space is non-singular complex manifold for a suitable choice of $\tau$. Secondly, we determine the Poincaré polynomial of the moduli space for rank 2 bundle. Lastly, we construct a map from the moduli space of stable Higgs pairs to the moduli space of stable Higgs bundles and proved that the map is a fibration under suitable assumptions.
Read the full abstract
Commutative Algebra
A Necessary and Sufficient Condition for Uniqueness of Euclidean Division
A well-known result from the 1960s characterizes all Euclidean domains in which division is guaranteed to produce a unique quotient and remainder. As this relies on the historical (and more restrictive) definition of a Euclidean domain, the question of whether the result still holds under the modern definition was left open. In this paper, we prove the answer is afirmative.
Read the full abstract
Probability
Numerical approximation of Markovian BSDEs in infinite horizon and elliptic PDEs
We study backward stochastic differential equations (BSDEs) in infinite horizon and design efficient numerical schemes for solving them. We establish a probabilistic representation of the solution of the BSDE using Malliavin derivative and prove results for contraction of a Picard scheme. We develop three numerical schemes, of which the first two are based on a fixed point argument using contraction, imposing additional assumptions compared to what is needed for existence and uniqueness of the solution. The first scheme is a space grid based approximation where we establish tight numerical error bounds using a growth truncation argument; it performs well in low dimensions but computational times increase exponentially with dimension. The second scheme uses neural network approximations for which we have proved a convergence result. Using neural networks alleviates the curse of dimensionality, giving good accuracy in very high dimensions. The third scheme also uses neural networks but does not rely on contraction arguments, showcasing good performance even for larger z-Lipschitz dependence outside the domain of contraction.
Read the full abstract
Probability
Weak solutions to distribution-dependent stochastic Volterra equations
We prove the existence of weak solutions for distribution-dependent stochastic Volterra equations under linear growth and continuity conditions on the coefficients and mild regularity assumptions on the kernels, including singular kernels. To this end, we formulate an associated local martingale problem and establish its connection with weak solutions. Moreover, we derive continuity and integrability properties of the solutions.
Read the full abstract
Probability
"True" self-avoiding walks on general trees
We study the asymptotic behavior of “true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse with probability proportional to the current weight of that edge, where the weight of each edge after being traversed $n$ times is given by $w(n)=\exp(-\beta n)$. We show that the process exhibits a sharp phase transition between recurrence and transience. The critical value is determined by the branching-ruin number of the tree, which coincides with the Hausdorff dimension of the boundary of the tree under a suitable metric. We prove that the walk is almost surely transient when the branching-ruin number is greater than $1/2$, and recurrent when it is less than $1/2$. This resolves an open question posed by Kosygina.
Read the full abstract
Analysis of PDEs
From PDEs on standard domains to self-similar particle systems on fractals
We construct transported PDEs on self-similar fractal domains from reference equations posed on the unit interval, and derive explicit self-similar interacting particle systems that approximate the resulting dynamics. The construction combines a measure-preserving isometry between $L^2$-spaces on $[0,1]$ and on the fractal \cite{Med2026}, a nonlocal-to-local approximation of differential operators \cite{PauTre2025}, and a Galerkin discretization on the canonical self-similar partitions. This yields a two-parameter approximation scheme whose error separates a nonlocal consistency term from a Galerkin network term. We work out the transport, Burgers, and heat equations, discuss the relation with intrinsic operators on fractals, and outline extensions to local charts and to pullbacks of nonlocal equations on fractal domains. Moreover, the reverse mapping transforms a nonlocal evolution equation on a fractal domains into the evolution equation on the unit interval, where the methods of classical numerical analysis can be applied. This suggests a promising direction for the development of numerical methods for nonlocal models on fractals, including fractional heat equation, fractal scattering, and related models.
Read the full abstract
Analysis of PDEs
A generalisation of the Gagliardo–Nirenberg Inequality with applications to mass-critical and mass-subcritical elliptic equations
Via a new inequality à la Gagliardo–Nirenberg, we prove the existence and nonexistence of solutions to \begin{equation*} \begin{cases} (-\Delta)^s u + \frac{\mu}{|y|^{2s}} u + \lambda u = f(u), \quad \mathbb{R}^N \ni x = (y,z) \in \mathbb{R}^K \times \mathbb{R}^{N-K}, \\ \int_{\mathbb{R}^N} u^2 \, \mathrm{d}x = \rho \end{cases} \end{equation*} in the mass-critical and mass-subcritical regimes, where $s>0$, $N \ge K \ge 2$, $\mu \in \mathbb{R}$ belongs to a specific range, $\rho>0$ is given a priori, and $\lambda \in \mathbb{R}$ is unknown. Additionally, we obtain similar results for the problem above with $\mu=0$ and $N \ge 1$ as well as a related curl-curl equation. Finally, we provide a thorough insight into the threshold for $\rho$ that divides the scenarios of negative and zero least energy.