Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
trac #19023 typos in group tuto, posets and digraph
Browse files Browse the repository at this point in the history
  • Loading branch information
Frédéric Chapoton committed Aug 22, 2015
1 parent 5dc1443 commit f6a4371
Show file tree
Hide file tree
Showing 3 changed files with 7 additions and 6 deletions.
4 changes: 2 additions & 2 deletions src/doc/en/thematic_tutorials/group_theory.rst
Original file line number Diff line number Diff line change
Expand Up @@ -1009,9 +1009,9 @@ groups of order less than 16. ::
8 D1 = CyclicPermutationGroup(2)
D2 = CyclicPermutationGroup(2)
D3 = CyclicPermutationGroup(2)
G = direct_product_permgroups([D1,D2,D3])} Abelian, non-cyclic
G = direct_product_permgroups([D1,D2,D3]) Abelian, non-cyclic
8 DihedralGroup(4) Non-abelian
8 QuaternionGroup()} Quaternions, also DiCyclicGroup(2)
8 QuaternionGroup() Quaternions, also DiCyclicGroup(2)
9 CyclicPermutationGroup(9) Cyclic
9 D1 = CyclicPermutationGroup(3)
D2 = CyclicPermutationGroup(3)
Expand Down
6 changes: 3 additions & 3 deletions src/sage/combinat/posets/posets.py
Original file line number Diff line number Diff line change
Expand Up @@ -3870,10 +3870,10 @@ def relabel(self, relabeling):
INPUT:
- ``relabeling`` -- a function or dictionnary
- ``relabeling`` -- a function or dictionary
This function should map each (non-wrapped) element of
``self`` to some distinct object.
This function should map each (non-wrapped) element of
``self`` to some distinct object.
EXAMPLES::
Expand Down
3 changes: 2 additions & 1 deletion src/sage/graphs/digraph.py
Original file line number Diff line number Diff line change
Expand Up @@ -2969,7 +2969,8 @@ def topological_sort_generator(self):
### Visualization

def layout_acyclic(self, rankdir="up", **options):
"""Return a ranked layout so that all edges point upward.
"""
Return a ranked layout so that all edges point upward.
To this end, the heights of the vertices are set according to the level
set decomposition of the graph (see :meth:`.level_sets`).
Expand Down

0 comments on commit f6a4371

Please sign in to comment.