Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

asked 2022-02-17 02:01:07 +0100

BMC gravatar image

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s') [s1,s2,s3,s4,s5]=W.simple_reflections() S=W.simple_reflections() T=W.reflections() for u in W: for v in W: if u!=v and v!=W.long_element() and u.bruhat_le(v): K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)]) if K.cardinality()==v.length()-u.length(): print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s') [s1,s2,s3,s4,s5]=W.simple_reflections() S=W.simple_reflections() T=W.reflections() for u in W: for v in W: if u!=v and v!=W.long_element() and u.bruhat_le(v): K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)]) if K.cardinality()==v.length()-u.length(): print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s') [s1,s2,s3,s4,s5]=W.simple_reflections() S=W.simple_reflections() prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections() for u in W: for v in W: if u!=v and v!=W.long_element() and u.bruhat_le(v): K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)]) if K.cardinality()==v.length()-u.length(): print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

prefix='s') [s1,s2,s3,s4,s5]=W.simple_reflections() S=W.simple_reflections() T=W.reflections() for u in W: for v in W: if u!=v and v!=W.long_element() and u.bruhat_le(v): K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)]) if K.cardinality()==v.length()-u.length(): print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s') [s1,s2,s3,s4,s5]=W.simple_reflections() S=W.simple_reflections() T=W.reflections() prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

    for v in W:
        for v in W:
             if u!=v and v!=W.long_element() and u.bruhat_le(v):
                      K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)])
    u.bruhat_le(t*u) and (t*u).bruhat_le(v)])

                    if K.cardinality()==v.length()-u.length():
                            print([u,v])

                        print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

    for v in W:

        if u!=v and v!=W.long_element() and u.bruhat_le(v):

                    K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])

                    if K.cardinality()==v.length()-u.length():

                        print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

T=W.reflections() for u in W:

    for v in W:

        if u!=v and v!=W.long_element() and u.bruhat_le(v):

                    K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])

                    if K.cardinality()==v.length()-u.length():

                        print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections() for u in W:

W:
        for v in W:
          if u!=v and v!=W.long_element() and u.bruhat_le(v):
                      K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])

u.bruhat_le(tu) and (tu).bruhat_le(v)])
                        if K.cardinality()==v.length()-u.length():

                        print([u,v])
print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections() T=W.reflections()

for u in W: for v in W: if u!=v and v!=W.long_element() and u.bruhat_le(v): K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)]) if K.cardinality()==v.length()-u.length(): print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

    for v in W:
        for v in W:
            if u!=v and v!=W.long_element() and u.bruhat_le(v):
                     K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)])
    u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                    if K.cardinality()==v.length()-u.length():
                            print([u,v])
print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

W:
        for v in W:
         if u!=v and v!=W.long_element() and u.bruhat_le(v):
                     K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
u.bruhat_le(tu) and (tu).bruhat_le(v)])
                        if K.cardinality()==v.length()-u.length():
                        print([u,v])
print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W: for v in W: W:

        if u!=v and v!=W.long_element() and u.bruhat_le(v):
                     K=Set([t for t in T if u.bruhat_le(tu) and (tu).bruhat_le(v)])
    u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                    if K.cardinality()==v.length()-u.length():
                            print([u,v])
print([u,v])

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W: for v in W:

    for v in W:

        if u!=v and v!=W.long_element() and u.bruhat_le(v):
                    K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                    if K.cardinality()==v.length()-u.length():
                        print([u,v])
click to hide/show revision 14
None

updated 2022-02-17 04:23:32 +0100

John Palmieri gravatar image

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

        for v in W:

         if u!=v and v!=W.long_element() and u.bruhat_le(v):
                     K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                     if K.cardinality()==v.length()-u.length():
                         print([u,v])
click to hide/show revision 15
retagged

updated 2022-02-17 18:50:59 +0100

FrédéricC gravatar image

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

        for v in W:

            if u!=v and v!=W.long_element() and u.bruhat_le(v):
                        K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                        if K.cardinality()==v.length()-u.length():
                            print([u,v])
click to hide/show revision 16
None

updated 2022-02-17 18:51:53 +0100

FrédéricC gravatar image

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

        for v in W:

            if u!=v and v!=W.long_element() and u.bruhat_le(v):
                        K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                        if K.cardinality()==v.length()-u.length():
                            print([u,v])
click to hide/show revision 17
retagged

updated 2022-02-17 18:52:18 +0100

FrédéricC gravatar image

A problem of the memory of the Kernel in sage 9.5.

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

for u in W:

        for v in W:

            if u!=v and v!=W.long_element() and u.bruhat_le(v):
                        K=Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
                        if K.cardinality()==v.length()-u.length():
                            print([u,v])
click to hide/show revision 18
None

updated 2022-02-17 20:50:53 +0100

slelievre gravatar image

A problem of the memory of the Kernel in sage 9.5.Memory full and Weyl group

I have a problem of finding all regular intervals in the Coxeter group A9. When I use the code below for small groups A1 up to A4 I find the intervals. But for big groups like A7,A8 A7, A8 (these are symmetric groups S8 and S9), etc in sage 9.5 they say that the memory is full. Is there a way of cleaning the used memory so that I can get the last intervals? Because I want to see how the last few intervals look like. Down is the code.

W=WeylGroup('A9', W = WeylGroup('A9', prefix='s')

[s1,s2,s3,s4,s5]=W.simple_reflections()

S=W.simple_reflections()

T=W.reflections()

s1, s2, s3, s4, s5 = W.simple_reflections()
S = W.simple_reflections()
T = W.reflections()
for u in W:
     for v in W:
         if u!=v and v!=W.long_element() u != v and v != W.long_element() and u.bruhat_le(v):
                        K=Set([t K = Set([t for t in T if u.bruhat_le(t*u) and (t*u).bruhat_le(v)])
             if K.cardinality()==v.length()-u.length():
                            print([u,v])
K.cardinality() == v.length() - u.length():
                print([u, v])
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
about | faq | help | privacy policy | terms of service
Powered by Askbot version 0.7.59