Let ∆ be one of the dual polar spaces DQ(8, q), DQ−(7, q), and let e : ∆ → Σ denote the spin-embedding of ∆. We show that e(∆) is a two-intersection set of the projective space Σ. Moreover, if ∆ ∼= DQ−(7, q), then e(∆) is a (q + 1)-tight set of a nonsingular hyperbolic quadric Q(7, q) of Σ ∼= PG(7, q). This (q + 1)-tight set gives rise to more examples of (q + 1)-tight sets of hyperbolic quadri...

Worked examples are instructional devices that provide an expert's problem solution for a learner to study. Worked-examples research is a cognitive-experimental program that has relevance to classroom instruction and the broader educational research community. A framework for organizing the findings of this research is proposed, leading to instructional design principles. For instance, one inst...

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10and 13-dimensional polytopes. We analyze in detail linkedness of polytopes on at most (6d + 7)/5 vertices. In that case, a sharp lower bound on minimal linkedness is derived, and ...

SMK Islam Kunjang is one of vocational high schools in district. a relatively developing school any things; such as the system administration, relation, or teaching methodology technique, because it runs for about 14 years old. located suburbs. Absolutely, most students were less spirit to study more over English. The teacher has been trying determine technique especially writing. students’ wri...

..................................................................................................................................... 3 INTRODUCTION .............................................................................................................................. 3 THE GRM TECHNIQUE ........................................................................................................

2 Categories and examples 7 2.1 The definition of a category . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.1 Categories as graphs with composition . . . . . . . . . . . . . . . . . . . . . . 7 2.1.2 Categories as partial semigroups . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.1.3 Categories as enriched categories . . . . . . . . . . . . . . . . . . . . . . . . ....