My Account Log in

1 option

Excluding a line from complex-representable matroids / Jim Geelen, Peter Nelson, Zach Walsh.

Math/Physics/Astronomy Library QA3 .A57 no.1523
Loading location information...

Available This item is available for access.

Log in to request item
Format:
Book
Author/Creator:
Geelen, James F., author.
Nelson, Peter, 1986- author.
Walsh, Zach, author.
Series:
Memoirs of the American Mathematical Society ; v. 1523.
Memoirs of the American Mathematical Society, 0065-9266 ; v. 1523
Language:
English
Subjects (All):
Matroids.
Vector spaces.
Algebras, Linear.
Graph theory.
Physical Description:
v, 91 pages ; 26 cm.
Place of Publication:
Providence, Rhode Island : American Mathematical Society, 2024
Summary:
For each positive integer t and each sufficiently large integer r, we show that the maximum number of elements of a simple, rank-r, C-representable matroid with no U₂, t+₃-minor is t(r2)+r. We derive this as a consequence of a much more general result concerning matroids on group-labeled graphs.
Contents:
Chapter 1. Introduction
Chapter 2. Results
Chapter 3. Preliminaries
Chapter 4. Gamma-lift matroids
Chapter 5. Finding a Dowling geometry
Chapter 6. Exploiting density
Chapter 7. Exploiting connectivity
Chapter 8. The main result
Chapter 9. An exact theorem
Chapter 10. Proofs
Bibliography.
Notes:
Includes bibliographical references.
ISBN:
1470471876
9781470471873
OCLC:
1477765387

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