Related papers: Nowhere-zero flows on signed eulerian graphs

A graph of order $n>3$ is called {switching separable} if its modulo-2 sum with some complete bipartite graph on the same set of vertices is divided into two mutually independent subgraphs, each having at least two vertices. We prove the…

In this paper, we consider steady Euler flows in two-dimensional bounded annuli, as well as in exterior circular domains, in punctured disks and in the punctured plane. We always assume rigid wall boundary conditions. We prove that, if the…

Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the…

The boundary conditions prescribing the constant traction or the so-called do-nothing conditions are frequently taken on artificial boundaries in the numerical simulations of steady flow of incompressible fluids, despite the fact that they…

In this thesis we consider the free surface flow due to a submerged source in a channel of finite depth. This problem has been considered previously in the literature, with some disagreement about whether or not a train of waves exist on…

We study the spinor flow on homogeneous spin manifolds. After providing the general setup we discuss the homogeneous spinor flow in dimension 3 and on almost abelian Lie groups in detail. As a further example the flag manifold in dimension…

We recall theorems by Krygin, Atkinson, Shneiberg and propose the following assertion. Let $T_t$ be an ergodic flow on $(X,\mu)$, let a function $f$ on $X$ have zero mean, and $\mu(A)>0$ for $A\subset X$. Then for almost all $x\in A$ with…

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph, the minimum size of a dicut equals to the maximum number…

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

We are concerned with rigidity properties of steady Euler flows in two-dimensional bounded annuli. We prove that in an annulus, a steady flow with no interior stagnation point and tangential boundary conditions is a circular flow, which…

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

We study the geodesic flow on the normal line congruence of a minimal surface in ${\Bbb{R}}^3$ induced by the neutral K\"ahler metric on the space of oriented lines. The metric is lorentz with isolated degenerate points and the flow is…

We prove that, in a two-dimensional strip, a steady flow of an ideal incompressible fluid with no stationary point and tangential boundary conditions is a shear flow. The same conclusion holds for a bounded steady flow in a half-plane. The…

There exist rotationally symmetric translating solutions to mean curvature flow that can be written as a graph over Euclidean space. This result is well-known. Its proof uses the symmetry and techniques from partial differential equations.…

The 2D Euler system, which governs inviscid incompressible fluid flow, can admit infinitely many steady solutions in a given domain with slip boundary conditions. To select physical classical solutions, we investigate the vanishing…

In this paper, we consider the anisotropic $\alpha$-Gauss curvature flow for complete noncompact convex hypersurfaces in the Euclidean space with the anisotropy determined by a smooth closed uniformly convex Wulff shape. We show that for…

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

We study zero forcing and $\ell$-leaky zero forcing on induced subgraphs of $d$-dimensional grid graphs. Using $\ell$-leaky forts, we prove structural results showing that for $\ell \le 2d-1$, every nonempty $\ell$-leaky fort in an induced…

The geodesics in the group of volume-preserving diffeomorphisms (volumorphisms) of a manifold $M$, for a Riemannian metric defined by the kinetic energy, can be used to model the movement of ideal fluids in that manifold. The existence of…

This paper gives a framework to study a continuum limit of a gradient flow on a graph where the number of vertices increases in an appropriate way. As examples we prove the convergence of a discrete total variation flow and a discrete…