The Mathematical Background

The dissertation has four chapters: Chapter 1 - Background Materials; Chapter 2 - Analysis of an Algorithm in Indefinite Quadratic Programming; Chapter 3 - Qualitative Properties of the Minimum Sum-of-Squares Clustering Problem; Chapter 4 - Some Incremental Algorithms for the Clustering Problem.

142p armyofthedead 23-06-2021 34 3   Download

We show that every subset of SL2 (Z/pZ) grows rapidly when it acts on itself by the group operation. It follows readily that, for every set of generators A of SL2 (Z/pZ), every element of SL2 (Z/pZ) can be expressed as a product of at most O((log p)c ) elements of A ∪ A−1 , where c and the implied constant are absolute. 1. Introduction 1.1. Background. Let G be a finite group. Let A ⊂ G be a set of generators of G. By definition, every g ∈ G can be expressed as a product of elements of...

24p dontetvui 17-01-2013 46 8   Download

We establish new results and introduce new methods in the theory of measurable orbit equivalence, using bounded cohomology of group representations. Our rigidity statements hold for a wide (uncountable) class of groups arising from negative curvature geometry.

55p noel_noel 17-01-2013 63 7   Download