No abstract uploaded!

Suppose G is a reductive algebraic group, T is a Cartan subgroup of G, N= Norm (T), and W= N/T is the Weyl group. If w W has order d, it is natural to ask about the orders lifts of w to N. It is straightforward to see that the minimal order of a lift of w has order d or 2d, but it can be a subtle question which holds. We first consider the question of when W itself lifts to a subgroup of N (in which case every element of W lifts to an element of N of the same order). We then consider two natural classes of elements: regular and elliptic. In the latter case all lifts of w are conjugate, and therefore have the same order. We also consider the twisted case.

We present a method for organizing a heterogeneous collection of 3D shapes for overview and exploration. Instead of relying on quantitative distances, which may become unreliable between dissimilar shapes, we introduce a qualitative analysis which utilizes multiple distance measures but only in cases where the measures can be reliably compared. Our analysis is based on the notion of quartets, each defined by two pairs of shapes, where the shapes in each pair are close to each other, but far apart from the shapes in the other pair. Combining the information from many quartets computed across a shape collection using several distance measures, we create a hierarchical structure we call categorization tree of the shape collection. This tree satisfies the topological (qualitative) constraints imposed by the quartets creating an effective organization of the shapes. We present categorization trees computed on various collections of shapes and compare them to ground truth data from human categorization. We further introduce the concept of degree of separation chart for every shape in the collection and show the effectiveness of using it for interactive shapes exploration.

No abstract uploaded!

No abstract uploaded!