# HG changeset patch
# User Peter McNamara <peter.mcnamara at bucknell.edu>
# Date 1248639255 14400
# Node ID e41fd77661c519c86d3bf039024cb47b5676f68e
# Parent  450f54b7c31b53aaf6cb033ef60c3f6cc9bbbc63
imported patch lyndon-words-def-pm.patch

diff --git a/sage/combinat/lyndon_word.py b/sage/combinat/lyndon_word.py
--- a/sage/combinat/lyndon_word.py
+++ b/sage/combinat/lyndon_word.py
@@ -33,6 +33,10 @@ def LyndonWords(e=None, k=None):
     """
     Returns the combinatorial class of Lyndon words.
     
+    A Lyndon word `w` is a word that is lexicographically less than all of 
+    its rotations.  Equivalenty, whenever `w` is split into two non-empty
+    substrings, `w` is lexicographically less than the right substring.
+
     EXAMPLES: If e is an integer, then e specifies the length of the
     alphabet; k must also be specified in this case.