{"paper":{"title":"The smallest line arrangement which is free but not recursively free","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiraku Kawanoue, Takeshi Nozawa, Takuro Abe","submitted_at":"2014-06-23T07:24:34Z","abstract_excerpt":"In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, the conjecture by Terao asserting that freeness depends only on combinatorics holds true. A long standing problem whether all free arrangements are recursively free or not is settled by Cuntz and Hoge very recently, by giving a free but non-recursively free plane arrangement consisting of 27 planes.\n  In this paper, we construct a free but non-recursively free plane arrangement consisting of 13 planes, and show that this example is the smallest in the sense of the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5820","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}