Delucchi, Emanuele and Settepanella, Simona (2010) Combinatorial polar orderings and recursively orderable arrangements. Advances in Applied Mathematics, 44 (2). pp. 124-144. ISSN 01968858
Full text not available from this repository. (Request a copy)Abstract
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and reach thereby a weakening of the conditions required to actually determine such orderings. A class of arrangements for which the construction of the minimal complex is particularly easy, called recursively order- able arrangements, can therefore be combinatorially defined. We initiate the study of this class, giving a complete characterization in dimension 2 and proving that every supersolvable complexified arrangement is recursively orderable.
| Item Type: | Scientific journal article, Newspaper article or Magazine article |
|---|---|
| Subjects: | Mathematical sciences |
| Department/unit: | Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull'intelligenza artificiale |
| Depositing User: | Emanuele Delucchi |
| Date Deposited: | 07 Jun 2022 09:16 |
| Last Modified: | 07 Jun 2022 09:22 |
| URI: | http://repository.supsi.ch/id/eprint/13406 |
Actions (login required)
 |
View Item |