Related papers: A combinatorial property of flows on a cycle

Generalizing a formula of Stanley, we prove combinatorially that the probability that $1, 2, \dots, k$ are contained in the same cycle of a product of two random $n$-cycles is \[\frac{1}{k} + \frac{4 (-1)^n}{ \binom{2k}{k}}…

We consider a model of a binary mixture of two immiscible compressible fluids. We propose a numerical scheme and discuss its basic properties: Stability, consistency, convergence. The convergence is established via the method of generalized…

We investigate the probability of detecting combinatorial Morse flows on a simplicial complex via a random search. We prove that it is really small, in a quantifiable way.

In this work we study the existence of singular flows satisfying shadowing-like properties. More precisely, we prove that if C1 -vector field on a closed manifold induces a chain-recurrent flow containing an attached hyperbolic singularity…

The Max-Flow Min-Cut theorem is the classical duality result for the Max-Flow problem, which considers flow of a single commodity. We study a multiple commodity generalization of Max-Flow in which flows are composed of real-valued k-vectors…

Certifying power flow solvability is important for reliable power system operations under volatile operating conditions, but solving power flow equations repeatedly can be costly and may encounter convergence issues. In this paper, we…

We study the following conjecture of Matt DeVos: If there is a graph homomorphism from Cayley graph Cay(M, B) to another Cayley graph Cay(M', B') then every graph with an (M, B)-flow has an (M', B')-flow. This conjecture was originally…

The appearence of a new type of fast nonlinear traveling wave states in binary fluid convection with increasing Soret effect is elucidated and the parameter range of their bistability with the common slower ones is evaluated numerically.…

We study a class of dynamical multi-commodity flow networks in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a…

In [12], the existence of ideal circle patterns in Euclidean or hyperbolic background geometry under the combinatorial conditions was proved using flow approaches. It remains as an open problem for the spherical case. In this paper, we…

We provide a tight approximate characterization of the $n$-dimensional product multicommodity flow (PMF) region for a wireless network of $n$ nodes. Separate characterizations in terms of the spectral properties of appropriate network…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

In vehicle traffic networks, congestion on one outgoing link of a diverging junction often impedes flow to other outgoing links, a phenomenon known as the first-in-first-out (FIFO) property. Simplified traffic models that do not account for…

The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…

Arnol'd and Kochergin mixing conservative flows on surfaces stand as the main and almost only natural class of mixing transformations for which higher order mixing has not been established, nor disproved. Under suitable arithmetic…

In this paper we introduce a property of ergodic flows, called Property B. We prove that any ergodic hyperfinite equiva- lence relation of type III_o whose associated flow satisfies this property is not of product type. A consequence of…

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either…

We consider the problem of multicommodity flows in planar graphs. Seymour showed that if the union of supply and demand graphs is planar, then the cut condition is sufficient for routing demands. Okamura-Seymour showed that if all demands…

This paper introduces the notions of vector field and flow on a general differentiable stack. Our main theorem states that the flow of a vector field on a compact proper differentiable stack exists and is unique up to a uniquely determined…