You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
v.1.0.7
* rank/unrank involutions in swap order (not very efficient)
* generation of involutions in reverse not implemented yet
* rename some static methods (eg gray -> toGray,fromGray)
* Permutation.initial generate kfixed derangements and kcycle permutations, although they are to be generated by combining other iterators
v.0.9.10
* faster sparse polynomial division and multiplication using Maxheap
* Abacus.Heap implementation
* System of diophantine equations check additional rows for solution if over-determined system
* update examples, tests
v.0.9.9
* Polynomial.fromString can parse a polynomial string/tex representation into a polynomial as best as possible
* Fix Polynomial/Expr/Term gt/gte/lt/lte methods to be as compatible as possible
* Minor adjustments
* update examples and tests
v.0.9.8 contd
* Polynomial functional composition method
* Find multiple rational roots of Polys if present (checking derivatives as well)
* Fix Poly primitive/content factorisation to use LCM of denominators
* Minor adjustments in limits for different methods of factorisation and testing
* update examples tests
v.0.9.4 contd
* add .get() method to get all (filtered) results as an array, from current position to end
* add magic squares combinatorial example and update n-queens example
* update examples/readme