#12993: Bug in computing the rank function a poset
--------------------------------------------------+-------------------------
       Reporter:  saliola                         |         Owner:  
sage-combinat
           Type:  defect                          |        Status:  
needs_review 
       Priority:  major                           |     Milestone:  sage-5.1    
 
      Component:  combinatorics                   |    Resolution:              
 
       Keywords:  poset, combinat                 |   Work issues:              
 
Report Upstream:  N/A                             |     Reviewers:              
 
        Authors:  Darij Grinberg, Anne Schilling  |     Merged in:              
 
   Dependencies:                                  |      Stopgaps:              
 
--------------------------------------------------+-------------------------
Description changed by saliola:

Old description:

> This should return True:
> {{{
> sage: P = Poset(([1,2,3,4],[[1,4],[2,3],[3,4]]), facade = True)
> sage: P.is_graded()
> False
> }}}
>
> Anne's suggestion from this [https://groups.google.com/d/topic/sage-
> combinat-devel/XsMrxKdvl1A/discussion thread] on sage-combinat-devel:
>
>     For a finite poset perhaps the easiest would be to
>
>     - start with a random element in the poset, assign rank 0
>     - look at all covers and cocovers and assign the rank according to
> the recurrence rank(x) = rank(y) + 1 if x covers y.
>     - repeat with the new elements
>     - if at any point an element is reached again and is assigned a
> different value from before, the poset is not graded; otherwise continue
> with new elements

New description:

 This should return True:
 {{{
 sage: P = Poset(([1,2,3,4],[[1,4],[2,3],[3,4]]), facade = True)
 sage: P.is_ranked()
 False
 }}}

 Anne's suggestion from this [https://groups.google.com/d/topic/sage-
 combinat-devel/XsMrxKdvl1A/discussion thread] on sage-combinat-devel:

     For a finite poset perhaps the easiest would be to

     - start with a random element in the poset, assign rank 0
     - look at all covers and cocovers and assign the rank according to the
 recurrence rank(x) = rank(y) + 1 if x covers y.
     - repeat with the new elements
     - if at any point an element is reached again and is assigned a
 different value from before, the poset is not graded; otherwise continue
 with new elements

--

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12993#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to