✦ LIBER ✦

The covering number in learning theory

✍ Scribed by Ding-Xuan Zhou

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 249 KB
Volume: 18
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.2002.0635

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Covering Number of the GroupPSLn(F)

✍ Arieh Lev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 253 KB

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

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 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 natural numbers in constructive set

The natural numbers in constructive set theory

✍ Michael Rathjen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 1 views

## Abstract Constructive set theory started with Myhill's seminal 1975 article [8]. This paper will be concerned with axiomatizations of the natural numbers in constructive set theory discerned in [3], clarifying the deductive relationships between these axiomatizations and the strength of various

Bounds in the Theory of Finite Covers

✍ David M. Evans; Osama A. Rashwan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We give an upper bound for the number of conjugacy classes of closed subgroups of the full wreath product FWr W Sym which project onto Sym . Here, is infinite, W is the set of n-tuples of distinct elements from (for some finite n), F is a finite nilpotent group, and the topology on the wreath produc

A contextual theory of learning and the

A contextual theory of learning and the learning organization

✍ Povl Erik Jensen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract Learning and accumulation of new knowledge in an organization always require two transformation processes: one transformation process from data to information and another from information to (new) knowledge. This is so because only information, and not knowledge, can be shared and sprea