English
Related papers

Related papers: Zero-sum flows for Steiner systems

200 papers

Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that every regular graph of valency at least four admitting a solvable arc-transitive group of automorphisms admits a…

Combinatorics · Mathematics 2014-05-27 Xiangwen Li , Sanming Zhou

Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are…

Combinatorics · Mathematics 2015-12-22 Matt DeVos , Edita Rollová , Robert Šámal

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

Combinatorics · Mathematics 2025-09-30 Lotrenzo Mella , Gloria Rinaldi

Statistical properties of $d$-dimensional incompressible flows with and without cylindrical reduction are studied, leading to several explanations and conjectures about turbulent flows and passive scalars, such as the de-correlation between…

Fluid Dynamics · Physics 2019-03-01 Jian-Zhou Zhu

Let $C_n$ be a cyclic group of order $n$. A sequence $S$ of length $\ell$ over $C_n$ is a sequence $S = a_1\boldsymbol\cdot a_2\boldsymbol\cdot \ldots\boldsymbol\cdot a_{\ell}$ of $\ell$ elements in $C_n$, where a repetition of elements is…

Combinatorics · Mathematics 2024-09-04 Sang June Lee , Jun Seok Oh

Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is will known that Steiner quadruple systems of order v, or SQS(v), exist if and only if v = 2, 4 mod 6. Universal cycles, introduced by…

Combinatorics · Mathematics 2012-04-17 Victoria Horan , Glenn Hurlbert

A zero-dimensional (resp. symbolic) flow is a suspension flow over a zero-dimensional system (resp. a subshift). We show that any topological flow admits a principal extension by a zero-dimensional flow. Following [Bur19] we deduce that any…

Dynamical Systems · Mathematics 2021-05-21 David Burguet , Ruxi Shi

We consider the three-dimensional steady Navier-Stokes system in the exterior of an infinite cylinder under the action of an external force. We construct solutions in the class of vertically uniform flows which vanish at horizontal…

Analysis of PDEs · Mathematics 2026-04-28 Mitsuo Higaki , Ryoma Horiuchi

Bouchet conjectured in 1983 that every flow-admissible signed graph admits a nowhere-zero 6-flow which is equivalent to the restriction to cubic signed graphs. In this paper, we proved that every flow-admissible $3$-edge-colorable cubic…

Combinatorics · Mathematics 2022-11-04 Liangchen Li , Chong Li , Rong Luo , C. -Q Zhang , Hailing Zhang

In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. We verify this conjecture for the class of flow-admissible signed graphs possessing a spanning even Eulerian subgraph, which includes as a…

Combinatorics · Mathematics 2025-10-10 Chao Wen , Qiang Sun , Chao Zhang

Numerical calculations of the 2-D steady incompressible driven cavity flow are presented. The Navier-Stokes equations in streamfunction and vorticity formulation are solved numerically using a fine uniform grid mesh of 601x601. The steady…

Numerical Analysis · Mathematics 2025-10-20 E. Erturk , T. C. Corke , C. Gokcol

This paper introduces a new method for proving global stability of fluid flows through the construction of Lyapunov functionals. For finite dimensional approximations of fluid systems, we show how one can exploit recently developed…

Optimization and Control · Mathematics 2015-05-20 Paul Goulart , Sergei Chernyshenko

We study convergence of a finite volume scheme for the Navier-Stokes-Fourier system describing the motion of compressible viscous and heat conducting fluids. The numerical flux uses upwinding with an additional numerical diffusion of order…

Numerical Analysis · Mathematics 2019-03-21 Eduard Feireisl , Maria Lukacova-Medvidova , Hana Mizerova , Bangwei She

Tutte's 5-Flow Conjecture from 1954 states that every bridgeless graph has a nowhere-zero 5-flow. In 2004, Kochol proved that the conjecture is equivalent to its restriction on cyclically 6-edge connected cubic graphs. We prove that every…

Combinatorics · Mathematics 2014-12-18 Giuseppe Mazzuoccolo , Eckhard Steffen

We formulate integrable flows related to the KdV hierarchy on null curves in the anti-de Sitter 3-space (${\rm AdS}$). Exploiting the specific properties of the geometry of ${\rm AdS}$, we analyze their interrelationships with Pinkall flows…

Differential Geometry · Mathematics 2023-11-21 Emilio Musso , Alvaro Pampano

We consider the so-called transport-Stokes system which describes sedimentation of inertialess suspensions in a viscous flow and couples a transport equation and the steady Stokes equations in the full three-dimensional space. First we…

Analysis of PDEs · Mathematics 2022-09-26 Amina Mecherbet , Franck Sueur

Cycle switching is a particular form of transformation applied to isomorphism classes of a Steiner triple system of a given order $v$ (an $STS(v)$), yielding another $STS(v)$. This relationship may be represented by an undirected graph. An…

Combinatorics · Mathematics 2024-05-14 Grahame Erskine , Terry S. Griggs

The 3D spatially periodic Navier-Stokes equation is posed as a nonlinear matrix differential equation. When the flow is assumed to be a time series having unknown wavenumber coefficients, then the matrix in this periodic Navier-Stokes…

Analysis of PDEs · Mathematics 2008-08-28 David T. Purvance

In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$-flow. Bouchet himself proved that such signed graphs admit nowhere-zero $216$-flows and Zyka further proved that such signed graphs…

Combinatorics · Mathematics 2019-08-30 Matt DeVos , Jiaao Li , You Lu , Rong Luo , Cun-Quan Zhang , Zhang Zhang

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Combinatorics · Mathematics 2018-02-12 Aaron Robertson