Results 1 
5 of
5
CLASSIFYING THICK SUBCATEGORIES OF PERFECT COMPLEXES
, 2006
"... Given a commutative coherent ring R, a bijective correspondence between the thick subcategories of perfect complexes Dper(R) and the Serre subcategories of finitely presented modules is established. To construct this correspondence, properties of the Ziegler and Zariski topologies on the set of (i ..."
Abstract
 Add to MetaCart
Given a commutative coherent ring R, a bijective correspondence between the thick subcategories of perfect complexes Dper(R) and the Serre subcategories of finitely presented modules is established. To construct this correspondence, properties of the Ziegler and Zariski topologies on the set
Seamless Surface Mappings
"... Figure 1: Two bijective seamless mappings between models of two humans are shown in (c),(d), generated by our algorithm from the two different cutplacements in (a),(b) (respectively), cuts visualized as colored curves. The two maps interpolate the same set of usergiven landmarks, shown as colored ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, and in fact for the two different cutplacements, the produced maps are identical. We introduce a method for computing seamless bijective mappings between two surfacemeshes that interpolates a given set of correspondences. A common approach for computing a map between surfaces is to cut the surfaces
ON AN INDEX TWO SUBGROUP OF PUZZLE AND LITTLEWOODRICHARDSON TABLEAU Z2 × S3Symmetries (Extended Abstract)
, 2009
"... We consider an action of the dihedral group Z2 × S3 on LittlewoodRichardson tableaux which carries a linear time action of a subgroup of index two. This index two subgroup action on KnutsonTaoWoodward puzzles is the group generated by the puzzle mirror reflections with label swapping. One shows ..."
Abstract
 Add to MetaCart
and LittlewoodRichardson tableaux may be put in corrspondence by linear algebraic maps. We conclude that, regarding the symmetries, the behaviour of the various combinatorial models for LittlewoodRichardson coefficients is similar, and the bijections exhibiting them are in a certain sense unique.
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
 Add to MetaCart
of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an npath of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond