My Account Log in

3 options

Computational Synthetic Geometry / by Jürgen Bokowski, Bernd Sturmfels.

Online

Available online

View online
Math/Physics/Astronomy Library QA3 .L28 v.1-999 470,523,830,849:2nd ed. v.1000-1722,1762,1781,1799-2099,2100-2192-2218 2219-2223-2258,2260-2271,2273-2274-2277,2279-2281,2283-2289,2291,2293-2294,2296,2298-2299,2300-2311,2313-2379,2381-2383 2385,2388-2389
Loading location information...

Mixed Availability Some items are available, others may be requested.

Log in to request item
LIBRA QA3 .L28 Scattered vols.
Loading location information...

Mixed Availability Some items are available, others may be requested.

Log in to request item
Format:
Book
Author/Creator:
Bokowski, Jürgen, author.
Sturmfels, Bernd, 1962- author.
Contributor:
SpringerLink (Online service)
Series:
Lecture Notes in Mathematics, 0075-8434 ; 1355.
Lecture Notes in Mathematics, 0075-8434 ; 1355
Language:
English
Subjects (All):
Geometry.
Local Subjects:
Geometry.
Physical Description:
1 online resource (VIII, 172 pages).
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989.
System Details:
text file PDF
Summary:
Computational synthetic geometry deals with methods for realizing abstract geometric objects in concrete vector spaces. This research monograph considers a large class of problems from convexity and discrete geometry including constructing convex polytopes from simplicial complexes, vector geometries from incidence structures and hyperplane arrangements from oriented matroids. It turns out that algorithms for these constructions exist if and only if arbitrary polynomial equations are decidable with respect to the underlying field. Besides such complexity theorems a variety of symbolic algorithms are discussed, and the methods are applied to obtain new mathematical results on convex polytopes, projective configurations and the combinatorics of Grassmann varieties. Finally algebraic varieties characterizing matroids and oriented matroids are introduced providing a new basis for applying computer algebra methods in this field. The necessary background knowledge is reviewed briefly. The text is accessible to students with graduate level background in mathematics, and will serve professional geometers and computer scientists as an introduction and motivation for further research.
Contents:
Preliminaries
On the existence of algorithms
Combinatorial and algebraic methods
Algebraic criteria for geometric realizability
Geometric methods
Recent topological results
Preprocessing methods
On the finding of polyheadral manifolds
Matroids and chirotopes as algebraic varieties.
Other Format:
Printed edition:
ISBN:
9783540460138
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account