𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The covering number of the elements of a matroid and generalized matrix functions

✍ Scribed by J.A. Dias da Silva; Rosário Fernandes; Amélia Fonseca

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
933 KB
Volume
271
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

Let S be a nonempty finite set with cardinality m. Let M be a matroid on S with no loops. The covering number of an element x in S is the smallest positive integer k such that x is a coloop of the union of k copies of M. We investigate connections between the structure of M and the values of the covering numbers of elements of S. Applications to the study of the rank partition and generalized matrix functions are presented.

📜 SIMILAR VOLUMES

The covering number of elements of a mat
The covering number of elements of a matroid and associated transformations
✍ Rosário Fernandes 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Let S be a nonempty finite set with cardinality m. Let M = (S, I(M)) be a matroid on S. Let x be an element of S which is not a loop of M. The covering number of x in M is the smallest positive integer s such that x is a coloop of the union of s copies of M. We investigate relations between the cove

The chromatic covering number of a graph
The chromatic covering number of a graph
✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

A partial ordering of CSm defined by the
A partial ordering of CSm defined by the generalized matrix functions
✍ Jun Wu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 238 KB

We present a description of a partial ordering of the complex full symmetric group algebra, CSm, via generalized matrix functions, dr(A), defined on the set of all m x m complex matrices A. We show that for f: S,~ --\* C, if dr(A) = 0 for all positive semidefinite Hermitian matrices A, then f = 0. T

On the computation of matrix elements be
On the computation of matrix elements between numerical wave functions: The canonical functions method
✍ H. Kobeissi; M. Dagher; A. El-Hajj; M. Kobeissi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 727 KB

The problem of the computation of the matrix elements Z ( v , v ' ; k ) = [ q U ( r ) ( r -rJkqUr(r)dr, is considered when q u ( r ) and q J r ) are eigenfunctions related to a diatomic potential of the RKR type (defined by the coordinates of its turning points Pi with polynomial interpolations). Th