Truncations of principal geometries
dc.contributor.author | Brualdi, Richard A. | en_US |
dc.contributor.author | Dinolt, George W. | en_US |
dc.date.accessioned | 2006-04-07T16:40:59Z | |
dc.date.available | 2006-04-07T16:40:59Z | |
dc.date.issued | 1975 | en_US |
dc.identifier.citation | Brualdi, Richard A., Dinolt, George W. (1975)."Truncations of principal geometries." Discrete Mathematics 12(2): 113-138. <http://hdl.handle.net/2027.42/22167> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-45FT6FF-4H/2/510c7421093ca705cca3170a0f4647cd | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/22167 | |
dc.description.abstract | We investigate the class of principal pregeometries (free simplicial geometries with spanning simplex) which form an important subclass of the class of transversal pregeometries (free simplicial geometries). We give a coordinate-free method for imbedding a transversal pregeometry on a simplex as a free simplicial pregeometry which makes use only of the set-theoretic properties of a presentation of the transversal pregeometry. We introduce the notion of an (r, k)-principal set as a generalization of principal basis and prove the collection of (r, k)-principal sets of a rank k pregeometry, if non-empty, are the bases of another pregeometry whose structure is determined. An algorithm for constructing principal sets is given. We then characterize truncations of principal geometries in terms of the existence of a principal set. We do this by erecting a given pregeometry to a free simplicial pregeometry with spanning simplex. The erection is the freest of all erections of the given pregeometry. | en_US |
dc.format.extent | 3531620 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Truncations of principal geometries | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Dearborn, Mich. 48126, USA | en_US |
dc.contributor.affiliationother | Department of Mathematics, University of Wisconsin, Madison, Wisc. 53706, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/22167/1/0000598.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(75)90027-8 | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.