Covering numbers under small perturbations
Let \({\mathcal M}([n])\) be a matroid without loops. Let \({\mathcal M}^{(k)}\) be the sum of \(k\) copies of \({\mathcal M}([n]).\) The covering number of \(x, x\in [n],\) is the smallest positive integer \(s_x(M)\) such that \(x\) is a coloop of \({\mathcal M}^{(s)}\); see \textit{J. A. Dias da Silvia, R. Fernandes} and \textit{A. Fonseca} [Linear Algebra Appl. 271, 191-219 (1998; Zbl 0889.05036)]. This notion is particularly interesting if \({\mathcal M}([n])\) is representable (coordinatizable) over a field \(\mathbb{F}\). The author investigates how the covering number of the elements of a representable matroid \({\mathcal M}(S),\) \(S:=\{s_1,\dots, s_n\} \subset \mathbb{F}^d,\) can be changed under arbitrary small perturbations of the vectors \(s_1,\dots, s_n.\)
- The covering number of elements of a matroid and associated transformations
- On the covering number of a matroid element
- The covering number of the elements of a matroid and generalized matrix functions
- Extensions of matroid covering and packing
- Connected coverings and an application to oriented matroids
- Flags and equality of tensors
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 4097397 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 2187686 (Why is no real title available?)
- On the covering number of a matroid element
- On the μ-colorings of a matroid
- Rank Partitions under Small Perturbations
- The covering number of elements of a matroid and associated transformations
- The covering number of the elements of a matroid and generalized matrix functions
- The covering number of the elements of a matroid and generalized matrix functions
- Small perturbations and pairs of matrices that have the same immanent
- Rank partitions and covering numbers under small perturbations of an element
- Rank Partitions under Small Perturbations
- Covering vectors by spaces in perturbed graphic matroids and their duals
- The covering number of elements of a matroid and associated transformations
- On the term rank partitions of matrices in
This page was built for publication: Covering numbers under small perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611878)