A Way with Words: Book 3 Student's book: Vocabulary Development Activities for Learners of English (Bk. 3)

Description

A Way with Words is a series of learner-centred materials designed to help students increase their vocabulary and develop essential skills and strategies for more effective learning, organizing and storing of new words and phrases. Students learn by actively using the vocabulary presented in meaningful and varied ways. A special feature is the section of self-study activities in each unit, which provides learners with a wider range of situations in which the words can be used, and further techniques for learning them. Book 3 is for upper intermediate students and covers approximately 1000 items of new vocabulary. This series introduces a range of tasks and exercise types to maintain a high level of learner interest. It pays particular attention to: important lexical features including collocation, compounding, affixation and aspects of word grammar; contains appendices on word building and provides regular revision and recycling. Cover Title Copyright CONTENTS Introduction List of talks Participants SOME RECENT COMBINATORIAL APPLICATIONS OF BORSUK-TYPE THEOREMS 1. INTRODUCTION 2. DISJOINT SIMPLICES 3. SPLITTING NECKLACES 4. THE GENERAL KNESER PROBLEM 5. OPEN PROBLEMS REFERENCES ON EXTREMAL FINITE SETS IN THE SPHERE AND OTHER METRIC SPACES 1 HARMONICS ON Sd AND FINITE SETS IN THE SPHERE Sd 2 COMBINATORICS OF FINITE SETS IN COMPACT SYMMETRIC SPACES OF RANK 1 3 COMBINATORICS OF FINITE SUBSETS IN NON-COMPACT SYMMETRIC SPACES OF RANK ONE 4 RIGID t-DESIGNS IN Sd REFERENCE METRIC AND GEOMETRIC PROPERTIES OF SETS OF PERMUTATIONS ABSTRACT INTRODUCTION 2 Bounds for s-distance sets and groups 3 Geometric sets and groups 4 Some generalisations 5 An application REFERENCES INFINITE GEOMETRIC GROUPS AND SETS 1 INTRODUCTION 2 Geometric Groups 3 Geometric Sets REFERENCES Intersection and Containment Problems Without Size Restrictions 0. Introduction 1. The Kleitman Lemma 2. No k Pairwise Disjoint Sets 3. No k Disjoint Sets Along with Their Union 4. No Two Sets with Their Union 5. Families in which no Set is Covered by the Union of Two Others 6. Families in which no Member Contains the Intersection of Two Others 7. Union-Free Families: Uniform Case 8. Union-Free Families without Size Restrictions References DISTANCE-TRANSITIVE GRAPHS OF VALENCY k, 8