Boolean formulae, hypergraphs and combinatorial topology

Mathematics – Algebraic Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Added discussion of independence complex and new computer calculations. Added coauthor Oliver Thistlethwaite. To appear in Top

Scientific paper

With a view toward studying the homotopy type of spaces of Boolean formulae, we introduce a simplicial complex, called the theta complex, associated to any hypergraph, which is the Alexander dual of the more well-known independence complex. In particular, the set of satisfiable formulae in k-conjunctive normal form with less than or equal to n variables has the homotopy type of Theta(Cube(n,n-k)), where Cube(n,n-k) is a hypergraph associated to the (n-k)-skeleton of an n-cube. We make partial progress in calculating the homotopy type of theta for these cubical hypergraphs, and we also give calculations and examples for other hypergraphs as well. Indeed studying the theta complex of hypergraphs is an interesting problem in its own right.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Boolean formulae, hypergraphs and combinatorial topology 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 Boolean formulae, hypergraphs and combinatorial topology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boolean formulae, hypergraphs and combinatorial topology will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-27297

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.