We conjecture that if we choose B to be finite dimensional, the surface is unique, up to rotating certain collections of tiles.
Statement
We conjecture that if we choose B to be finite dimensional, the surface is unique, up to rotating certain collections of tiles. Theorem ([2]). The following are equivalent: (1) A is a string algebra. (2) A = B/R with B locally gentle and R is an ideal generated by paths of length \geq 2 such that every oriented cycle in A has a relation. (3) A is a labelled tiling algebra. Laminations for tiled surfaces, [3]. In the second part of the talk we introduce the notion of laminations on a surface tiled by polygon: every tile is a polygon of size \geq 3 and with at most one boundary edge. The laminations in [4], see also [5], can be viewed as the case of a triangulated surface. In [3], we aim to determine the size of a maximal lamination and to define a mutation operation on curves in a maximal lamination. Laminations are collections of non-crossing curves such that whenever a curve successively crosses two edges of a tile, these two edges have to be adjacent. Let {e1 , . . . , en , en+1 , . . . , em } be the arcs in the tiling where e1 , . . . , en are the arcs whose endpoints are both punctures and en+1 , . . . , em are arcs with endpoints a puncture and a vertex on the boundary, m > n. Any curve c crossing the tiling gives a coordinate vector with entries in Zm as follows: We say that c crosses ei positively, if the arc ei together with the immediate predecessor and successor of arcs crossed by c form an S-shape. We say that c crosses ei negatively, if they form a Z-shape. And c crosses ei trivially if it crosses these three arcs in a fan (or does not meet
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.