We study the functorially finite maximal rigid subcategories in 2-CY triangulated categories and their endomorphism algebras. Cluster tilting subcategories are obviously functorially finite and maximal rigid; we prove that the converse is true if the 2-CY triangulated categories admit a cluster tilting subcategory. As a generalization of a result of Keller and Reiten (2007) [KR], we prove that any functorially finite maximal rigid subcategory is Gorenstein with Gorenstein dimension at most 1. Similar as cluster tilting subcategory, one can mutate maximal rigid subcategories at any indecomposable object. If two maximal rigid objects are reachable via simple mutations, then their endomorphism algebras have the same representation type.

No abstract uploaded!

No abstract uploaded!

The first part of this paper describes some important underlying themes in the mathematical theory of continuum mechanics that are distinct from formulating and analyzing governing equations. The main part of this paper is devoted to a survey of some concrete, conceptually simple, pretty problems that help illuminate the underlying themes. The paper concludes with a discussion of the crucial role of invariant constitutive equations in computation.

This investigation studies nonemptiness problems of plane edge coloring with three colors. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of p colors are arranged side by side such that the touching edges of the adjacent tiles have the same colors. Given a basic set B of Wang tiles, the nonemptiness problem is to determine whether or not Σ(B) 6= ∅, where Σ(B) is the set of all global patterns on Z2 that can be constructed from the Wang tiles in B. Wang’s conjecture is that for any B of Wang tiles, Σ(B) 6= ∅ if and only if P(B) 6= ∅, where P(B) is the set of all periodic patterns on Z2 that can be generated by the tiles in B. When p ≥ 5, Wang’s conjecture is known to be wrong. When p = 2, theconjecture is true. This study proves that when p = 3, the conjecture is also true. If P(B) 6= ∅, then B has a subset B′ of minimal cycle generators such that P(B′) 6= ∅ and P(B′′) = ∅ for B′′ $ B′. This study demonstrates that the set C(3) of all minimal cycle generators contains 787, 605 members that can be classified into 2, 906 equivalence classes. N(3) is the set of all maximal non-cycle generators : if B ∈ N(3), then P(B) = ∅ and P(B ˜) 6= ∅ for B ˜ % B. Wang’s conjecture is shown to be true by proving that B ∈ N(3) implies Σ(B) = ∅.