This follows a suggestion by Bill Allombert at
https://pari.math.u-bordeaux.fr/cgi-bin/bugreport.cgi?bug=2409

* scripts/cmh-classpol.sh.in (GP_OPTS): Add parameters.

Incidentally this should solve
   #1

* scripts/checkpol.gp: Remove setting of parisize.

* configure.ac (AC_INIT): Update version.

* configure.ac (AC_INIT): Update version.
* NEWS: Add news items.
* README.md: Update copyright date.

The code was correct, but not recognised as such by gcc.

* src/cm2.c: Initialise a variable outside a conditional.

This makes them smaller without changing the corresponding polarised ideals
or period matrices.

* scripts/shimura.gp (n_system): Divide the system of semiprimitive
  polynomials by a common content.

This is a follow-up to commit ea586ca1 .

* scripts/shimura.gp (explode_cmfield): Also define global variables lambda
  and omeg.

* scripts/shimura.gp (n_system): Drop most computations when n=1.
  (symplectic_bases): Compute n-systems for modulus 1 instead of the
  modulus 60 used for testing purposes.

* scripts/shimura.gp (n_system): Implement congruence condition for the B.

* scripts/shimura.gp (n_system): Add code to make forms equiprimitive.

* scripts/shimura.gp (good_root): New function.
  (symplectic_basis): Use new function.

* scripts/shimura.gp (coprime_from_semiprimitive_polynomial): New function.
  (n_system): Call new function.

* scripts/shimura.gp (semiprimitive_polynomial): Take the gcd between
  A, B and C, without also adding n. The latter does not work when a
  prime has higher valuation in gcd (A, B, C) than in n.
  (strong_approximation): Simplify the code to not remove all primes
  dividing a, but only those occurring in n.

It is anyway needed to correct the signs, so using it in one place makes
things easier. Running time 258s on the large example.

* scripts/shimura.gp (my_idealcoprime): Move to...
  (strong_approximation): ...this and let it also handle signs of
  embeddings.
  (semiprimitive_polynomial): Call the new function to handle coprimality
  and signs simultaneously.
  (n_system): Adapt function call.

The code represents orbits by semiprimitive polynomials; for testing
purposes modulo N=60, whereas N=1 would be enough since we work with
modular functions for the full group. The record example takes 249s.

* scripts/shimura.gp (my_idealcoprime, semiprimitive_polynomial,
  n_system): New functions.
  (symplectic_basis): Change prototype to work with a quadratic polynomial
  instead of a polarised ideal.
  (symplectic_bases): Use new functions.

* scripts/shimura.gp (init_cmfield_basic): Add two fields for lambda, a
  generator of the different of K0, and omeg, the second element of the
  integral basis of K0.
  (init_cmfield): Push CKdata and Sdata two positions further.
  (symplectic_basis): Drop parameter omeg.
  (symplectic_bases): Adapt function call.

* scripts/shimura.gp (bezout_vector,
  switch_ideal_basis_for_symplectic_input): Drop unused functions.
  (symplectic_basis): Remove unneeded function call.

* scripts/shimura.gp (symplectic_basis): Drop conversion from polynomial
  to integral basis.
  (period_matrix): Drop conversion from integral to polynomial basis.
  (reduced_period_matrix): Add comment on input.

This is a first step towards the implementation of N-systems.
It also appears to be faster: The record example from [EnTh14] now takes
236s instead of 335s. The output is the same as by the previous
implementation.

* scripts/shimura.gp (symplectic_transformation, symplectic_form): Remove
  functions.
  (symplectic_basis): Change prototype of function and compute the
  symbolic period matrix from a basis of af as an OK0-module.
  (symplectic_bases): Adapt function call.

* scripts/shimura.gp (init_cmfield_basic): Add the flag 1 to rnfinit.
  This makes the intention clearer, but is no functional change.

* scripts/shimura.gp (init_cmfield_basic): Make sure to call "nfinit (Krel)"
  to enhance its internal state.
  (shimura_group_arbitrary_lift_of_ideal, shimura_group_is_element,
  shimura_group_kernel_of_norm_map): Drop explicit multiplication with
  integral basis, since now ideals in HNF also work.

* src/borchardt.c (BorchardtMean3, BorchardtMean4): Remove public functions.
  The second one actually was declared with a different prototype.
  (BorchardtMeanOneStep, BorchardtMeanOneStepWithSigns, BorchardtMean_fast):
  Remove functions, some of which were already commented out.
* src/cmh.h (BorchardtMean3, BorchardtMean4): Remove function declarations.

* src/Makefile.am (cm2_mpi_LDADD): Add libparsepari.

* scripts/shimura.gp: Add a licence header and copyright dates.

* configure.ac (AC_INIT): Update version.

* configure.ac (AC_INIT): Update version.

* BUGS: Drop [92, 1819], which now works.

* scripts/cmh-classpol.sh.in: Add a line to print the PARI/GP version.

* BUGS: Drop [1234, 235], which succeeds after a bug fix in PARI/GP with
  their commit 8964ced3ff73a2e0063cbd49cf1ee0285f753888.

Version 2.13 of PARI has introduced compact units and modified the
implementation of bnfisprincipal. Without using the bit "2" of the
flag when a generator is required, the example [1521816,1234,235]
leads to a warning and generators that are not computed.

Regardless of this, the example causes an exception.

* scripts/shimura.gp (reduce_type_norm,
  shimura_group_arbitrary_lift_of_ideal, shimura_group_element_is_identity,
  shimura_group_element_dlog): Add flag 0 or 3 to bnfisprincipal according
  to whether a generator is needed or not.
* BUGS: Add example.

* scripts/shimura.gp (reduce_type_norm): Drop a function call that was only
  needed for an old version of PARI/GP.

This effectively reverts commit 59f947fb,
which broke the example [33, 92, 1819].

* scripts/shimura.gp (triple_new): Drop a call to reduce_basepoint.
* BUGS: Drop an entry.

* src/factor.c (factor_trialdiv): Save a conversion to mpz_t.

* src/factor.c (mpz_remove_squares): Rewrite the function in terms of
  existing ones.

* src/factor.c (factor_trialdiv): Call PARI.
  (factor_matrix_alloc, remove_prime_power, coprime): Remove functions.
* src/cm2.c (recognise_quadratic_coefficients): Reword warning message.
* BUGS: Drop solved cases.

* src/factor.c (factor_matrix_fold_inner): Make function static.

* src/factor.c (factor_matrix_init): New function.
  (factor_matrix_alloc, factor_matrix_dup): Use the new function.

* src/cm2.c: Add copyright dates.