FLINT 3.6 released

[Fredrik Johansson]

Dear all,

I'm pleased to announce FLINT 3.6: https://github.com/flintlib/flint/releases/tag/v3.6.0

Highlights:

* Power series composition in O(M(n) log n) using the new Kinoshita-Li algorithm.

* New implementation of p-adic numbers 'padic_radix' which is superior to the
  classic 'padic' in many ways (builtin error tracking; works with FLINT's
  generic rings; ~5x faster arithmetic at high precision; supports both
  absolute and relative precision modes; O(1) digit extraction).

* Real root isolation and root refinement for fmpz_poly (much faster than the
  existing complex root isolation).

* Fixed a long-standing bug in FLINT's quadratic sieve that would cause
  fmpz_factor to hang for some input (e.g. for
  500000000000000000000000000000000000000017711).

* Many speedups to linear algebra, polynomial factorisation, integer
  factorisation, Groebner bases, and other operations.

* Added several trigonometric functions for power series, added Bessel
  functions of the first kind for power series, and optimised existing
  trigonometric functions.

Plus many other new features and fixes, for example:

* Division with remainder for Ore polynomials
* Added many matrix and permutation utility functions
* Subresultant-based resultant and XGCD for polynomials over generic UFDs
* Added arb_get_simplest_fmpq
* Added an implementation of the 'secondary zeta function'
* Improved accuracy in acb_dft

See https://flintlib.org/doc/history.html for a complete list of changes. For this version, we've merged 73 pull requests with code from the following 13 authors:

* Albin Ahlbäck
* Chenxin Zhong
* Edgar Costa
* Elias Tsigaridas
* Fredrik Johansson
* Joel Dahne
* Lars Göttgens
* Maria Neagoie
* Mathieu Gouttenoire
* Ricardo Buring
* user202729
* Vincent Delecroix
* Vincent Neiger

Thanks to everyone who contributed! Thanks also to everyone who participated in our June workshop where a lot of this work was done.

Best wishes on behalf of the FLINT team,
Fredrik