1 |
Ideals in SemigroupsRodgers, Samuel A. 01 1900 (has links)
This thesis investigates ideals in semigroups.
|
2 |
Analyticam demonstrationem, propos. 47. primi elementorum Euclidis consensu amplissimae facultatis philosophicae in incluta lipsiensi adornatam,Christ, Andreas Stephanus, Thorinus, Andreas, January 1900 (has links)
Diss.--Leipzig (Andreas Thorinus, respondent). / At head of title: Q.D.B.V. Day of the month in title supplied in manuscript.
|
3 |
Analyticam demonstrationem, propos. 47. primi elementorum Euclidis consensu amplissimae facultatis philosophicae in incluta lipsiensi adornatam,Christ, Andreas Stephanus, Thorinus, Andreas, January 1900 (has links)
Diss.--Leipzig (Andreas Thorinus, respondent). / At head of title: Q.D.B.V. Day of the month in title supplied in manuscript.
|
4 |
Om Fermat's s. k. stora sats och nägra därmed sammanhängande undersökningarArwin, A. January 1914 (has links)
Adademisk afhandling--Lund.
|
5 |
On many-one degreesLiu, Shih-Chao, January 1965 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1965. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
|
6 |
A Generalization of the Weierstrass Approximation TheoremMurchison, Jo Denton 08 1900 (has links)
A presentation of the Weierstrass approximation theorem and the Stone-Weierstrass theorem and a comparison of these two theorems are the objects of this thesis.
|
7 |
Combinatorial Consequences of Relatives of the Lusternik-Schnirelmann-Borsuk TheoremSpencer, Gwen 01 May 2005 (has links)
Call a set of 2n + k elements Kneser colored when its n-subsets are put into classes such that disjoint n-subsets are in different classes. Kneser showed that k + 2 classes are sufficient to Kneser-color the n-subsets of a 2n + k element set. There are several proofs that this same number is necessary which rely on fixed-point theorems related to the Lusternik-Schnirelmann- Borsuk (LSB) theorem. By employing generalizations of these theorems we expand the proofs mentioned to obtain proofs of an original result we call the Subcoloring theorem. The Subcoloring theorem asserts the existence of a partition of a Kneser-colored set that halves its classes in a special way. We demonstrate both a topological proof and a combinatorial proof of this main result. We present an original corollary that extends the Subcoloring theorem by providing bounds on the size of the pieces of the asserted partition. Throughout, we formulate our results both in combinatorial and graph theoretic terminology.
|
8 |
Central limit theorems for associated random fields with applicationsKim, Tae-sung 21 November 1985 (has links)
A functional central limit theorem for a strictly stationary
associated random field in the general d-dimension case with an added
moment condition is proven. Functional central limit theorems for
associated random measures are also proven. More specifically,
conditions are given that imply weak convergence in the Skorohod
topology of a renormalized random measure to the d-dimensional
Wiener process. These results are applied to show new functional
central limit theorems for doubly stochastic point random fields and
Poisson cluster random measures. / Graduation date: 1986
|
9 |
Parallel analytic tableaux systemsJohnson, Robert David January 1996 (has links)
No description available.
|
10 |
Exploiting dependencies in search and inference mechanismsShanahan, Murray Patrick January 1987 (has links)
No description available.
|
Page generated in 0.0595 seconds