{
  "id": "2106.00975",
  "version": "v1",
  "published": "2021-06-02T06:42:58.000Z",
  "updated": "2021-06-02T06:42:58.000Z",
  "title": "Weaker forms of unconditionality of bases in greedy approximation",
  "authors": [
    "Fernando Albiac",
    "Jose L. Ansorena",
    "Miguel Berasategui",
    "Pablo M. Berna",
    "Silvia Lassalle"
  ],
  "categories": [
    "math.FA"
  ],
  "abstract": "In this paper we study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from being unconditional and use this concept to give a new characterization of nearly unconditional bases.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-06-02T06:42:58.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "41A65",
      "41A46",
      "41A17",
      "46B15",
      "46B45"
    ],
    "keywords": [
      "greedy approximation",
      "weaker forms",
      "thresholding greedy algorithm",
      "unconditionality properties",
      "quasi-greedy bases"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}