Topological Criteria for $k-$Formal Arrangements

Details Topological Criteria for $k-$Formal Arrangements Topological Criteria for $k-$Formal Arrangements

2006-08-17

arxiv.org/abs/math/0608448v1

Mathematics

Combinatorics

9 pages, 1 figure

Scientific paper

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 $\Delta$ be the flag (clique) complex of $G$ and let $H_{\bullet}(\Delta)$ be the homology of the chain complex of $\Delta$. 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(\Delta)=0$ for every $i=1,...,k-1$.

Affiliated with

Also associated with

No associations

Rating

Topological Criteria for $k-$Formal Arrangements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Topological Criteria for $k-$Formal Arrangements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological Criteria for $k-$Formal Arrangements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567743