✦ LIBER ✦

The Covering Number of the GroupPSLn(F)

✍ Scribed by Arieh Lev

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 253 KB
Volume: 182
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0162

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be the group PSL F , where n G 3, F is a field, and F G 4. Assume, n further, that if n s 3, then F is either finite or algebraically closed. Given an k Ä 4 integer k and a subset A : G, denote A s a a иии a ¬ a , a , . . . , a g A . 1 2 k 1 2 k Ž . k Denote by cn G the minimal value of k such that C s G for every nontrivial Ž . conjugacy class C of G. It is shown that cn G s n. Related results on factoriza-Ž . Ž . tions of matrices in GL F and SL F are also discussed.

📜 SIMILAR VOLUMES

The covering number and the uniformity o

The covering number and the uniformity of the ideal ℐf

✍ Noboru Osuga 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract Let __f, g__ ∈ ^__ω__^ __ω__ . We will denote by __g__ ≫ __f__ that for every __k__ < __ω__, __f__ (__n__ ^__k__^ ) ≤ __g__ (__n__ ) except for finitely many __n__ . The ideal ℐ~__f__~ on ^__ω__^ 2 is the collection of sets __X__ such that, for some __g__ ≫ __f__ and __τ__ ∈ ∏~__n__ <_

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

The covering number in learning theory

✍ Ding-Xuan Zhou 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Normative F wave values and the number o

Normative F wave values and the number of recorded F waves

✍ Dr. Morris A. Fisher; Dr. Bruce Hoffen; Dr. Cheryl Hultman 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

Neighborhood unions and the cycle cover

Neighborhood unions and the cycle cover number of a graph

✍ Guantao Chen; Ronald J. Gould; Michael S. Jacobson; Richard H. Schelp 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## Abstract For several years, the study of neighborhood unions of graphs has given rise to important structural consequences of graphs. In particular, neighborhood conditions that give rise to hamiltonian cycles have been considered in depth. In this paper we generalize these approaches to give a

The number of {□, →}-logics

✍ George F. Schumm 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB