More extensive edits

Author: kwankyu

src/sage/algebras/fusion_rings/fusion_ring.py

@@ -1,5 +1,5 @@
 """
-Fusion Rings
+Fusion rings
 """
 # ****************************************************************************
 #  Copyright (C) 2019 Daniel Bump <bump at match.stanford.edu>

src/sage/combinat/abstract_tree.py

@@ -1,5 +1,5 @@
 r"""
-Abstract Recursive Trees
+Abstract recursive trees
 
 The purpose of this class is to help implement trees with a specific structure
 on the children of each node. For instance, one could want to define a tree in

src/sage/combinat/all.py

@@ -1,22 +1,22 @@
 r"""
 Combinatorics
 
-Introductory material
----------------------
+Introduction
+------------
 
 - :ref:`sage.combinat.quickref`
 - :ref:`sage.combinat.tutorial`
 
-Thematic indexes
-----------------
+Topics
+------
 
 - :ref:`sage.combinat.counting`
 - :ref:`sage.combinat.enumerated_sets`
 - :ref:`sage.combinat.catalog_partitions`
 - :ref:`sage.combinat.finite_state_machine`
+- :ref:`sage.combinat.posets.all`
 - :ref:`sage.combinat.species.all`
 - :ref:`sage.combinat.designs.all`
-- :ref:`sage.combinat.posets.all`
 - :ref:`sage.combinat.words.all`
 - :ref:`sage.combinat.bijectionist`
 - :ref:`sage.combinat.chas.all`
@@ -26,7 +26,6 @@
 - :ref:`sage.combinat.sf.all`
 - :ref:`sage.combinat.fully_commutative_elements`
 
-
 Utilities
 ---------
 

src/sage/combinat/alternating_sign_matrix.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-Alternating Sign Matrices
+Alternating sign matrices
 
 AUTHORS:
 

src/sage/combinat/binary_tree.py

@@ -1,5 +1,5 @@
 """
-Binary Trees
+Binary trees
 
 This module deals with binary trees as mathematical (in particular immutable)
 objects.

src/sage/combinat/chas/wqsym.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-Word Quasi-symmetric functions
+Word quasi-symmetric functions
 
 AUTHORS:
 

src/sage/combinat/cluster_algebra_quiver/all.py

@@ -1,7 +1,7 @@
 r"""
 Cluster algebras and quivers
 
-- A compendium on the cluster algebra and quiver package in Sage [MS2011]_
+A compendium on the cluster algebra and quiver package in Sage [MS2011]_
 
 - :ref:`sage.combinat.cluster_algebra_quiver.quiver_mutation_type`
 - :ref:`sage.combinat.cluster_algebra_quiver.quiver`

src/sage/combinat/combinat.py

@@ -7,65 +7,61 @@
 
 **Numbers:**
 
--  Bell numbers, :func:`bell_number`
+- Bell numbers :func:`bell_number`
 
--  Catalan numbers, :func:`catalan_number`
+- Catalan numbers :func:`catalan_number`
 
--  Narayana numbers, :func:`narayana_number`
+- Narayana numbers :func:`narayana_number`
 
--  Euler numbers, :func:`euler_number`
+- Euler numbers :func:`euler_number`
 
--  Eulerian numbers, :func:`eulerian_number`
+- Eulerian numbers :func:`eulerian_number`
 
--  Fibonacci numbers, :func:`fibonacci`
+- Fibonacci numbers :func:`fibonacci`
 
--  Lucas numbers, :func:`lucas_number1`, :func:`lucas_number2`.
+- Lucas numbers :func:`lucas_number1`, :func:`lucas_number2`
 
--  Stirling numbers, :func:`stirling_number1`,
-   :func:`stirling_number2`.
+- Stirling numbers :func:`stirling_number1`, :func:`stirling_number2`
 
--  Polygonal numbers, :func:`polygonal_number`
+- Polygonal numbers :func:`polygonal_number`
 
 **Polynomials**
 
--  Eulerian polynomial, :func:`eulerian_polynomial`
+- Eulerian polynomial :func:`eulerian_polynomial`
 
--  Bernoulli polynomials, :func:`bernoulli_polynomial`
+- Bernoulli polynomials :func:`bernoulli_polynomial`
 
 **Sets:**
 
--  Tuples of a multiset, :func:`tuples` and :func:`number_of_tuples`. An
-   ordered tuple of length `k` of a set `S` is a ordered selection with
-   repetitions of `S` and is represented by a sorted list of length `k`
-   containing elements from `S`.
+- Tuples of a multiset :func:`tuples`, :func:`number_of_tuples`
 
--  Unordered tuples of a set, :func:`unordered_tuples` and
-   :func:`number_of_unordered_tuples`. An unordered tuple of length `k` of a
-   set `S` is an unordered selection with repetitions of `S` and is represented
-   by a sorted list of length `k` containing elements from `S`.
+- Unordered tuples of a set :func:`unordered_tuples`, :func:`number_of_unordered_tuples`
 
 **Combinatorial functions from other modules:**
 
--  :func:`sage.arith.misc.binomial` binomial coefficient
+- Binomial coefficient :func:`sage.arith.misc.binomial`
 
--  :func:`sage.arith.misc.factorial` factorial
+- Factorial :func:`sage.arith.misc.factorial`
 
--  :func:`sage.arith.misc.falling_factorial` falling power
+- Falling power :func:`sage.arith.misc.falling_factorial`
 
--  :func:`sage.arith.misc.rising_factorial` rising power
+- Rising power :func:`sage.arith.misc.rising_factorial`
 
--  :func:`sage.combinat.partition.number_of_partitions` number of partitions
+- Number of partitions :func:`sage.combinat.partition.number_of_partitions`
 
--  :func:`sage.combinat.q_analogues.gaussian_binomial` Gaussian binomial coefficient
+- Gaussian binomial coefficient :func:`sage.combinat.q_analogues.gaussian_binomial`
 
 .. TODO::
 
     Add GUAVA commands:
-        * VandermondeMat
-        * GrayMat returns a list of all different vectors of length n over
-          the field F, using Gray ordering.
-    Add (not in GAP):
-        * Rencontres numbers (:wikipedia:`Rencontres_number`)
+
+    * VandermondeMat
+    * GrayMat returns a list of all different vectors of length n over
+      the field F, using Gray ordering.
+
+    Add commands not in GAP:
+
+    * Rencontres numbers (:wikipedia:`Rencontres_number`)
 
 REFERENCES:
 

src/sage/combinat/crystals/all.py

@@ -1,25 +1,14 @@
 r"""
 Crystals
 
-Introductory material
----------------------
-
 - :ref:`sage.combinat.crystals.crystals`
 - The `Lie Methods and Related Combinatorics <../../../../../thematic_tutorials/lie.html>`_ thematic tutorial
-
-Catalogs of crystals
---------------------
-
 - :ref:`sage.combinat.crystals.catalog`
 
-See also
---------
-
-- The categories for crystals: :class:`Crystals`, :class:`HighestWeightCrystals`,
-  :class:`FiniteCrystals`, :class:`ClassicalCrystals`, :class:`RegularCrystals`,
-  :class:`~sage.categories.regular_supercrystals.RegularSuperCrystals`
-  -- The categories for crystals
-- :ref:`sage.combinat.root_system.all`
+See also the categories for crystals: :class:`Crystals`,
+:class:`HighestWeightCrystals`, :class:`FiniteCrystals`,
+:class:`ClassicalCrystals`, :class:`RegularCrystals`,
+:class:`~sage.categories.regular_supercrystals.RegularSuperCrystals`
 """
 # install the docstring of this module to the containing package
 from sage.misc.namespace_package import install_doc

src/sage/combinat/designs/bibd.py

@@ -1,5 +1,5 @@
 r"""
-Balanced Incomplete Block Designs (BIBD)
+Balanced incomplete block designs (BIBD)
 
 This module gathers everything related to Balanced Incomplete Block Designs. One can build a
 BIBD (or check that it can be built) with :func:`balanced_incomplete_block_design`::

src/sage/combinat/designs/difference_matrices.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Difference Matrices
+Difference matrices
 
 This module gathers code related to difference matrices. One can build those
 objects (or know if they can be built) with :func:`difference_matrix`::

src/sage/combinat/designs/ext_rep.py

@@ -1,12 +1,12 @@
 r"""
-External Representations of Block Designs
+External representations of block designs
 
-The "ext_rep" module is an API to the abstract tree represented by
+This module is an API to the abstract tree represented by
 an XML document containing the External Representation of a list of
 block designs. The module also provides the related I/O operations for
-reading/writing ext-rep files or data. The parsing is based on expat.
+reading/writing ``ext-rep`` files or data. The parsing is based on expat.
 
-This is a modified form of the module ext_rep.py (version 0.8)
+This is a modified form of the module ``ext_rep.py`` (version 0.8)
 written by Peter Dobcsanyi [Do2009]_ [email protected].
 
 .. TODO::
@@ -15,22 +15,19 @@
     information about things like automorphism groups, transitivity, cycle type
     representatives, etc, but none of this data is made available through the
     current implementation.
-
-Functions
----------
 """
 
-###########################################################################
+# ***********************************************************************
 # This software is released under the terms of the GNU General Public
 # License, version 2 or above (your choice). For details on licensing,
 # see the accompanying documentation.
 #
 # This is a modified form of the module ext_rep.py (version 0.8)
 # written by Peter Dobcsanyi [email protected].
 #
-# Copyright 2004 by Peter Dobcsanyi [email protected], and copyright
-# 2009 Carlo Hamalainen [email protected]
-###########################################################################
+# Copyright 2004 Peter Dobcsanyi [email protected]
+#           2009 Carlo Hamalainen [email protected]
+# ***********************************************************************
 
 import sys
 import xml.parsers.expat
@@ -597,7 +594,6 @@ def _encode_attribute(string):
         sage: _encode_attribute('E')
         'E'
     """
-
     if pattern_integer.match(string):
         return int(string)
     elif pattern_decimal.match(string):
@@ -610,8 +606,7 @@ class XTree:
     '''
     A lazy class to wrap a rooted tree representing an XML document.
     The tree's nodes are tuples of the structure:
-
-        (name, {dictionary of attributes}, [list of children])
+    (name, {dictionary of attributes}, [list of children])
 
     Methods and services of an XTree object ``t``:
 

src/sage/combinat/designs/group_divisible_designs.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Group-Divisible Designs (GDD)
+Group-divisible designs (GDD)
 
 This module gathers everything related to Group-Divisible Designs. The
 constructions defined here can be accessed through ``designs.<tab>``::

src/sage/combinat/designs/latin_squares.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.modules
 r"""
-Mutually Orthogonal Latin Squares (MOLS)
+Mutually orthogonal Latin squares (MOLS)
 
 The main function of this module is :func:`mutually_orthogonal_latin_squares`
 and can be can be used to generate MOLS (or check that they exist)::

src/sage/combinat/designs/resolvable_bibd.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.rings.finite_rings
 r"""
-Resolvable Balanced Incomplete Block Design (RBIBD)
+Resolvable balanced incomplete block design (RBIBD)
 
 This module contains everything related to resolvable Balanced Incomplete Block
 Designs. The constructions implemented here can be obtained through the

src/sage/combinat/designs/steiner_quadruple_systems.py

@@ -1,5 +1,5 @@
 r"""
-Steiner Quadruple Systems
+Steiner quadruple systems
 
 A Steiner Quadruple System on `n` points is a family `SQS_n \subset \binom {[n]}
 4` of `4`-sets, such that any set `S\subset [n]` of size three is a subset of

src/sage/combinat/diagram_algebras.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-Diagram and Partition Algebras
+Diagram and partition algebras
 
 AUTHORS:
 

src/sage/combinat/enumerated_sets.py

@@ -1,5 +1,5 @@
 """
-Enumerated sets and combinatorial objects
+Enumerated sets
 
 Basic enumerated sets
 ---------------------
@@ -13,7 +13,6 @@
 -------------
 
 - :ref:`sage.combinat.partition`
-  (see also: :ref:`sage.combinat.catalog_partitions`)
 - :ref:`sage.combinat.composition`
 - :class:`~sage.combinat.composition_signed.SignedCompositions`
 - :class:`IntegerListsLex`

src/sage/combinat/fqsym.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.modules
 r"""
-Free Quasi-symmetric functions
+Free quasi-symmetric functions
 
 AUTHORS:
 

src/sage/combinat/graph_path.py

@@ -1,7 +1,7 @@
 r"""
-Paths in Directed Acyclic Graphs
+Paths in directed acyclic graphs
 """
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2007 Mike Hansen <[email protected]>,
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -14,7 +14,7 @@
 #  The full text of the GPL is available at:
 #
 #                  http://www.gnu.org/licenses/
-#*****************************************************************************
+# ****************************************************************************
 
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.structure.parent import Parent

src/sage/combinat/grossman_larson_algebras.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.graphs sage.modules
 r"""
-Grossman-Larson Hopf Algebras
+Grossman-Larson Hopf algebras
 
 AUTHORS:
 

src/sage/combinat/matrices/latin.py

@@ -1,6 +1,6 @@
 # sage.doctest: needs sage.combinat sage.groups sage.modules
 r"""
-Latin Squares
+Latin squares
 
 A *latin square* of order `n` is an `n \times n` array such that
 each symbol `s \in \{ 0, 1, \dots, n-1\}` appears precisely once in each

src/sage/combinat/non_decreasing_parking_function.py

@@ -1,5 +1,5 @@
 r"""
-Non-Decreasing Parking Functions
+Non-decreasing parking functions
 
 A *non-decreasing parking function* of size `n` is a non-decreasing
 function `f` from `\{1,\dots,n\}` to itself such that for all `i`, one

src/sage/combinat/ordered_tree.py

@@ -1,5 +1,5 @@
 """
-Ordered Rooted Trees
+Ordered rooted trees
 
 AUTHORS: