This is an implementation of a basic greedy algorithm to construct arrangements satisfying a certain property, based on [Cun22]. A variant was used in [MMR24] to construct an arrangement which is \(4\)-formal with a restriction which is not \(3\)-formal.
‣ HArrGreedySearch( NumberOfHs, dim, GField, PropTargetFct, MaxNoIterations ) | ( operation ) |
Returns: A hyperplane arrangement
Constructs a greedy search for arrangements over GField with NumberOfHs hyperplanes in dimension dim.
PropTargetFct should be a function taking a hyperplane arragement as argument, returning a non-negative real number, which the search tries to minimize, and such that value=0 means the arrangement satisfies the desired property.
MaxNoIterations is the maximal number of steps to be carried out in the search (one step = exchanging a hyperplane).
gap> HArrGreedySearch(13,3,GF(17),CharPolySplits,400); GreedySearch over GF(17) for arrangements: - of rank 3 - with 13 hyperplanes.
‣ CharPolySplits( A ) | ( function ) |
A target/score function for splitting of the characteristic polynomial of A over \(\mathbb{Z}\).
‣ DistMSetInvL( A, B ) | ( function ) |
A target/score function for comparing MSetInvL(B) and MSetInvL(B) (see MSetInvL (2.2-7)).
‣ GreedySearchRun( GS ) | ( attribute ) |
Returns: a function
Run the search algorithm of GS which will return an arrangement or fail.
gap> GS:=HArrGreedySearch(13,3,GF(17),CharPolySplits,400); GreedySearch over GF(17) for arrangements: - of rank 3 - with 13 hyperplanes. gap> A:=GreedySearchRun(GS)(); 227 Iterations - <HyperplaneArrangement: 13 hyperplanes in 3-space> gap> ExpArr(A); [ 1, 6, 6 ] gap> HArrIsSupersolvable(A); true gap> A:=GreedySearchRun(GS)(); 358 Iterations - <HyperplaneArrangement: 13 hyperplanes in 3-space> gap> ExpArr(A); [ 1, 6, 6 ] gap> HArrIsSupersolvable(A); false gap> HArrIsFree(A); true
‣ GreedySearchGF( GS ) | ( attribute ) |
Returns: a field
The Galois field over which to search for arrangements.
‣ GreedySearchDimension( GS ) | ( attribute ) |
‣ GreedySearchNOfHs( GS ) | ( attribute ) |
‣ GreedySearchTargetFct( GS ) | ( attribute ) |
‣ GreedySearchMaxIterations( GS ) | ( attribute ) |
generated by GAPDoc2HTML