Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 18 March
For a classical simple and simply connected group $G$, let $\mathcal{M}_{G,\omega}$ be the moduli space of $\omega$-semistable parabolic $G$-bundles on a complex smooth projective curve of genus $g$. We prove two results in this article: (1) $\mathcal{M}_{G,\omega}$ is of Fano type when $g\geq 3$; (2) the algebra of conformal blocks on any $n$-pointed stable curve for a classical simple Lie algebra is finitely generated.
Group Theory
Homomorphism extension problem for subdirect products of finite groups
Motivated by the simplification of decomposition formulas for fibred bisets, we study the homomorphism extension problem for subdirect products of finite groups when the codomain is an abelian group satisfying certain hypothesis. We prove that every homomorphism of subdirect products whose Goursat quotients have trivial Schur multipliers is extensible. We also examine the case where subdirect products contain a twisted diagonal subgroup and investigate the functoriality of the extensibility property.
Read the full abstract
Dynamical Systems · Cross-listed from cond-mat.stat-mech
Study of Meta-Fibonacci Integer Sequences by Continuous Self-Referential Functional Equations
I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)= A(A(n-1))+A(n-A(n-1))$, the sequence $D(n)= D(D(n-1))+D(n-1-D(n-2))$ introduced by the present author more than 25 years ago, and Hofstadter's well-known $Q(n)= Q(n-Q(n-1))+Q(n-Q(n-2))$. The sequences are studied in their equivalent detrended forms $(a,d,q)(n)=2\,(A,D,Q)(n)-n$. For $a(n)$ and $d(n)$, a highly symmetric functional equation admits exact continuous solutions that nicely model the global behavior (backbone) of the sequences. For the Hofstadter sequence, a continuous functional model is developed that leads to a random matrix approach for the generation and study of fractal solutions. Two remarkable properties of the Q-sequence are reproduced by the model: the anomalous scaling of the generation length, which scales $\sim (2-\eta)^k$, and the anomalous amplitude growth that scales like $2^{\alpha k}$.
Read the full abstract
Differential Geometry
Classification of Smooth Alignable Voss Surfaces
Alignable nets are grid structures that can collapse to a planar strip. This property simplifies on-site assembly and enables compact transport and storage. These structures are then deployed by a scissor motion at vertices in a desired location. In this article, we classify all non-developable surfaces supporting an alignable net that additionally have the geodesic-conjugate net property, namely, the alignable Voss surfaces. Using the surface elements and adapted frames, we show that these surfaces arise as rotation fields of either helicoidal pseudospherical surfaces or Amsler surfaces, resulting in two distinct classes. The first class consists of helicoidal Voss surfaces. Exploiting this helicoidal structure, we combine a kinematic interpretation with the Bour family to derive explicit immersion formulas depending on the isometric deformation and alignability parameters. Furthermore, we examine several subclasses and an extension of this result in detail. In particular, we study the notable case of infinitely many geodesic-conjugate nets on a helicoid and provide a kinematic explanation for why this phenomenon appears in computations. For the second class, we obtain the classification at the level of the fundamental forms and show that they correspond to certain $3$-parameter families of non-helicoidal intrinsic surfaces of revolution. These families are governed by general Painleve III solutions including both regular and nonregular solutions. Finally, a surprising feature of this class is that its members support geodesic isothermal-conjugate nets absent from Eisenhart's classification of the aforementioned nets, thereby identifying a missing case in that classification.
Read the full abstract
Analysis of PDEs
Kinetic Sobolev Spaces
We define and study homogeneous kinetic Sobolev spaces adapted to the Kolmogorov equation. We consider both local and non-local diffusion. The spaces are built from the Lebesgue spaces L p for all integrability exponents p $\in$ (1, $\infty$) with regularity assumptions in the transport and diffusive directions according to the scaling of the Kolmogorov equation. The regularity scale accommodates weak and strong solutions. We prove that the proposed spaces satisfy sharp embeddings quantifying the transfer-ofregularity à la Bouchut-Hörmander, continuity-in-time in the spirit of Lions and the gainof-integrability of Sobolev and Hardy-Littlewood-Sobolev type. A core tool are mapping properties of the Kolmogorov operator, given by the fundamental solution, established between anisotropic homogeneous Sobolev spaces. To achieve this, we prove L^p boundedness of related singular integral operators, for which we deduce novel kernel estimates by a Littlewood-Paley decomposition and geometric considerations. Moreover, we provide a new uniqueness criterion which allows us to show well-posedness of the Cauchy problem.
Read the full abstract
Mathematical Physics
Generalized Snell's laws for rough interfaces
In this paper, we consider the reflection and transmission problem of waves by a rapidly oscillating rough interface that exhibits general mixing properties. Using an asymptotic analysis based on a separation of scales, corresponding to a paraxial (parabolic) scaling regime, we precisely characterize the specular and speckle (diffusive) components of the reflected and transmitted fields. A critically scaled interface is considered, in the sense that the amplitudes of the interface fluctuations and the central wavelength are of the same order. When the correlation length of the interface fluctuations is of the same order as the beam width, random specular components arise in both the reflected and transmitted waves, while no speckle component is observed. Equivalently, the reflected and transmitted fields are essentially confined to the cones formed by the specular components (specular cones) with directions given by the classical Snell's law of reflection and refraction. When the correlation length is smaller than the beam width, a specular homogenization regime emerges. In this case, the rough interface can be approximated by an effective flat interface, yielding deterministic specular reflected and transmitted cones. However, broader cones containing the specular cones appear, within which the wavefields form speckle patterns (speckle cones) whose total energy is of leading order. We provide the two-point correlation functions of these speckle patterns and establish a central-limit-theorem-type result, showing that they can be modeled as Gaussian random fields. These results enable the identification of generalized Snell's laws of reflection and transmission, which depend on an effective scattering operator at the interface.
Read the full abstract
Algebraic Geometry
Quantum cohomology and irrationality of Gushel-Mukai fourfolds
We compute the small quantum cohomology of Gushel-Mukai fourfolds. Following [13], our computations imply that the very general ones are not rational. Following [8], and thanks to a suitable deformation of the small quantum cohomology ring, we also deduce that a rational Gushel-Mukai fourfold has the same rational cohomology as some K3 surface.
Read the full abstract
Algebraic Geometry
On generalized canonical bundle formula and boundedness of complements in complex analytic setting
We establish the generalized canonical bundle formula for generalized lc-trivial fibrations with irrational coefficients over non-compact bases in the complex analytic setting, and we show that the discriminant b-divisor and moduli b-divisor are compatible with restriction to arbitrary open subsets. We also discuss the boundedness of complements in this setting.
Read the full abstract
Probability
Large time behaviour for the semigroup of the kinetic Brownian motion in the plane
We establish an integration by parts formula for the semigroup in time $T>0$ of the kinetic Brownian motion in the Euclidean plane together with its velocity in the circle. The stochastic differential equation of our kinetic Brownian motion is driven here by one real-valued Brownian motion constructed from an orthonormal basis of $L^2([0,T],\R)$ and an independent sequence of $\SN(0,1)$ random variables. Our method is based on an explicit computation of a Malliavin dual in the Gaussian space. We are mainly interested in large time $T$. From our integration by parts, we obtain gradient estimates including a reverse Poincaré inequality for the semigroup. As a direct consequence, we also obtain a Liouville property for the generator of the kinetic Brownian motion and its speed: all bounded harmonic functions are constant.
Read the full abstract
Numerical Analysis
A New Fractional Step Structure Preserving Method for The Landau-Lifshitz-Gilbert Equation
In this paper, we propose a structure preserving method using a Crank-Nicolson's type method with an implicit Gauss-Seidel fractional iteration. Such a method is of first-order accuracy in time and second-order accuracy in space, stable and length preserving. Such a proposed method brings great benefits for the theoretical analysis. The numerical accuracy, norm preserving and stability are verified for 1D and 3D tests.
Read the full abstract
Group Theory
Representations and identities of involution Plactic-like monoids arising from the meet of the stalactic congruence and its dual
Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped with multiple involutions, and divide these involutions into $\lfloor\frac{n}{2}\rfloor+1$ types. A faithful representation of $\mathsf{mSt}_n$ under each of these involutions is obtained. We give transparent combinatorial characterizations of identities for $\mathsf{mSt}_n$ under each involution, and so the finite basis problem and identity checking problem for them are solved.
Read the full abstract
Numerical Analysis
Wavenumber-explicit $hp$-FEM analysis of Maxwell's equations with impedance boundary conditions in piecewise smooth media
We consider the time-harmonic Maxwell equations with impedance boundary conditions on a bounded Lipschitz domain $\Omega$ with analytic boundary $\Gamma$. We suppose that $\Omega$ consists of multiple subdomains, and that the permeability and permittivity tensors are analytic on every subdomain, but may jump across subdomain interfaces. Under these conditions we show that for any wavenumber $k\in\mathbb{C}$ with $|k|\geq 1$ for which Maxwell's equations are polynomially well-posed, a Galerkin discretization based on Nédélec elements of order $p$ on a mesh with mesh width $h$ is quasi-optimal, provided that there holds the wavenumber-explicit scale resolution condition a) that $|k|h/p$ is sufficiently small and b) that $p/\log |k|$ is bounded from below.
Read the full abstract
Dynamical Systems
A Full-Density Approach to Simulating Random Iteration Equations with Applications
The goal of this study is to introduce a unified framework for simulating random iteration equations (RIE), understood as iteration equations containing random variables. The main idea is to propagate approximations of the full state density from one iteration to the next, rather than estimating it from many repeated pathwise Monte Carlo simulations. The presentation of the RIE modeling framework is conceptually simple based on recent work on static random equations and designed to be accessible. The modeling requirements for RIEs allow for potential nonsmooth nonlinearities and stochasticities in the transfer function. Additionally, the RIE computational strategy for full-density propagation is presented based on iterative likelihood / posterior calculations. As results, illustrative applications of nonlinear random and stochastic differential equation simulations, a new full-density gradient descent method (FDGD) for global optimization under uncertainty and examples of chaotic mappings are presented in order to demonstrate the breadth of the utility of this framework. In total, the character of the presentation is explorative and encourages new applications and theoretical studies.
Read the full abstract
Analysis of PDEs
Singularly Perturbed Gradient Flows and Evolution of Critical Points in Infinite Dimensions
We consider singularly perturbed gradient flows in Hilbert spaces, driven by a time-dependent, nonconvex, and nonsmooth energy, and address the convergence of their solutions to curves of critical points of the driving energy functional. The degenerating nature of the estimates along the gradient-flow curves calls for novel compactness arguments, which we carefully develop by combining tools from the variational approach to Hilbert and metric gradient flows \cite{RossiSavare06,AGS08}, with fine requirements on the set of critical points of the energy. This leads us to prove that subsequential limits of singularly perturbed gradient flows are Dissipative Viscosity solutions of the limiting problem, i.e., curves of critical points satisfying a suitable balance between the energy and a defect measure, encoding dissipation. This energy-dissipation balance encompasses information on the dynamics of the process at jump times, recording, in particular, the re-emergence of viscous behavior. Under a suitable rectifiability condition on the critical set, we show that \DSolutions\ improve to Balanced Viscosity solutions, which have the key property that the dissipation measure is purely atomic. In the second part of the paper we show that, for smooth energies whose second differential is a Fredholm operator, the condition that the kernel of the Hessian has dimension at most one at every critical point already implies our measure-theoretic assumptions. We further relate them to the transversality conditions from bifurcation theory and show that they have a generic character with respect to a wide family of linear perturbations of the energy. The results are new also in finite dimension. Applications to various PDE models are presented.
Read the full abstract
Differential Geometry · Cross-listed from cs.LO
Synthetic Differential Geometry in Lean
This article is about the formalization of synthetic differential geometry with the Lean proof assistant and the mathematical library mathlib. The main result we prove and formalize is a Taylor theorem for functions of several variables, where the series expansion is around an infinitesimal neighborhood. Most of our proofs are in fact new. Our investigations highlight the possibility of using mathlib to do constructive mathematics.
Read the full abstract
Numerical Analysis
Modified Halley's method for computation of zeros of solution of second order ODEs
This paper develops an efficient iterative method for computing all zeros of solutions of second order ordinary differential equations. A third order Halleys method is first derived by approximating the solution of an associated Riccati differential equation. To improve computational efficiency, a modified Halleys method is proposed by fixing one of the functions in Halleys scheme as a constant. The modified Halleys method also retains third order convergence. Based on the behavior of the coefficients of the second order ODE, nonlocal convergence results are established for both Halleys and modified Halleys methods. Suitable initial guesses for computing all zeros of solutions of second order ODEs in a given interval are also presented for both methods. Furthermore, algorithms based on the modified Halleys method are developed for to compute all nodes and weights for Gauss Legendre and Gauss Hermite quadratures. A comparative numerical study with recent methods demonstrates the efficiency of the proposed algorithms.
Read the full abstract
Optimization and Control
An error bound-based convergence analysis framework for a class of randomized algorithms
Classical analyses show that randomized coordinate descent (RCD) and gradient descent (GD) share the same convergence rates in terms of objective gap under convexity and specific global EB-type assumptions. However, this rate preservation phenomenon does not extend to iterate rates, almost-sure rates, or general local error bound conditions. In this paper, we study this phenomenon systematically, not only for RCD but also for a much broader class of algorithms that share the same structures. Specifically, we introduce an abstract class of algorithms, called monotone randomized algorithms (MRAs), and new unified error bound (UEB) conditions that are independent of problem class and accommodate general EB moduli. These UEB conditions subsume many EB- and Kurdyka–Łojasiewicz-type assumptions used in the analysis of algorithms for optimization, convex feasibility, and common fixed point problems. We then develop a new analysis framework and a set of technical tools that yield nonasymptotic in-expectation rates and asymptotic almost-sure rates for both the optimality measure and the iterates under the global UEB condition. Under the local UEB condition, we further establish asymptotic almost-sure rates for both quantities. For comparison, we introduce the monotone deterministic algorithms (MDAs), as the corresponding deterministic counterpart of MRAs. We illustrate the tightness of our MRA analysis by showing that the lower bounds of MDAs match the upper bounds of MRAs qualitatively. We also demonstrate the strength and versatility of our framework through three applications, namely generalized randomized subspace descent for unconstrained minimization, randomized block proximal gradient methods for composite optimization, and the randomized Krasnosel'skiĭ–Mann method for common fixed point problems.
Read the full abstract
Number Theory
On the size of $\{a: 1\leq a<n, n|a^2-1, a|n^2-1\}$ for number $n$
For number $n>1$, let $\mathcal{A}(n) = \{1\leq a<n: n|a^2-1, a|n^2-1 \}$. We show that the size of $\mathcal{A}(n)$ is connected to a property concerning integer evaluations of Fibonacci-like polynomials. In the process, we prove that $|\mathcal{A}(n)|< \log_2 n$, and establish the average value of $|\mathcal{A}(n)|$ to be a little above $2$, asymptotically. But the empirical data up to $n<10^7$ indicate that $|\mathcal{A}(n)|\leq 3$, proving which is left as an open issue.
Read the full abstract
Analysis of PDEs
Lower bounds on the blowup rate of vorticity in the Euler equations
Under the assumption that a solution to the 3D incompressible Euler equations blows up at a time $T_\ast$ and that $T_\ast $ is the first such time, we establish lower bounds on the rate of blow-up of the maximum norm of the vorticity. In particular, when the domain is $\mathbb{R}^3$ or $\mathbb{T}^3$, we provide lower bounds on $\int_{0}^{t}\Vert \omega\Vert_{L^\infty}\,ds$ and $\sup_{s\in[0,t]}\|\omega\|_{L^\infty}$ for $t$ sufficiently close to~$T_\ast$. Notably, this gives a quantitative description of the BKM blow-up criterion. Moreover, we provide pointwise-in-time lower bounds on~$\|D^k \omega\|_{L^\infty}$. Finally, we state some consequences on the blow-up rate of the derivative of the deformation tensor.
Read the full abstract
Combinatorics
Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
Let $\vec{G}=(V,E^+\cup E^-)$ be a bidirected graph whose underlying undirected graph $G=(V,E)$ is $2$-edge-connected. A strongly connected orientation (SCO) is defined as a subset of arcs that contains exactly one of $e^+,e^-$ for every $e\in E$ and induces a strongly connected subgraph of $\vec{G}$. Given a family $\mathcal{F}$ of proper subsets of $V$, we call an SCO tight if there is exactly one arc entering $U$ for every $U\in \mathcal{F}$. We give a polynomial-time algorithm to construct a set $\mathcal{B}$ consisting of tight SCO's which forms an integral basis for the linear hull of tight SCO's. That is, $\mathcal{B}$ is a linearly independent subset of tight SCO's, and every integer vector in the linear hull of tight SCO's can be written as an integral combination of $\mathcal{B}$. This extends the main result of Abdi, Conuéjols, Liu and Silina (IPCO 2025), who gave a non-constructive proof of the existence of such a basis in an equivalent setting. While the previous proof uses polyhedral theory, our proof is purely combinatorial and yields a polynomial-time algorithm. As an application of our algorithm, we show that parity-constrained tight strongly connected orientations can be solved in deterministic polynomial time. Along the way, we discover appealing connections to the theory of perfect matching lattices.
Read the full abstract
Dynamical Systems
Data-driven model order reduction for structures with piecewise linear nonlinearity using dynamic mode decomposition
Piecewise-linear nonlinear systems appear in many engineering disciplines. Prediction of the dynamic behavior of such systems is of great importance from practical and theoretical viewpoint. In this paper, a data-driven model order reduction method for piecewise-linear systems is proposed, which is based on dynamic mode decomposition (DMD). The overview of the concept of DMD is provided, and its application to model order reduction for nonlinear systems based on Galerkin projection is explained. The proposed approach uses impulse responses of the system to obtain snapshots of the state variables. The snapshots are then used to extract the dynamic modes that are used to form the projection basis vectors. The dynamics described by the equations of motion of the original full-order system are then projected onto the subspace spanned by the basis vectors. This produces a system with much smaller number of degrees of freedom (DOFs). The proposed method is applied to two representative examples of piecewise linear systems: a cantilevered beam subjected to an elastic stop at its end, and a bonded plates assembly with partial debonding. The reduced order models (ROMs) of these systems are constructed by using the Galerkin projection of the equation of motion with DMD modes alone, or DMD modes with a set of classical constraint modes to be able to handle the contact nonlinearity efficiently. The obtained ROMs are used for the nonlinear forced response analysis of the systems under harmonic loading. It is shown that the ROMs constructed by the proposed method produce accurate forced response results.
Read the full abstract
Probability
The Law of Large Numbers for Time-inhomogeneous Markov Chains under General Conditions
The weak and strong laws of large numbers for time-inhomogeneous Markov chains are studied under general conditions. First, under Drift Condition and Contraction Condition in total variation, we prove the weak law of large numbers. Then, assuming Drift Condition together with a time-inhomogeneous Doeblin minorization, we develop a Nummelin-type splitting and obtain a strong law of large numbers. Our results utilize the invariant measure family in the sense of Liu–Lu (2025), and extend the classical Harris-ergodic LLN to the time-inhomogeneous setting.
Read the full abstract
Functional Analysis
A brief review of Radon-Nikodýmification
We review recent results on Radon-Nikodýmification of abstract measure spaces, the particular case of integral geometric measure, and applications to the dual of SBV.
Functional Analysis
Restricted Toeplitz and Hankel Operators
We introduce and systematically study a class of operators that arise naturally due to the Beurling decomposition of the Hardy space $H^2=K_\theta \oplus \theta H^2$. While the compressions of classical Toeplitz and Hankel operators to the Beurling subspace $\theta H^2$ and the model space $K_\theta$ account for the diagonal components of the decomposition, the corresponding off-diagonal operators have remained largely unexplored. Motivated by this, we introduce and analyze a new class of operators, termed restricted Toeplitz and restricted Hankel operators, acting between Beurling subspace $\eta H^2$ and model space $K_\theta$. Within this framework, we obtain necessary and sufficient conditions for the vanishing, finite-rank, and compactness properties of these operators. We further establish algebraic characterizations in the spirit of Brown-Halmos \cite{BH} and Sarason \cite{SAR, DES}, showing that these operators can be identified through certain operator equations involving compressed shifts. As an application, we introduce the notions of small and big truncated Toeplitz operators, and provide criteria for when they vanish, have finite rank, or are compact.
Read the full abstract
Functional Analysis
A modified double inertial subgradient extragradient algorithm for non-monotone variational inequality with applications
This paper presents a modified iterative approach to solve the variational inequality problem using the double inertial technique in the context of a real Hilbert space. Our iterative technique involves a projection onto a generalized half-space and a self-adaptive step-size rule which works without prior knowledge of the Lipschitz constant of the operator. We establish a weak convergence result for a variational inequality involving a non-monotone cost operator along with weak and strong convergence results for quasi-monotone and strongly pseudo-monotone operators, respectively. Under a simplified framework, linear convergence of the proposed method is also discussed. Additionally, we provide some numerical experiments to demonstrate the effectiveness of our iterative algorithm compared to previously established algorithms in solving real-world applications. Finally, we carry out a sensitivity analysis of our algorithm to demonstrate its effectiveness across various parameter settings.
Read the full abstract
Combinatorics
Promotion and rowmotion in rational Catalan combinatorics
We study four bijections, which are promotion, evacuation, rowmotion, and rowvacuation, on generalized Dyck paths in rational Catalan combinatorics. We define the maps on generalized Dyck paths, which have their origins in maps on Dyck paths and non-crossing partitions. They include rotation, Kreweras complement map, Simion–Ullman involution on non-crossing partitions, and Lalanne–Kreweras involution on Dyck paths. These maps have an expression in terms of the four combinatorial bijections. By extending the bijection studied by D. Armstrong, C. Stump, and H. Thomas on one hand, and the correspondence of RSK type studied by B. Adenbaum and S. Elizalde on the other, we present the equivalence between the two bijections, promotion and rowmotion, on generalized Dyck paths through these bijection and correspondence. For this purpose, we provide an alternative description of the correspondence of RSK type in terms of Dyck tilings.
Read the full abstract
Optimization and Control
Dynamical Properties of Safety Filters for Linear Systems and Affine Control Barrier Functions
This letter studies the dynamical properties of safety filters designed based on Control Barrier Functions (CBF). This mechanism, which is popular in safety-critical applications, takes a nominal controller and minimally modifies it to render it safe. Although CBF-based safety filters make the closed-loop system safe, characterizing their additional dynamical properties, such as stability, boundedness, or existence of spurious equilibria, remains a challenging problem. Here, we address this problem for the case of linear systems and an affine CBF constraint. We provide conditions under which the closed-loop system presents undesired equilibria, unbounded trajectories, or the origin is globally exponentially stable.
Read the full abstract
Number Theory
Construction of a $p$-extension of number fields whose unit group has prescribed Galois module structure
Let $G$ be a finite $p$-group. We construct a $G$-extension $K/k$ of number fields such that the $p$-adic completion of the unit group of $K$ has a prescribed $\mathbb{Z}_p[G]$-module structure, up to free direct summands.
Quantum Algebra · Cross-listed from hep-th
W-algebras of the Deligne-Cvitanović Exceptional series and the minimal 3d ${\mathcal N}=4$ SCFT
We propose a three-dimensional field theory construction that realizes the vertex algebras associated with the intermediate Lie algebras and the related $C_2$-cofinite minimal $W$-algebras of the Deligne-Cvitanović (DC) series as boundary algebras. The construction is based on the minimal three-dimensional ${\mathcal N}=4$ superconformal field theory coupled to a topological field theory. For a Neumann-type boundary condition compatible with the topological $A$-twist, the algebra of boundary local operators realizes the minimal $W$-algebra $W_{-h^\vee/6}(\mathfrak{g},f_{\text{min}})$. While this boundary condition is not deformable to the $B$-twist, we argue that a holomorphic-topological ($HT^B$) twist instead realizes the level-one affine algebras of the intermediate Lie algebras, providing a uniform three-dimensional origin for these vertex algebra structures.
Read the full abstract
Optimization and Control
A Cycle-Based Solvability Condition for Real Power Flow Equations
Certifying power flow solvability is important for reliable power system operations under volatile operating conditions, but solving power flow equations repeatedly can be costly and may encounter convergence issues. In this paper, we develop an explicit cycle-based solvability condition for the lossless real power flow equations on meshed networks. We decompose every feasible nodal balance solution into a particular flow plus a cycle flow correction vector. The power flow problem is then reduced to enforcing edge-wise feasibility and cycle consistency. We show that the cycle consistency function is strongly monotone and is the gradient of a strongly convex energy function. By exploiting these properties, we derive an explicit condition for the existence and uniqueness of a power flow solution with bounded angle difference. The resulting condition is invariant under the choice of cycle basis and can be verified through simple algebraic computations. Numerical results on standard test systems show that the proposed condition is significantly less conservative than existing sufficient conditions and closely approximates true loading limits.