2-dimensional unit vector flows

2026-02-24

AI Summary

This study investigates the existence and structure of nowhere-zero S²-flows on graphs—assignments of unit vectors in ℝ³ to directed edges such that flow conservation holds at every vertex—with a focus on characterizing cubic graphs. It extends the algebraic rank method previously used for S¹-flows to the S² setting, introducing a novel characterization based on geometric and algebraic properties. Specifically, the work defines a flow matrix over the rationals and introduces the notion of “odd-coordinate-freeness,” establishing a rank condition that determines whether a graph admits a nowhere-zero 4-flow. The authors prove that if a graph satisfies this condition and supports an S²-flow, then it necessarily admits a nowhere-zero 4-flow. Furthermore, they show that the class of graphs admitting S²-flows is closed under operations such as vertex triangulation, thereby expanding the toolkit for constructing such flows.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Constraint Satisfaction and Optimization: Satisfiability
• Knowledge Representation and Reasoning: Qualitative Reasoning

Application Category

• Graph Algorithms and Modeling for the Web: Graph embeddings and representation learning for Web-related graphs
• Search and Retrieval-Augmented AI: Web query analysis, representation and understanding
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics

Abstract

We study $2$-dimensional unit vector flows on graphs, that is, nowhere-zero flows that assign to each oriented edge a unit vector in $\mathbb R^{3}$. We give a new geometric characterization of $\mathbb S^{2}$-flows on cubic graphs. We also prove that the class of cubic graphs admitting an $\mathbb S^{2}$-flow is closed under a natural composition operation, which yields further constructions; in particular, blowing up a vertex into a triangle preserves the existence of an $\mathbb S^{2}$-flow. Our second contribution is algebraic: we extend the rank-based approach of [SIAM J. Discrete Math., 29 (2015), pp.~2166--2178] from $\mathbb S^{1}$-flows to $\mathbb S^{2}$-flows. More precisely, we show that if an $\mathbb S^{2}$-flow $\varphi$ satisfies $\operatorname{rank}(S_{\mathbb{Q}}(\varphi))\le 2$ and $S_{\mathbb{Q}}(\varphi)$ is odd-coordinate-free, then the graph admits a nowhere-zero $4$-flow.

Problem

• unit vector flows
• nowhere-zero flows
• cubic graphs
• S²-flows
• graph flows

Innovation

• S²-flows
• cubic graphs
• nowhere-zero flows
• rank-based approach
• graph composition