Topological Criteria for $k-$Formal Arrangements
| dc.creator | Tohaneanu, Stefan Ovidiu | |
| dc.date | 2006-08-17 | |
| dc.date.accessioned | 2026-07-07T07:21:54Z | |
| dc.date.available | 2026-07-07T07:21:54Z | |
| dc.description | We prove a criterion for $k-$formality of arrangements, using a complex constructed from vector spaces introduced in \cite{bt}. As an application, we give a simple description of $k-$formality of graphic arrangements: Let $G$ be a connected graph with no loops or multiple edges. Let $Δ$ be the flag (clique) complex of $G$ and let $H_{\bullet}(Δ)$ be the homology of the chain complex of $Δ$. If $\mathcal A_G$ is the graphic arrangement associated to $G$, we will show that $\mathcal A_G$ is $k-$formal if and only if $H_i(Δ)=0$ for every $i=1,...,k-1$. | |
| dc.description | 9 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0608448 | |
| dc.identifier | http://arxiv.org/abs/math/0608448 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115466 | |
| dc.subject | Combinatorics | |
| dc.subject | 52C35 (Primary); 18G35 (Secondary) | |
| dc.title | Topological Criteria for $k-$Formal Arrangements | |
| dc.type | text |