This paper is motivated by the problem of subdividing a prismatic mesh to a tetrahedral mesh (without inserting Steiner points) so as to not only match arbitrarily prescribed boundary conditions but also allow arbitrary topologies in the base mesh. We explore all possible combinations of these two factors, and propose a complete solution to this 3D problem by converting it to an equivalent 2D graph problem, called cutting flow problem. For each case, we not only prove the sufficient and necessary condition for the existence of solutions, but also provide linear and provable algorithms to compute a solution whenever there is one.

Nakaoka and Palu introduced the notion of extriangulated categories by extracting the similarities between exact categories and triangulated categories. In this paper, we study cotorsion pairs in a Frobenius extriangulated category $\C$. Especially, for a $2$-Calabi-Yau extriangulated category $\C$ with a cluster structure, we describe the cluster substructure in the cotorsion pairs. For rooted cluster algebras arising from $\C$ with cluster tilting objects, we give a one-to-one correspondence between cotorsion pairs in $\C$ and certain pairs of their rooted cluster subalgebras which we call complete pairs. Finally, we explain this correspondence by an example relating to a Grassmannian cluster algebra.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!