1 |
Algorithms for bivariate zonoid depth /Gopala, Harish, January 1900 (has links)
Thesis (M.C.S.)--Carleton University, 2004. / Includes bibliographical references (p. 27-29). Also available in electronic format on the Internet.
|
2 |
Tight bound edge guard results on art gallery problems /Yiu, Siu-ming. January 1996 (has links)
Thesis (Ph. D.)--University of Hong Kong, 1997. / Includes bibliographical references (leaf 98-103).
|
3 |
Symmetries, colorings, and polyanumeration /Nieman, Jeremy. January 2007 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaf 34).
|
4 |
A class of combinatorial geometries arising from partially ordered sets /Denig, William Allen January 1976 (has links)
No description available.
|
5 |
Characterizations of Some Combinatorial GeometriesYoon, Young-jin 08 1900 (has links)
We give several characterizations of partition lattices and projective geometries. Most of these characterizations use characteristic polynomials. A geometry is non—splitting if it cannot be expressed as the union of two of its proper flats. A geometry G is upper homogeneous if for all k, k = 1, 2, ... , r(G), and for every pair x, y of flats of rank k, the contraction G/x is isomorphic to the contraction G/y. Given a signed graph, we define a corresponding signed—graphic geometry. We give a characterization of supersolvable signed graphs. Finally, we give the following characterization of non—splitting supersolvable signed-graphic geometries : If a non-splitting supersolvable ternary geometry does not contain the Reid geometry as a subgeometry, then it is signed—graphic.
|
6 |
Tight bound edge guard results on art gallery problems姚兆明, Yiu, Siu-ming. January 1996 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
|
7 |
An Erlanger program for combinatorial geometries.Kung, Joseph Pee Sin January 1978 (has links)
Thesis. 1978. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Vita. / Bibliography: leaves 132-137. / Ph.D.
|
8 |
Embedding geometric lattices and combinatorial designs into projective geometries or symmetric designs with the same number of hyperplanes or blocks /Barnes, Martha Lynn January 1977 (has links)
No description available.
|
9 |
The Maximum Size of Combinatorial Geometries Excluding Wheels and Whirls as MinorsHipp, James W. (James William), 1956- 08 1900 (has links)
We show that the maximum size of a geometry of rank n excluding the (q + 2)-point line, the 3-wheel W_3, and the 3-whirl W^3 as minor is (n - 1)q + 1, and geometries of maximum size are parallel connections of (q + 1)-point lines. We show that the maximum size of a geometry of rank n excluding the 5-point line, the 4-wheel W_4, and the 4-whirl W^4 as minors is 6n - 5, for n ≥ 3. Examples of geometries having rank n and size 6n - 5 include parallel connections of the geometries V_19 and PG(2,3).
|
10 |
Extremal semi-modular functions and combinatorial geometriesNguyen, Hien Quang January 1975 (has links)
Thesis. 1975. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics. / Vita. / Bibliography: leaves 132-133. / by Nguyen Quang Hien. / Ph.D.
|
Page generated in 0.1095 seconds