An initial version of a non-stub implementation of Hecke triangle groups
Support for multiplicative decomposition of hecke triangle group elements
into basic factors, namely (powers of) generators. As a consequence:
Support for arbitrary automorphy factors and the possibility
to check whether a matrix really is an element of the group

Performance improvements to function evaluation (which was a regression
due to the change from the stub to the real implementation of the groups)

Change Exceptions to more specific errors.
Simplify automorphy factors:

Since automorphy factors can now be calculated exactly
(basically by the same procedure as in get_FD), we no
longer need to determine the automorphy factor in get_FD.

The slight performance drop far outweighs the benefit
of reduced complexity in HeckeTriangleGroup's get_FD.
performance gain: only check whether a basis of a subspace really is a basis if necessary...
add missing documentation and doctests, add a proper latex representation, remove an unnecessary check
use the maximal order for the base ring of hecke triangle groups, support for corresponding fixed_points of a hecke triangle group, remove some unnecessary/extensive cached_method's
support group actions on and to infinity
support no-order for fixed point examples, better fixed point examples
add a method which returns the correct embedding from the root extension field to another field
bugfix: root_extension_embedding didn't always produce the correct embedding, replaced the method by a slower but more reliable one
support action of elements on elements by conjugation
support an argument (the power) for the translation (this gives a performance gain for large or negative powers)
Merge branch 'u/jj/hecke_lseries' into u/jj/triangle_groups

Conflicts:
	src/sage/modular/modform_hecketriangle/hecke_triangle_groups.py
Merge branch 'u/jj/hecke_lseries' into u/jj/triangle_groups
Minor reviewer changes.
Merge tag '6.4.beta3' into u/jj/triangle_groups

Sage version 6.4.beta3
Deprecation of is_graded on hasse diagram.
More docs for is_graded().
Trac #17023: Adding width() function to poset

Add a `.width()` -- i.e. number of elements in the longest antichain --
to poset. Seems to have polynomial time algorithm based on Dilworth's
Theorem.

URL: http://trac.sagemath.org/17023
Reported by: jmantysalo
Ticket author(s): Nathann Cohen
Reviewer(s): Frédéric Chapoton, Jori Mäntysalo
Trac #17095: No documentation for random_element_plancherel()

On `sage.combinat.partition.Partitions_n` function
`random_element_plancherel()` has not any explanation about what
Plancherel distribution(?) means.

URL: http://trac.sagemath.org/17095
Reported by: jmantysalo
Ticket author(s): Frédéric Chapoton
Reviewer(s): Florent Hivert