A simple proof that any additive basis has only finitely many essential subsets
| dc.creator | Farhi, Bakir | |
| dc.date | 2008-07-22 | |
| dc.date | 2008-07-23 | |
| dc.date.accessioned | 2026-07-07T09:52:05Z | |
| dc.date.available | 2026-07-07T09:52:05Z | |
| dc.description | Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due to B. Deschamps and the author states that any additive basis has only finitely many essential subsets (see ``Essentialité dans les bases additives, J. Number Theory, 123 (2007), p. 170-192''). The aim of this note is to give a simple proof of this theorem. | |
| dc.description | 3 pages | |
| dc.identifier | https://arxiv.org/abs/0807.3461 | |
| dc.identifier | http://arxiv.org/abs/0807.3461 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/165470 | |
| dc.subject | Number Theory | |
| dc.subject | 11B13 | |
| dc.title | A simple proof that any additive basis has only finitely many essential subsets | |
| dc.type | text |