The fibres of the Scott map on polygon tilings are the flip equivalence classes

We associate strand diagrams to tilings of surfaces with marked points, generalising Scott's method for triangulations of polygons. We thus obtain a map from tilings of surfaces to permutations of the marked points on boundary components, the {\em Scott map}. In the disk case (polygon tilings) we prove that the fibres of the Scott map are the flip equivalence classes. The result allows us to consider the size of the image as a generalisation of a classical combinatorial problem, and hence to determine the size in low ranks.

The resultant strand diagram − → σ (T ) varies depending on the tiling, but induces a permutation σ (T ) on the polygon vertex set that is the same permutation in each case. This construction is amenable to generalisation in a number of ways. For example, starting with the notion of triangulation for an arbitrary marked surface S [11,12] (the polygon case extended to include handles, multiple boundary components, and interior vertices) there is a simplicial complex A(S) of tilings [13][14][15] of which the triangulations are the top dimensional simplices. Lower simplices/tilings are obtained by deleting edges from a triangulation. There is a strand diagram − → σ (T ) in each case (we define it below, see Fig. 1a This construction gives rise to a number of questions. The one we address here is, what are the fibres of this Scott map σ ? To give an intrinsic characterisation is a difficult problem in general. Here we give the answer in the polygon case, i.e. generalising σ (T ), with fibre the set of all triangulations of the polygon, to the full A-complex of the polygon.
The answer is in terms of another crucial geometrical device used in the theory of cluster mutations [12] and widely elsewhere (see e.g. [1,11,14,17] and cf. [9])-flip equivalence (or the Whitehead move): Our main Theorem, Theorem 2.1, can now be stated informally as in the title. We shall conclude this introduction with some further remarks about related work. Then from Sects. 2-6 we turn to the precise definitions, formal statement and proof of Theorem 2.1.
In Sect. 7 we report on combinatorial aspects of the problem-specifically the size of the image of the map σ in the polygon cases. The number of triangulations of polygons is given by the Catalan numbers. Taking the set A r of all tilings of the r -gon, we have the little Schröder numbers (see e.g. [31,Ch.6]) The image-side problem is open. We use solutions to Schröder's problem and related problems posed by Cayley (as in [25,28]), and our Theorem to compute the sequence in low rank r , and in Sect. 7.4 prove a key Lemma towards the general problem. To give a flavour of the set σ (A r ) ⊂ r , the set of vertex permutations: |σ (A r )| = 1, 2, 7, 26, 100, 404, 1691, . . . (r = 3, 4, 5, . . . , 9) Finally in Sect. 8 we give some elementary applications of Theorem 2.1 to Postnikov's alternating strand diagrams and the closely related reduced plabic graphs [26]. In particular we consider a direct map G from tilings to plabic graphs generalising [27, §2]. (A heuristic for this 'stellar-replacement' map is given by the examples and then The geometry and topology of the plane, and of two-manifolds, continues to reward study from several perspectives. Recent motivations include modelling of anyons for Topological Quantum Computation [18], fusion categories [1], cluster categories [4,8], Teichmüller spaces [11,15], frieze patterns [6], diagram algebras [16,22,29], classical problems in combinatorics [20,28] and combinatorics of symmetric groups and permutations [29]. In Baur et al. [4] used Scott's map [30] to produce strand diagrams for triangulated surfaces, again with the same permutation, in each case. This raises the intriguing question of which permutations are accessible in this way, and the role of the geometry in such constructions. Strictly speaking, the precise identification of permutations is dependent, in this setup, on a labelling convention. It is the numbers of permutations and the fibres over them (as we investigate here) that are, therefore, the main invariants accessible in the present formalism.

Definitions and results
Given any manifold X we write ∂ X for the boundary and (X ) for X \∂ X . For a subset D ⊂ X we write D for its closure [23].
A A concrete tiling of (S, M) is a collection of pairwise compatible arcs that are in fact pairwise non-intersecting. A tiling T is a boundary-fixing ambient isotopy class of concrete tilings-which we may specify by a concrete representative, with arc set E(T ) (it will be clear that this makes sense on classes). A tile of tiling T is a connected component of S\ ∪ α∈E(T ) α. We write F(T ) for the set of tiles. (Note that if S is not homeomorphic to a disk then a tile need not be homeomorphic to a disk. For example a tile could be the whole of S in the case of Fig. 3.) Fixing (S, M), it is a theorem that there are finite maximal sets of compatible arcs. Set κ(S, M) = 6g + 3b + 2 p + |M| − 6, where g is the genus, b the number of connected components of ∂ S, and p = |M ∩ (S)|. Suppose κ(S, M) ≥ 1 and every boundary component intersects M. Then T maximal has |E(T )| = κ(S, M), and every tile is a simple disk bounded by three arcs. Evidently given a tiling T then the removal of an arc yields another tiling. In this sense the set of tilings of (S, M) forms a simplicial complex, denoted A(S, M).
We say two tilings are related by 'flip' if they differ only by the position of a diagonal triangulating a quadrilateral. The transitive closure of this relation is called f li p equivalence. We write [T ] for the equivalence class of the tiling T ; and AE(S, M) for the set of classes of A(S, M).

The Scott map
Let L be a connected component of the boundary of an oriented 2-manifold, and P a finite subset labeled p 1 , p 2 , . . . , p |P| in the clockwise order (a traveller along P in the clockwise direction keeps the manifold on her right). Then an umbral set P ± is a further subset of points p − i and p + i (i ∈ 1, 2, . . . , |P|) such that the clockwise order of all these points is . . . , Given (S, M), let M ± denote a fixed collection of umbral sets over all boundary components. A J ordan diagram d on (S, M) is a finite number of closed oriented curves in S together with a collection of n = |M ∂ | oriented curves in S such that each curve passes from some p + i to some p − j in M ± ; and the collection of endpoints is M ± . Intersections of curves are allowed, but must be transversal.
Diagram d is considered up to boundary-fixing isotopy. Let Pu(S, M) denote the set of Jordan diagrams.
Next we define a map − → σ : A(S, M) → Pu(S, M). Consider a tiling T in A(S, M). By construction each boundary L of a tile t is made up of segments of arcs, terminating at a set of points P. Hence we can associate P ± to P as above. To arc segment s passing from p i to p i+1 say, we associate a strand segment α s in t passing from p + i+1 to p − i , such that the part of the tile on the s side of strand segment α s is a topological disk. Finally strand segment crossings are transversal and minimal in number. See tile t in Fig. 4 for example.
It will be clear that if two tiles meet at an arc segment then the umbral point constructions from each tile can be chosen to agree: as in Fig. 4. Applying the α s construction to every segment s of every tile t in T , we thus obtain a collection − → σ (T ) of strand segments in S forming strands whose collection of terminal points are at the umbral points of ∂ S; so that − → σ (T ) ∈ Pu(S, M). Altogether, writing M for the set of permutations of set M, we have σ : We call this the Scott map. It agrees with Scott's construction [30] in the case of triangulations of simple polygons. We remark that the intermediate map − → σ is injective, as we will show later (Theorem 8.4). The map σ however is clearly not injective, as the image of any triangulation of a polygon is the permutation induced by i → i + 2.
The focus of this article is the case where (S, M) is a polygon P with n vertices. We write A n for A(S, M) in this case, AE n for AE(S, M), and Pu n for Pu(S, M). Our main result can now be stated: Theorem 2.1 Let T 1 , T 2 ∈ A n be tilings of an n-gon P. Then σ ( Sections 3, 4, 5 and 6 are concerned with the proof of this result. We will see in Lemma 3.5 that − → σ (A n ) lies in the subset of Pu n of alternating strand diagrams [26, §14]. Theorem 2.1 is thus related to Postnikov's result [26,Corollary 14.2] that the permutations arising from two alternating strand diagrams are the same if and only if the strand diagrams can be obtained from each other through a sequence of certain kinds of 'moves'. Consider the effect of a flip on the associated strands: Comparing with Figure 14.2 of [26], the diagram shows that the flip corresponds to a certain combination of two types of Postnikov's three moves (see Fig. 19

Notation for tilings of polygons
We note here simplifying features of the polygon case that are useful in proofs.
Geometrically we may consider a tile as a subset of polygon P considered as a subset of R 2 . This facilitates the following definition.

Definition 2.3
Let T ∈ A n . By Tr(T ) ⊂ R 2 we denote the union of all triangles in T . We call T 1 and T 2 triangulated − par t equivalent if Tr(T 1 ) = Tr(T 2 ) and they agree on the complement of Tr(T 1 ). See Fig. 5. By Hatcher's Corollary in [14], two tilings are flip equivalent if and only if they are triangulated-part equivalent. The following is immediate.   Write n = {1, 2, . . . , n} for the vertex set of P, assigned to vertices as for example in Fig. 6. The 'vertices' of A n as a simplicial complex are the n(n − 3)/2 diagonals. A diagonal between polygon vertices i, j is uniquely determined by the vertices. We write [i, j] for such a diagonal. Here order is unimportant. A tiling in A n can then be given as its set of diagonals. Example: The tiling from A 8 in Fig. 1 is T = { [2,8], [3,5], [5,8]}. An example of a top-dimensional simplex (triangulation) in A 8 of which this T is a face is T ∪ { [3,8], [6,8]}.
Equally usefully, focussing instead on tiles, we may represent a tiling T ∈ A n as a subset of the power set P(n): for T ∈ P(n) one includes the subsets that are the vertex sets of tiles in T .

Example 2.5
In tile notation the tiling from A 8 in Fig. 1 becomes In this representation, while A 3 = {{{1, 2, 3}}}, we have: We present two proofs of Theorem 2.1: one by constructing an inverse-in Sect. 4 we show how to determine the flip equivalence class from the permutation; and one by direct geometrical arguments-see Sect. 6. We first establish machinery used by both.

Machinery for proof of Theorem 2.1
The open dual γ (T ) of tiling T is the dual graph of T regarded as a plane-embedded graph (see e.g. [7]) excluding the exterior face (so restricted to vertex set T ). See Fig. 7 for an example.

Lemma 3.1 Graph γ (T ) is a tree.
Proof Let e be a diagonal of T and P the underlying n-gon. Then P\e has two components. Thus removing a single edge separates γ (T ).
A proper tiling is a tiling with at least two tiles. An ear in a proper tiling T is a tile with one edge a diagonal. An r -ear is an r -gonal ear.

Elementary properties of strands
Consider a tiling T . Note that a tile t in T and an edge e of t determine a strand of the − → σ (T ) construction-the strand leaving t through e. Now, when a strand s leaves a tile t through an edge e it passes to an adjacent tile t (as in Fig. 7), or exits P and terminates. We associate a (possibly empty) branch γ t,e of γ (T ) to this strand at e: the subgraph accessible from the vertex of t without touching t. Note that the continuation of the strand s leaves t at some edge e distinct from e, and that γ t ,e is a subgraph of γ t,e . Proof Consider the strand as in the paragraph above. If the strand exits the polygon P at e we are done. Otherwise, since the sequence of graphs γ t i ,e i associated to the passage of the strand is a decreasing sequence of graphs, containing each other, it eventually leaves P and terminates in some tile of a vertex of γ t ,e and so does not return to t.
An immediate consequence of Lemma 3.3 is the following: Proof The first two properties follow from the construction. That no strand crosses itself follows from Corollary 3.4. Note that the underlying polygon can be drawn convex, in which case strands are left-turning. The requirement that there are no unoriented digons follows from the fact that strands are left-turning in this sense. (Remark: our main construction is unaffected by non-convexity-preserving ambient isotopies, but the left-turning property is only preserved under convexity preserving maps.) We write x y for a strand starting at vertex x and ending at vertex y. Thus if x y is a strand of tiling T and σ is σ (T ) then this strand determines σ (x) = y. If a list of vertices is ordered minimally clockwise around the polygon, we will often just say clockwise, for example (7, 1, 2) is ordered minimally clockwise. To emphasise that vertices x 1 , x 2 , x 3 are ordered minimally clockwise, we will repeat the "smallest" element at the end: (1) We say that a strand x y covers q if we have x < q < y < x minimally clockwise.
(2) We say that x y covers strand

Factorisation Lemma
Consider the two strands s 1 , s 2 passing through an edge e of a tile t. We say these strands are 'antiparallel at e'; and consider the 'parallel' strand s 1 and antistrand s 2 both moving into t from e. See Fig. 8 for examples.
Proof Consider Fig. 9. The only way a strand of − → σ (T 1 ) passes out of P is through e, and there is exactly one such strand (and one passing in). This strand is non-returning by Lemma 3.3, so its endpoints are identifiable from σ = σ (T 1 ) as the unique vertex pair k, l with σ (k) = l and with k in P and l not. Apart from this and the corresponding 'incoming' pair with σ (k ) = l , all other strand endpoint pairs of − → σ (T 1 | P ) are as in − → σ (T 1 ) and hence agree with − → σ ( then σ (T 2 ) identifies the same two pairs k, l and k , l . At this point it is enough to show that the image of vertex k under − → σ (T 1 | P ), which is either vertex i or j, is the same as for − → σ (T 2 | P ). But it is i in both cases since the strand passing out of P through e is at i.

Properties of strands and tiles
We will say that a vertex in polygon P is simple in tiling T if it is not the endpoint of a diagonal. We will say that an edge e = [i, i + 1] of P is a simple edge in T if both vertices are simple.  In general a strand passes through a sequence of tiles. At each such tile it is parallel to one edge and passes through the two adjacent edges. Any remaining edges in the tile are called complementary to the strand. Each of these complementary edges defines a sub-tiling-the tiling of the part of P on the other side of the edge. We call this the complement to the corresponding edge. Note that the strand covers every vertex in this sub-tiling. See for example Fig. 10. We deduce: (the non-saturation of the bound corresponds to some tiles having non-empty complement).

Example 3.12
As an illustration for Lemma 3.11 consider Fig. 6. Both tilings have a strand 6 9, illustrating the case k = 3. In the tiling on the left, there is a strand 13 3 passing through one quadrilateral with complementary triangle {14, 1, 2}.

Lemma 3.13 Let T ∈ A n and σ = σ (T ). Then σ (i) = i + 2 if and only if there exists T ∈ [T ] with a 3-ear at vertex i + 1.
Proof If: T has a strand direct from i to i + 2 in the given ear. Note that all other tilings in [T ] have only triangles incident at i + 1 (since a neighbourhood of i + 1 lies in the triangulated part). One sees from the construction that these tilings all have a strand from i to i + 2. See (a): [26,Corollary 14.2] and the strand/flip construction in Sect. 2.1 also implies the "if" part. For self-containedness we will avoid assuming Postnikov's result.) Only if: If there is no such T in [T ] then among the tiles incident at i + 1 is one with order r > 3. The strand from i passes into P at the first tile incident at i + 1. If this is a triangle then the strand passes into the second tile incident at i + 1, and so on. Thus eventually the strand meets a tile of higher order-see (b) above. But then by Lemma 3.11 we have i i + k with k > 2.
For given n let us write τ for the basic cycle element in n : τ = (1, 2, . . . , n). The following is implicit in [30], and is a corollary to Lemma 3.11.

Definition 3.15
A run is a subsequence of form i − 1, i − 2, . . . , i − r + 1 in a cycle of a permutation of n . A maximal subsequence of this form is an r -run at i.
In Fig. 6, both permutations have a 3-run at 9. Lemma 3.16 Let T ∈ A n , and σ = σ (T ). We have is not simple-a triangular ear. If q 1 = j − r (and hence q 2 = j), we are done. So assume for contradiction that j < q 1 ≤ q 2 < j − r < j. Both diagonals are edges of a common tile Q containing the simple edges Consider the strand starting at j − r . It leaves the tile Q at an edge at q 2 . By Corollary 3.4 it cannot return back into Q, and so its endpoint is different from j.

Inductive proof of Theorem
One proof strategy for the main theorem (Theorem 2.1) is as follows. We assume the theorem is true for orders m < n (the induction base is clear).
The 'If' part follows from the Factorisation Lemma (Lemma 3.9) and Lemma 3.14.
For the 'Only if' part proceed as follows. Consider T 1 , . Note that T 1 has an ear, either triangular or bigger (Corollary 3.2). Pick such an ear Since T 1 \E and T 2 \E are well defined we have σ (T 1 \E) = σ (T 2 \E) by the Factorisation Lemma (Lemma 3.9). That is, the Scott permutations σ (T 1 ) and σ (T 2 ) of T 1 Such partitions arise from tilings: Let Q ∈ T ∈ A n . Then the vertices of Q partition the vertices of P in two ways. Consider the edge e = [q i , q i+1 ] of Q. In the subpolygon on the vertices q i , q i + 1, . . . , q i+1 , there are q i+1 − q i strands of − → σ (T ) starting at vertices in I i (Q) and the same number of strands ending at the vertices in J i (Q). Among them, q i+1 − q i − 1 remain in the subpolygon.
For an example, see Fig. 11.

Fig. 11
Tile inducing partition and long strands for Q Using this notation, we get an alternative proof for Corollary 3.4 stating that a strand of a tiling can only use one strand segment of a given tile: Let Q be a tile of a tiling T ∈ A n and let q 1 , . . . , q r be its vertices, r ≥ 3, q 1 < q 2 < · · · < q r < q 1 . Assume strand x y involves a strand segment of Q, say parallel to the edge [q i−1 , q i ]. By construction, this strand segment is oriented from q i to q i−1 , comes from the subpolygon on the vertices q i , q i + 1, . . . , q i+1 and then passes into the subpolygon on the vertices q i−2 , q i−2 +1, . . . , q i−1 . We claim that the strand then necessarily starts in I i (Q) and ends in J i−2 (Q), i.e. that x = q i+1 and y = q i−2 . We show that it ends in J i−2 (Q): Consider the subpolygon on the vertices q i−2 , q i−2 + 1, . . . , q i−1 , bounded by the edge [q i−1 , q i ]. From the orientation of strand segments in tiles, it is clear, that the strand then leaves this subpolygon near z where z ∈ {q i−2 + 1, . . . , q i−1 − 1} is the first vertex met when going from q i−2 towards q i−1 which has an edge [z, q i−1 ]. Hence y ∈ J i−2 (Q). A similar argument shows x ∈ I i (Q).

Remark 5.2
Let T be a tiling of P, with tile Q inducing partitions as above. There are two types of strands regarding these partitions. Let x y be a strand starting in I i 1 (Q) and ending in J i 2 (Q) for some i 1 , i 2 . Then we either have i 1 = i 2 or i 1 = i 2 + 2 (by the preceding argument or by Corollary 3.4). The case i 1 = i 2 + 2 is illustrated in Fig. 11 for Q a pentagon.

Definition 5.3
Let Q be a tile of a tiling T of an n-gon. If a strand x y of T uses a strand segment of Q, we say that the strand x y is a long strand for Q. If for the partitions induced by Q, x ∈ I i (Q), then y ∈ J i−2 (Q) if x y is a long strand for Q and y ∈ J i (Q) otherwise, cf. Remark 5.2.

Lemma 5.4
Let Q be an r -tile of a tiling of P with vertices q 1 < · · · < q r < q 1 clockwise. Then every long strand x y with respect to Q covers exactly r − 2 vertices of Q and there are exactly two vertices q i−1 , q i for every such strand with y ≤ q i−1 < q i ≤ x < y (clockwise).

Geometric Proof of Theorem
We now use geometric properties of tilings to prove the "only if" part of Theorem 2.1. The maximum tile size of tiling T is denoted r (T ). For two tilings T 1 , T 2 and r i = r (T i ), the case r 1 = r 2 is covered in Corollary 6.3; and r := r 1 = r 2 follows from Lemma 6.4. We first prove an auxiliary result. Proof (a) Let e = [n 1 , n 2 ] be the shortest diagonal in T lying above q. Note, s 1 ≤ n 1 < q < n 2 ≤ s 2 < s 1 . Consider the strand segment in σ (T ) following e from n 1 to n 2 (see figure below). This induces a strand s with y z, say. We claim n 1 ≤ y < q and q < z ≤ n 2 . To see this let [x, n 1 ] be in T with n 1 ≤ x < n 2 , x maximal (x = n 1 + 1 possibly). Then x ≤ q since e is the shortest diagonal above q and so s has its starting point among {n 1 , n 1 + 1, . . . , x − 1}. A similar argument proves the claim for y. Proof If e is not an edge of Q, we find vertices q i and q j of Q with s 1 < q i < s 2 < q j < s 1 . We can thus use Lemmas 5.4 and 6.1 for q i and again for q j to see that Q has r − 2 vertices on the left side of e and r − 2 vertices to the right of e, and that they all differ from s 1 and from s 2 , where r = |Q|. So r = 2(r − 2) and r = 4. Corollary 6.3 Let T 1 and T 2 be two tilings of a polygon P with σ (T 1 ) = σ (T 2 ). Then r 1 = r 2 .
Proof Let r = r 2 . Assume that σ (T 1 ) = σ (T 2 ). In case r 1 = 3, the claim follows from Lemma 3.14: in this case, σ (T 1 ) is induced by i → i + 2 and T 2 has to be a triangulation, too. Assume for contradiction that r 1 < r . Since we can assume r 1 > 3, we have r > 4. We consider a tile Q of size r > 4 in T 2 , with vertices q 1 , . . . , q r . In T 1 , we choose a tile S with dim(Q ∩ S) > 1. Then S has an edge e with dim(Q ∩ e) = 1 and so by Lemma 6.2, Q is a tile of T 1 , a contradiction to the maximal tile size in T 1 .

Lemma 6.4 Let T 1 and T 2 be two tilings of a polygon P with
Proof By Lemma 3.10 the positions of 4-ears in T 1 and T 2 agree, when r 1 = r 2 = 4. By the Factorisation Lemma (Lemma 3.9) we can remove (common) ears of size 4, to leave reduced tilings T 1 and T 2 of some P . These necessarily have ears, but by Lemma 3.11, (up to equivalence) 3-ears can be chosen to be in the same positions in each tiling. Now iterate.

Proof of Theorem 2.1
If the maximum tile sizes of T 1 and of T 2 differ, the claim follows from Corollary 6.3. So let r = r 1 = r 2 be the maximum tile size of T 1 and of T 2 . If r = 4, Lemma 6.4 proves the claim. So assume that there are tiles of size r > 4 and consider such a tile Q in T 2 . By Lemma 6.2 there are no diagonals of T 1 'intersecting' Q, so in T 1 we have a tile containing Q. Applying the same argument with the tilings reversed we see that T 1 and T 2 agree on parts tiled with tiles of size > 4.
By the Factorisation Lemma (Lemma 3.9), we can remove all (common) ears of size > 4. Among the remaining (common) tiles of size at least 5, we choose a tile Q and a non-boundary edge e of Q, such that to one side of e, all tiles in T 1 and in T 2 have size at most four. Let P be the union of these tiles of size ≤ 4. By the Factorisation Lemma we have σ (T 1 | P ) = σ (T 2 | P ) and by Lemma 6.4, [T 1 | P ] = [T 2 | P ] . We can remove P and repeat the above until Q is a (common) ear -which can be removed, too. Iterating this proves the claim.

On the image of the Scott map treated combinatorially
To give an intrinsic characterization of the image in n of the Scott map σ : A n → n for all n remains an interesting open problem. Note in particular that so far the map does not equip the image with a group structure (or indeed any algebraic structure).
Here we report on one invariant which Theorem 2.1 gives us access to, namely the size of the image, which is given by |AE n |.
As an initial illustration we observe that: The number of permutations arising from tiling an n-gon using one r -gon (r > 3) and triangles otherwise is n r .
Proof By the main Theorem this is the same as enumerating the classes in AE n of this type. Since the details of the triangulated part are irrelevant, the class is determined by choosing the vertices of the r -gon. Hence choosing r from n.

Example 7.2
In total, there are 26 permutations arising from the 45 tilings of the hexagon: one from the empty tiling; 6 from tilings with one pentagon and one triangle; 15 from tilings with one quadrilateral and two triangles; 3 from tilings using two quadrilaterals; and 1 from the triangulation case. Figure 2 contains examples of these tilings and the associated permutations.
In order to go further we will need some notation.

Notation and known results
Recall that an integer partition λ = (λ 1 , λ 2 , . . . ) has also the exponent notation: where α i is the number of parts in λ equal to i. A λ-tiling is a tiling with, for each d, α d tiles that are (d + 2)-gonal.
Recall that A n is the complex of tilings of the n-gon. Define a n = |A n |. Write A n (m) (with m ∈ {0, 1, 2, . . . , n − 3}) for the set (and a n (m) the number) of tilings with m diagonals. Write A n (λ) (with λ an integer partition of n − 2) for the set of λ-tilings (thus with a m-gonal face for each row λ i = m − 2). Thus where λ denotes the conjugate partition to λ [21], so λ 1 is the number of parts. Similarly recall AE n is the set of classes of tilings under triangulated-part/flip equivalence. Write AE n (m) for the set A n (m) under triangulated-part equivalence and AE n (λ) the set A n (λ) under triangulated-part equivalence.

(7.3)
The sequence a n is the little Schröder numbers (see e.g. [31] and OEIS A001003). It is related to the Fuss-Euler combinatoric as follows. By [28] the number of tilings of the n-gon with m diagonals is a n (m) = 1 m + 1 (a n (m) = q m (1, n) from [28]). Thus in addition to the usual generating function n≥0 a n x n = 1 + we have a n = n m=0 1 m + 1

Explicit construction of A n
Of greater use than an expression for the size of A n is an explicit construction of all tilings. For this we shall consider a tiling in A n to be as in the formal definition, i.e. to be the same as its set of arcs. This is the set of diagonals in the present polygon case, where we can represent an arc between vertices i, j unambiguously by [i, j].
In particular then we have an inclusion A n−1 → A n . The copy of A n−1 in A n is precisely the subset of tilings in which vertex n is simple and there is no diagonal There remain in A n the tilings in which n is not simple but there is not a diagonal [n − 2, n]. Consider those for which there is a diagonal [n − 3, n]. In the presence of this diagonal any tiling 'factorises' into the parts in the two subpolygons on either side of this diagonal. One of these has vertices 1, 2, . . . , n − 3 and n, and so its tilings are an image of A n−2 where vertex n − 2 becomes vertex n. The other has vertices n − 3, n − 2, n − 1, n and so has tilings from a shifted image of A 4 , but has n simple (since [n − 3, n] is the first diagonal in the original tiling). Since n is simple, it is the part of that image coming from A 3 J (A 3 ). We write 2.K (A 3 ) for these two shifted copied of A 3 . We write 2.K (A 3 ) · A n−2 for the meld with tilings from A n−2 to construct the set of tilings of the original polygon.
There now remain in A n the tilings in which n is not simple but there is not a diagonal [n − 2, n] or [n − 3, n]. Consider those for which there is a diagonal [n − 4, n]. In the presence of this diagonal any tiling 'factorises' into the parts in the two subpolygons on either side of this diagonal. We have the obvious generalisation of the preceeding construction in this case, written 2.K (A 4 ) · A n−3 .
We may iterate this construction until all cases of diagonals from n are included. We have established the following.

Proposition 7.4 Consider the list defined recursively by A 3 = (∅) and
where set operations on lists are considered as concatenation in the natural order; 2.− denotes the doubling as above; K () denotes the relabeling of all vertices so that the argument describes a suitable subpolygon; and A · B denotes the meld of tilings from subpolygons as above. Then this list is precisely a total order of A n .
Proof Noting the argument preceding the Proposition, it remains to lift the construction from the set to the list. But this requires only the interpretation of union as concatenation.

Tables for A n ( )
The class sets AE n are harder to enumerate than A n . Practically, one approach is to list elements of A n and organise by arrangement of their triangulated parts, which determines the class size. We first recall the numbers a n (m) of tilings of an n-gon with m diagonals: see Table 1. The main diagonal enumerates the top dimensional simplices in A n . It counts triangulations and hence is the Catalan sequence C n . The entries in the next diagonal correspond to tilings with a single quadrilateral and triangles else.
We will give the number of elements of AE n (m) for small n in Table 2. In order to verify this it will be convenient to refine Tables 1 and 2 by considering these numbers for fixed partitions λ. Specifically we subdivide each case of m from the previous tables according to λ, with the m-th composite entry written as a list of entries in the form (λ 1 ,λ 2 ,...) a n (λ) ranging over all λ with |λ| = m. Thus for example (32) 7 tells that a 7 ((3, 2)) = 7. We include Table 3 for A n (λ) and Table 4 for AE n (λ). Neither table is known previously. The a n case is computed partly by brute force (and see below); verified in GAP [32], and checked using identity (2)). Table 1 Values of a n (m), and hence a n , in low rank  For the purpose of computing AE n a better filtration is by the partition describing the size of the connected triangulated regions. But this is even harder to compute in general.

Formulae for |AE n ( )| for all n
In the λ notation Proposition 7.1 becomes To determine the size of image of the Scott map for a polygon of a given rank, one strategy is to compute AE n (λ) through A n (λ). While A n (λ) is also not known in general, we have a GAP code [3,32] to compute any given case.
Next aiming to enumerate A , consider λ21 −2 , somewhat as in the proof of (ii), but here there is another triangle, which must not touch the marked 4-gon. Let us write (α 2 + 1)A(λ21 −2 ) to denote a version of A(λ21 −2 ) where one of the quads is marked. There are two ways of triangulating the marked quad, giving X = 2(α 2 +1)A(λ21 −2 ), say. Consider the subset B of X of tilings where the marked quadrilateral and triangle are not adjacent.
Proof The construction (forgetting the mark) defines a map B → A . Marking the adjacent pair of triangles in an element of A gives a map A → B that is inverse to it.
The complementary subset C of X has quadrilateral and triangle adjacent. Elements map into A by forgetting the mark.
Claim: C double counts A , i.e. the forget-map is surjective but not injective.
Proof There are 5 ways the quadrilateral and triangle can occupy a pentagon together, and two ways of triangulating the quad. The cases can be written out, and this doublecounts the triangulations of the pentagon.
By direct analogy with (7) we claim Next consider X = 5(α 3 + 1)A(λ31 −3 ), marking one 5-gon, and then triangulating it. We have a subset B where the 5-gon and triangle are not adjacent; and complement C. 31 . This follows as in the proof of part (iii). The complement C maps to A 4 by forgetting the mark. Claim: 14|C| = 30|A 4 |.
Proof There are 6 ways the 5-gon and triangle can occupy a hexagon together, and 5 ways to triangulate the 5-gon. This gives 30 marked cases, which pass to 14 triangulations. So far we have that It remains to determine A 22 and A 211 .
, marking two 4-gons, and then triangulating them. Subset D has the 4-gons non-adjacent; and E is the complement.
Claim: D ∼ = A 22 . This follows similarly as the statement on B.
The complement E maps to A 4 by forgetting the marks. Claim: 14|E| = 12|A 4 |.

Proof
There are 3 ways the 4-gons can occupy a hexagon together, and 4 ways to triangulate them. (NB the map is not surjective-not every triangulation of a hexagon resolves as two quadrilateral triangulations-but we only need to get the count right. We always get 12 out of 14 possible in each case.)

So far we have
Next we need A 211 .
(7.10) Next consider Z = 2(α 2 + 1)A(λ21 −2 ), marking a 4-gon and triangulating it. Subset F has the three parts non-adjacent. Subset G has the 4-gon and one triangle adjacent. Subset G has the two triangles adjacent. Subset H has all three parts adjacent:

Remark 7.11
In [2] we prove the following generalisation of Proposition 7.5

Tables for AE n
Proposition 7.12 The numbers AE n for n < 11 are given in Table 2.
Proof The numbers a n (λ) are given in Table 3 by a GAP calculation [3]. The numbers in Table 4 then follow from formula (5) and Proposition 7.5. Table 2 follows immediately.

On asymptotics
We determined in Tables 2, 4 the sizes of the image of the Scott map in low rank.
Of course the ratio of successive sizes of the formal codomains grows with n as | n |/| n−1 | = n. In the next table we consider the ratios of two consecutive entries of the sequence |AE n | n . (7.13) A paradigm for this is the Catalan combinatoric C n (see e.g. [31]), which can also be equipped with an inclusion in the permutations n -see e.g. [19,29] (NB this inclusion is not related to the inclusion in A n already noted). It is straightforward in this case to verify that the asymptotic growth rate is 4. This raises the question: Is there a limit rate in the AE n case?

On enumerable classes of strand diagrams and plabic graphs
Let Pb n be the set of reduced plabic graphs [26, §11] of rank-n; and Po n be the set of alternating strand diagrams as in [26, §14]. (See also Sects. 8.1 and 8.5.) Their relationship with A n can be summarized as follows: Here G is as in Sect. 1, − → σ as in Sect. 2.1, and D, D as in Sect. 8.2. In this section we apply Theorem 2.1 to corresponding subsets of plabic and strand diagrams. We define the sets X n of minimalist strand diagrams, see Sect. 8.1; and Pt n of rhombic (plabic) graphs, see (8.5). We will show that these sets are in bijection with A n .
For the sake of brevity we refer to Postnikov's original paper for motivations behind the constructions of plabic and strand diagrams themselves. These are large and complex classes of objects, and canonical forms for them would be a useful tool. The rigid/canonical nature of A n induces canonical forms for (the restricted cases of) the other constructions.
We start by characterizing the image of − → σ in Theorem 8.4 as the set of minimalist strand diagrams and hence show that − → σ is injective. In Sect. 8.2 we recall Postnikov's bijections between alternating strand diagrams and plabic graphs. (An illustration of the connection between plabic graphs and strand diagrams is given by Fig. 12b.) This allows us to characterize the image of G in Sect. 8.3 as the set of rhombic plabic graphs, Theorem 8.19. Finally we determine the images of flip equivalence in the two other realisations.

On − → and strand diagrams
An absolute strand diagram on (S, M) is a Jordan diagram such that: (i) strands crossing a given strand must alternate in direction; (ii) if two strands cross twice such as to cut out a simple disk then the resultant loop is oriented; (iii) if a strand is selfcrossing then no resultant loop is a simple disk; (iv) no strand is a closed loop cutting out a simple disk. Note that this agrees with the ordinary definition of alternatingstranddiagram [4,26] for S a simple disk. Here rank n = |M ∂ | = |M|.
For any directed planar graph we classify the faces as clockwise, counterclockwise, alternating or other.
(8.1) Let X n be the subset of rank-n alternating strand diagrams whose faces are as follows: (i) n clockwise faces at the boundary, labelled 1, 2, . . . , n going clockwise around the boundary; (ii) alternating faces with four sides; (iii) oriented faces in the interior that are counterclockwise and have at least 3 sides.
We call the elements of X n minimalist strand diagrams. See Fig. 13 for an example.

(8.2)
Note that an element of X n (as every alternating strand diagram) has a chequerboard colouring of faces (see e.g. [26]). If a clockwise face is black (say) then all oriented faces are black and all alternating faces white. Also the faces around an alternating face alternate clockwise/counterclockwise. The paths of non-short edges are not constrained by the 'shrinking' of the clockwise edges. Thus each pair may be brought close to each other, and hence form an arbitrarily narrow neighbourhood of a line between two of the n points. Since no two alternating faces intersect, these lines cannot cross, and so they form an element of A n .

Theorem 8.4
The map f : X n → A n is the inverse to a bijection − → σ : A n → X n .
Proof It will be clear that f makes sense on − → σ (T ) since it even makes sense tile by tile (cf. Fig. 14). Indeed it recovers the tile, so f inverts − → σ . The other steps have a similar flavour.
Remark. One can prove more generally, that − → σ is injective on tilings of (S, M) and that the image of any tiling of (S, M) is an absolute strand diagram. with M2-3 also for black nodes. In M2 any number of incoming edges is allowed. Postnikov also defines reductions on plabic graphs: and similarly with colours reversed. The move-equivalence class of γ is its orbit under (M1-3). A plabic graph of rank n is reduced if it has no connected component without boundary vertices; and if there is no graph in its move-equivalence class to which (R1) or (R2) can be applied. See [26, §12] for details.

Maps D, D between strand diagrams and plabic graphs
We write Pb n for the set of reduced plabic graphs of rank n.
Recall the map G on A n to plabic graphs from Sect. 1. If T is a tiling of an n-gon, we draw a white node at each vertex of the polygon and a black node in each tile, connecting the latter by edges with the white nodes at the vertices of the tile. One can see that the graph produced has no parallel bicoloured edges and no internal leaves with bicoloured edges. Thus G : A n → Pb n .
Postnikov's plabic networks are generalisations of the above including face weights. Here it will be convenient to consider another kind of generalisation.

Properties of the map G
We note that G is the composition D • − → σ . Since D is a bijection and − → σ is injective (Theorem 8.4), G is injective. In this section, we give an intrinsic characterization of the image of G.
(8.12) Let u and v be two black nodes in γ ∈ Pf n that are on a common quadrilateral. If u has degree r + 2 and is incident with r ≥ 1 leaves, we say that γ has an r -bouquet at u or a bouquet at u. The subgraph on the quadrilateral and on the r leaves is the bouquet at u.
The first figure below is a bouquet at u with 4 leaves. The second figure shows two (non-disjoint) bouquets, one at u and one at v. The second graph has two bouquets. It satisfies the conditions for Pt n of Definition 8.13.

Definition 8.13
The set Pt n of r hombic graphs is the set of connected fully reduced plabic graphs γ in Pf n containing at least one black node and such that (a) the tagged nodes (in the sense of (8.5)) are white and all other nodes are black, (b) every black node has degree ≥ 3, (c) every closed face is a quadrilateral, (d) in the fan of edges coming out of a white node every adjacent pair is part of a quadrilateral.
(8.14) We observe that conditions (a) and (b) imply: (e) Two faces of a rhombic graph share at most one edge.

Lemma 8.15
If γ ∈ Pt n , γ not a star, then γ has at least two bouquets.
Proof Forget the leaves for a moment, so we have graph of quadrilaterals. (Cf. [24].) Now consider the exterior 'face' subgraph -a 2-coloured loop. We see (e.g. by induction on number of faces, using (8.14)) that this must have at least 2 black corners (black nodes touching only 1 quadrilateral).
We note that G(A n ) ⊆ Pt n . Our next goal is to get an inverse to the map G, going from rhombic graphs to tilings. One ingredient is the following lemma which says that if we split an element of Pt n at a bouquet at node u, we obtain a star graph and an element γ u of Pt n .
(8.16) Let γ be a plabic graph containing a bouquet at vertex u, with u of degree r + 2. Define γ u as the full subgraph on the vertex set excluding u and its leaves. We denote by γ s the full subgraph on u and all white nodes incident with u.
For example here γ s is the upper graph on the right and γ u is the lower graph on the right.

Lemma 8.17
Let γ ∈ Pt n , γ not a star. If γ has a bouquet at u then γ u ∈ Pt n . Proof Note that γ u inherits (a) and (b) of Definition 8.13 from γ . Denote the second black node of the bouquet at u by v. When splitting, the quadrilateral face involving u and v becomes a boundary face of γ u . All other faces of γ u are faces of γ . So (c) also holds.
It remains to see that (d) holds for γ u . The only vertices to check are i and i + r + 1. In γ , every adjacent pair of edges at i (or at i + r + 1 respectively) are part of a quadrilateral. When going to γ u , one extremal edge of the fan is removed, so the remaining edges still satisfy (d).  have degree three and let p 2 , p 4 be the other two white nodes adjacent to the black nodes of . Then the four full subgraphs p i , u j , p i+1 (with i, j appropriate) of γ are either boundary paths or part of quadrilaterals. In the former case, the image of γ under G has a boundary segment [ p i , p i+1 ]; in the latter case, it has a diagonal [ p i , p i+1 ]. In any case, T contains a triangulated quadrilateral p 1 , p 2 , p 3 , p 4 with diagonal [ p 1 , p 3 ] and the move ρ corresponds to the exchange [ p 1 , p 3 ] ←→ [p 2 , p 4 ] in T .
Given Lemma 8.21 we can then define move-ρ equivalence classes Pt n /∼ on Pt n . Furthermore, the number of equivalence classes are the same as |AE n |.
(8.23) There are many beautiful set sequences in the little Schröder combinatoric [31] (A n is a standard one, to which we have now added Pt n and X n ). It is one nice problem for future consideration to recast flip equivalence into cases such as Schröder's original  19 Postnikov's moves of alternating strand diagrams bracket sequences (the set n is the set of properly nested bracketings on a word of length n − 1, where there is always an (undrawn) outer bracketing and otherwise each bracket pair must contain at least two symbols-the bijection with A n is elementary via rooted versions of the dual trees of Sect. 3). As a taste of this game, the first few in this case are as follows: 3  Here flip equivalence collapses the entire first row to a point.
but this need not concern us.) The result now follows on noting that we may attach a (representative) tiling with any base on the left, and one from the subset with nontriangle base on the right. To illustrate (12) schematically: take a triangle with a distinguished base edge, glue tilings to the left hand edge and tilings with a tile of size ≥ 4 to the right hand edge.
Example: This gives b 4 = d 3 c 0 + d 2 c 1 + d 1 c 2 + d 0 c 3 (note that c 1 = 0), or, in tilings, with the base triangle shaded: Eliminating B, C from our formulae we obtain a quartic for D: where Y = z D. Computing the discriminant yields a dominant singularity of D at 0.19448…. Thus the asymptotic ratio of coefficients is the reciprocal lim n→∞ d n+1 d n = 5.1418 . . . .
(Finer details of the asymptotic behaviour can be determined-see for example [10].) One can compare this with the asymptotic ratio for the little Schröder numbers which is famously 3 + 2 √ 2 = 5.8284 . . .; and of course to the asymptotic ratio of sizes of the sets of all permutations, which is unbounded.
Equation (13) gives rise to a recurrence for the d n making it possible to compute several terms easily. Here, we list the first 15 terms: