Mathematics – Combinatorics
Scientific paper
2011-10-02
Mathematics
Combinatorics
Scientific paper
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the discriminantal arrangement with the parameter (n,k) is isomorphic to the intersection lattice of the hyperplane arrangement generated by n generic points in the d-dimensional vector space where d=n-k-1. The combinatorics of the discriminantal arrangements is very hard, except for the special cases of the Boolean arrangements (k=0) and the braid arrangements (k=1). We review some results on the intersection lattices of the arrangements generated by generic points and use them to obtain some computational results on the characteristic polynomials of the discriminantal arrangements.
Numata Yasuhide
Takemura Akimichi
No associations
LandOfFree
On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points 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 On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284000