genericArrangement(r,n,K)
genericArrangement(r,n)
By definition, a generic arrangement is a realization of a uniform matroid $U_{r,n}$, which is characterized by the property that all subsets of the ground set of size at most $r$ are independent. Points on the monomial curve have this property.
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/HyperplaneArrangements.m2:1793:0.