It is known that many (upper) cluster algebras possess different kinds of good bases which contain the cluster monomials and are parametrized by the tropical points of cluster Poisson varieties. For a large class of upper cluster algebras (injective-reachable ones with full rank coefficients), we describe all of its bases with these properties. Moreover, we show the existence of the generic basis for them. In addition, we prove that Bridgeland's representation theoretic formula is effective for their theta functions (weak genteelness). Our results apply to (almost) all well-known cluster algebras arising from representation theory or higher Teichmüller theory, including quantum affine algebras, unipotent cells, double Bruhat cells, skein algebras over surfaces, where we change the coefficients if necessary so that the full rank assumption holds.

Let N be a three dimensional Riemannian manifold. Let E be a closed embedded surface in N. Then it is a question of basic interest to see whether one can deform: in its isotopy class to some" canonical" embedded surface. From the point of view of geometry, a natural" canonical" surface will be the extremal surface of some functional defined on the space of embedded surfaces. The simplest functional is the area functional. The extremal surface of the area functional is called the minimal surface. Such minimal surfaces were used extensively by Meeks-Yau [MY21 in studying group actions on three dimensional manifolds.

No abstract uploaded!

We give a detailed proof of Siu’s theorem on extendibility of holomorphic vector bundles of rank larger than one, and prove a corresponding extension theorem for holomorphic sprays. We apply this result to study ellipticity properties of complements of compact subsets in Stein manifolds. In particular we show that the complement of a closed ball in $\mathbb{C}^{n}, n \geq3$ , is not subelliptic.

In this paper, we tackle the problem of tiling a domain with a set of deformable templates. A valid solution to this problem completely covers the domain with templates such that the templates do not overlap. We generalize existing specialized solutions and formulate a general layout problem by modeling important constraints and admissible template deformations. Our main idea is to break the layout algorithm into two steps: a discrete step to lay out the approximate template positions and a continuous step to refine the template shapes. Our approach is suitable for a large class of applications, including floorplans, urban layouts, and arts and design.