irreducible decomposition of binomial ideals
play

Irreducible decomposition of binomial ideals Christopher ONeill - PowerPoint PPT Presentation

Aug 12, 2023 •260 likes •2.2k views

Irreducible decomposition of binomial ideals Christopher ONeill Duke University musicman@math.duke.edu Joint with Thomas Kahle and Ezra Miller January 18, 2014 Christopher ONeill (Duke University) Irreducible decomposition of binomial

  1. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  2. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  3. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  4. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I ⇒ x 3 , x 2 y , xy 2 , y 3 ∈ soc p ( I ) Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  5. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I ⇒ x 3 , x 2 y , xy 2 , y 3 ∈ soc p ( I ) soc p ( I ) / I = { f : p f ⊂ I } / I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  6. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I ⇒ x 3 , x 2 y , xy 2 , y 3 ∈ soc p ( I ) soc p ( I ) / I = { f : p f ⊂ I } / I = { f : xf , yf ∈ I } / I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  7. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I ⇒ x 3 , x 2 y , xy 2 , y 3 ∈ soc p ( I ) soc p ( I ) / I = { f : p f ⊂ I } / I = { f : xf , yf ∈ I } / I k { x − y , x 3 } = Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  8. Irreducible Ideals Let I = � x 2 − xy , xy − y 2 , x 4 , y 4 � ⊂ k [ x , y ], and let p = � x , y � . x − y ∈ soc p ( I ) x 4 , x 3 y , x 2 y 2 , xy 3 , y 4 ∈ I ⇒ x 3 , x 2 y , xy 2 , y 3 ∈ soc p ( I ) soc p ( I ) / I = { f : p f ⊂ I } / I = { f : xf , yf ∈ I } / I k { x − y , x 3 } = so dim k (soc p ( I ) / I ) = 2. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 9 / 36

  9. Monomial Ideals Long long ago, in an algebraic setting not far away... Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 10 / 36

  10. Monomial Ideals Long long ago, in an algebraic setting not far away... Monomial Ideals Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 10 / 36

  11. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 11 / 36

  12. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 11 / 36

  13. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 11 / 36

  14. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 11 / 36

  15. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  16. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  17. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  18. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  19. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  20. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  21. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  22. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Generators of I are “Inward-pointing corners” Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  23. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram x a = x a 1 1 · · · x a n n ∈ k [ x 1 , . . . , x n ] → a = ( a 1 , . . . , a n ) ∈ N n ← Connect all monomials x a ∈ I Generators of I are “Inward-pointing corners” Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 12 / 36

  24. Monomial Ideals Fact If a monomial ideal I is p -primary, then p is a monomial ideal. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 13 / 36

  25. Monomial Ideals Fact If a monomial ideal I is p -primary, then p is a monomial ideal. Fact Any monomial ideal I admits a monomial irreducible decomposition, that is, an expression of the form r � I = J i i =1 for irreducible monomial ideals J 1 , . . . , J r . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 13 / 36

  26. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  27. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  28. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  29. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  30. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  31. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 14 / 36

  32. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  33. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  34. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 J 1 = � x 4 , y � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  35. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 J 1 = � x 4 , y � J 2 = � x 3 , y 2 � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  36. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 J 1 = � x 4 , y � J 2 = � x 3 , y 2 � J 3 = � x 2 , y 4 � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  37. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 J 1 = � x 4 , y � J 2 = � x 3 , y 2 � J 3 = � x 2 , y 4 � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  38. Monomial Ideals � x 4 , x 3 y , x 2 y 2 , y 4 � I = Staircase Diagram I is p -primary, p = � x , y � soc p ( I ) / I = k { x 3 , x 2 y , xy 3 } “Outward-pointing corners” Irreducible decomposition: I = J 1 ∩ J 2 ∩ J 3 J 1 = � x 4 , y � J 2 = � x 3 , y 2 � J 3 = � x 2 , y 4 � Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 15 / 36

  39. Irreducible Decomposition Facts Fix an irredundant irreducible decomposition r � I = J i i =1 for a p -primary ideal I . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 16 / 36

  40. Irreducible Decomposition Facts Fix an irredundant irreducible decomposition r � I = J i i =1 for a p -primary ideal I . r = dim k soc p ( I ) / I . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 16 / 36

  41. Irreducible Decomposition Facts Fix an irredundant irreducible decomposition r � I = J i i =1 for a p -primary ideal I . r = dim k soc p ( I ) / I . For each i , the map R / I ։ R / J i induces a nonzero map on socles. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 16 / 36

  42. Irreducible Decomposition Facts Fix an irredundant irreducible decomposition r � I = J i i =1 for a p -primary ideal I . r = dim k soc p ( I ) / I . For each i , the map R / I ։ R / J i induces a nonzero map on socles. More generally, soc p ( I ) / I ∼ = � r i =1 soc p ( J i ) / J i . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 16 / 36

  43. Irreducible Decomposition Facts Fix an irredundant irreducible decomposition r � I = J i i =1 for a p -primary ideal I . r = dim k soc p ( I ) / I . For each i , the map R / I ։ R / J i induces a nonzero map on socles. More generally, soc p ( I ) / I ∼ = � r i =1 soc p ( J i ) / J i . If I is monomial ideal, then soc p ( I ) is monomial. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 16 / 36

  44. Binomial Ideals And now, back to our original programming... Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 17 / 36

  45. Binomial Ideals And now, back to our original programming... Binomial ideals Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 17 / 36

  46. Binomial Ideals Theorem (Eisenbud-Sturmfels, 1996) If k = k , every binomial ideal admits a binomial primary decomposition. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 18 / 36

  47. Binomial Ideals Theorem (Eisenbud-Sturmfels, 1996) If k = k , every binomial ideal admits a binomial primary decomposition. Question (Eisenbud-Sturmfels, 1996) Does the same hold for irreducible decomposition? Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 18 / 36

  48. Binomial Ideals Theorem (Eisenbud-Sturmfels, 1996) If k = k , every binomial ideal admits a binomial primary decomposition. Question (Eisenbud-Sturmfels, 1996) Does the same hold for irreducible decomposition? In 2002, Dickenstein, Matusevich and Miller investigate the combinatorics of binomial primary decomposition. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 18 / 36

  49. Binomial Ideals Theorem (Eisenbud-Sturmfels, 1996) If k = k , every binomial ideal admits a binomial primary decomposition. Question (Eisenbud-Sturmfels, 1996) Does the same hold for irreducible decomposition? In 2002, Dickenstein, Matusevich and Miller investigate the combinatorics of binomial primary decomposition. In 2013, Kahle and Miller give a combinatorial method of explicitly constructing binomial primary decomposition. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 18 / 36

  50. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  51. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  52. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  53. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  54. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  55. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  56. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , x ( x 2 − xy ) = x 3 − x 2 y ∈ I , Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  57. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , x ( x 2 − xy ) = x 3 − x 2 y ∈ I , . . . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  58. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , x ( x 2 − xy ) = x 3 − x 2 y ∈ I , . . . x a , x b ∈ I ⇒ x a − x b ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  59. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , x ( x 2 − xy ) = x 3 − x 2 y ∈ I , . . . x a , x b ∈ I ⇒ x a − x b ∈ I Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  60. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = x a ∈ k [ x 1 , . . . , x n ] ← → a ∈ N n Define relation ∼ I on N n : a ∼ I b ∈ N n ← → x a − λ x b ∈ I for some nonzero λ ∈ k x 2 − xy ∈ I , xy − y 2 ∈ I , x ( x 2 − xy ) = x 3 − x 2 y ∈ I , . . . x a , x b ∈ I ⇒ x a − x b ∈ I ( x 2 = xy in k [ x , y ] / I ) Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 19 / 36

  61. Binomial Ideals Fix a binomial ideal I ⊂ k [ x 1 , . . . , x n ]. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 20 / 36

  62. Binomial Ideals Fix a binomial ideal I ⊂ k [ x 1 , . . . , x n ]. The equivalence relation ∼ I induced by I on N n is a congruence : a ∼ I b implies a + c ∼ I b + c for a , b , c ∈ N n . In particular, ( N n / ∼ I , +) is well defined. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 20 / 36

  63. Binomial Ideals Fix a binomial ideal I ⊂ k [ x 1 , . . . , x n ]. The equivalence relation ∼ I induced by I on N n is a congruence : a ∼ I b implies a + c ∼ I b + c for a , b , c ∈ N n . In particular, ( N n / ∼ I , +) is well defined. The monomials in I form a single class ∞ ∈ N n / ∼ I , called the nil . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 20 / 36

  64. Binomial Ideals Fix a binomial ideal I ⊂ k [ x 1 , . . . , x n ]. The equivalence relation ∼ I induced by I on N n is a congruence : a ∼ I b implies a + c ∼ I b + c for a , b , c ∈ N n . In particular, ( N n / ∼ I , +) is well defined. The monomials in I form a single class ∞ ∈ N n / ∼ I , called the nil . The nil ∞ corresponds to 0 in the quotient k [ x 1 , . . . , x n ] / I . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 20 / 36

  65. Binomial Ideals Fix a binomial ideal I ⊂ k [ x 1 , . . . , x n ]. The equivalence relation ∼ I induced by I on N n is a congruence : a ∼ I b implies a + c ∼ I b + c for a , b , c ∈ N n . In particular, ( N n / ∼ I , +) is well defined. The monomials in I form a single class ∞ ∈ N n / ∼ I , called the nil . The nil ∞ corresponds to 0 in the quotient k [ x 1 , . . . , x n ] / I . Each non-nil a ∈ N n / ∼ I represents a distinct monomial modulo I . Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 20 / 36

  66. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � I = Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 21 / 36

  67. Binomial Ideals � x 2 − xy , xy − y 2 , x 4 , y 4 � Monoid N 2 / ∼ I I = Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 21 / 36

  68. Binomial Ideals Theorem (Kahle-Miller, 2013) For k = k , every binomial ideal has an expression of the form r � I = J i i =1 where each J i is binomial, primary, and has a unique monomial in its socle. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 22 / 36

  69. Binomial Ideals Theorem (Kahle-Miller, 2013) For k = k , every binomial ideal has an expression of the form r � I = J i i =1 where each J i is binomial, primary, and has a unique monomial in its socle. To construct a binomial irreducible decomposition for I , we can assume Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 22 / 36

  70. Binomial Ideals Theorem (Kahle-Miller, 2013) For k = k , every binomial ideal has an expression of the form r � I = J i i =1 where each J i is binomial, primary, and has a unique monomial in its socle. To construct a binomial irreducible decomposition for I , we can assume I is primary to the maximal ideal m , Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 22 / 36

  71. Binomial Ideals Theorem (Kahle-Miller, 2013) For k = k , every binomial ideal has an expression of the form r � I = J i i =1 where each J i is binomial, primary, and has a unique monomial in its socle. To construct a binomial irreducible decomposition for I , we can assume I is primary to the maximal ideal m , soc m ( I ) / I has a unique monomial. Christopher O’Neill (Duke University) Irreducible decomposition of binomial ideals January 18, 2014 22 / 36

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Irreducible decompositions of binomial ideals Christopher ONeill Duke University

Irreducible decompositions of binomial ideals Christopher ONeill Duke University

Irreducible decompositions of binomial ideals Christopher ONeill Duke University musicman@math.duke.edu Joint with Thomas Kahle and Ezra Miller January 18, 2014 Christopher ONeill (Duke University) Irreducible decompositions of binomial

747 views • 59 slides
Binomial edge ideals and determinantal facet ideals Sara Saeedi Madani (joint with J. Herzog and

Binomial edge ideals and determinantal facet ideals Sara Saeedi Madani (joint with J. Herzog and

Binomial edge ideals and determinantal facet ideals Sara Saeedi Madani (joint with J. Herzog and D. Kiani) Universit at Osnabr uck October 2015 Sara Saeedi Madani (joint with J. Herzog and D. Kiani) Binomial edge ideals and

839 views • 68 slides
Decompositions of Binomial Ideals Laura Felicia Matusevich Texas A&M University AMS Spring

Decompositions of Binomial Ideals Laura Felicia Matusevich Texas A&M University AMS Spring

Decompositions of Binomial Ideals Laura Felicia Matusevich Texas A&M University AMS Spring Central Sectional Meeting, April 17, 2016 Polynomial Ideals k the polynomial ring over a field k .

456 views • 24 slides
1 Binomial Heaps Binomial- -Heap Heap- -Union Union Binomial Heaps Binomial Binomial-

1 Binomial Heaps Binomial- -Heap Heap- -Union Union Binomial Heaps Binomial Binomial-

Binomial Heaps Binomial trees Binomial Heaps Binomial trees Def. For each non-negative integer k, a binomial tree B k of root degree k is an ordered tree defined recursively as follow: 1) B 0 consists of a single node 2) B k consists of two

194 views • 3 slides
Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universit at Magdeburg

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universit at Magdeburg

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universit at Magdeburg Setup Let k be a field. For computations we use k = Q . k [ p ] := k [ p 1 , . . . , p n ] the polynomial ring in n indeterminates For each u

701 views • 29 slides
Primary decomposition of powers of prime ideals for numerical semigroups Ralf Fr oberg July

Primary decomposition of powers of prime ideals for numerical semigroups Ralf Fr oberg July

Primary decomposition of powers of prime ideals for numerical semigroups Ralf Fr oberg July 10, 2016 General commutative algebra An ideal P in a ring R is prime if xy P implies that x or y is in P . Equivalently, P is prime if and only if

726 views • 31 slides
The Binomial Distribution Binomial Experiment An experiment with these characteristics: For some

The Binomial Distribution Binomial Experiment An experiment with these characteristics: For some

ST 380 Probability and Statistics for the Physical Sciences The Binomial Distribution Binomial Experiment An experiment with these characteristics: For some predetermined number n , a sequence of n smaller 1 experiments called trials ; Each

552 views • 22 slides
Markov Chains II CS70 Summer 2016 - Lecture 6C Not irreducible. Irreducible. Or: graph

Markov Chains II CS70 Summer 2016 - Lecture 6C Not irreducible. Irreducible. Or: graph

Markov Chains II CS70 Summer 2016 - Lecture 6C Not irreducible. Irreducible. Or: graph representation is strongly connected. other state. Irreducibile Markov chain: every state communicates with every Irreducibility 3 Is 1 accessible from 2?

525 views • 5 slides
Chapter 19: Binomial Heaps We will study another heap structure called, the binomial heap. The

Chapter 19: Binomial Heaps We will study another heap structure called, the binomial heap. The

Chapter 19: Binomial Heaps We will study another heap structure called, the binomial heap. The binomial heap allows for efficient union, which can not be done efficiently in the binary heap. The extra cost paid is the minimum operation, which

560 views • 24 slides
Perfect sets and f -ideals Introduction Perfect sets and f -ideals of degree d Author Jin Guo (

Perfect sets and f -ideals Introduction Perfect sets and f -ideals of degree d Author Jin Guo (

Perfect sets and f -ideals Jin Guo Outline Perfect sets and f -ideals Introduction Perfect sets and f -ideals of degree d Author Jin Guo ( n, 2) th perfect number (This is a joint work with professor Tongsuo Wu) Structure of V ( n, 2)

2.01k views • 154 slides
1 Bin(10, 0.3), Bin(100, 0.03) vs. Poi(3) Tender (Central) Moments with Poisson Recall: Y ~

1 Bin(10, 0.3), Bin(100, 0.03) vs. Poi(3) Tender (Central) Moments with Poisson Recall: Y ~

Whither the Binomial Binomial in the Limit Recall example of sending bit string over network Recall the Binomial distribution n ! n = 4 bits sent over network where each bit had i n i ( ) ( 1 ) P X i

191 views • 4 slides
On the q -binomial coefficients and binomial congruences q -series seminar University of Illinois

On the q -binomial coefficients and binomial congruences q -series seminar University of Illinois

On the q -binomial coefficients and binomial congruences q -series seminar University of Illinois at UrbanaChampaign Armin Straub November 15, 2012 University of Illinois at UrbanaChampaign On the q -binomial coefficients and binomial

1.12k views • 87 slides
Factorizations of ideals in noncommutative rings similar to factorizations of ideals in

Factorizations of ideals in noncommutative rings similar to factorizations of ideals in

Factorizations of ideals in noncommutative rings similar to factorizations of ideals in commutative Dedekind domains Alberto Facchini Universit` a di Padova Conference on Rings and Factorizations Graz, 21 February 2018 Dedekind domains

960 views • 71 slides
JUST THE MATHS SLIDES NUMBER 2.2 SERIES 2 (Binomial series) by A.J.Hobson 2.2.1

JUST THE MATHS SLIDES NUMBER 2.2 SERIES 2 (Binomial series) by A.J.Hobson 2.2.1

JUST THE MATHS SLIDES NUMBER 2.2 SERIES 2 (Binomial series) by A.J.Hobson 2.2.1 Pascals Triangle 2.2.2 Binomial Formulae UNIT 2.2 - SERIES 2 - BINOMIAL SERIES INTRODUCTION In this section, we expand (multiplying out) an

479 views • 9 slides
2 2 (4-1) = = k n k P k X k P ( k ) p q .

2 2 (4-1) = = k n k P k X k P ( k ) p q .

4. Binomial Random Variable Approximations, Conditional Probability Density Functions and Stirlings Formula Let X represent a Binomial r.v as in (3-42). Then from (2-30) k k n ( ) 2 2 (4-1) = =

556 views • 34 slides
Tighter Bounds for the Sum of Irreducible LCP Values Juha Krkkinen 1 Dominik Kempa 1 Marcin

Tighter Bounds for the Sum of Irreducible LCP Values Juha Krkkinen 1 Dominik Kempa 1 Marcin

Tighter Bounds for the Sum of Irreducible LCP Values Juha Krkkinen 1 Dominik Kempa 1 Marcin Pitkowski 2 1 University of Helsinki 2 Nicolaus Copernicus University Outline 1 Cyclic words 2 Irreducible LCP values 3 Upper bound for the sum of

447 views • 33 slides
Sample sta*s*cs and linear regression NEU 466M Instructor:

Sample sta*s*cs and linear regression NEU 466M Instructor:

Sample sta*s*cs and linear regression NEU 466M Instructor: Professor Ila R. Fiete Spring 2016 Mean { x 1 , , x N } N samples of variable x N h x

661 views • 28 slides
MA/CSSE 473 Day 06 Euclid's Algorithm MA/CSSE 473 Day 06 Student Questions Odd Pie Fight

MA/CSSE 473 Day 06 Euclid's Algorithm MA/CSSE 473 Day 06 Student Questions Odd Pie Fight

MA/CSSE 473 Day 06 Euclid's Algorithm MA/CSSE 473 Day 06 Student Questions Odd Pie Fight Modular exponentiation Euclid's algorithm (if there is time) extended Euclid's algorithm 1 Quick look at review topics in textbook REVIEW

314 views • 10 slides
CS 301 Lecture 06 Nonregular languages and the pumping lemma Stephen Checkoway February 5,

CS 301 Lecture 06 Nonregular languages and the pumping lemma Stephen Checkoway February 5,

CS 301 Lecture 06 Nonregular languages and the pumping lemma Stephen Checkoway February 5, 2018 1 / 23 DFA M 1 b a a q 0 q 1 q 2 b a,b q 3 a,b 2 / 23 DFA M 1 Strings in the language b aa a a q 0 q 1 q 2 aba abba

920 views • 53 slides
Used in SQL recursion. 2. Logical rules form the basis for man y information-in

Used in SQL recursion. 2. Logical rules form the basis for man y information-in

Logical Query Languages Motiv atio n: 1. Logical rules extend more naturally to recursiv e queries than do es relational algebra. Used in SQL recursion. 2. Logical rules form the basis for man y information-in

260 views • 21 slides
Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical

Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical

Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4340, Advanced Engineering Mathematics M. Macauley (Clemson) Lecture 4.6: Some

617 views • 13 slides
Leadscrew Slides Steel Extended Contact Bearing Stageses Stainless Steel Extended Contact

Leadscrew Slides Steel Extended Contact Bearing Stageses Stainless Steel Extended Contact

MANUAL POSITIONERS Mirror Mounts Leadscrew Slides Steel Extended Contact Bearing Stageses Stainless Steel Extended Contact Bearing Stages Inexpensive leadscrew slides Ideal for non-critical positioning

270 views • 4 slides
Quantum Fluctuation of Conductivities in Quantum Hall Effect Manabu Machida (U. Tokyo, Japan)

Quantum Fluctuation of Conductivities in Quantum Hall Effect Manabu Machida (U. Tokyo, Japan)

Dynamics and Relaxation in Complex Quantum and Classical Systems and Nanostructures (Dresden, 2006 summer) Quantum Fluctuation of Conductivities in Quantum Hall Effect Manabu Machida (U. Tokyo, Japan) In collaboration with N. Hatano (U.

843 views • 16 slides
CS 360 Programming Languages Day 11 Lexical Scope What is scope? The scope of a

CS 360 Programming Languages Day 11 Lexical Scope What is scope? The scope of a

CS 360 Programming Languages Day 11 Lexical Scope What is scope? The scope of a variable is the region of a computer program where that variable can be used. (You know this.) Why do we care? (You may not know this.)

652 views • 34 slides

More recommend