Covering numbers under small perturbations
type: Item
instance of: scholarly article
title: Covering numbers under small perturbations
zbMATH Open document ID: 0995.05030
DOI: 10.1016/S0024-3795(02)00295-1
author: Rosário Fernandes
published in: Linear Algebra and its Applications
publication date: 2002-08-28T00:00:00Z
review text: 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.\)
reviewed by: Raul Cordovil
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 1790260
zbMATH Keywords: covering numbers
zbMATH Keywords: matroids
MaRDI profile type: Publication
cites work: Q3824422
cites work: On the μ-colorings of a matroid
cites work: The covering number of the elements of a matroid and generalized matrix functions
cites work: Q5460883
cites work: Flags and equality of tensors
cites work: The covering number of elements of a matroid and associated transformations
cites work: On the covering number of a matroid element
cites work: Rank Partitions under Small Perturbations
cites work: Q3135082
cites work: Q4111952
full work available at URL: s0024-3795(02)00295-1
OpenAlex ID: W2092429114
description: scientific article; zbMATH DE number 1790260