zonotopes toric arrangements and generalized tutte
play

Zonotopes, toric arrangements, and generalized Tutte polynomials - PowerPoint PPT Presentation

Zonotopes, toric arrangements, and generalized Tutte polynomials FPSAC 2010 Luca Moci Roma Tre TU Berlin San Francisco, August 2010 Luca Moci (Roma Tre TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San


  1. Zonotopes, toric arrangements, and generalized Tutte polynomials FPSAC 2010 Luca Moci Roma Tre → TU Berlin San Francisco, August 2010 Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 1 / 13

  2. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  3. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  4. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  5. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  6. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  7. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  8. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  9. Real hyperplane arrangements Take V = R n and H a collection of affine hyperplanes (i.e affine subspaces of dimension n − 1). Problem In how many regions V is divided by the hyperplanes? Take H ∈ H and set: H 1 . = H \ { H } , H 2 . = { H ∩ K , K ∈ H 1 } . Clearly reg ( H ) is obtained from reg ( H 1 ) by adding the number of regions of H 1 which are cut in two parts by H . But this number equals reg ( H 2 ). Thus we have the recursive formula reg ( H ) = reg ( H 1 ) + reg ( H 2 ) . This method is known as deletion-restriction. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 2 / 13

  10. Complex hyperplane arrangements If V = C n , removing hyperplanes does not disconnect V . In this way we get an object M with a rich topology and geometry. Then one wants to compute invariants of the complement M . These are related with the combinatorics of the intersection poset L . Problem Compute the Poincar´ e polynomial of M and the characteristic polynomial of L . Also these polynomials can be computed by deletion-restriction. Tutte’s idea: find the most general deletion-restriction invariant. This is a polynomial T ( x , y ). (It was originally defined for graphs). In this talk we will introduce another kind of arrangements, and provide an analogue of the Tutte polynomial. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 3 / 13

  11. Complex hyperplane arrangements If V = C n , removing hyperplanes does not disconnect V . In this way we get an object M with a rich topology and geometry. Then one wants to compute invariants of the complement M . These are related with the combinatorics of the intersection poset L . Problem Compute the Poincar´ e polynomial of M and the characteristic polynomial of L . Also these polynomials can be computed by deletion-restriction. Tutte’s idea: find the most general deletion-restriction invariant. This is a polynomial T ( x , y ). (It was originally defined for graphs). In this talk we will introduce another kind of arrangements, and provide an analogue of the Tutte polynomial. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 3 / 13

  12. Complex hyperplane arrangements If V = C n , removing hyperplanes does not disconnect V . In this way we get an object M with a rich topology and geometry. Then one wants to compute invariants of the complement M . These are related with the combinatorics of the intersection poset L . Problem Compute the Poincar´ e polynomial of M and the characteristic polynomial of L . Also these polynomials can be computed by deletion-restriction. Tutte’s idea: find the most general deletion-restriction invariant. This is a polynomial T ( x , y ). (It was originally defined for graphs). In this talk we will introduce another kind of arrangements, and provide an analogue of the Tutte polynomial. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 3 / 13

  13. Complex hyperplane arrangements If V = C n , removing hyperplanes does not disconnect V . In this way we get an object M with a rich topology and geometry. Then one wants to compute invariants of the complement M . These are related with the combinatorics of the intersection poset L . Problem Compute the Poincar´ e polynomial of M and the characteristic polynomial of L . Also these polynomials can be computed by deletion-restriction. Tutte’s idea: find the most general deletion-restriction invariant. This is a polynomial T ( x , y ). (It was originally defined for graphs). In this talk we will introduce another kind of arrangements, and provide an analogue of the Tutte polynomial. Luca Moci (Roma Tre → TU Berlin) Zonotopes, toric arrangements, and generalized Tutte polynomials San Francisco, August 2010 3 / 13

Recommend


More recommend