sigma-ij-0.2.0.2: Thom polynomials of second order Thom-Boardman singularities

Math.ThomPoly.Subs

Description

We need to find (small) integer substitution such that the denominator in our formula never vanishes.

That is, for n we need to find n integers a[i] such that:

• 0  /=  a[i] -  a[j]
• 0  /=  a[i] - (a[j] + a[k])
• 0  /=  (a[i] + a[j]) - (a[k] + a[l])

Synopsis

# Lazily cached tables of substitutions

We cache a substitution table

# Find substitutions

choosePerm :: Int -> [a] -> [[a]] Source #

Select k elements from a list in all possible orders

checkSubs :: forall a. (Eq a, Num a) => [a] -> Bool Source #

Checks if a substitution satisfies the constraints

Find random substitution which satisfies the constraints