Ticket #14099: trac_14099-rev.patch

File trac_14099-rev.patch, 1.3 KB (added by ncohen, 8 years ago)
  • sage/combinat/posets/posets.py

    # HG changeset patch
    # User Nathann Cohen <nathann.cohen@gmail.com>
    # Date 1371650805 -7200
    # Node ID 485c2dca961af9c64498a8ef30d6ccc994ef87f4
    # Parent  6858c13cedd15127ffe9381e060a1ad761893a17
    Adding Method for testing avoidance in posets -- fixed reference in the docstring
    
    diff --git a/sage/combinat/posets/posets.py b/sage/combinat/posets/posets.py
    a b  
    15431543        If ``m`` is a tuple of pairs of chain lengths, returns ``True`` if the poset
    15441544        does not contain a pair of incomparable chains whose lengths comprise
    15451545        one of the chain pairs, and ``False`` if not.
    1546        
    15471546        A poset is `(m+n)`-free if it contains no induced subposet that is
    15481547        isomorphic to the poset consisting of two disjoint chains of lengths
    15491548        `m` and `n`.  See, for example, Exercise 15 in Chapter 3 of
    1550         Stanley, *Enumerative Combinatorics, Volume 1*, 2nd edition.
     1549        [EnumComb1]_.
    15511550
    15521551        INPUT:
    15531552
     
    16191618        AUTHOR:
    16201619
    16211620        - Eric Rowland (2013-05-28)
     1621
     1622        REFERENCES:
     1623
     1624        .. [EnumComb1] Enumerative Combinatorics I,
     1625          Second Edition,
     1626          Richard P. Stanley,
     1627          Cambridge University Press (2011)
    16221628        """
    16231629        if n is None:
    16241630            try: