#15560: Add methods to rigged configurations
-------------------------------------+-------------------------------------
       Reporter:  tscrim             |        Owner:  sage-combinat
           Type:  enhancement        |       Status:  needs_review
       Priority:  major              |    Milestone:  sage-6.3
      Component:  combinatorics      |   Resolution:
       Keywords:  rigged             |    Merged in:
  configurations                     |    Reviewers:  Anne Schilling
        Authors:  Travis Scrimshaw   |  Work issues:
Report Upstream:  N/A                |       Commit:
         Branch:                     |  e103d1ee41d9f2809fa74f71dfe35ddacbe2f313
  public/combinat/rigged_configurations/methods-15560|     Stopgaps:
   Dependencies:  #13872 #15882      |
-------------------------------------+-------------------------------------

Comment (by aschilling):

 Hi Travis,

 Here are some more comments:

 * The documentation of right_split has a ` missing. Please run the
 documentation to see that it actually compiles!

 * Please add the map `\theta` to rigged configuration and compare to
 lusztig_involution.

 * Please add tests and more explanations what `build_graph` does. Explain
 which graph it is computing. Also the following fails:

 {{{
 sage: RC = RiggedConfigurations(['D', 4, 1], [[2, 1]])
 sage: from sage.combinat.rigged_configurations.bij_type_D import
 RCToKRTBijectionTypeD
 sage: RCToKRTBijectionTypeD(RC(partition_list=[[1],[1],[1],[1]])).run()
 [[2], [-3]]

 sage:
 
RCToKRTBijectionTypeD(RC(partition_list=[[1],[1],[1],[1]])).run(build_graph=True)
 ---------------------------------------------------------------------------
 ValueError                                Traceback (most recent call
 last)
 <ipython-input-10-1c82ae944c4d> in <module>()
 ----> 1
 
RCToKRTBijectionTypeD(RC(partition_list=[[Integer(1)],[Integer(1)],[Integer(1)],[Integer(1)]])).run(build_graph=True)

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/combinat/rigged_configurations/bij_type_D.pyc in run(self,
 verbose, build_graph)
     513
     514                     if build_graph:
 --> 515                         y = self.rigged_con.parent()(*[x._clone()
 for x in self.cur_partitions])
     516                         self._graph.append([self._graph[-1][1],
 (y, len(self._graph)), letters(b)])
     517

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/structure/parent.so in sage.structure.parent.Parent.__call__
 (sage/structure/parent.c:8924)()

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/structure/coerce_maps.so in
 sage.structure.coerce_maps.DefaultConvertMap_unique._call_with_args
 (sage/structure/coerce_maps.c:4637)()

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/structure/coerce_maps.so in
 sage.structure.coerce_maps.DefaultConvertMap_unique._call_with_args
 (sage/structure/coerce_maps.c:4501)()

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/combinat/rigged_configurations/rigged_configurations.pyc in
 _element_constructor_(self, *lst, **options)
     717             lst = lst[0]
     718
 --> 719         return self.element_class(self, list(lst), **options)
     720
     721     def _calc_vacancy_number(self, partitions, a, i, **options):

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/combinat/rigged_configurations/rigged_configuration_element.pyc
 in __init__(self, parent, rigged_partitions, **options)
     289             nu[-1] = RiggedPartitionTypeB(nu[-1])
     290
 --> 291         ClonableArray.__init__(self, parent, nu)
     292
     293     def _repr_(self):

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/structure/list_clone.so in
 sage.structure.list_clone.ClonableArray.__init__
 (sage/structure/list_clone.c:3758)()

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/structure/list_clone.so in
 sage.structure.list_clone.ClonableArray.check
 (sage/structure/list_clone.c:5758)()

 /Applications/sage/local/lib/python2.7/site-
 packages/sage/combinat/rigged_configurations/rigged_configuration_element.pyc
 in check(self)
     492             for i, vac_num in
 enumerate(partition.vacancy_numbers):
     493                 if vac_num < partition.rigging[i]:
 --> 494                     raise ValueError("rigging can be at most the
 vacancy number")
     495
     496     def to_tensor_product_of_kirillov_reshetikhin_tableaux(self,
 display_steps=False, build_graph=False):

 ValueError: rigging can be at most the vacancy number
 }}}

 Anne

--
Ticket URL: <http://trac.sagemath.org/ticket/15560#comment:22>
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 unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.

Reply via email to