English
Related papers

Related papers: Zero-sum flows for Steiner systems

200 papers

We present a definition of spectral flow relative to any norm closed ideal J in any von Neumann algebra N. Given a path D(t) of selfadjoint operators in N which are invertible in N/J, the spectral flow produces a class in K_0(J). In the…

Operator Algebras · Mathematics 2007-05-23 Jens Kaad , Ryszard Nest , Adam Rennie

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…

Combinatorics · Mathematics 2026-02-26 Hussein Houdrouge , Bobby Miraftab , Pat Morin

We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13--28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the r\^ole of circuits is…

Combinatorics · Mathematics 2014-07-22 Edita Macajova , Martin Skoviera

This paper concerns a generalization of nowhere-zero modular q-flows from graphs to simplicial complexes of dimension d greater than 1. A modular q-flow of a simplicial complex is an element of the kernel of the d-th boundary map with…

Combinatorics · Mathematics 2014-09-23 Bradley Lewis Burdick

Let $\Gamma$ be a graph, $A$ an abelian group, $\mathcal{D}$ a given orientation of $\Gamma$ and $R$ a unital subring of the endomorphism ring of $A$. It is shown that the set of all maps $\varphi$ from $E(\Gamma)$ to $A$ such that…

Combinatorics · Mathematics 2021-11-16 Jun-Yang Zhang , Na Lu

Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…

Combinatorics · Mathematics 2026-01-27 Xiao-Nan Lu

We initiate the study of nowhere-zero flow reconfiguration. The natural question is whether any two nowhere-zero $k$-flows of a given graph $G$ are connected by a sequence of nowhere-zero $k$-flows of $G$, such that any two consecutive…

In contrast to ordinary graphs, the number of the nowhere-zero group-flows in a signed graph may vary with different groups, even if the groups have the same order. In fact, for a signed graph $G$ and non-negative integer $d$, it was shown…

Combinatorics · Mathematics 2018-06-26 Jianguo Qian

Tutte's $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization…

Combinatorics · Mathematics 2017-07-24 Jiaao Li , Rong Luo , Yi Wang

For integers $a\ge 2b>0$, a \emph{circular $a/b$-flow} is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected planar graph admits a circular…

Combinatorics · Mathematics 2020-07-14 Daniel W. Cranston , Jiaao Li

A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$…

Combinatorics · Mathematics 2017-09-15 Louis Esperet , Giuseppe Mazzuoccolo , Michael Tarsi

Tutte's 3-flow conjecture asserts that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. We prove that this conjecture is true for every Cayley graph of valency at least four on any supersolvable group with a noncyclic Sylow…

Combinatorics · Mathematics 2022-03-08 Junyang Zhang , Sanming Zhou

Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero flow has a nowhere-zero 6-flow. We prove that the conjecture is true for all signed series-parallel graphs. Unlike the unsigned case, the restriction to…

Combinatorics · Mathematics 2014-11-10 Tomáš Kaiser , Edita Rollová

Let $\Gamma$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$, let $D_{2n}$ be the dihedral group of order $2n$. Define $\mathbb{D} := \{(\begin{smallmatrix} 1 & a \\ 0 & 1 \end{smallmatrix})…

Combinatorics · Mathematics 2018-12-04 Bart Litjens

This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We generalise the well-known fact about the existence of nowhere-zero $2$-flows in eulerian graphs by proving that every signed eulerian graph that…

Combinatorics · Mathematics 2016-07-04 Edita Máčajová , Martin Škoviera

A signed graph is a graph with a positive or negative sign on each edge. Regarding each edge as two half edges, an orientation of a signed graph is an assignment of a direction to each of its half edges such that the two half edges of a…

Combinatorics · Mathematics 2016-04-13 Fan Yang , Sanming Zhou

In 2010s Fleiner introduced a notion of stable flows in directed networks and showed that such a flow always exists and can be found by use of a reduction to the stable allocation problem due to Baiou and Balinski. Recently Cseh and…

Combinatorics · Mathematics 2023-05-17 Alexander Karzanov

We suggest that the dynamical spontaneous symmetry breaking reported in a turbulent swirling flow at $Re=40~000$ by Cortet et al., Phys. Rev. Lett., 105, 214501 (2010) can be described through a continuous one parameter family…

Fluid Dynamics · Physics 2014-03-17 Brice Saint-Michel , François Daviaud , Bérengère Dubrulle

Let G = (V,E) be a planar n-vertex digraph. Consider the problem of computing max st-flow values in G from a fixed source s to all sinks t in V\{s}. We show how to solve this problem in near-linear O(n log^3 n) time. Previously, no better…

Discrete Mathematics · Computer Science 2012-10-18 Jakub Łącki , Yahav Nussbaum , Piotr Sankowski , Christian Wulff-Nilsen

This paper is concerned with the two-dimensional stationary Navier-Stokes system in the domain exterior to the unit disk. The existence of solutions with critical decay $O(|x|^{-1})$ is established around some explicit flows with large…

Analysis of PDEs · Mathematics 2022-07-26 Mitsuo Higaki