A new bound for the Carathéodory rank of the bases of a matroid
Abstract
References
Index Terms
- A new bound for the Carathéodory rank of the bases of a matroid
Recommendations
Improved bound for the Carathéodory rank of the bases of a matroid
Let M be a matroid on m elements and let r be its rank. We show that any vector in the integer cone of the incidence vectors of bases of M can be written as nonnegative integer combination of at most m + r - 1 incidence vectors of bases of M.
Bounding the number of bases of a matroid
AbstractThomassen proved in 2010 that the number of spanning trees of a graph with vertex degrees d 1 , d 2 , … , d n is at most d 1 d 2 … d n − 1. This note generalizes this result to show that if A is a matrix representing a rank-r matroid M ...
An Explicit Bound for Stability of Sinc Bases
ICINCO 2015: Proceedings of the 12th International Conference on Informatics in Control, Automation and Robotics - Volume 1It is well known that exponential Riesz bases are stable. The celebrated theorem by Kadec shows that 1/4 is a
stability bound for the exponential basis on L2(-p,p). In this paper we prove that a/p (where a is the Lamb-
Oseen constant) is a stability ...
Comments
Information & Contributors
Information
Published In
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIAM: Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Check for updates
Qualifiers
- Article
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 278Total Downloads
- Downloads (Last 12 months)61
- Downloads (Last 6 weeks)10
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in