Papers
Topics
Authors
Recent
Search
2000 character limit reached

Zero-sum flows for Steiner systems

Published 4 Jan 2021 in math.CO | (2101.00867v1)

Abstract: Given a tt-(v,k,λ)(v, k, \lambda) design, D=(X,B)\mathcal{D}=(X,\mathcal{B}), a zero-sum nn-flow of D\mathcal{D} is a map f:B⟶±1,…,±(n−1)f : \mathcal{B}\longrightarrow {\pm1,\ldots, \pm(n-1)} such that for any point x∈Xx\in X, the sum of ff over all blocks incident with xx is zero. For a positive integer kk, we find a zero-sum kk-flow for an STS(uw)(u w) and for an STS(2v+7)(2v+7) for v≡1 (mod 4)v\equiv 1~(\mathrm{mod}~4), if there are STS(u)(u), STS(w)(w) and STS(v)(v) such that the STS(u)(u) and STS(v)(v) both have a zero-sum kk-flow. In 2015, it was conjectured that for $v>7$ every STS(v)(v) admits a zero-sum $3$-flow. Here, it is shown that many cyclic STS(v)(v) have a zero-sum $3$-flow. Also, we investigate the existence of zero-sum flows for some Steiner quadruple systems.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.