Abstract
Adapting Lindström’s wellknown construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a combinatorial description for the set of “universal” quadratic relations valid for such functions. Their specializations to particular semirings involve plenty of known quadratic relations for minors of matrices (e.g., Plücker relations) and the tropical counterparts of such relations. Also some applications and related topics are discussed.
Introduction
In this paper, we consider functions which take values in a commutative semiring and are generated by planar flows. Functions of this sort satisfy plenty of quadratic relations, and our goal is to describe a combinatorial method to reveal and prove such relations. One important class consists of quadratic relations of Plücker type.
Recall some basic facts concerning Plücker algebra and Plücker coordinates. For a positive integer n, let [n] denote the set {1,2,…,n}. Consider the n×n matrix x of indeterminates x _{ ij } and the corresponding commutative polynomial ring ℤ[x]. Also consider the polynomial ring ℤ[Δ] generated by variables Δ_{ S } indexed by the subsets S⊆[n]. They are linked by the natural ring homomorphism ψ:ℤ[Δ]→ℤ[x] that brings each variable Δ_{ S } to the flag minor polynomial for S, i.e., to the determinant of the submatrix x _{ S } formed by the column set S and the row set {1,…,S} of x. An important fact is that the ideal ker(ψ) of ℤ[Δ] is generated by homogeneous quadrics, each being a certain integer combination of products Δ_{ S }Δ_{ S′}. They correspond to quadratic relations on the Plücker coordinates of an invertible n×n matrix (regarded as a point of the corresponding flag manifold embedded in an appropriate projective space); for a survey see, e.g., [13, Chap. 14].
There are many quadratic Plücker relations on flag minors of a matrix whose entries are assumed to belong to an arbitrary commutative ring ℜ (the case ℜ=ℝ or ℂ is most popular). Let f(S) denote the flag minor with a column set S in this matrix.
The simplest examples of Plücker relations involve triples: for any three elements i<j<k in [n] and any subset X⊆[n]−{i,j,k}, the flag minor function f:2^{[n]}→ℜ of an n×n matrix satisfies
where for brevity we write Xi′…j′ for X∪{i′,…,j′}. We call (1.1) the AP3relation (abbreviating “algebraic Plücker relation with triples”). Another wellknown special case (in particular, encountered in a characterization of Grassmannians) involves quadruples i<j<k<ℓ; this is of the form
A general algebraic Plücker relation on flag minors of a matrix can be written as
Here X and Y are disjoint subsets of [n], and \({ \mathcal{A}}\) and \({\mathcal{B}}\) are certain families of pelement subsets of Y, for some p.
In fact, an instance of (1.3) (such as (1.1) or (1.2)) represents a class of relations of “the same type”. More precisely, let m:=Y and define γ _{ Y } to be the order preserving bijective map [m]→Y, i.e., γ _{ Y }(i)<γ _{ Y }(j) for i<j. This gives the families \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) of pelement subsets of the initial interval [m] such that \({ \mathcal{A}}=\{\gamma_{Y}(C)\,\colon C\in { \mathcal{A}}_{0}\}\) and \({ \mathcal{B}}=\{\gamma_{Y}(C)\,\colon C\in { \mathcal{B}}_{0}\}\). We call \({ \mathcal{A}}_{0}\) the pattern of \({ \mathcal{A}}\) and write \({ \mathcal{A}}=\gamma_{Y}({ \mathcal{A}}_{0})\), and similarly for \({ \mathcal{B}}_{0}\) and \({ \mathcal{B}}\). When considering a class of functions \(f:2^{[n]}\to { \mathcal{R}}\) and speaking of (1.3) as a “universal” (or “stable”) relation, we require that (1.3) be valid for all functions within this class and depend only on m, p, and the patterns \({\mathcal{A}}_{0},{ \mathcal{B}}_{0}\), but not on X and Y. Namely, (1.3) should hold for any choice of disjoint X,Y⊆[n] with Y=m and for the corresponding families \({ \mathcal{A}}:=\gamma_{Y}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}:=\gamma_{Y}({ \mathcal{B}}_{0})\).
In particular, (1.3) turns into (1.1) when m=3, p=2, \({ \mathcal{A}}_{0}=\{13\}\), \({ \mathcal{B}}_{0}=\{12,23\}\), and Y={i,j,k}, and turns into (1.2) when m=4 p=2, \({ \mathcal{A}}_{0}=\{13\}\), \({ \mathcal{B}}_{0}=\{12,14\}\), and Y={i,j,k,ℓ}.
An important fact established by Lindström [12] is that the minors of many matrices can be expressed in terms of flows in a planar graph. A certain flow model will play a key role in our description; next we specify the terminology and notation that we use. (A more general flow model yielding a generalization of Lindström’s result is given in [14, 15].)
By a planar network we mean a finite directed planar acyclic graph G=(V,E) in which two subsets S={s _{1},…,s _{ n }} and T={t _{1},…,t _{ n′}} of vertices are distinguished, called the sets of sources and sinks, respectively. We assume that these vertices, also called terminals, lie in the boundary of a compact convex region in the plane, which we denote by O and sometimes conditionally call a “circumference”, and the remaining part of the graph lies inside O. The terminals appear in O in the cyclic order s _{ n },…,s _{1},t _{1},…,t _{ n′} clockwise (with possibly s _{1}=t _{1} or s _{ n }=t _{ n′}), and for convenience we say that the sources and sinks lie in the “lower” and “upper” halves of O, respectively, and that the indices in each set grow “from left to right”.
Two important particular cases are: the (square) grid Γ _{ n,n′} and the halfgrid \(\varGamma^{\triangle}_{n}\), where the vertices in the former are the integer points (i,j)∈ℝ^{2} with 1≤i≤n, 1≤j≤n′, the vertices in the latter are the integer points (i,j) with 1≤j≤i≤n, and the edges in both cases are all possible ordered pairs of the form ((i,j),(i−1,j)) or ((i,j),(i,j+1)). The sources are the points s _{ i }:=(i,1), whereas the sinks are the points t _{ j }:=(1,j) in the former case, and the t _{ j }:=(j,j) in the latter case. The graphs Γ _{5,4} and \(\varGamma^{\triangle}_{4}\) are illustrated in Fig. 1.
In what follows, the collection of pairs (I⊆[n],I′⊆[n′]) with equal sizes: I=I′, is denoted by \({ \mathcal{E}}^{n,n'}\). By an (II′)flow we mean a collection ϕ of pairwise (vertex) disjoint directed paths in G going from the source set S _{ I }:={s _{ i } :i∈I} to the sink set T _{ I′}:={t _{ j } :j∈I′}. The set of (II′)flows in G is denoted by \(\varPhi_{II'}^{G}\), or simply by Φ _{ II′}.
Let w:V→ℜ be a weighting on the vertices of G (alternatively, one can consider a weighting on the edges; see the end of this section). We associate to w the function f=f _{ w } on \({ \mathcal{E}}^{n,n'}\) defined by
where V _{ ϕ } is the set of vertices occurring in a flow ϕ. (When G has no flow for some (I,I′), we set f(II′):=0.) We refer to f obtained in this way as an algebraic flowgenerated function, or an AFGfunction for short.
When an (II′)flow ϕ enters the first I=:k sinks (i.e., I′=[k]), we say that ϕ is a flag flow for I. Accordingly, we use the abbreviated notation Φ _{ I } for Φ _{ I [k]}, and f _{ w }(I) for f _{ w }(I [k]). When we are interested in the flag case only, f _{ w } is regarded as a function on the set 2^{[n]} of subsets of [n].
Lindström [12] showed that if M is the n′×n matrix whose entries m _{ ji } are defined as \(\sum_{\phi\in\varPhi_{\{i\}\{j\}}}\prod_{v\in V_{\phi}} w(v)\), then for any \((I,I')\in { \mathcal{E}}^{n,n'}\), the minor of M with the column set I and the row set I′ is equal to the value f(II′) as in (1.4). A converse property is valid for many matrices, in particular, for the totally nonnegative matrices (see [3]): the minors of such a matrix can be expressed as above via flows for some planar network and weighting. (Recall that a real matrix is called totally nonnegative (totally positive) if all minors in it are nonnegative (resp., positive).)
Another important application of the flow model concerns tropical analogues of the above quadratic relations. In this case, the flowgenerated function f=f _{ w } determined by a weighting w on V is defined by
Here w is assumed to take values in a totally ordered abelian group \(\mathfrak{L}\) (usually one deals with \(\mathfrak{L}={\mathbb{R}}\) or ℤ). The expression for f in (1.5) is the tropicalization of that in (1.4), and f is said to be a tropical flowgenerated function, or a TFGfunction. Some appealing properties of such functions and related objects in the flag flow case are demonstrated in [4, 5] (where realvalued tropical functions are considered but everywhere ℝ can be replaced by \(\mathfrak{L}\)). In particular, a TFGfunction f satisfies the tropical analog of (1.1), or the TP3relation: for i<j<k and X⊆[n]−{i,j,k},
In this paper, we combine both cases, the algebraic and tropical ones, by considering functions taking values in an arbitrary commutative semiring \(\mathfrak{S}\), a set equipped with two associative and commutative binary operations ⊕ (addition) and ⊙ (multiplication) satisfying the distributive law a⊙(b⊕c)=(a⊙b)⊕(a⊙c). Sometimes we will assume that \(\mathfrak{S}\) contains neutral elements 0 (for addition) and/or 1 (for multiplication). Two special cases are: (i) a commutative ring (in which case \(\underline{0}\in\mathfrak{S}\) and each element has an additive inverse); (ii) a commutative semiring with division (in which case \(\underline{1}\in\mathfrak{S}\) and each element has a multiplicative inverse). Examples of (ii) are: the set ℝ_{>0} of positive reals (with ⊕=+ and ⊙=⋅), and the abovementioned tropicalization of a totally ordered abelian group \(\mathfrak{L}\), denoted as \(\mathfrak {L}^{\mathrm{trop}}\) (with ⊕=max and ⊙=+). The set 2ℤ_{>0} of positive even integers (with usual addition and multiplication) gives an example of a commutative semiring having neither 0 nor 1.
Extending (1.4) and (1.5), the flowgenerated function f=f _{ w } determined by a weighting \(w:V\to\mathfrak{S}\) is defined by
where w(ϕ) denotes the weight ⊙(w(v) :v∈V _{ ϕ }) of a flow ϕ. We call f an FGfunction (abbreviating “flowgenerated function”), and denote the set of these functions by \(\mathbf {FG}_{n,n'}(\mathfrak{S})\).
Remark 1
Note that an (II′)flow in G may not exist, making f(II′) undefined if \(\mathfrak{S}\) does not contain 0 (e.g., in the tropical case). To overcome this trouble, we may formally extend \(\mathfrak{S}\), when needed, by adding an “extra neutral” element ∗, setting ∗⊕a=a and ∗⊙a=∗ for all \(a\in \mathfrak{S}\). In the extended semiring \(\mathfrak{\widehat{S}}\), one defines f(II′):=∗ whenever Φ _{ II′}=∅.
As before, we write f(I) for f(I [I]) in the flag flow case. Then a direct analogue of the general Plücker relation (1.3) for \(\mathfrak{S}\) is viewed as
Definition 1
Let p<m≤n and let \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) be two families of pelement subsets of [m]. If (1.7) (with f determined as above) holds for any commutative semiring \(\mathfrak {S}\), acyclic directed graph G, weighting w, disjoint subsets X and Y, and the families \({ \mathcal{A}}:=\gamma_{Y}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}:=\gamma_{Y}({\mathcal{B}}_{0})\), then we call (1.7) a stable quadratic relation of Plücker type, or a PSQrelation for short, and say that it is induced by the patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\).
Note that in general we admit that \({ \mathcal{A}}_{0}\) or \({ \mathcal{B}}_{0}\) can contain multiple members. In other words, one may assume that for m,p fixed, the pairs of patterns inducing PSQrelations constitute an abelian group under the operations \(({ \mathcal{A}}_{0},{ \mathcal{B}}_{0})+({ \mathcal{A}}'_{0},{ \mathcal{B}}'_{0}):=({ \mathcal{A}}_{0}\sqcup { \mathcal{A}}'_{0},{ \mathcal{B}}_{0}\sqcup { \mathcal{B}}'_{0})\) and \(({ \mathcal{A}}_{0},{ \mathcal{B}}_{0})({ \mathcal{A}}'_{0},{ \mathcal{B}}'_{0}):=({ \mathcal{A}}_{0}\sqcup { \mathcal{B}}'_{0},{ \mathcal{B}}_{0}\sqcup { \mathcal{A}}'_{0})\), where ⊔ denotes the disjoint set union. For this reason, we will write \({ \mathcal{A}}_{0}\Subset\binom{[m]}{p}\) and \({ \mathcal{A}}\Subset\binom{Y}{p}\) (with symbol ⋐ rather than ⊆), and similarly for \({ \mathcal{B}}_{0}\) and \({ \mathcal{B}}\).
Next, a Plücker relation on minors of a matrix deals with flag minors and is homogeneous, in the sense that the pairs of minor sizes in all products are the same. However, there are quadratic relations involving nonflag and nonhomogeneous minors. One relation of this sort is expressed by Dodgson’s condensation formula [6]:
where f(II′) stands for the minor of a matrix with the column set I and the row set I′, k−i=k′−i′>0, X is the interval [i+1..k−1] (from i+1 to k−1) and X′ is the interval [i′+1..k′−1].
This inspires a study of a larger class of quadratic relations on flowgenerated functions over commutative semirings. Now for \(\mathfrak{S},G,w\) as before, we deal with the function f=f _{ w } on \({ \mathcal{E}}^{n,n'}\), and consider disjoint X,Y⊆[n] and disjoint X′,Y′⊆[n′]. An identity of our interest is of the form
Here, to simplify notation, we write KL for the union K∪L of disjoint sets K,L, denote the complement Y−C of C⊆Y by \(\overline{C}\), and the complement Y′−C′ of C′⊆Y′ by \(\overline{C}\,'\). The families \({ \mathcal{A}},{ \mathcal{B}}\) consist of certain pairs (C⊆Y,C′⊆Y′) (admitting multiplicities). As before, we are interested in “universal” relations, and for this reason, consider the patterns \({ \mathcal{A}}_{0},{\mathcal{B}}_{0}\) formed by the pairs (A _{0}⊆[m],B _{0}⊆[m′]) such that \({ \mathcal{A}}=\gamma_{Y,Y'}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}=\gamma_{Y,Y'}({\mathcal{B}}_{0})\), where m:=Y, m′:=Y′, and γ _{ Y,Y′} is the bicomponent order preserving bijective map of [m]⊔[m′] to Y⊔Y′. Observe that (1.7) is a special case of (1.9) with X′={1,2,…,X+r} and Y′={X+r+1,…,X+m−r}, where r:=min{p,m−p}.
Definition 2
When (1.9) holds for fixed \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) as above and any corresponding \(\mathfrak{S},G,w,X,Y,X',Y'\) and the families \({ \mathcal{A}}:=\gamma_{Y,Y'}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}:=\gamma_{Y,Y'}({ \mathcal{B}}_{0})\), we call (1.9) a (general) stable quadratic relation, or an SQrelation, and say that it is induced by the patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\).
To distinguish between the general and Plücker cases, we will refer to \({ \mathcal{A}},{ \mathcal{B}}\) in Definition 2 as 2families, and to \({\mathcal{A}}_{0},{ \mathcal{B}}_{0}\) as 2patterns, whereas analogous objects in Definition 1 will be called 1families and 1patterns.
The goal of this paper is to describe a relatively simple combinatorial method of characterizing the patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) inducing SQrelations (in particular, PSQrelations). In fact, our method generalizes a flow rearranging approach used in [4] for proving the TP3relation for TFGfunctions. The method consists in reducing to a certain combinatorial problem, and as a consequence, provides an “efficient” procedure to recognize whether or not a pair \({ \mathcal{A}},{ \mathcal{B}}\) of 2families yields an SQrelation.
The main result obtained on this way is roughly as follows. We associate to a pair (C⊆[m],C′⊆[m′]) a certain set of perfect matchings on [m]⊔[m′]. Given a pair \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) of 2patterns for m,m′, define to be the collection of such matchings over all members of \({ \mathcal{A}}_{0}\) (counting multiplicities), and define in a similar way. We say that \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced if the families and are equal, and show (Theorem 3.1) that
2patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) induce an SQrelation if and only if they are balanced.
Our approach to handling flows and reducing the problem to examining certain collections of matchings is close in essence to a lattice paths method elaborated in Fulmek and Kleber [9] and Fulmek [8] to generate quadratic identities on Schur functions. The latter method is based on the Gessel–Viennot interpretation [11] of semistandard Young tableaux by use of “flows” in a special directed graph, and [8, 9] give sufficient conditions on quadratic identities for Schur functions, formulated just in terms of relations on matchings.
The paper is organized as follows. Section 2 describes properties of certain pairs of flows, called double flows, which lie in the background of the method. Section 3 states the main result (Theorem 3.1) and proves sufficiency, claiming that all balanced families \({ \mathcal{A}},{ \mathcal{B}}\) give SQrelations. Section 4 is devoted to illustrations of the method; it demonstrates a number of examples of SQrelations, including rather wide classes (a majority concerns the flag flow case). Section 5 proves the other direction of Theorem 3.1, which is more intricate. Moreover, we show that if 2patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are not balanced, then for any corresponding X,Y,X′,Y′, one can construct a planar network G with integer weights w such that the FGfunction f _{ w } violates relation (1.9). As a consequence, for \({ \mathcal{A}},{ \mathcal{B}}\) fixed, validity of ( 1.9 ) for all commutative semirings \({\mathfrak{S}}\) is equivalent to its validity for \({\mathfrak{S}}={\mathbb{Z}}\) . (This matches the socalled transfer principle for semirings; see, e.g., [1, Sect. 3].) Section 6 is devoted to applications to Schur functions. The final Sect. 7 contains a short discussion on nice additional properties (namely, the existence and an explicit construction of a socalled basis for \(\mathbf{FG}_{n,n'}({\mathfrak{S}})\), the Laurent phenomenon for FGfunctions, and some others) in the case when \({\mathfrak{S}}\) is a commutative semiring with division; this extends corresponding results from [4]. Here we also indicate one more sufficient condition on a matrix guaranteeing that the function of its minors is flowgenerated (Proposition 7.2). The paper is concluded with a (rather routine) proof of the assertion that the function of minors of any n′×n matrix A over a commutative ring obeys all SQrelations concerning n,n′ (Proposition 7.3).
We have mentioned above that, instead of a weighting on the vertices of a graph G in question, one can consider a weighting on the edges. However, this does not affect the problem and our results in essence. When an edge e is endowed with a weight, one can split e into two edges in series and transfer the weight into the intermediate vertex, yielding an equivalent flow model (up to assigning the weight to each old vertex to be the “neutral element for multiplication”). Throughout the paper (except for Sect. 6), we prefer to deal with a weighting on vertices for technical reasons.
Flows and double flows
As before, let G=(V,E) be an (acyclic) planar network with sources s _{1},…,s _{ n } and sinks t _{1},…,t _{ n′}. In this section, we describe ideas and tools behind the method of constructing 2patterns \({\mathcal{A}}_{0},{ \mathcal{B}}_{0}\) that ensure validity of (1.9) for all flowgenerated functions f=f _{ w } on \({ \mathcal{E}}^{n,n'}\) determined by weightings \(w:V\to\mathfrak{S}\), where \(\mathfrak{S}\) is an arbitrary commutative semiring.
First of all, we specify some terminology and notation. By a path in a digraph (directed graph) we mean a sequence P=(v _{0},e _{1},v _{1},…,e _{ k },v _{ k }) such that each e _{ i } is an edge connecting vertices v _{ i−1},v _{ i }. An edge e _{ i } is called forward if it is directed from v _{ i−1} to v _{ i }, denoted as e _{ i }=(v _{ i−1},v _{ i }), and backward otherwise (when e _{ i }=(v _{ i },v _{ i−1})). The path P is called directed if it has no backward edge, and simple if all vertices v _{ i } are distinct. When k>0, v _{0}=v _{ k }, and all v _{1},…,v _{ k } are distinct, P is called a simple cycle, or a circuit. The sets of vertices and edges of P are denoted by V _{ P } and E _{ P }, respectively.
Consider an (II′)flow ϕ in G, where \((I,I')\in {\mathcal{E}}^{n,n'}\). It consists of pairwise disjoint directed paths going from the source set S _{ I } to the sink set T _{ I′}. Since G is acyclic, these paths are simple, and in view of the ordering of sources and sinks in the boundary O, the path in ϕ beginning at ith source in S _{ I } enters ith sink in T _{ I′} (counting “from left to right”). Equivalently (when s _{1}≠t _{1} and s _{ n }≠t _{ n′}), we may think of ϕ as an induced subgraph of G satisfying: \(\delta^{\mathrm{out}}_{\phi}(s_{i})=1\) and \(\delta^{\mathrm{in}}_{\phi}(s_{i})=0\) if i∈I; \(\delta^{\mathrm{out}}_{\phi}(t_{j})=0\) and \(\delta^{\mathrm{in}}_{\phi}(t_{j})=1\) if j∈I′; and \(\delta^{\mathrm{out}}_{\phi}(v)=\delta^{\mathrm{in}}_{\phi}(v)\in\{0,1\}\) for the other vertices v of G. Here \(\delta^{\mathrm{out}}_{\phi}(v)\) (resp., \(\delta^{\mathrm{in}}_{\phi}(v)\)) denotes the number of edges in ϕ leaving (resp., entering) a vertex v. Also we denote \(\delta^{\mathrm{out}}_{\phi}(v)+\delta^{\mathrm{in}}_{\phi}(v)\) by δ _{ ϕ }(v).
Our approach is based on examining certain pairs of flows in G and rearranging them to form some other pairs. To simplify technical details, it is convenient to modify the original network G as follows. Let us split each vertex v∈V into two vertices v′,v″ (placing them in a small neighborhood of v in the plane) and connect them by edge e _{ v }=(v′,v″), called a splitedge. Each edge (u,v) of G is replaced by an edge going from u″ to v′; we call it an ordinary edge. Also for each s _{ i }∈S, we add a new source \(\widehat{s}_{i}\) and the edge \((\widehat{s}_{i},s'_{i})\), and for each t _{ j }∈T, add a new sink \(\widehat{t}_{j}\) and the edge \((t''_{j},\widehat{t}_{j})\); we refer to such edges as extra ones. The picture illustrates the transformation for the halfgrid \(\varGamma^{\triangle}_{3}\).
Note that the new (modified) graph is again acyclic, but it need not be planar in general (e.g., a local nonplanarity arises when the original graph has a vertex v with four incident edges e _{1},e _{2},e _{3},e _{4}, in this order clockwise, such that e _{1},e _{3} enter and e _{2},e _{4} leave v); nevertheless, the latter fact will cause no trouble to us. We denote this graph by \(\widehat{G}=(\widehat{V},\widehat{E})\), and take \(\widehat{S}:=\{\widehat{s}_{1},\ldots,\widehat{s}_{n}\}\) and \(\widehat{T}:=\{\widehat{t}_{1},\ldots,\widehat{t}_{n'}\}\) as the sets of sources and sinks in it, respectively. As before, sources and sinks are also called terminals. Clearly, for any i∈[n] and j∈[n′], there is a natural 1–1 correspondence between the directed paths from s _{ i } to t _{ j } in G and the ones from \(\widehat{s}_{i}\) to \(\widehat{t}_{j}\) in \(\widehat{G}\). This is extended to a 1–1 correspondence between flows, and for \((I,I')\in { \mathcal{E}}^{n,n'}\), we keep notation Φ _{ II′} for the set of flows in \(\widehat{G}\) going from \(\widehat{S}_{I}:=\{\widehat{s}_{i} \,\colon i\in I\}\) to \(\widehat{T}_{I'}:=\allowbreak \{\widehat{t}_{j}\,\colon j\in\nobreak I'\}\). (When needed, a weighting w on the vertices v of the initial G is transferred to the splitedges of \({\widehat{G}}\), namely, by setting w(e _{ v }):=w(v). Then corresponding flows in both networks have equal weights, which are the ⊙products of the weights of vertices or splitedges in the flows. This implies that the functions on \({ \mathcal{E}}^{n,n'}\) generated by corresponding flows coincide.)
The digraph \(\widehat {G}\) possesses the following useful properties:

(2.1)

(a)
Each nonterminal vertex is incident with exactly one splitedge, and if e=(u,v) is a splitedge, then \(\delta^{\mathrm{out}}_{\widehat{G}}(u)=1\) and \(\delta^{\mathrm{in}}_{\widehat{G}}(v)=1\).

(b)
Each source (sink) has exactly one leaving edge and no entering edge (resp., one entering edge and no leaving edge).

(a)
Consider disjoint subsets X,Y⊆[n] and disjoint subsets X′,Y′⊆[n′]. Let m:=Y and m′:=Y. Consider a pair (A⊆Y,A′⊆Y′) satisfying
as before denoting by \(\overline{A}\) and \(\overline{A}\,'\) the sets Y−A and Y′−A′, respectively.
Remark 2
The above equalities are necessary for the existence of an (XAX′A′)flow and an \((X\overline{A}X'\overline{A}\,')\)flow (as before, we write XA for X∪A, and so on). They imply
We say that X,Y,X′,Y′ satisfying (i) are consistent and refer to a pair (A⊆Y,A′⊆Y′) satisfying (ii) as being proper for (Y,Y′). The set of proper pairs for (Y,Y) is denoted by Π _{ Y,Y′}. For brevity, we write Π _{ m,m′} for Π _{[m],[m′]}.
Consider an (XAX′A′)flow ϕ and an \((X\overline{A}X\overline{A}\,')\)flow ϕ′ in \({\widehat{G}}\); we call the pair (ϕ,ϕ′) a double flow for (A,A′). Our method will rely on two lemmas. Hereinafter we write C△ D for the symmetric difference (C−D)∪(D−C) of sets C,D.
Lemma 2.1
E _{ ϕ }△ E _{ ϕ′} is partitioned into the edge sets of pairwise disjoint circuits C _{1},…,C _{ d } (for some d) and simple paths P _{1},…,P _{ p } (with \(p=\frac{1}{2}(m+m')\)), where each P _{ i } connects either \(\widehat{S}_{A}\) and \(\widehat{S}_{\overline{A}}\), or \(\widehat{S}_{A}\) and \(\widehat{T}_{A'}\), or \(\widehat{S}_{\overline{A}}\) and \(\widehat{T}_{\overline{A}\,'}\), or \(\widehat{T}_{A'}\) and \(\widehat{T}_{\overline{A}\,'}\). In each of these circuits and paths, the edges of ϕ and the edges of ϕ′ have opposed directions (say, the former edges are forward and the latter ones are backward).
Proof
Observe that a vertex v of \({\widehat{G}}\) satisfies: (i) δ _{ ϕ }(v)=1 and δ _{ ϕ′}(v)=0 if \(v\in \widehat{S}_{A}\cup \widehat{T}_{A'}\); (ii) δ _{ ϕ }(v)=0 and δ _{ ϕ′}(v)=1 if \(v\in \widehat{S}_{\overline{A}}\cup \widehat{T}_{\overline{A}\,'}\); (iii) δ _{ ϕ }(v)=δ _{ ϕ′}(v)=1 if \(v\in \widehat{S}_{X}\cup \widehat{T}_{X'}\); and (iv) δ _{ ϕ }(v),δ _{ ϕ′}(v)∈{0,2} otherwise. This together with (2.1) implies that any vertex v is incident with 0, 1 or 2 edges in E _{ ϕ }△ E _{ ϕ′}, and the number of such edges is equal to 1 if and only if \(v\in \widehat{S}_{A}\cup \widehat{S}_{\overline{A}}\cup \widehat{T}_{A'}\cup \widehat{T}_{\overline{A}\,'}\). (This is where we essentially use the transformation of G into \(\widehat{G}\).) Hence the weakly connected components of the subgraph of \({\widehat{G}}\) induced by E _{ ϕ }△ E _{ ϕ′} are circuits, say, C _{1},…,C _{ d }, and simple paths P _{1},…,P _{ p }, each of the latter connecting two terminals in \(\widehat{S}_{A}\cup \widehat{S}_{\overline{A}} \cup \widehat{T}_{A'}\cup \widehat{T}_{\overline{A}\,'}\).
Consider consecutive edges e,e′ in a circuit C _{ i } or a path P _{ j }. If both e,e′ belong to the same flow among ϕ,ϕ′, then, obviously, they have the same direction in this circuit/path. Suppose e,e′ belong to different flows. In view of (2.1), the common vertex v of e,e′ is not a terminal and it is incident with a splitedge e″. Clearly, e″ belongs to both ϕ,ϕ′, and therefore e″≠e,e′. Then either both e,e′ enter v or both leave v, so they are directed differently along the circuit/path containing them. This yields the second assertion in the lemma.
Finally, consider a path P _{ j }=(v _{0},e _{1},v _{1},…,e _{ r },v _{ r }) as above, and suppose that some of its ends, say, v _{0}, belongs to \(\widehat{S}_{A}\). Then the extra edge e _{1} is contained in ϕ and leaves the source v _{0}. If \(v_{r}\in \widehat{S}_{A}\), then the extra edge e _{ r } is in ϕ as well and leaves the source v _{ r }; so e _{1},e _{ r } are directed differently along P _{ j }, contradicting the argument above. And if \(v_{r}\in \widehat{T}_{\overline{A}\,'}\), then e _{ r } belongs to ϕ′ and enters the sink v _{ r }; so e _{1},e _{ r } have the same direction along P _{ j }, again obtaining a contradiction. Thus, P _{ j } connects \(\widehat{S}_{A}\) and \(\widehat{S}_{\overline{A}}\cup \widehat{T}_{A'}\). Similarly, any path P _{ j } neither has both ends in exactly one of \(\widehat{S}_{\overline{A}},\widehat{T}_{A'},\widehat{T}_{\overline{A}\,'}\), nor connects \(\widehat{S}_{\overline{A}}\) and \(\widehat{T}_{A'}\). □
Figure 2 illustrates an example of \({\widehat{G}},\phi,\phi '\) and indicates E _{ ϕ }⊔E _{ ϕ′} and E _{ ϕ }△ E _{ ϕ′}.
Next we explain how to rearrange a double flow (ϕ,ϕ′) for (A,A′) so as to obtain a double flow for another pair (B,B′)∈Π _{ Y,Y′}. Let P _{1},…,P _{ p } be the paths as in Lemma 2.1, where \(p=\frac{1}{2}(m+m')\). We denote the set of these paths by \({ \mathcal{P}}(\phi ,\phi')\). For a path \(P\in { \mathcal{P}}(\phi,\phi')\), let π(P) denote the pair of elements in Y⊔Y′ corresponding to the end vertices of P. We observe from Lemma 2.1 that π(P) belongs to one of \(A\times \overline{A}\), A×A′, \(A'\times \overline{A}\,'\), \(\overline{A}\times \overline{A}\,'\) (considering π(P) up to reversing). Define
This set of pairs forms a perfect matching on Y⊔Y′ (i.e., each element of the latter set is contained in exactly one pair).
Lemma 2.2
Choose an arbitrary subset M _{0}⊆M(ϕ,ϕ′). Define Z:=⋃(π∈M _{0})∩Y, Z′:=⋃(π∈M _{0})∩Y′, B:=A△ Z, and B′:=A′△ Z′. Define \(U:=\bigcup(E_{P}\,\colon P\in { \mathcal{P}}(\phi,\phi'),~\pi(P)\in M_{0})\). Then there are a unique (XBX′B′)flow ψ and a unique \((X\overline{B}X'\overline{B}\,')\)flow ψ′ such that E _{ ψ }=E _{ ϕ }△ U and E _{ ψ′}=E _{ ϕ′}△ U. In particular, E _{ ψ }⊔E _{ ψ′}=E _{ ϕ }⊔E _{ ϕ′}.
Proof
By Lemma 2.1, each path \(P\in { \mathcal{P}}(\phi,\phi')\) is a concatenation of directed paths Q _{1},…,Q _{ r } (considered up to reversing), where consecutive Q _{ j },Q _{ j+1} are contained in different flows among ϕ,ϕ′ and either both leave or both enter their common vertex. Therefore, exchanging the pieces Q _{ j } in ϕ,ϕ′, we obtain an (XCX′C′)flow α and an \((X\overline{C}X'\overline{C}\,')\)flow α′ such that E _{ α }=E _{ ϕ }△ E _{ P } and E _{ α′}=E _{ ϕ′}△ E _{ P }, where C:=A△ (π∩Y) and C′:=A′△ (π∩Y′).
Doing so for all \(P\in { \mathcal{P}}(\phi,\phi')\) with π(P)∈M _{0}, we obtain flows ψ,ψ′ satisfying the desired properties, taking into account that the paths in \({ \mathcal{P}}(\phi,\phi')\) are pairwise disjoint. The uniqueness of ψ,ψ′ is obvious. □
Note that M(ψ,ψ′)=M(ϕ,ϕ′) and \({ \mathcal{P}}(\psi,\psi')={ \mathcal{P}}(\phi,\phi')\), and the transformation of ψ,ψ′ by use of the paths in \({ \mathcal{P}}(\psi,\psi')\) related to M _{0} returns the flows ϕ,ϕ′.
Figure 3 illustrates flows ψ,ψ′ created from ϕ,ϕ′ in Fig. 2. Here the left fragment shows ψ,ψ′ when the exchange is performed with respect to the (single) path P in \({ \mathcal{P}}(\phi,\phi')\) connecting the sources \(\widehat{s}_{2}\) and \(\widehat{s}_{3}\), and the right fragment shows those for the path P′ connecting the source \(\widehat{s}_{1}\) and the sink \(\widehat{t}_{2}\) (see (e) in Fig. 2).
In the next section, we will use the fact that, although the modified graph \({\widehat{G}}\) may not be planar, its subgraph ϕ∪ϕ′ is planar.
To see this, consider a nonterminal vertex v in the initial graph G that belongs to both flows ϕ,ϕ′. Let a,a′ be the edges of ϕ (concerning G) entering and leaving v, respectively, and let b,b′ be similar edges for ϕ′. The only situation when the subgraph ϕ∪ϕ′ (concerning \(\widehat{G}\)) is not locally planar in a small neighborhood of the splitedge e _{ v } is that all a,a′,b,b′ are different and follow in this order (clockwise or counterclockwise) around v. We assert that this is not the case. Indeed, a,a′ belong to a directed path P in \({\widehat{G}}\) from a source \(\widehat{s}_{i}\) to a sink \(\widehat{t}_{i'}\), and b,b′ belong to a directed path Q from \(\widehat{s}_{j}\) to \(\widehat{t}_{j'}\). From the facts that the initial graph G is planar and acyclic and that the edges a,a′,b,b′ occur in this order around v one can conclude that the paths P,Q can meet only at v. This implies that the terminals s _{ i },t _{ i′},s _{ j },t _{ j′} are different and follow in this cyclic order in the boundary O; a contradiction. Thus, ϕ∪ϕ′ is planar, as required.
Remark 3
In the definition of FGfunctions, one can equivalently consider only the acyclic digraphs G having the additional property that each edge of G belongs to at least one directed path going from a source to a sink. Arguing as above, one easily shows that for any vertex v of such a G, the edge direction (to v or from v) changes at most twice when we move around v. Then the modified graph \(\widehat{G}\) is automatically planar, and so is ϕ∪ϕ′.
Balanced families
In this section, we use the above observations and results to construct families involved in stable quadratic relations.
Consider the same objects as before: consistent sets X,Y,X′,Y′ and a proper pair (A,A′) for (Y,Y′) (obeying (2.2)), a double flow (ϕ,ϕ′) for (A,A′), and the perfect matching M=M(ϕ,ϕ′) on Y⊔Y′, referring to the members of M as couples. We denote the set of double flows for (A,A′) by \({ \mathcal{D}}(A,A')\) (when X,Y,X′,Y′ are fixed).
We associate to (A,A′) the set (or ) of feasible perfect matchings M on Y⊔Y′ defined as follows. Let us think that the elements of Y and Y′ are placed, respectively, on the lower half and on the upper half of a circumference O, in the increasing order from left to right. Also let us call the elements (points) of A⊔A′ white, and the elements of \(\overline{A}\sqcup \overline{A}\,'\) black. Then a perfect matching M on Y⊔Y′ is called feasible for (A,A′) if:

(3.1)

(i)
When both elements of a couple π∈M lie either in the lower half of O or in the upper half of O, these elements have different colors.

(ii)
When the elements of π lie in different halves, these elements have the same color.

(iii)
M is planar, in the sense that the chords of O connecting the couples in M are pairwise not intersecting.

(i)
Observe that for \((\phi,\phi')\in { \mathcal{D}}(A,A')\), the matching M=M(ϕ,ϕ′) is feasible. This follows from Lemma 2.1, taking into account that the subgraph ϕ∪ϕ′ of \(\widehat{G}\) is planar and that the paths in \({ \mathcal{P}}(\phi,\phi')\) are pairwise disjoint. A priori any matching in may be expressed as M(ϕ,ϕ′) for some \((\phi,\phi')\in { \mathcal{D}}(A,A')\).
We refer to a triple (A,A′,M) with (A,A′)∈Π _{ Y,Y′} and as a configuration. For a 2family \({ \mathcal{A}}\Subset\varPi_{Y,Y'}\), we define \({ \mathcal{K}}({ \mathcal{A}})\) to be the family of all configurations (A,A′,M) (with possible multiplicities) arising when (A,A′) runs over \({ \mathcal{A}}\).
The exchange operation applied to a configuration (A,A′,M) and to a chosen subset M _{0}⊆M makes the pair (B,B′) defined by B:=A△ (⋃(π∈M _{0})∩Y) and B′:=A△ (⋃(π∈M _{0})∩Y′); in other words, we change the colors of both elements in each couple π∈M _{0} (cf. Lemma 2.2). Then M becomes a feasible matching for (B,B′), and the exchange operation applied to the configuration (B,B′,M) and the same M _{0} returns (A,A′).
Definition
We say that two 2families \({ \mathcal{A}},{ \mathcal{B}}\Subset\varPi_{Y,Y'}\) are balanced if there exists a bijection between \({ \mathcal{K}}({ \mathcal{A}})\) and \({ \mathcal{K}}({\mathcal{B}})\) such that the corresponding configurations (A,A′,M) and (B,B′,M′) have the same matching: M=M′. (We rely on the simple fact that for any two configurations (A,A′,M) and (B,B′,M), the pair (B,B′) can be obtained from (A,A′) by the exchange operation w.r.t. some M _{0}⊆M.) Equivalently, \({ \mathcal{A}},{ \mathcal{B}}\) are balanced if for each planar perfect matching M on Y⊔Y′, the number of times M occurs in sets among \((A,A')\in { \mathcal{A}}\) is equal to a similar number for sets among \((B,B')\in { \mathcal{B}}\). This can be written as
where for \({ \mathcal{C}}\Subset\varPi_{Y,Y'}\), denotes the family consisting of matchings M taken with the multiplicities equal to the number of \((C,C')\in { \mathcal{C}}\) such that . Clearly, \({\mathcal{A}},{ \mathcal{B}}\) are balanced if and only if their 2patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced.
Our main result is the following
Theorem 3.1
Let \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\Subset\varPi_{m,m'}\). The following statements are equivalent:

(i)
Expression (1.9) is a stable quadratic relation, where \({ \mathcal{A}}=\gamma_{Y,Y'}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}=\gamma_{Y,Y'}({ \mathcal{B}}_{0})\).

(ii)
\({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced.
Part (i)⇒(ii) of this theorem will be shown in Sect. 5. In its turn, part (ii)⇒(i) can be immediately proved by relying on the lemmas from the previous section.
Proposition 3.2
Let \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\Subset\varPi_{m,m'}\) be balanced. Then identity (1.9) holds for any consistent sets X,Y,X′,Y′ (corresponding to n,n′,m,m′ as above; cf. (2.2)(i)), the families \({ \mathcal{A}}=\gamma_{Y,Y'}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}=\gamma_{Y,Y'}({\mathcal{B}}_{0})\), and any FGfunction f on \({ \mathcal{E}}^{n,n'}\) (corresponding to arbitrary \(G,w,\mathfrak {S}\) as above).
Proof
For corresponding \(G,w,\mathfrak{S},X,Y,X',Y'\), consider the FGfunction f=f _{ w } on \({ \mathcal{E}}^{n,n'}\). The summand corresponding to \((A,A')\in { \mathcal{A}}\) in the L.H.S. of (1.9) can be expressed via double flows as follows:
The summand corresponding to \((B,B')\in { \mathcal{B}}\) in the L.H.S. of (1.9) is expressed similarly.
Consider a configuration \((A,A',M)\in { \mathcal{K}}({ \mathcal{A}})\) and suppose (ϕ,ϕ′) is a double flow for (A,A′) such that M(ϕ,ϕ′)=M (if it exists). Since \({ \mathcal{A}},{ \mathcal{B}}\) are balanced, (A,A′,M) is bijective to some configuration (B,B′,M) in \({ \mathcal{B}}\). Since M is a feasible matching for both (A,A′) and (B,B′), one can see from conditions (3.1)(i), (ii) that (B,B′) is obtained from (A,A′) by the exchange operation w.r.t. some M _{0}⊆M. Then transforming (ϕ,ϕ′) by use of the paths \(P\in {\mathcal{P}}(\phi,\phi')\) with π(P)∈M _{0}, as described in Lemma 2.2, we obtain a double flow (ψ,ψ′) for (B,B′) such that E _{ ψ }⊔E _{ ψ′}=E _{ ϕ }⊔E _{ ϕ′}, and therefore w(ψ)⊙w(ψ′)=w(ϕ)⊙w(ϕ′). Moreover, (ϕ,ϕ′)↦(ψ,ψ′) gives a bijection between all double flows involved in the configurations in \({ \mathcal{K}}({ \mathcal{A}})\) and those in \({ \mathcal{K}}({ \mathcal{B}})\). Now the desired equality (1.9) follows by considering the last term in (3.2). □
The rest of this section is devoted to additional conventions and illustrations.
Let M be a planar perfect matching on Y⊔Y′. Sometimes it will be convenient to assume that all couples π∈M are ordered: if π consists of elements i,j, we may write π=ij if: either (a) i,j∈Y and i<j, or (b) i,j∈Y′ and i<j, or (c) i∈Y and j∈Y′. We call a couple π in these cases lower horizontal, upper horizontal, and vertical, respectively. The subsets of such couples in M are denoted by M ^{lh}, M ^{uh}, and M ^{vert}, respectively. When π=ij is horizontal, we denote the interval {i,i+1,…,j} by [π]. The fact that M is planar (cf. (3.1)(iii)) implies that

(3.3)
the set M ^{lh} is nested, which means that for any π,π′∈M ^{lh}, the intervals [π] and [π′] are either disjoint or one includes the other; also for each π∈M ^{lh}, all elements of Y within [π] are covered by couples in M ^{lh}; similar properties hold for M ^{uh} and Y′.
A proper pair (A,A′)∈Π _{ Y,Y′} along with a feasible matching M for it can be illustrated by use of either a circular diagram or a twolevel diagram; the couples in the former are connected by straightline segments, and those in the latter by straightline segments or by arcs. See the picture where Y={1,2,3,4}, Y′={1′,2′}, A={1,3}, A′={1′}, M ^{lh}={34}, M ^{uh}=∅, and M ^{vert}={11′,22′}.
Recall that in the flag flow case we deal with 1patterns on [m] and 1families on Y⊆[n] (with Y=m), which are formed by pelement subsets in these sets (cf. Definition 1 in the Introduction). They are equivalent, respectively, to 2patterns on ([m],[m′]) and 2families on (Y,Y′), where Y′=m′=p−(m−p). Theorem 3.1 implies the following criterion on Plücker type relations.
Corollary 3.3
Let \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\Subset\binom{[m]}{p}\). Then (1.7) is a PSQrelation (where \({ \mathcal{A}}=\gamma_{Y}({ \mathcal{A}}_{0})\) and \({ \mathcal{B}}=\gamma_{Y}({ \mathcal{B}}_{0})\)) if and only if the 1patterns \({\mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced.
Here the notion of balanced 1families \({ \mathcal{A}},{ \mathcal{B}}\) (in particular, 1patterns) comes from the one given for 2families and is specified as follows. Let q:=m−p and assume, w.l.o.g., that p≥q. A feasible matching for a set \(A\in\binom{Y}{p}\) (or for the partition \((A,\overline{A})\) of Y) is now defined to be a set \(\widetilde{M}\) of pairs (couples) in Y such that

(3.4)

(i)
\(\widetilde{M}=q\), the couples in \(\widetilde{M}\) are mutually disjoint, and \(\pi\cap A=\pi\cap \overline{A}=1\) for each \(\pi\in \widetilde{M}\).

(ii)
\(\widetilde{M}\) is nested, and for each \(\pi\in \widetilde{M}\), all elements of [π] are covered by \(\widetilde{M}\);

(i)
cf. (3.3). In other words, \(\widetilde{M}\) is just the set M ^{lh} in the corresponding planar perfect matching M for Y⊔Y′. In view of A=p, \(\overline{A}=q\) and Y′=p−q, we have M ^{uh}=∅ and M ^{vert}=p−q. In particular, the elements of Y′ are colored white, provided that the elements of A and \(\overline{A}\) are white and black, respectively.
For illustrations in the flag case, we will use flat (or onelevel) diagrams. An example of such a diagram and its corresponding twolevel diagram are drawn in the picture; here Y=[7], A={1,3,5,6}, \(\widetilde{M}=\{14,23,67\}\), and Y′={1′}.
Examples of stable quadratic relations
In this section, we illustrate the method described in the previous section by demonstrating several classes of stable quadratic relations on FGfunctions. According to Proposition 3.2, once we are able to show that one or another pair of families \({ \mathcal{A}},{ \mathcal{B}}\) is balanced, we can declare that relation (1.9) involving these families is stable.
As before, when visualizing a proper pair (C⊆[m],C′⊆[m′]) (i.e., satisfying (2.2)(ii)), we will refer to the elements of C and C′ as white, and to the elements of their complements \(\overline{C}=[m]C\) and \(\overline{C}\,'=[m']C'\) as black.
Most of examples below (namely, those in items 1–5) concern PSQrelations for flagflowdetermined functions \(f:2^{[n]}\to\mathfrak{S}\). In these cases, we deal with 1patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\subseteq\binom{[m]}{p}\) for some p<m and set q:=m−p. Also, considering one or another whiteblack partition \((C,\overline{C})\) of [m] (with C=p) and a feasible matching M for it, we illustrate the configuration (C,M) by a flat diagram (introduced in the end of the previous section). The set of feasible matchings for \((C,\overline{C})\) is denoted by .
1. When m=3 and p=2, the collection \(\binom{[m]}{p}\) consists of three 2element sets C, namely, 12,13,23, and their complements \(\overline{C}\) are the 1element sets 3,2,1, respectively. Since q=1, a feasible matching consists of a unique couple. The sets 12 and 23 admit only one feasible matching each, namely, and , whereas 13 has two feasible matchings, namely, . Therefore, the 1patterns \({ \mathcal{A}}_{0}:=\{13\}\) and \({ \mathcal{B}}_{0}:=\{12,23\}\) are balanced. The corresponding configurations and bijection are illustrated in the picture.
This gives rise to the P3relation (generalizing AP3 and TP3relations (1.1), (1.6)): for a triple i<j<k (forming Y) and X⊆[n]−{i,j,k},
2. Let p=q=2. Take the 1patterns \({ \mathcal{A}}_{0}:=\{13\}\) and \({ \mathcal{B}}_{0}:=\{12,14\}\) in \(\binom{[4]}{2}\). One can see that each of 12 and 14 admits a unique feasible matching: and , whereas consists of two feasible matchings: just those {14,23} and {12,34}. Thus, \({\mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced; see the picture where the couples (arcs) involved in the corresponding exchange operations are marked with crosses.
As a consequence, we obtain the P4relation (generalizing (1.2) and its tropical counterpart): for i<j<k<ℓ and X⊆[n]−{i,j,k,ℓ},
3. As one more illustration of the method, let us consider one particular case for m=5 and p=3. Put \({ \mathcal{A}}_{0}:=\{135\}\) and \({ \mathcal{B}}_{0}:=\{234,125,145\}\). One can check that , , , and that consists just of the five matchings occurring in those three collections. Therefore, \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) are balanced. The corresponding configurations and bijection are shown in the picture.
This implies a particular PSQrelation on quintuples: for i<j<k<ℓ<r and X⊆[n]−{i,j,k,ℓ,r},
4. The next illustration concerns a wide class of balanced 1patterns for m>p≥m−p=:q; it includes the 1patterns indicated in items 1 and 2 as special cases.
The 1pattern \({ \mathcal{A}}_{0}\) contains a distinguished set \(A_{0}\in\binom{[m]}{p}\). Fix a nonempty subset \(Z\subseteq \overline{A}_{0}\) and consider the collection
For a subset C⊆[n], we will denote by Σ(C) the number ∑(i∈C). Now define
In particular, \({ \mathcal{A}}_{0}\cap { \mathcal{B}}_{0}=\emptyset\). We assert the following:
Lemma 4.1
The pair \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) in (4.4) is balanced.
Proof
Consider \(C\in { \mathcal{C}}\) and . We describe a rule which associates to (C,M) another configuration (D,M), aiming to obtain the desired bijection between \({ \mathcal{K}}({ \mathcal{A}}_{0})\) and \({ \mathcal{K}}({ \mathcal{B}}_{0})\).
Since M is feasible and p≥q, we have \(M=q=\overline{A}_{0}\). This implies that exactly one of the two cases is possible: (i) there is a couple π∈M with both elements in A _{0}; and (ii) each π∈M satisfies π∩A _{0}=1 (whence \(\pi\cap \overline{A}_{0}=1\) and M covers \(\overline{A}_{0}\)).
In case (i), take the couple π=ij∈M (i<j) such that i,j∈A _{0} and i is minimum under this property. Let D:=C△ π. Then \(D\cap \overline{A}_{0}=C\cap \overline{A}_{0}=Z\), whence \(D\in { \mathcal{C}}\). Also the interval [π] is partitioned into couples (cf. (3.4)(ii)), implying that j−i is odd. Hence the numbers Σ(C)−Σ(A _{0})+Z and Σ(D)−Σ(A _{0})+Z have different parity, and therefore, C,D belong to different collections among \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\). Obviously, M is a feasible matching for D, the couple π satisfies the above minimality property for D, and applying to D the exchange operation w.r.t. π returns C. We associate the configurations (C,M) and (D,M) to each other.
In case (ii), each couple of M has one element in A _{0} and the other in \(\overline{A}_{0}\). Let M _{ Z } be the set of π∈M such that π∩Z≠∅ and let Q:=⋃(π∈M _{ Z }). Then the set D:=C△ Q satisfies D=p and \(D\cap \overline{A}_{0}=\emptyset\). This means that D=A _{0}. Also and C=A _{0}△ Q. Since j−i is odd for each ij∈M, the numbers Σ(C)−Σ(A _{0}) and Z have the same parity. So \(C\in { \mathcal{B}}_{0}\). We associate (C,M) and (A _{0},M) to each other. Conversely, for each , let C′:=A _{0}△ Q′, where Q′:=⋃(π∈M′ :π∩Z≠∅). Then \(Q'\cap \overline{A}_{0}=Z\), \(C'\in { \mathcal{B}}_{0}\), and the above construction associates (C′,M′) with (A _{0},M′).
This gives the desired bijection between \({ \mathcal{K}}({ \mathcal{A}}_{0})\) and \({\mathcal{K}}({ \mathcal{B}}_{0})\). □
Remark 4
(i) Consider m=3, p=2, A _{0}:=12, and Z:={3}. Then the collection \({ \mathcal{C}}\) as in (4.3) consists of the sets 13,23, and we have \({ \mathcal{A}}_{0}=\{12,23\}\) and \({ \mathcal{B}}_{0}=\{13\}\). These 1patterns correspond to those in item 1. (ii) When m=4, p=2, A _{0}:=12, and Z:={3}, we obtain \({ \mathcal{A}}_{0}=\{12,23\}\) and \({ \mathcal{B}}_{0}=\{13\}\). They generate the same PSQrelations as the balanced 1patterns {13}, {12,14} in item 2.
The 1patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) as in (4.4) give rise to the following PSQrelation on FGfunctions f; for brevity, it is exposed when \(\mathfrak{S}\) is a ring. Let I,J⊂[n] and I≥J. Fix Z⊆J−I. Then
where the sum is over all K⊆I−J with K=Z; Inv(I′,J′) denotes the number of pairs (i,j)∈I′×J′ with i>j (inversions); and a:=Z+Inv(I−J,J−I). In this case, one should set X:=I∩J, Y:=I△ J, m:=Y, p:=I−J, and A _{0}:=I−J.
Relations similar to (4.5) (but possibly written in a different form) appear in a characterization of flag manifolds \(\mathrm{Fl}=\mathrm{Fl}^{d_{1},\ldots,d_{r}}(\mathbb{C}^{n})\), where d _{1}<⋯<d _{ r }≤n; cf. [10, Chap. 9]. In this case one should take all subsets I,J⊆[n] and Z⊆J−I with I=d _{ i }, J=d _{ j }, i≥j; then (4.5) generate the ideal of polynomials with zero values on Fl canonically embedded in the corresponding product of projective spaces.
5. One more representable class of balanced 1patterns for p<m≤n with p≥m−p=:q is obtained by slightly modifying the previous construction.
Fix a set Z⊂[m] with 0<Z≤q−1 and a subset Z′⊆Z. Form the collection
Partition \({ \mathcal{C}}\) into two 1patterns
Lemma 4.2
The pair \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) in (4.6) is balanced.
Proof
Let \(C\in { \mathcal{C}}\) and . Since M=q>Z, there exists a couple π=ij∈M (i<j) with both elements in [m]−Z; take such a π so that i be minimum. Form D:=C△ π. Then C,D belong to different 1patterns among \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) (since j−i is odd), and we can associate (C,M) and (D,M) to each other, taking into account that and that the choice of π depends only on M. □
This lemma gives rise to the corresponding class of PSQrelations; we omit it here. (In fact, such relations can be derived from those in item 4 when \(\mathfrak{S}\) is a ring.)
In the rest of this section, we give simple examples of balanced families in the nonflag case. Now we deal with disjoint sets X,Y⊆[n] and disjoint sets X′,Y′⊆[n′], denote m:=Y and m′:=Y′, and consider 2patterns formed by proper pairs for ([m],[m′]) (cf. (2.2)). Corresponding matchings will be illustrated by use of twolevel diagrams (see the end of Sect. 3) in which the white/black elements of [m] (resp., [m′]) are disposed in the lower (resp. upper) horizontal line.
6. The picture below shows an example of balanced homogeneous 2patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\).
Here m=m′=3, \({ \mathcal{A}}_{0}\) consists of the pairs 1213 and 2313, and \({ \mathcal{B}}_{0}\) consists of the pairs 1312 and 1323 (indicated by light circles); we write ab for (a,b). The feasible matchings are indicated by line segments, and the couples involved in the corresponding exchange operations are marked with crosses.
These 2patterns give rise to the SQrelation
where i<j<k and i′<j′<k′ (this is rather trivial for minors of a matrix).
7. One of the simplest examples of balanced nonhomogeneous 2patterns is formed by \({ \mathcal{A}}_{0}=\{11\}\) and \({ \mathcal{B}}_{0}=\{21,1212\}\), in the case m=m′=2. See the picture:
This gives the following SQrelation similar to Dodgson’s condensation formula for minors of a matrix (cf. (1.8)): for i<k and i′<k′,
Another simple nonhomogeneous example is analogous to the row decomposition (by row 2) of the determinant of a 3×3 matrix. Here m=m′=3, \({ \mathcal{A}}_{0}=\{1313\}\) and \({ \mathcal{B}}_{0}=\{1213,2313,123123\}\); see the picture:
Necessity of the balancedness
This section is devoted to the other direction in Theorem 3.1. Moreover, we show a sharper property. It says that if a pair \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\) is not balanced, then for any choice of appropriate consistent sets X,Y,X′,Y′ and for \(\mathfrak{S}:={\mathbb{Z}}\), there exist (and can be explicitly constructed) a planar network and a weighting such that the corresponding flowgenerated function f violates relation (1.9).
As before, for subsets C⊆Y and C′⊆Y′, we write \(\overline{C}\) for Y−C, and \(\overline{C}\,'\) for Y′−C′, and call (C,C′) a proper pair for (Y,Y′) if it satisfies (2.2)(ii).
Theorem 5.1
Fix disjoint sets X,Y⊆[n] and disjoint sets X′,Y′⊆[n′] satisfying (2.2)(i). Let \({ \mathcal{A}},{ \mathcal{B}}\Subset\varPi _{Y,Y'}\). Suppose that \({ \mathcal{A}},{ \mathcal{B}}\) are not balanced. Then (1.9) does not hold for some (G,w) and \(\mathfrak{S}={\mathbb{Z}}\). More precisely, there exists a planar network G=(V,E) with n sources and n′ sinks such that for the allunit weighting w≡1 on V, the flowgenerated function f=f _{ w } on \({\mathcal{E}}^{n,n'}\) gives
Proof
Since \({ \mathcal{A}},{ \mathcal{B}}\) are not balanced, there exists a planar perfect matching M on Y⊔Y′ such that
where \({ \mathcal{A}}_{M}\) denotes the set of pairs \((A,A')\in { \mathcal{A}}\) having M as a feasible matching: , and similarly for \({ \mathcal{B}}\).
We fix such an M, and our aim is to construct a planar network G=(V,E) that satisfies the following properties: for each proper pair (C,C′) for (Y,Y′),

(P1)
If , then G has a unique (XCX′C′)flow and a unique \((X\overline{C}X'\overline{C}\,')\)flow, i.e., \(\varPhi_{XCX'C'}=\varPhi_{X\overline{C}X'\overline{C}\,'}=1\).

(P2)
If , then at least one of Φ _{ XCX′C′} and \(\varPhi_{X\overline{C}X'\overline{C}\,'}\) is empty.
Assuming that such a G does exist, assign the weight w(v):=1 to each vertex v. By (P1) and (P2), for the function f=f _{ w } and a proper pair (C,C′)⊆(Y,Y′), each of the values f(XCX′C′) and \(f(X\overline{C}X'\overline{C}\,')\) is equal to one if , and at least one of them is zero otherwise. This implies
and now the required inequality (5.1) follows from (5.2).
It suffices to construct the desired network G in the case n=X+Y and n′=X′+Y′ (for we can add a source s _{ i } for i∈[n]−(X∪Y) (if exists) as an isolated vertex, and can do similarly for sinks). So we may assume, w.l.o.g., that X,Y form a partition of [n], and X′,Y′ do that of [n′].
We first describe the construction when X=X′=∅, which is the crucial special case. Subsequently we will explain that this construction can be easily extended to arbitrary X,X′.
Thus, we deal with n=Y=Y′ sources s _{1},…,s _{ n } and n sinks t _{1},…,t _{ n }. As usual, the sources (sinks) lie in the lower (resp., upper) half of a circumference O in the plane, and their indices grow from left to right. The other vertices of G lie inside O. All edges will be represented by directed straightline segments. The graph G is constructed in five steps.
Step 1
For each couple π∈M, we draw the segment between corresponding terminals, denoted by L _{ π }. Namely: (a) if π=ij∈M ^{lh}, L _{ π } connects the sources s _{ i },s _{ j } (a lower horizontal segment); (b) if π=ij∈M ^{uh}, L _{ π } connects the sinks t _{ i },t _{ j } (an upper horizontal segment); and (c) if π=ij∈M ^{vert}, L _{ π } connects the source s _{ i } and sink t _{ j } (a vertical segment). In case (c), we direct L _{ π } from s _{ i } to t _{ j }. These segments are pairwise disjoint (since M is planar).
Step 2
For each π=ij∈M ^{lh}, the lower horizontal segment L _{ π } is transformed into a graph whose vertices are s _{ i },s _{ j } and j−i distinct points in the interior of the segment. The edges are the j−i+1 subsegments connecting consecutive vertices. We distinguish between two sorts of vertices, called odd and even ones, so that s _{ i },s _{ j } are regarded as odd, and the odd and even vertices alternate along L _{ π }. Each edge is directed from the odd to even vertex. So L _{ π } becomes a path with alternating edge directions, and its end vertices s _{ i },s _{ j } have leaving edges.
Each upper horizontal segment L _{ π=ij } is transformed into a path in a similar fashion, but now we direct each edge from the even to odd vertex. So the end vertices t _{ i },t _{ j } of L _{ π } are odd and have entering edges.
Step 3
The horizontal segments (regarded as graphs) are connected by additional edges. To define them, let us say that a couple π=ij∈M ^{lh} is a predecessor of another couple π′∈M ^{lh} if [π]⊃[π′]. If, in addition, there is no π″∈M ^{lh} between π and π′ (i.e. [π]⊃[π″]⊃[π′]), π is called the immediate predecessor of π′. Accordingly, π′ is called a successor of π in the former case, and an immediate successor in the latter case. A couple is maximal (minimal) if it has no predecessor (resp., no successor). The set of successors (immediate successors) of π is denoted by Succ(π) (resp., by ISucc(π)); moreover, we order the couples in ISucc(π), say, π _{1}=i _{1} j _{1},…,π _{ r }=i _{ r } j _{ r }, so that j _{ d }<i _{ d+1} for d=1,…,r−1. It is easy to see that i _{1}=i+1, j _{ r }=j−1 and i _{ d+1}=j _{ d }+1 for each d (when r≥1).
Note that each path \(L_{\pi_{d}}\) has exactly (j _{ d }−i _{ d }+1)/2 even vertices. Also L _{ π } has exactly (j−i−1)/2 nonterminal odd vertices v (i.e., v≠s _{ i },s _{ j }). Then
yielding the equality
where V^{odd}(π″) (V^{even}(π″)) denotes the set of nonterminal odd vertices (resp., of even vertices) in a path L _{ π″}. Observe that within the circle O ^{∗} surrounded by O, the region confined by the segments for {π}∪ISucc(π) is convex and does not meet any other segment for M. Ordering the vertices in each of the two equally sized sets W(π):=⋃(V^{even}(π′) :π′∈ISucc(π)) and V^{odd}(π) from left to right, we draw a directed edge (segment) from each vertex of the former to the corresponding vertex of the latter. These edges are pairwise disjoint; we call them lower bridges for π. See the picture where π=16 and the dark and light circles indicate even and nonterminal odd vertices in L _{ π }, respectively.
A similar edge set is constructed for each nonminimal upper couple π∈M ^{uh}, connecting the set V^{odd}(π) of nonterminal odd vertices in L _{ π } and the set W(π) of even vertices in L _{ π′} among π′∈ISucc(π). The only difference is that such edges, called upper bridges for π, are now directed from odd to even vertices.
The following observation is useful:
(This follows from the equality V^{even}(π)=(j−i+1)/2, where π=ij, and the fact that the successors of π form a perfect matching on {i+1,…,j−1}, implying Succ(π)=(j−i−1)/2.)
Step 4
Let \(M^{\mathrm{lh}}_{\mathrm{max}}\) (\(M^{\mathrm{uh}}_{\mathrm{max}}\)) be the set of maximal couples in M ^{lh} (resp., M ^{uh}). The segments of couples in \(M^{\mathrm{lh}}_{\mathrm{max}}\cup M^{\mathrm{uh}}_{\mathrm{max}}\) confine a convex region Ω within the circle O ^{∗}. Consider the sets \(Q:=\bigcup(\mathrm{V}^{\mathrm{even}}(\pi)\,\colon\pi\in M^{\mathrm{lh}}_{\mathrm{max}})\) and \(Q':=\bigcup (\mathrm{V}^{\mathrm{even}}(\pi)\,\colon \pi\in M^{\mathrm{uh}}_{\mathrm{max}})\); we order the vertices in each of them from left to right. Property (5.3) and the equalities Y=Y′=2M lead to the following relations:
So Q=Q′. We draw a directed edge from each vertex of the sequence Q to the corresponding vertex of Q′. These (pairwise noncrossing) edges are called middle bridges.
Step 5
When M ^{vert}≠∅, the graph G′ constructed during the previous steps need not be planar since some middle bridges may intersect vertical segments. The final step transforms G′ within small neighborhoods of such intersection points.
More precisely, for π=ij∈M ^{vert}, the (directed) vertical segment L _{ π } goes from the source s _{ i } to the sink t _{ j } and lies in the convex region Ω (defined above). The set B _{ π } of edges of G′ intersecting L _{ π } consists of some middle bridges. (One can see that i−j is even and that B _{ π }=∅ if i=j.) Let z _{ π,b } denote the intersection point of L _{ π } and b∈B _{ π }. Also for a middle bridge b, we denote by R _{ b } the set of vertical segments intersecting b.
To transform G′ into the desired graph G, we first turn each vertical segment L _{ π=ij } into the directed path (going from s _{ i } to t _{ j }) whose inner vertices are the points z _{ π,b } for b∈B _{ π }, and similarly turn each middle bridge b (directed “upwards”) into the directed path whose inner vertices are the points z _{ π,b } for L _{ π }∈R _{ b }. Next we iteratively modify the graph as follows. At each iteration, choose a vertex z=z _{ π,b } in the current graph, split z into two vertices z′ and z″, and connect them by edge e _{ π,b } from z′ to z″, called the extra edge generated by π,b.
Geometrically, we choose z′,z″ to be two points in the segment b within a small neighborhood of z so that z′ lies below z″. Then b (regarded as path) is modified in a natural way: if b is of the form \(\ldots ,e,z,\widetilde{e},\ldots\) (where e and \(\widetilde{e}\) are the edges in b entering and leaving z, respectively), then we make e enter z′ and make \(\widetilde{e}\) leave z″; this turns b into the directed path \(\ldots,e,z',e_{\pi,b},z'',\widetilde{e},\ldots\) . The local transformation of the path L:=L _{ π } at z is different: if L is of the form \(\ldots,e,z,\widetilde{e},\ldots\) , we make e entering z″, and \(\widetilde{e}\) leaving z′, obtaining the nondirected path \(\ldots,e,z'',e_{\pi,b},z',\widetilde{e},\ldots\) (in which e _{ π,b } has the backward direction). Geometrically, L turns into a zigzagshaped line. The transformation at z=z _{ π,b } is illustrated in the picture:
Eventually we obtain the desired graph G. We refer to the edges of G generated by vertical segments (resp., middle bridges) of G′ and different from extra edges as vedges (resp., bedges). Thus, under the transformation G′↦G, each middle bridge b turns into a directed path with R _{ b }+1 bedges and R _{ b } extra edges which alternate. In its turn, each vertical segment L=L _{ π } turns into a “zigzag” path with B _{ π }+1 vedges and B _{ π } extra edges; these edges alternate and are, respectively, the forward and backward edges in the path.
We will distinguish between two sorts of edges in G, referring to the lower and upper bridges and bedges as thick edges, and to the remaining edges as thin ones. The picture below illustrates the construction for an instance of M. Here n=7, M ^{lh}={16,23,45}, M ^{uh}={12,47,56}, and M ^{vert}={73}, and the left fragment shows the segment representation of M after Step 1. The graph G is drawn in the right fragment where the dark circles indicate even vertices and those formed by splitting, the light circles indicate nonterminal odd vertices, and the thin and thick edges are as defined above.
Note that the obtained G is acyclic (as all edges not contained in “horizontal segments” are “directed upwards”). Also we will take advantages from the following features of G which can be seen from the above construction:

(5.5)

(i)
Each source has one leaving edge and no entering edge, whereas each sink has one entering edge and no leaving edge.

(ii)
Each inner (i.e., nonterminal) vertex is of degree 3, and it has either two thin entering edges and one thick leaving edge, or two thin leaving edges and one thick entering edge.

(iii)
The connected components of the subgraph of G induced by the thin edges correspond to the lower horizontal paths L _{ π } for π∈M ^{lh}, the upper horizontal paths L _{ π } for π∈M ^{uh}, and the (straight or zigzag) paths L _{ π } for π∈M ^{vert}, each of these paths having alternately directed edges.

(i)
It will be convenient to represent each thin path L _{ π } as the union of two matchings (one being formed by the forward edges, and the other by the backward edges), denoted by \(N^{1}_{\pi}, N^{2}_{\pi}\). Also we denote the set of thick edges entering (leaving) vertices of L _{ π } by \(Z^{\mathrm{in}}_{\pi}\) (resp. \(Z^{\mathrm{out}}_{\pi}\)). In particular, \(Z^{\mathrm{in}}_{\pi}\) is the set of lower bridges for π when π∈M ^{lh}, and \(Z^{\mathrm{out}}_{\pi}\) is the set of upper bridges for π when π∈M ^{uh}.
We assert that G satisfies properties (P1) and (P2) for the given M. To show this, we consider a proper pair (C,C′) for (Y,Y′) and argue as follows.
(a) Suppose . Take the subgraph F of G induced by the edge set U consisting of all thick edges and the following thin edges. For each π∈M ^{lh}, U includes exactly one of the matchings \(N^{1}_{\pi},N^{2}_{\pi}\) in L _{ π }, namely, the one containing the edge leaving the source s _{ i }, where i is the element of π∩C (which is unique since M is feasible for (C,C′)). Similarly, for each π∈M ^{uh}, U includes the matching in L _{ π } that contains the edge entering the sink t _{ j }, where {j}=π∩C′. And for each π=ij=M ^{vert}, if i∈C (and therefore, j∈C′), then U includes the matching in L _{ π } covering both s _{ i } and t _{ j } (which is formed by vedges), whereas if i∉C (and j∉C′), then U includes the matching formed by extra edges (which may be empty).
Using (5.5) and the fact that G is acyclic, one can conclude that F consists of pairwise disjoint directed paths going from S _{ C } to T _{ C′}, i.e., F is a (CC′)flow in G. Acting similarly w.r.t. \(\overline{C}\) and \(\overline{C}\,'\), we construct a \((\overline{C}\overline{C}\,')\)flow F′ in G.
(b) Next we show that in case the flows F and F′ as above are unique. Consider an arbitrary flow \(\widetilde{F}\) from some sources to some sinks in G. From (5.5) it easily follows that for each π∈M,

(5.6)

(i)
If \(\widetilde{F}\cap L_{\pi}\) is a matching \(N^{\alpha}_{\pi}\), α∈{1,2}, then \(\widetilde{F}\) contains both \(Z^{\mathrm{in}}_{\pi},Z^{\mathrm{out}}_{\pi}\).

(ii)
Conversely, if \(\widetilde{F}\) contains a set \(Z\in\{Z^{\mathrm{in}}_{\pi},Z^{\mathrm{out}}_{\pi}\}\) and if Z≠∅, then \(\widetilde{F}\cap L_{\pi}\) is exactly one of \(N^{1}_{\pi},N^{2}_{\pi}\) (regarding these objects as edge sets).

(i)
We explain that (5.6) determines \(\widetilde{F}\) uniquely if \(\widetilde{F}\) is a (CC′)flow. Indeed, from the construction of G it easily follows that there is an ordering π(1),…,π(m) (m=Y) of the couples in M such that for k=1,…,m, at least one of the sets \(Z^{\mathrm{in}}_{\pi (k)}\) and \(Z^{\mathrm{out}}_{\pi(k)}\) is entirely contained in \(\bigcup_{d=1}^{k1}(Z^{\mathrm{in}}_{\pi(d)}\cup Z^{\mathrm{out}}_{\pi(d)})\) (which is automatically holds when π(k) is a minimal couple in M ^{lh}∪M ^{uh} since some of \(Z^{\mathrm{in}}_{\pi(k)},Z^{\mathrm{out}}_{\pi (k)}\) are empty).
Now we argue as follows. If π(k) is a minimal couple in M ^{lh} and if {i}=π(k)∩C, then each of \(N^{1}_{\pi(k)},N^{2}_{\pi(k)}\) consists of a single edge and, obviously, \(\widetilde{F}\) contains exactly one of them, namely, the edge incident to s _{ i }. Applying (5.6)(i) to this π(k), we obtain that \(\widetilde{F}\) contains \(Z^{\mathrm{out}}_{\pi(k)}\) (as well as \(Z^{\mathrm{in}}_{\pi(k)}=\emptyset\)). Similarly, if π(k) is a minimal couple in M ^{uh}, then \(\widetilde{F}\) is determined within L _{ π(k)} and contains \(Z^{\mathrm{in}}_{\pi(k)}\) (and \(Z^{\mathrm{out}}_{\pi(k)}=\emptyset\)). In a general case, assume by induction that for d=1,…,k−1, \(\widetilde{F}\) is determined on L _{ π(d)} and contains \(Z^{\mathrm{in}}_{\pi(d)}\cup Z^{\mathrm{out}}_{\pi(d)}\). Then, due to the above ordering, \(\widetilde{F}\) contains at least one of \(Z^{\mathrm{in}}_{\pi(k)},Z^{\mathrm{out}}_{\pi(k)}\). Hence, by (5.6)(ii), \(\widetilde{F}\cap L_{\pi(k)}\) is \(N^{\alpha}_{\pi(k)}\) for some α∈{1,2}. (This remains true when \(Z^{\mathrm{in}}_{\pi(k)}\cup Z^{\mathrm{out}}_{\pi(k)}=\emptyset\), which is possible only if π(k)=ij∈M ^{vert} and i=j.) Moreover, α is determined by considering the end vertices (terminals) of L _{ π(k)} and checking which of them (or none, or both) belongs to S _{ C }∪T _{ C′} (since such a terminal must be covered by \(N^{\alpha}_{\pi(k)}\)). Now (5.6)(i) enables us to conclude with \(Z^{\mathrm{in}}_{\pi(k)}\cup Z^{\mathrm{out}}_{\pi(k)}\subseteq \widetilde{F}\), justifying the induction.
So \(\widetilde{F}=F\). The uniqueness of a \((\overline{C}\overline{C}\,')\)flow is shown similarly. This yields (P1).
(c) To check (P2), consider a proper pair (C,C′) for (Y,Y′) such that there exist both a (CC′)flow F and a \((\overline{C}\overline{C}\,')\)flow F′ in G. Our goal is to show that , i.e., that the following hold: (c1) π∩C=1 for π∈M ^{lh}; (c2) π∩C′=1 for π∈M ^{uh}; and (c3) (i∈C)⇔(j∈C′) for π=ij∈M ^{vert}. We consider the above ordering π(1),…,π(r) on M and use induction on k, assuming that the corresponding relation among (c1)–(c3) holds for each π(d) with d<k.
When π(k) is a minimal couple in M ^{lh}, π(k)⊆C would imply that F contains both edges of the 2edge path L _{ π(k)}, which is impossible (since these edges enter the same vertex). For a similar reason, π(k)∩C=∅ would imply the nonexistence of F′. So π(k) satisfies (c1). Similarly a minimal couple in M ^{uh} satisfies (c2). Also if π(k)=ij∈M ^{vert} and i=j, then L _{ π(k)} consists of a single edge, and (c3) is trivial. For a general k, using induction and arguing as in part (b), we may assume that there is a nonempty set among \(Z^{\mathrm{in}}_{\pi(k)},Z^{\mathrm{out}}_{\pi(k)}\) which is contained in both F,F′. Then there are α,β∈{1,2} such that \(F\cap L_{\pi(k)}=N^{\alpha}_{\pi(k)}\) and \(F'\cap L_{\pi(k)}=N^{\beta}_{\pi(k)}\). The matchings \(N^{\alpha}_{\pi(k)},N^{\beta}_{\pi(k)}\) determine the location of the end vertices (terminals) u,v of L _{ π(k)} w.r.t. C,C′ and their complements to Y,Y′, and each of u,v is related to exactly one of C∪C′ and \(\overline{C}\cup \overline{C}\,'\). This implies α≠β, and validity of (c1)–(c3) for π(k) follows. Finally, (5.6)(i) provides that each of F,F′ contains both \(Z^{\mathrm{in}}_{\pi(k)},Z^{\mathrm{out}}_{\pi(k)}\), completing the proof of (P2).
It remains to consider the situation when some of X,X′ or both are nonempty. It reduces to the previous case by replacing each element of X (X′) by a couple of elements in Y (resp., Y′) and adding such couples to the matching in question. More precisely, an element i∈X is replaced by consecutive elements i′,i″ added to Y (which are inserted into the linearly ordered set X∪Y in place of i). Similarly, an element j∈X′ is replaced by consecutive elements j′,j″ added to Y′. Then the resulting sets \(\widetilde{Y}\) and \(\widetilde{Y}'\) have the same size, equal to Y+2X=Y′+2X′. Accordingly, we extend each planar perfect matching M on Y⊔Y′ to a planar perfect matching \(\widetilde{M}\) on \(\widetilde{Y}\sqcup \widetilde{Y}'\) by adding the lower (upper) horizontal couple π ^{i}=i′i″ for each i∈X (resp., π ^{j}=j′j″ for each j∈X′). Note that the added couples are minimal for the corresponding partial orders, and the pairs \((\widetilde{C}\subseteq \widetilde{Y},\widetilde{C}'\subseteq \widetilde{Y}')\) having \(\widetilde{M}\) as a feasible matching are exactly those obtained from the pairs (C⊆Y,C′⊆Y′) satisfying by adding to C one element from {i′,i″} for each i∈X, and adding to C′ one element from {j′,j″} for each j∈X′.
Let \(\widetilde{G}\) be the graph obtained by applying the previous construction to such an \(\widetilde{M}\). Then each couple π ^{i}, i∈X, generates the 2edge path \(L_{\pi^{i}}\) connecting the sources s _{ i′},s _{ i″}, and similarly for X′ and sinks. Shrinking each \(L_{\pi^{i}}\) into one point, regarded as the source s _{ i } when i∈X and as the sink t _{ i } when i∈X′, we obtain the desired graph G for X,X′,Y,Y′ and M. It is straightforward to verify that properties (P1), (P2) for \(\widetilde{G},\widetilde{Y},\widetilde{Y}',\widetilde{M}\) imply those for G,X,X′,Y,Y′,M.
This completes the proof of Theorem 5.1, and Theorem 3.1 follows. □
Note that any FGfunction f=f _{ w } on \({ \mathcal{E}}^{n,n'}\) obtained by the construction in the above proof takes nonnegative integer values (since the weighting w is nonnegative). This together with the fact that the function of minors of a totally nonnegative matrix is an FGfunction gives the following:
Corollary 5.2
2patterns \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\Subset\varPi_{m,m'}\) are balanced if and only if the corresponding quadratic relations (concerning any n,n′,X,X′,Y,Y′ as above) hold for any function \(f:{ \mathcal{E}}^{n,n'}\to {\mathbb{Z}}_{\ge0}\) which is the function of minors of a totally nonnegative n′×n matrix. Furthermore, when \({ \mathcal{A}}_{0},{ \mathcal{B}}_{0}\Subset\varPi_{m,m'}\) are not balanced, for any corresponding n,n′,X,X′,Y,Y′, there exists, and can be explicitly constructed, a totally nonnegative n′×n matrix such that the function f of its minors obeys inequality (5.1) (where \({ \mathcal{A}}:=\gamma_{Y,Y'}({\mathcal{A}}_{0})\) and \({ \mathcal{B}}:=\gamma_{Y,Y'}({ \mathcal{B}}_{0})\)).
Applications to Schur functions
It is well known that Schur functions (polynomials) are expressed as minors of a certain matrix, by Jacobi–Trudi’s formula. Therefore, these functions satisfy many quadratic relations, in particular, ones of Plucker type. In [8, 9] and some other works (see a discussion in [8]), one shows how to establish quadratic relations for ordinary and skew Schur functions by use of a lattice paths method based on the Gessel–Viennot interpretation of semistandard Young tableaux [11]. This lattice path method is, in fact, a specialization to a particular planar network of the flow approach that we described in Sects. 2, 3. Below we give a brief discussion on this subject.
Recall that a partition of length r is an rtuple λ of weakly decreasing nonnegative integers λ _{1}≥λ _{2}≥⋯≥λ _{ r }. The Ferrers diagram of λ is meant to be the array F _{ λ } of cells with r leftaligned rows containing λ _{ i } cells in ith row (the row indices will grow from the bottom to the top). For N∈ℕ, an Nsemistandard Young tableau of shape λ is a filling T of F _{ λ } with numbers from [N] so that the numbers weakly increase in each row and strictly increase in each column. We associate to T the monomial x ^{T} that is the product of variables x _{1},…,x _{ N }, each x _{ k } being taken in the degree equal to the number of occurrences of k in T. Then the Schur function for λ and N is the polynomial
where the sum is over all Nsemistandard Young tableaux of shape λ. Besides, one often considers a skew Schur function s _{ λ/μ }, where μ is an rpartition with μ _{ i }≤λ _{ i }; it is defined in a similar way w.r.t. the skew Ferrers diagram F _{ λ/μ } obtained by removing from F _{ λ } the cells of F _{ μ }, along with its semistandard fillings. When needed, an “ordinary” diagram F _{ λ } is regarded as the skew one F _{ λ/μ }, where μ=(0,…,0), and similarly for tableaux.
There is an important onetoone correspondence between the rpartitions λ and the relement subsets A _{ λ } of the set ℤ_{>0} of positive integers (or a set [n] for n≥λ _{1}+r). This is given by
Let us form the directed square grid Γ=Γ(N) whose vertices are the points (i,j) for i∈ℤ_{>0} and j∈[N] and whose edges e are directed upwards or to the right, i.e., e=((i,j),(i,j+1)) or ((i,j),(i+1,j)) (instead, one can take a finite truncation of this grid). The vertices s _{ i }:=(i,1) and t _{ i }:=(i,N) are regarded as the sources and sinks in Γ, respectively, and we assign to each horizontal edge e at level h the weight to be the indeterminate x _{ h }:
Now using the Gessel–Viennot model [11] (in a slightly different form), one can associate to an Nsemistandard skew Young tableau T with shape λ/μ the system \({ \mathcal{P}}_{T}=(P_{1},\ldots,P_{r})\) of directed paths in Γ, where for k=1,…,r:

(6.3)
P _{ k } corresponds to (r+1−k)th row of T; it goes from the source \(s_{k+\mu_{r+1k}}\) to the sink \(t_{k+\lambda_{r+1k}}\); and for h=1,…,N, the number of horizontal edges of P _{ k } at level h is equal to the number of occurrences of h in the kth row of T.
So the sources used in \({ \mathcal{P}}_{T}\) are the s _{ i } for i∈A _{ μ }, and the sinks are the t _{ j } for j∈A _{ λ }. Observe that the semistandardness of T implies that these paths are pairwise disjoint, i.e., \({ \mathcal{P}}_{T}\) is an (A _{ μ }A _{ λ })flow in Γ. One can see the converse as well: if \({ \mathcal{P}}\) is an (A _{ μ }A _{ λ })flow in Γ, then the filling T of F _{ λ/μ } determined, in a due way, by the horizontal edges of paths in \({ \mathcal{P}}\) is just a semistandard skew Young tableau, and one has \({\mathcal{P}}_{T}={ \mathcal{P}}\). This gives a nice bijection between corresponding flows and tableaux. The next picture illustrates an example of a semistandard Young tableau T with N=6, r=5, λ=(6,5,3,3,2) and μ=(2,2,1,1,0), and its corresponding flow \({ \mathcal{P}}_{T}=(P_{1},\ldots,P_{5})\).
Note that when T is “ordinary” (i.e., μ=0), the sources used in \({ \mathcal{P}}_{T}\) are s _{1},s _{2},…,s _{ r }. We say that this \({ \mathcal{P}}_{T}\) is a coflag flow (it becomes a flag flow if we reverse the edges of Γ and swap the sources and sinks).
The above bijection between the Nsemistandard skew Young tableaux with shape λ/μ and the (A _{ μ }A _{ λ })flows in Γ(N) implies that (ordinary of skew) Schur functions are “values” of the flowgenerated function f _{ w } for Γ and the weighting w as in (6.2). (It leads to no confusion that the weights are given on the horizontal edges of Γ and belong to a polynomial ring.) This gives rise to establishing quadratic relations on Schur functions, by properly translating SQrelations on FGfunctions. Below we give two examples (the reader may try to extend the list of examples by using SQrelations from Sect. 4).
1. A particular relation on ordinary Schur functions with r=2 can be derived from PSQrelations on quadruples. This reads as
where i<j≤k<ℓ. Letting (i′,j′,k′,ℓ′):=(i+1,j+1,k+2,ℓ+2) and f:=f _{ w }, one can see that (6.4) turns into
which, in view of i′<j′<k′<ℓ′, is nothing else than the coflag counterpart of the AP4relation (1.2) in case X=∅. (Note that relation (6.4) can be generalized by adding to each 2component partition a fixed partition (λ _{1},…,λ _{ r′}) such that either λ _{ r′}≥ℓ or i≥λ _{1}.)
2. The next example is shown in [9] by use of Dodgson’s condensation formula for matrix minors. It says that a partition (λ _{1},…,λ _{ r }) with λ _{ r }>0 yields
For each of the six partitions λ ^{(i)} in this relation, i=1,…,6 (from left to right), we take the set \(A_{\lambda^{(i)}}\) as in (6.1) and form the corresponding subsets S ^{(i)},T ^{(i)} of sources and sinks in Γ, respectively. In addition, for i=1,3,5, we shift each of the sets S ^{(i)},T ^{(i)} by one position to the right (which leads to equivalent sets of flows, as well as their weights, in Γ). Then we obtain the following six sourcesink index pairs (from left to right, as before), denoting X:={2,…,r−1} and X′:={λ _{2}+r−1,λ _{3}+r−2,…,λ _{ r−1}+2}:
Now define i:=1, k:=r, i′:=λ _{ r }+1, k′:=λ _{1}+r. Then i<k, i′<k′, X∩{i,k}=∅, X′∩{i′,k′}=∅, and (6.5) turns into the following relation for f=f _{ w }:
which is just Dodgson’s condensation formula (cf. (1.8)).
FGfunctions over a semiring with division
In this section, we assume that \({\mathfrak{S}}\) is a commutative semiring with division, i.e., \({\mathfrak{S}}\) contains 1 and the operation ⊙ is invertible (i.e., \(({\mathfrak{S}},\odot)\) is an abelian group). Two important special cases mentioned in the Introduction are: the set ℝ_{>0} of positive reals, and the tropicalization \({\mathfrak{L}}^{\mathrm{trop}}\) of a totally ordered abelian group \({\mathfrak{L}}\), in particular, the set ℝ_{max} of reals with the operations ⊕=max and ⊙=+. It turns out that for such a \({\mathfrak{S}}\), the set \(\mathbf{FG}=\mathbf{FG}_{n}({\mathfrak{S}})\) of flagflowgenerated functions on 2^{[n]} possesses the following nice properties:

(7.1)

(i)
All these functions f can be generated by flows in one planar network, namely, in the halfgrid \(\varGamma^{\triangle}_{n}\) (see Fig. 1);

(ii)
FG coincides with the set of functions \(f:2^{[n]}\to {\mathfrak{S}}\) satisfying P3relation (4.1) for all i,j,k,X (so (4.1) provides the other PSQrelations);

(iii)
FG has as a basis the set \({ \mathcal{I}}_{n}\) of intervals in [n] (including the “empty interval” ∅), called the standard basis for FG;

(iv)
The values of f are expressed as (algebraic or tropical) Laurent polynomials in its values on \({ \mathcal{I}}_{n}\).

(i)
Here a basis for this FG is meant to be a collection \({ \mathcal{I}}'\subset2^{[n]}\) such that the restriction map \(f\mapsto f_{\,\vrule height 1.6ex width 0.05em depth 0pt\, { \mathcal{I}}'}\) gives a bijection between FG and \(\mathfrak{S}^{{ \mathcal{I}}'}\); in other words, any function in FG is determined by its values on \({ \mathcal{I}}'\), and the latter values can be chosen arbitrarily in \(\mathfrak{S}\).
The facts exhibited in (7.1) are discussed in [4] (mostly for \({\mathfrak{S}}:={\mathbb{R}}_{\max}\)) and in [2, 7] (concerning (iv)). The arguments given there can be directly extended to an arbitrary \({\mathfrak{S}}\) as above, and below we give a brief outline (which is sufficient to restore the details with help of [4]). As before, an interval {p,p+1,…,q} in [n] is denoted by [p..q].

A.
An important feature of \(\varGamma_{n}^{\triangle}=(V,E)\) is that for any nonempty interval I=[q..r] in [n], there exists exactly one feasible flow ϕ _{ I } from S _{ I } to the sinks t _{1},…,t _{I}; namely, ϕ _{ I } goes through the vertices (i,j) occurring in the rectangle [r]×[r−q+1] (more precisely, satisfying i≤r, j≤r−q+1 and i≥j). Therefore, given a weighting \(w:V\to {\mathfrak{S}}\), the values of f=f _{ w } on the nonempty intervals [q..r] are viewed as
$$ f\bigl([q..r]\bigr)=\bigodot_{j\le i\le r,\; 1\le j\le rq+1} w(i,j).$$(7.2)Note that the number \(\frac{n(n+1)}{2}\) of vertices of \(\varGamma _{n}^{\triangle}\) is equal to the number of nonempty intervals in [n] and system (7.2) is nondegenerate. So, using the division in \({\mathfrak{S}}\), denoted as /, we can in turn express the weights of vertices via the values of f on the intervals. This is computed as
$$ w(i,j)=\begin{cases}(f(I_{i,j})\odot f(I_{i1,j1}))/(f(I_{i1,j})\odot f(I_{i,j1})) & \mbox{for }i>j,\\f(I_{i,j})/f(I_{i,j1}) & \mbox{for }i=j,\end{cases}$$(7.3)denoting by I _{ i′,j′} the interval [(i′−j′+1)..i′] and letting f(I _{ i′,0}):=1.
Thus, the correspondence w↦f _{ w } gives a bijection between the set of weightings \(w:V\to {\mathfrak{S}}\) and the set \({\mathfrak{S}}^{{ \mathcal{I}}_{n}^{+}}\), where \({ \mathcal{I}}_{n}^{+}\) denotes the set of nonempty intervals in [n].

B.
We know that for a weighting w, the value of f=f _{ w } on any nonempty subset A⊆[n] is represented by a “polynomial” in variables w(v), v∈V, namely, by an ⊕sum of products ⊙(w(v) :v∈V′) for some subsets V′⊆V. Substituting into this polynomial the corresponding terms from (7.3), we obtain an expression of the form
$$f(A)=\oplus( { \mathcal{P}}_k\,\colon k=1,\ldots,N ),$$where each \({ \mathcal{P}}_{k}\) is a “monomial” \(\odot(f(I)^{\odot\sigma _{k}(I)} \,\colon I\in { \mathcal{I}}_{n}^{+})\) with integer (possibly negative) degrees σ _{ k }(I). This means that f(A) is a Laurent polynomial (w.r.t. the addition ⊕ and multiplication ⊙) in variables f(I), \(I\in { \mathcal{I}}_{n}^{+}\).
(Analyzing possible flows in \(\varGamma_{n}^{\triangle}\), one can show that the degrees σ _{ k }(I) are bounded and, moreover, belong to {−1,0,1,2}. This is proved in [4] for the tropical case and can be directly extended to an arbitrary commutative semiring \({\mathfrak{S}}\) with division.)

C.
A simple fact (cf. [4]) is that any function f:2^{[n]}→ℝ obeying TP3relation (1.6) is determined by its values on \({ \mathcal{I}}_{n}\). The proof of this fact is directly extended to \({\mathfrak{S}}\) in question, as follows (a sketch). If S⊆[n] is not an interval, define i:=min(S), k:=max(S), X:=S−{i,k}, and choose an element j in [i..k]−S. Then for a function f on 2^{[n]} obeying P3relation (4.1), the value f(S) is expressed via the values f(S′) on five sets S′=Xi,Xj,Xk,Xij,Xjk. Since max(S′)−min(S′)<max(S)−min(S), we can apply induction on max(S)−min(S).
Using this fact and reasonings above, we obtain that \({ \mathcal{I}}_{n}\) is indeed a basis for the functions in \(\mathbf{FG}_{n}({\mathfrak{S}})\) and that all these functions are generated by flows in \(\varGamma_{n}^{\triangle}\) (so they are bijective to weightings \(w:V\to {\mathfrak{S}}\), up to their values on ∅, and possess the Laurentness property as above).
Next we explain how to extend the properties exhibited in (7.1) to the set \(\mathbf{FG}_{n,n'}({\mathfrak{S}})\) of flowgenerated functions on \({ \mathcal{E}}^{n,n'}\) taking values in a commutative semiring \({\mathfrak{S}}\) with division. Instead of P3relation (4.1) which has shown its importance in the flag flow case, a central role will now will be played by three special SQrelations. The first one is
where i<j<k and X are as before, k′∈[n′] and X′⊆[n′]−{k′}. We refer to (7.4) as the generalized P3relation. (The pair of 2patterns for it is equivalent to the pair of 1patterns for (4.1). In fact, for our purposes it suffices to assume that k′>max(X′).) The second one is the SQrelation symmetric to (7.4):
And the third one is Dodgson’s type relation (4.7) for i,k,X,i′,k′,X′ such that (cf. (1.8)):
Let \(\mathbf{K}_{n,n'}({\mathfrak{S}})\) be the set of functions \(f:{\mathcal{E}}^{n,n'}\to {\mathfrak{S}}\) satisfying (7.4), (7.5), and (4.7) with (7.6). Besides, define \({ \mathcal{I}}_{n,n'}\) to be the set of pairs (I⊆[n],I′⊆[n′]) such that both I and I′ are intervals and I=I′; we refer to (I,I′) as a (consistent) double interval. Two subsets of double intervals are distinguished: let \({\mathcal{D}}^{1}_{n,n'}\) consist of those (I,I′) that the first interval I is initial (i.e., contains 1), and \({ \mathcal{D}}^{2}_{n,n'}\) of those (I,I′) that the second interval I′ is initial; we say that such an (I,I′) is a pressed double interval.
Theorem 7.1
For \(\mathbf{F}:=\mathbf{FG}_{n,n'}({\mathfrak{S}})\), \(\mathbf{K}:=\mathbf {K}_{n,n'}({\mathfrak{S}})\), and \({ \mathcal{D}}:={ \mathcal{D}}^{1}_{n,n'}\cup { \mathcal{D}}^{2}_{n,n'}\), the following properties hold:

(i)
K coincides with F.

(ii)
\({ \mathcal{D}}\) is a basis for the functions in F.

(iii)
For each f∈F, the values of f are Laurent polynomials (over \({\mathfrak{S}}\)) in the values f(II′), \((I,I')\in { \mathcal{D}}\).
Proof
Instead of the halfgrid \(\varGamma_{n}^{\triangle}\) used in the flag flow case, we now work with the grid Γ=Γ _{ n,n′}=(V,E) (see Fig. 1). Let us associate to each vertex (k,k′) of Γ the integer rectangle R(k,k′):=[k]×[k′] and the pressed double interval \(D(k,k'):=(I,I')\in { \mathcal{D}}\), where I=[i..k] and I′=[i′..k′] (then min{i,i′}=1). (D(k,k′) is welldefined due to I=I′.) Observe that Γ has a unique (II′)flow ϕ: its vertices are exactly those in R(k,k′). Therefore, for a weighting \(w:V\to {\mathfrak{S}}\), the FGfunction f=f _{ w } satisfies
Then w is expressed via the values of f on \({ \mathcal{D}}\) as
letting f(D(p,q)):=1 if p=0 or q=0. Thus, w↦f _{ w } gives a bijection between the set of weightings \(w:V\to {\mathfrak{S}}\) and \({\mathfrak{S}}^{{ \mathcal{D}}^{+}}\), where \({ \mathcal{D}}^{+}:={ \mathcal{D}}\{(\emptyset,\emptyset)\}\).
Next, let f∈K and consider a pair \((S,S')\in {\mathcal{E}}^{n,n'}\). Let i:=min(S), k:=max(S), i′:=min(S′), k′:=max(S′). We show that f(SS′) is determined by the values of f on \({ \mathcal{D}}\), by considering three cases.

(a)
Suppose that S is not an interval. Letting X:=S−{i,k} and X′:=S′−{k′}, choosing an element j∈[i..k]−S, and using (7.4), we express f(SS′) via the values of f on the other five pairs occurring there. Since for each of those five pairs \((\widetilde{S}\widetilde{S}')\), the number \(\max(\widetilde{S})+\max(\widetilde{S}')\min(\widetilde{S})\min(\widetilde{S}')\) is strictly less than k+k′−i−i′, we can apply induction and conclude that f(SS′) is determined by the values of f on those pairs in \({ \mathcal{E}}^{n,n'}\) where the first term is an interval.

(b)
Suppose that S is an interval but S′ is not. Acting symmetrically to the previous case and using (7.5), we conclude that f(SS′) is determined by the values of f on double intervals.

(c)
Suppose that (S,S′) is a double interval but not a pressed one. Set \(\widetilde{i}:=i1\) and \(\widetilde{i}':=i'1\); then \(\widetilde{i}\ge1\) and \(\widetilde{i}'\ge 1\). Let X:=S−{k} and X′:=S′−{k′} and apply (4.7) to \(\widetilde{i},k,X,\widetilde{i}',k',X'\). Then f(SS′) is expressed via the values of f on five double intervals (II′) such that max(I)+max(I′)+min(I)+min(I′) is strictly less than k+k′+i+i′. So we can apply induction.
As a result, we obtain that any function f∈K is determined by its values on \({ \mathcal{D}}\). On the other hand, we have seen that any choice of \(f_{0}:{ \mathcal{D}}^{+}\to {\mathfrak{S}}\) determines a (unique) weighting w in Γ, which in turn determines a function f∈F with \(f_{\,\vrule height 1.6ex width 0.05em depth 0pt\, {\mathcal{D}}^{+}}=f_{0}\). These observations imply that K=F and that \({ \mathcal{D}}\) is a basis for F. The Laurentness concerning F and \({ \mathcal{D}}\) is clear. □
In light of this theorem, when we deal with a commutative semiring with division, any SQrelation is a consequence of the SQrelations of three types: the generalized P3relation, its symmetric one, and Dodgson’s type relation. In particular, this is so when we deal with SQrelations on minors of totally positive matrices.
One more property involving the basis \({ \mathcal{D}}={ \mathcal{D}}^{1}_{n,n'}\cup {\mathcal{D}}^{2}_{n,n'}\) extends the corresponding fact for totally positive matrices.
Proposition 7.2
Let A=(a _{ ij }) be a real n×n′ matrix (regarding i as the column index) and let f ^{A}(II′), \((I,I')\in { \mathcal{E}}^{n,n'}\), be the function of minors of A. Suppose f ^{A}(II′)≠0 for all pressed double intervals \((I,I')\in { \mathcal{D}}\). Then f ^{A} is a flowgenerated function.
Proof
Let w be the weighting on vertices of the grid Γ _{ n,n′} determined by the values of f ^{A} on \({ \mathcal{D}}\), as in the proof of Theorem 7.1 (w is welldefined since f ^{A} is nowhere zero within \({ \mathcal{D}}\)). Let A′ be the n×n′ matrix obtained from w by Lindström’s method. Then the minors of A and A′ related to \({ \mathcal{D}}\) coincide; so it suffices to show that A is determined by these minors. To see the latter, observe that the entries a _{ ij } with i=1 or j=1 are such minors. Suppose we have already “restored” the entries a _{ ij } for a set Q of index pairs such that ij∈Q, i′≤i, and j′≤j imply i′j′∈Q; we assume that Q contains all ij with min{i,j}=1 as well. Then, unless Q=[n]×[n′], there exists a pair ij∉Q such that Q contains each pair i′j′≠ij with i′≤i and j′≤j. Let (I,J) and (I′,J′) be the pressed double intervals with max(I)=i, max(J)=j, max(I′)=i−1 and max(J′)=j−1. Then the product a _{ ij }⋅f ^{A}(I′J′) is expressed as a polynomial in the value f ^{A}(IJ) and entries a _{ pq } with pq∈Q. Now f ^{A}(I′J′)≠0 enables us to compute a _{ ij } (and the new set Q∪{a _{ ij }} of “restored” entries satisfies the above condition). □
We conclude this paper with extending the SQrelations to minors of matrices.
Proposition 7.3
Let A be an n×n′ matrix over a commutative ring \({ \mathcal{R}}\). Then the function f ^{A} of minors of A obeys all SQrelations for n,n′.
Proof
Assuming \({ \mathcal{R}}={\mathbb{R}}\), consider the parameterized matrix P _{(t)}=A+tB, where B is an arbitrary totally positive n′×n matrix and t∈ℝ. (By the way, such a B can be generated by use of the grid Γ _{ n,n′} with a weighting in ℝ_{>0}.) When t is large enough, P _{(t)} becomes totally positive, and therefore the function \(f_{(t)}:=f^{P_{(t)}}\) of its minors becomes an FGfunction, implying that such an f obeys all SQrelations S. Substituting f into S gives a polynomial Q in t. Since Q turns into zero when t is large, Q is the zero polynomial. Hence f _{(0)}=f ^{A} obeys S as well (when \({ \mathcal{R}}={\mathbb{R}}\)). Moreover, Q at 0 is a polynomial, with integer coefficients, in the entries a _{ ij } of the matrix A (each being regarded as indeterminate). So it is the zero polynomial in a _{ ij }, and we can take an arbitrary commutative ring for \({ \mathcal{R}}\), obtaining the result. □
References
 1.
Akian, M., Gaubert, S., Guterman, A.: Linear independence over tropical semirings and beyond. In: Litvinov, G.L., Sergeev, S.N. (eds.) Tropical and Idempotent Mathematics. Contemporary Mathematics, vol. 495, pp. 1–38 (2009)
 2.
Berenstein, A., Fomin, S., Zelevinsky, A.: Parametrizations of canonical bases and totally positive matrices. Adv. Math. 122, 49–149 (1996)
 3.
Brenti, F.: Combinatorics and total positivity. J. Comb. Theory, Ser. A 71, 175–218 (1995)
 4.
Danilov, V., Karzanov, A., Koshevoy, G.: Tropical Plücker functions and their bases. In: Litvinov, G.L., Sergeev, S.N. (eds.) Tropical and Idempotent Mathematics. Contemporary Mathematics, vol. 495, pp. 127–158 (2009)
 5.
Danilov, V., Karzanov, A., Koshevoy, G.: Plücker environments, wiring and tiling diagrams, and weakly separated setsystems. Adv. Math. 224, 1–44 (2010)
 6.
Dodgson, C.L.: Condensation of determinants. Proc. R. Soc. Lond. 15, 150–155 (1866)
 7.
Fomin, S., Zelevinsky, A.: The Laurent phenomenon. Adv. Appl. Math. 28(2), 119–144 (2002)
 8.
Fulmek, M.: Bijective proofs for Schur function identities. arXiv:0909.5334v1 [math.CO] (2009)
 9.
Fulmek, M., Kleber, M.: Bijective proofs for Schur function identities which imply Dodgson’s condensation formula and Plücker relations. Electron. J. Comb. 8(1), 16 (2001)
 10.
Fulton, W.: Young Tableaux. London Math. Soc. Student Text, vol. 35. Cambridge University Press, Cambridge (1997)
 11.
Gessel, I.M., Viennot, X.: Determinants, paths, and plane partitions. Preprint (1989)
 12.
Lindström, B.: On the vector representation of induced matroids. Bull. Lond. Math. Soc. 5, 85–90 (1973)
 13.
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Text in Mathematics, vol. 227. Springer, Berlin (2005)
 14.
Postnikov, A.: Total positivity, Grassmannians, and networks. arXiv:math.CO/0609764 (2006)
 15.
Talaska, K.: A formula for Plücker coordinates associated with a planar network. arXiv:0801.4822 [math.CO] (2008)
Acknowledgements
Author information
Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Danilov, V.I., Karzanov, A.V. & Koshevoy, G.A. Planar flows and quadratic relations over semirings. J Algebr Comb 36, 441–474 (2012). https://doi.org/10.1007/s1080101203446
Received:
Accepted:
Published:
Issue Date:
Keywords
 Plücker relation
 Dodgson condensation
 Tropicalization
 Semiring
 Planar graph
 Network flow
 Lindström’s lemma
 Schur function
 Laurent phenomenon