Solving schubert problems with Littlewood-Richardson homotopies

doi:10.1145/1837934.1837971

Solving schubert problems with Littlewood-Richardson homotopies

Full Text:

Pdf

Buy this Article

Authors:	Frank Sottile	Texas A&M University, College Station, TX
	Ravi Vakil	Stanford University, Stanford, CA
	Jan Verschelde	University of Illinois at Chicago, Chicago, IL

Published in:

· Proceeding

ISSAC '10 Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

Pages 179-186
ACM New York, NY, USA ©2010
table of contents ISBN: 978-1-4503-0150-3 doi>10.1145/1837934.1837971

	2010 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 5 · Downloads (cumulative): 40 · Citation Count: 0

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- ISSAC'13

Share:

|

Tags: algorithms combinatorics continuation geometric littlewood-richardson rule grassmannian homotopies numerical schubert calculus path following polynomial system roots of nonlinear equations schubert problems

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder