A new axiom system for matroids: 1. Uniform matroid recognition
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2017
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916124057141248 |
|---|---|
| author | Chaourar, Brahim |
| author_facet | Chaourar, Brahim |
| contents | In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid. This problem is intractable if we use an independence or an equivalent oracle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1703_03744 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | A new axiom system for matroids: 1. Uniform matroid recognition Chaourar, Brahim Combinatorics Primary 05B35, Secondary 52B40 In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid. This problem is intractable if we use an independence or an equivalent oracle. |
| title | A new axiom system for matroids: 1. Uniform matroid recognition |
| topic | Combinatorics Primary 05B35, Secondary 52B40 |
| url | https://arxiv.org/abs/1703.03744 |