d-Dimensional p-Normed Nowhere-Zero Flows
- d-Dimensional p-normed nowhere-zero flows generalize classical graph flows by assigning nonzero vectors with constrained p-norms to edges while satisfying Kirchhoff's law.
- The framework unifies integer, circular, and vector-valued flows through geometric constructions and oriented cycle double covers in finite bridgeless graphs.
- Key results include sharp bounds on flow numbers across various norms and dimensions, linking combinatorial properties with convex geometric representations.
A -dimensional -normed nowhere-zero flow is a multidimensional generalization of classical graph flows, in which each edge is assigned a vector in whose -norm lies strictly within a specified annular interval, and the usual Kirchhoff flow-conservation law is enforced at every vertex. This extension simultaneously encompasses and generalizes integer flows, circular flows (), and the vector-valued flows of Mattiolo–Mazzuoccolo–Rajn–Tabarelli, providing a unified geometric and combinatorial framework for the study of flow properties in finite bridgeless graphs. The subject incorporates combinatorial graph theory, convex geometry, and, through its connections to cycle double covers, higher-dimensional polyhedral constructions.
1. Formal Definitions and Fundamental Notions
Let be a finite bridgeless graph, an integer, a real parameter, and a norm index. An orientation of fixes a direction for each edge. A function
is called a \textbf{-dimensional -normed nowhere-zero -flow} (abbreviated -NZF) if it satisfies:
- (i) At each vertex , the vector sum (interpreted by orientation) of incident flows vanishes:
- (ii) For every edge , the -norm constraint is enforced:
The associated \textbf{flow index} (or -normed flow number) is
With , , this recovers the classical integer flow number; for , general (equipped, suitably, with the circular interval) this characterizes circular flows.
2. Geometric and Combinatorial Descriptions
In the Euclidean case (), -NZFs are particularly amenable to geometric construction. Given an \textbf{oriented -cycle double cover} (oriented -CDC)—a collection of directed cycles in which each edge is traversed by exactly two of the cycles, in opposing directions—one obtains an -NZF with edge-values in the set
Through the assignment (standard basis vectors indexed by cycles), each flow-vector lies on the discrete sphere .
This correspondence is formalized:
admits an -valued flow if and only if it admits an oriented -cycle double cover (Mattiolo et al., 22 Oct 2025).
For more general -norms, the construction is analogous: one seeks a symmetric finite set of vectors on the -norm unit sphere such that superpositions (sum/difference along covered edges) remain within a fixed norm ratio.
3. Principal Structural Results and Bounds
Boundedness results for are central. The following highlights best-known theorems across key values of and :
| Dimension | Norm | General Upper Bound | Sharpness/Condition | Reference |
|---|---|---|---|---|
| $2$ | $2$ | Always, via Seymour's decomposition | (Mattiolo et al., 2023) | |
| $2$ | $3$ | All | (Li et al., 17 Jan 2026) | |
| $2$ | $2$ | If oriented $5$-CDC exists | (Mattiolo et al., 2023) | |
| $2$ | $3$ | Always, and | (Gáborik et al., 25 Oct 2025) | |
| $3$ | All | (Li et al., 17 Jan 2026) | ||
| $2$ | If admits suitable cycle $2$-cover | (Li et al., 17 Jan 2026) | ||
| $2$ | has non-oriented -CDC | (Mattiolo et al., 22 Oct 2025) |
Special Cases and Tightness
- In dimension two, for graphs with an oriented $5$-cycle double cover, the Euclidean flow number is (with the golden ratio) (Mattiolo et al., 2023).
- In Manhattan and Chebyshev norms, the flow numbers and are always rational and, for , exactly coincide (Gáborik et al., 25 Oct 2025).
- If a graph admits a nowhere-zero -flow, it supports an oriented cycle double cover of cycles, hence, per geometric construction, can attain the sharp lower bound for all (Li et al., 17 Jan 2026).
4. Cycle Double Covers, Flow Construction, and Geometric Representation
Cycle double covers, especially their oriented variants (OCDC), play a central organizing role:
- Existence of an oriented -CDC is \textit{equivalent} to the existence of an -flow in the Euclidean norm (Mattiolo et al., 22 Oct 2025).
- Cycle cover constructions for arbitrary norms adopt a similar formalism: given cycles, label them by points on the -unit sphere in the -dimensional hyperplane . Each edge, covered equally in forward and reverse directions, receives the vector sum of the corresponding cycle labels, ensuring non-vanishing and norm constraints.
Geometric representations further facilitate construction, especially in the cubic ($3$-regular) case: every flow at a vertex corresponds to a triangle in , and gluing constraints prescribe boundary congruence for incident edges. Such triangulation encodings furnish succinct witnesses for -NZFs (Mattiolo et al., 2023).
5. Norm Dependence: Manhattan, Chebyshev, and General -Norms
For each -norm, there is a corresponding flow number and associated geometric/linear program:
- \textbf{Manhattan ():} -MNZFs are defined with edge-vectors .
- \textbf{Chebyshev ():} -ChNZFs require .
- In , the transformation (up to scaling) bijects the and annuli, yielding for any (Gáborik et al., 25 Oct 2025).
- For all , both flow numbers are rational, and Chebyshev flows admit a canonical normal form with rational coordinates (Gáborik et al., 25 Oct 2025).
- In arbitrary and , duality conjectures arise: increases on and decreases on , indicative of a potential – duality in flow geometry (Li et al., 17 Jan 2026).
6. Connections to Classical Conjectures and Open Problems
- \textbf{Tutte's $5$-Flow Conjecture:} For , for all bridgeless . Multidimensional and -normed analogues demonstrate substantially lower bounds, e.g. , underscoring the power of higher-dimensional embeddings (Li et al., 17 Jan 2026).
- \textbf{S-Flow Conjecture (Jain):} Asserts for all bridgeless . The current best general bound is , achieved via structural decomposition and explicit constructive flows, with equality for graphs possessing an oriented $4$-cycle double cover (Li et al., 17 Jan 2026).
- \textbf{Analogue for :} The existence of an oriented $5$-cycle double cover would yield in the Euclidean norm, and this is conjecturally optimal (Mattiolo et al., 2023).
A variety of open problems remain, notably concerning optimal bounds for as and grow, dependence on the existence and size of oriented cycle double covers, the detailed behavior of for snarks and other cubic graphs, and the extension to further normed spaces and integral flows (Li et al., 17 Jan 2026, Mattiolo et al., 2023).
7. Geometric and Topological Interpretations
Each nowhere-zero -normed flow corresponds to placing edge-values in an -annular shell: For , the flows reside on the -sphere . Oriented cycle cover formulations embed the construction into the hyperplane , forming a regular simplex in various norm geometries. The combinatorial-to-geometric dictionary facilitates the transfer of results among integer flows, circular flows, and their higher-dimensional generalizations, permitting the application of algebraic, polyhedral, and computational techniques (Mattiolo et al., 22 Oct 2025, Li et al., 17 Jan 2026).
References:
- “Geometric description of -dimensional flows of a graph” (Mattiolo et al., 22 Oct 2025)
- “On -dimensional nowhere-zero -flows on a graph” (Mattiolo et al., 2023)
- “Manhattan and Chebyshev flows” (Gáborik et al., 25 Oct 2025)
- “High-Dimensional -Normed Flows” (Li et al., 17 Jan 2026)