Associated Primes of the Square of the Alexander Dual of Hypergraphs

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages

Scientific paper

The purpose of this paper is to provide methods for determining the associated primes of the square of the Alexander dual of the edge ideal for an m-hypergraph H. We prove a general method for detecting associated primes of the square of the Alexander dual of the edge ideal based on combinatorial conditions on the m-hypergraph. Also, we demonstrate a more efficient combinatorial criterion for detecting the non-existence of non-minimal associated primes. In investigating 3-hypergraphs, we prove a surprising extension of the previously discovered results for 2-hypergraphs (simple graphs). For 2-hypergraphs, associated primes of the square of the Alexander dual of the edge ideal are either of height 2 or of odd height greater than 2. However, we prove that in the 3-hypergraph case, there is no such restriction - or indeed any restriction - on the heights of the associated primes. Further, we generalize this result to any dimension greater than 3. Specifically, given any integers m, q, and n with 3\leq m\leq q\leq n, we construct a m-hypergraph of size n with an associated prime of height q. We further prove that it is possible to construct connected m-hypergraphs under the same conditions.

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

Associated Primes of the Square of the Alexander Dual of Hypergraphs 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 Associated Primes of the Square of the Alexander Dual of Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Associated Primes of the Square of the Alexander Dual of Hypergraphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-71208

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