Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

> Additional thoughts how to tackle these? Okay, I got this working too now -- thanks again, it works and I can try to get further with the research problem we look at! -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

Here is the latest updates: 1. After setting # Location of system crti.o, in case we build our own gcc export SAGE_CRTI_DIR="/usr/lib/gcc/x86_64-redhat-linux/4.4.7/../../../../lib64" in src/bin/sage-env-config.in by hand, the compilation of 8.8.beta7 with #27907 merged now works. Many thanks

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

Following the setting of SAGE_CRTI_DIR in "build/pkgs/gcc/spkg-configure.m4" seems to work: (sage-sh) stumpcl2@dlp762:sage$ echo $CC gcc (sage-sh) stumpcl2@dlp762:sage$ echo $CRTI (sage-sh) stumpcl2@dlp762:sage$ CRTI=`$CC -print-file-name=crti.o 2>/dev/null || true` (sage-sh)

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

No, it hasn't. I just did "make distclean" and then "./configure" which recreated src/bin/sage-env-config, but it says export SAGE_CRTI_DIR="@SAGE_CRTI_DIR@" -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

[stumpcl2@dlp762 ~]$ cd progs/sage/ [stumpcl2@dlp762 sage]$ ls -l local/lib/gcc/*/7.2.0/*crt* -rw-r--r-- 1 stumpcl2 15301 2896 4. Jun 16:22 local/lib/gcc/x86_64-pc-linux-gnu/7.2.0/crtbegin.o -rw-r--r-- 1 stumpcl2 15301 3224 4. Jun 16:22 local/lib/gcc/x86_64-pc-linux-gnu/7.2.0/crtbeginS.o

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

here comes /tmp/stumpcl2/sage/local/var/tmp/sage/build/mpir-3.0.0-644faf502c56f97d9accd301965fc57d6ec70868.p0/src/config.log -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

It appears that it is not an issue of this particular old system as Matthias pointed out. I would appreciate further help at https://trac.sagemath.org/ticket/27907 to figure out how to provide the correct version of [gcc-7.2.0] /usr/lib/../lib/crti.o: could not read symbols: File in wrong

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

Okay, thank you for checking -- I think that machine needs some upgrades! In case anyone else runs into this issue, here is a partial fix: I first compiled 8.6 from scratch and then upgraded to 8.8.beta6 and this worked. Unfortunately, my own code on top of 8.8.beta6 again does not build with

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

> well, building gcc 7 with a 7-years old complier (gcc version 4.4.7 > 20120313 (Red Hat 4.4.7-23), as the log says) > probably not possible. > Do they have something newer installed? They did install for me both gcc-7.2.0 (didn't work) and gcc-7.3.0 (didn't work either). Let me emphasize

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

> ./configure --with-mp=mpir > make This did not work -- but if I do not provide any gcc, sage compiles its own and this works for gcc-7.2.0 on sage-8.6 while it does not work for the same gcc-7.2.0 on sage-8.7. You find the log for the failing gcc-7.2.0 attached. -- You received this

Re: [sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

Thanks Dima! -- here is the requested information: It's a fresh install, config.log is attached. In just this moment, the system admin told me that he was able to compile sage-8.6 using the standard gcc compiler by RHEL6 (this is copy-and-paste, I don't know what that means), while the error

[sage-devel] Re: compiling error for 8.8.beta6 on Red Hat 6.10

(only realizing now that the "attaching the logs" failed yesterday...) -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To

[sage-devel] compiling error for 8.8.beta6 on Red Hat 6.10

I am getting errors building * package: gfan-0.6.2.p1 * package: ppl-1.2.p1 please see the attached logs. For ppl configure: error: Cannot find GMP version 4.1.3 or higher. and for gfan ./gfan: /usr/lib64/libstdc++.so.6: version `GLIBCXX_3.4.20' not found (required by ./gfan) ./gfan:

[sage-devel] Changing permutation group iteration order causes tons of doctests failures

Changing permutation group iteration order causes tons of doctests failures, so *WHAT TO DO?* In https://trac.sagemath.org/ticket/25477, we implemented a fast iteration through permutation groups using strong generating sets. This causes the iteration order to change. The problem is that

[sage-devel] Re: sage gets killed on startup on ubuntu

> Another thing: try to move your ~/.sage/ away awesome, that worked -- thanks! -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to

[sage-devel] Re: sage gets killed on startup on ubuntu

$ printenv CLUTTER_IM_MODULE=xim LS_COLORS=rs=0:di=01;34:ln=01;36:mh=00:pi=40;33:so=01;35:do=01;35:bd=40;33; 01:cd=40;33;01:or=40;31;01:mi=00:su=37;41:sg=30;43:ca=30;41:tw=30;42:ow=34; 42:st=37;44:ex=01;32:*.tar=01;31:*.tgz=01;31:*.arc=01;31:*.arj=01;31:*.taz=

[sage-devel] Re: sage gets killed on startup on ubuntu

> Either you updated the system, or you updated the (shell) environment, or your disk/swap is almost full, or your hardware is dying, or worse... It doesn't seem as if any of these apply -- any idea what I could check to find the issue? Note that I can start python sage's python normally, see

[sage-devel] Re: sage gets killed on startup on ubuntu

> some interesting env var set? not actively, looking through them doesn't show anything that seems sage related. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email

[sage-devel] sage gets killed on startup on ubuntu

Hi, since today, I cannot start sage anymore, not even on a freshly compiled development version (or any other of my older sage versions): Testing that Sage starts... [2018-06-20 17:33:33] SageMath version 8.2, Release Date: 2018-05-05 This looks like the first time you are running Sage.

[sage-devel] Re: Permutation group: faster use of stabilizer chain from gap

Okay, I think I got all the bottlenecks resolved now -- I'd appreciate further comments and reviews on the ticket (https://trac.sagemath.org/ ticket/25477 ), especially from someone familiar with the libgap interface. -- You received this message because

[sage-devel] Re: Permutation group: faster use of stabilizer chain from gap

Hi, Thanks for the reply! The ticket has evolved drastically since my post here (and indeed uses libgap now), the bottleneck now is that I have a libgap list of libgap integers (which are indeed C integers) and need to use these in cython, which I currently fail to do. Anyway, I do not see

[sage-devel] Permutation group: faster use of stabilizer chain from gap

In https://trac.sagemath.org/ticket/25477, we (this is mainly Moritz Firsching) implement a new iterator for permutation groups using stabilizer chains. Indeed, the multiplication of permutations seems to be faster than in gap so we hope this method to be really fast in the end... The

Re: [sage-devel] help needed for pushing to trac

> I think there was an issue related to how the GitHub logins worked. > Please log out and log in again, re-upload your SSH key, and give it > another try. yes, works now -- thanks! -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To

[sage-devel] help needed for pushing to trac

Hi, I recently changed my ssh key, and now wanted to push to trac for the first time since. I hopefully followed every relevant line in http://doc.sagemath.org/html/en/developer/trac.html 1. I copied my new ssh key and can see it via $ git trac config Trac xmlrpc URL:

Re: [sage-devel] Experimental package gap3 installation broken

Dear Jeroen, > This was broken in #20692, the "cd src" should NOT have been removed: thanks for spotting, I created ticket #22480 . Christian -- You received this message because you are subscribed to the

[sage-devel] Experimental package gap3 installation broken

Hi, on 7.5.beta3, I can still install without problems the experimental package GAP3 after deleting the upstream tarball. I then created a second copy of sage with the (now almost) newest development version 7.6.beta4. When trying to install the package there, I get the following error:

Re: [sage-combinat-devel] I want product of the outgoing vertices as product of variables but it gives nonint type erros

Dear Biswajit, it doesn't hurt opening a question with a friendly sentence. Anyway, as the output tells you, your graph vertices are labelled by strings (namely "x0", "x1", ...) which you cannot multiply as the product of two strings is not defined here. If you want to use variables instead,

[sage-devel] Re: Error building openblas-0.2.19

> https://groups.google.com/d/msg/sage-release/3QJoAgg9bgo/5uvnTLV1AwAJ awesome, seems to work -- thanks! C# -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to

[sage-devel] Error building openblas-0.2.19

I just compiled sage-7.5.beta3 on a brand-new computer (also tried 7.4 with the same outcome) and openblas-0.2.19 failed to build with the attached error message (apparently different from previous problems with a missing library): Makefile:123: *** OpenBLAS: Detecting CPU failed. Please set

[sage-devel] Can we still not get canonical labels and graph isomorphisms from nauty?

The title says it all: Is it still state of the art that we cannot get canonical labels and graph isomorphisms from nauty? I found this post from last year https://groups.google.com/d/topic/sage-devel/mKZ1Ar1lJG0/discussion I just checked the vertex-facet incidence graph of the 24-cell,

[sage-devel] Optional package for GAP3 reloaded

Dear all, I have provided a new version of an optional package for GAP3 at http://trac.sagemath.org/ticket/20107 . I would be glad if some people could try to install as I only tested it on a 64bit linux machine; so both 32bit and osx installations would be appreciated! Beside that, also more

[sage-devel] Re: Bug in computing the Gröbner fan of an ideal of minors in a matrix

This is now http://trac.sagemath.org/ticket/20146 in case anyone wants to have a look. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to

[sage-devel] Bug in computing the Gröbner fan of an ideal of minors in a matrix

Hi, (after having a Singular bug in the computation of its Hilbert series, i now have a bug in computing the Gröbner fan: First one annoyance (yes, x1 is a prefix of x11) that I want to point out: {{{ sage: P = PolynomialRing(QQ,3*5,"x"); x = P.gens(); M = Matrix(3,x) sage: M [ x0 x1 x2 x3

[sage-devel] Bug in computing the Hilbert series of an ideal of minors in a matrix

Hi, if I compute the Hilbert series of the ideal generated by all 2x2 minors in a 4x10 matrix of variables, everything works well. But if I increase the number of columns to 11, the outcome is false. I created a ticket at http://trac.sagemath.org/ticket/20145 -- I would appreciate if someone

Re: [sage-devel] Re: The Sage Project (Nathann Cohen)

> > I had to involve outside investors, and I may have to do so again in the > future. They put their personal money on the line, and will have a > say about how profits might get used, if there are ever any profits I was always a supporter of SMC since I think you are building a great tool

[sage-devel] Hm, seemingly wrong bracketing works anyway?

Is it just me finding it wired that the following works with the wrong bracketing [1..len(a]) ? sage: a = [1,2,3] sage: [1..len(a]) [1, 2, 3] Cheers, Christian -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from

[sage-devel] setting up "git trac" seems to be broken

Hi, I got the following both on my machine as on the sage cloud: ~/sage-git$ git trac config --user stumpc5 --pass '' Saved trac username. Saved trac password. Trac xmlrpc URL: http://trac.sagemath.org/xmlrpc (anonymous) http://trac.sagemath.org/login/xmlrpc (authenticated) realm

Re: [sage-devel] Re: setting up "git trac" seems to be broken

> What did it download to /tmp/tmpBtMBUh? The file doesn't appear to exist. Is the command "git trac config --user YourName --pass 'pwd' " only not working for me? -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group

Re: [sage-devel] Re: setting up "git trac" seems to be broken

> Whats the error with the updated git-trac script? you find the error with the updated script at the end. I can now reproduce and solve the error: --> if I 1. go to Preferences -> SSH keys, 2. add blank lines between the different keys, 3. press "save changes", I get the below error message

Re: [sage-devel] Re: setting up "git trac" seems to be broken

> I think you have an invalid ssh key added to trac, can you double-check? Okay, it appears that I can only paste a *single* ssh key into the field in the trac preferences. Even though it says that I can have multiple, one per line. I now have three there, and pasting any single of them makes it

Re: [sage-devel] Re: setting up "git trac" seems to be broken

> well the empty string is not a valid key; I'll change the script to skip over > them. I agree. But the empty lines seem to be deleted automatically on the preferences page (I only copy-paste it forward to an editor and then back to the website, without any deletion of empty line). I only used

Re: [sage-devel] Re: Which servers do I contact when doing sage development?

IMHO its a stupid firewall setup to restrict by IP numbers. It reeks of the 90s where you neither had github nor cdns. But its 20 years later, if you can't connect to github then you can't do scientific computing work period. Just tell your admins to get a clue, thats way more productive

[sage-devel] Which servers do I contact when doing sage development?

I work on a sage development branch on a machine behind a firewall. That firewall doesn't allow me to contact any IPs, except if I whitelisted it. Until recently, that was not a big deal when doing development there, the servers I needed to contact were sagemath.org git.sagemath.org

[sage-devel] Re: Shortest expressions in permutation groups with generators

the reason must be efficiency. E.g. for permutation groups one would work with a strong generating set S, rather than the original generators; expressing an element in terms of S is very quick, and then you hold expressions for each element of S in terms of the original generators

[sage-devel] Re: Shortest expressions in permutation groups with generators

GAP4 has 39.5-2 Factorization ( http://www.gap-system.org/Manuals/doc/ref/chap39.html) calling GAP from Sage is not hard... Thanks for your reply -- but I am still a little puzzled: gap has two algorithms to compute a word in generators. This one, and the one implemented in

[sage-devel] Re: Which servers do I contact when doing sage development?

You need to access sagemath.org with is now on the fastly cdn (via github). Its almost certainly geo-specific ip and subject to change without notice. IMHO you can't reasonably assume that special IP numbers work. I agree that www.sagemath.org is there, but it seems that sagemath.org has

Re: [sage-devel] Re: Which servers do I contact when doing sage development?

The mirror list is downloaded from http://www.sagemath.org/mirror_list Is it true that among the needed resources, only www.sagemath.org is or will be any time soon located anywhere where I cannot assume a relatively constant IP ? If the answer is yes or likely yes: are there only few

Re: [sage-devel] Re: Which servers do I contact when doing sage development?

This is probably safer than what you have now, since the whitelist entry isn't permanent -- it's only for connections you've initiated. With the permanent whitelist, someone who takes over git.sagemath.org could try to SSH into your machine while you're asleep. It's also way way way

[sage-devel] functionality request on recursively enumerated sets

I have a question about the code of recursively enumerated sets inside sets/recursively_enumerated_sets.pyx. Such recursive structures contain the extra information about a path from the seeds to a given node (which is indeed a shortest path for breadth first search). Since the successor function

[sage-devel] Shortest expressions in permutation groups with generators

Hi there, I wasn't able to find the following functionality: Let W = PermutationGroup(gens) be a permutation group and let w in W. Find a *shortest* expression as a group of w as a word in gens and their inverses. w.word_problem() finds a word, but this has not necessarily the shortest possible

[sage-combinat-devel] How to set the category of finite Coxeter groups properly?

Hi there, I need some help with the category framework. There is a category finite Coxeter group which is CoxeterGroups().Finite(). I now have implemented a category ComplexReflectionGroups().Finite().WellGenerated() which is certainly a super category of CoxeterGroups().Finite(). But if I add

Re: [sage-combinat-devel] How to set the category of finite Coxeter groups properly?

Great, that worked -- thanks Nicolas! Here is one more issue, is that what I should expect, or should I change something there? (Should Category of finite groups still be there? Thanks again, Christian Failed example: FiniteCoxeterGroups().super_categories() Expected: [Category of

Re: [sage-combinat-devel] weyl group element of E8 act on a positive root to get some partiular root but the below program shows error

Hi all, - Can GAP iterate through the elements of a finite matrix group (at this point this is all GAP know about the group) without storing them all in memory. according to the user manual of Chevie (https://www.imj-prg.fr/~jean.michel/gap3/htm/chap069.htm#SECT024) it is possible to

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Does findstat relly on a big database that is enhanced with the new queries? Or does it compute every query from scratch? I start with answering here since this the crucial point. We want to use Sage in FindStat only in the background, a user interacting with FindStat (by searching for

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Does findstat relly on a big database that is enhanced with the new queries? Or does it compute every query from scratch? I start with answering here since this the crucial point. We want to use Sage in FindStat only in the background, a user interacting with FindStat (by searching for

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Would it be possible to include the findstat functionality in sage? That is, i have a bunch of pairs (permutation, number), then call the function findtsta on them, and get a list of possible ways that the numbers can me computed from the permutations. All inside sage, without need to go to

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Just to make this statement more precise: it will not be possible within the next two years if Mmarco relies on your availability for this (there is no blame in that statement, it's just a clarification that others might be willing to work on this problem). It is not a problem -- it's the

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

It seems that actually nobody read my initial post on that thread... so let me repeat I did -- but didn't really have any qualified contribution... But the semantic has to be implemented at the level of maps not at the level of methods. could you explain what you mean there (maybe using

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

The second step would be to think how to add semantic to the map. Part of is already managed by the axioms/categories (for example a Morphism between GradedSets preserve the grading). But there is nothing for injectivity/surjectivity or more subtle properties. Thanks for the clarification! I

Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Ceterum censeo: Please do not put too much semantic into an attribute of the map. It will be a burden for the map, will cost memory, and will be difficult to search. I would personally really like to get semantic information about maps implemented in Sage. This starts with automated

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Would it be possible to include the findstat functionality in sage? That is, i have a bunch of pairs (permutation, number), then call the function findtsta on them, and get a list of possible ways that the numbers can me computed from the permutations. All inside sage, without need to go to

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Just to make this statement more precise: it will not be possible within the next two years if Mmarco relies on your availability for this (there is no blame in that statement, it's just a clarification that others might be willing to work on this problem). It is not a problem -- it's the

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

It seems that actually nobody read my initial post on that thread... so let me repeat I did -- but didn't really have any qualified contribution... But the semantic has to be implemented at the level of maps not at the level of methods. could you explain what you mean there (maybe using

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

The second step would be to think how to add semantic to the map. Part of is already managed by the axioms/categories (for example a Morphism between GradedSets preserve the grading). But there is nothing for injectivity/surjectivity or more subtle properties. Thanks for the clarification! I

[sage-devel] Re: [sage-combinat-devel] Re: redesign combinatorial statistics

Ceterum censeo: Please do not put too much semantic into an attribute of the map. It will be a burden for the map, will cost memory, and will be difficult to search. I would personally really like to get semantic information about maps implemented in Sage. This starts with automated

Re: [sage-combinat-devel] combinatorial statistics

well, there was a decorator for statistics before the move to gitI have code that used it. sorry, Martin, that we removed it again! But you see that Nathann keeps arguing it is not useful to people (I am not going to participate in that discussion -- I want to do math and I don't kill my

Re: [sage-combinat-devel] combinatorial statistics

Besides: is it possible to run a more exhaustive FindStat search? If I understand correctly, FindStat limits itself to 3 maps, right? No -- you can change the 3 into a 5 at most. And the at most is just a limit to not run for too long, so if you are willing to wait overnight, we can also do 6

Re: [sage-combinat-devel] combinatorial statistics

Another question: I would like to search for a statistic (on permutations, but the question applies in general) that satisfies addtitional structural constraints (eg., it should be invariant under conjugation with the long cycle). Is such a search also possible? The obvious solution is to

Re: [sage-combinat-devel] combinatorial statistics

Yes! So, if I want to perform such a query, I should send the code generating the statistic to you, right? How urgent is it? -- I could try and see if the server explodes if I increase the 5 to a 7. That way, you can keep playing there. -- You received this message because you are

Re: [sage-combinat-devel] combinatorial statistics

I am in need of browsing through all the statistics on permutations and derangements, and wanted to use combinatorial_statistics_in_class, but I can't find it anymore... What should I be using? Hi Martin -- sage: from sage.combinat.combinatorial_map import combinatorial_maps_in_class sage:

Re: [sage-combinat-devel] combinatorial statistics

thanks for the fast reply -- but I need statistics, not maps. I..e, I'd like to have a list of all methods applying to permutations that return a number... sorry for not properly reading your request! We had, similar to the @combinatorial_maps decorator, an @combinatorial_statistic decorator

[sage-devel] 6.2.rc0 crashed on startup

Hi, I just pulled the newest develop version and did make start. Now, I get the error below. Am I again doing something wrong here? Thanks for your help, Christian --- -- stumpc5@stumpc5:~/progs/sage$ sage

Re: [sage-devel] 6.2.rc0 crashed on startup

Why using make start instead of make? (doing it currently, but it takes some time.) I thought that's the same, except that I save the time of building the documentation. Isn't that right? Thanks! -- You received this message because you are subscribed to the Google Groups sage-devel

Re: [sage-devel] 6.2.rc0 crashed on startup

Why using make start instead of make? (doing it currently, but it takes some time.) I thought that's the same, except that I save the time of building the documentation. Isn't that right? okay, it finished -- but the error on startup remained... any ideas? Thanks again, Christian --

Re: [sage-devel] 6.2.rc0 crashed on startup

Please, put the log somewhere accessible to everybody. From which version did you upgrade? Sometimes, the build system is not smart enough and it is needed to do a make distclean and then make... i.e. rebuilding Sage from scratch. Thanks for your help! I attach the report -- I

Re: [sage-devel] 6.2.rc0 crashed on startup

Thanks for your help! I attach the report -- I upgraded from 6.2.beta4 if I remember right. I will redo the make, but that will take until tomorrow morning... I just typed the last line of the crash report into google and see that it was discussed before in sage-release:

[sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

Hi -- [ disclaimer: I am not quite sure that I did everything right, git still doesn't feel like home. ] I pulled the Sage master and development branches. Then I checked out master and compiled 6.1.1 without problems. Then I checked out devel, compiled, and got the error below. Then I

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

Could you be more precise on which command did you use? It might be that you rebuild sage source code (sage -b) instead of rebuild everything (make). That is right, I did use sage -b. Should I have used make instead? (At some point I also tried make start, but I am not sure anymore if this

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

The thing is that between two versions some of the spkg might have changed. So each time you change version you should do use make. If no spkg has changed, it will be equivalent to sage -b. Thanks, it worked now! But I just got the below error building the doc. Is that related, or another

Re: [sage-devel] Compilation of 6.2.beta0 - 6.2.beta4 fails

No idea... You can try to rebuild doc from scratch with make doc-clean and then make doc-html. Anyway, even not doing that you should have a working Sage version (without docs) Thanks again, Sage works now! And I will be the docs working hopefully also... Christian -- You received this

[sage-combinat-devel] Input for skew tableaux

Hi, Is it on purpose / can I rely on the following behaviour for skew tableaux: sage: tab = SkewTableau([[0,1,None],[None,None,1,2],[None,None,0,0,1],[1,None]]); tab [[0, 1, None], [None, None, 1, 2], [None, None, 0, 0, 1], [1, None]] As we also had for compositions, it appears that I can even

Re: [sage-combinat-devel] Le diagrams and permutation tableaux

Thanks for your comments, Darij! My impression is that I also do not quite answer to your mail: What I would like to have: Given a partition \lambda (or something more general, even a BadShape without knowing what that is), I would like a class of all Le diagrams of shape \lambda. I.e., a class

[sage-combinat-devel] Le diagrams and permutation tableaux

Hi there, I wonder if someone already has code for Postnikov's Le diagrams. These are fillings of partitions fitting in a box with 0's and 1's with the additional property that no 0 has a 1 in the same column AND to its left in the same row. My aim is to get Le diagrams (or maybe the subclass of

Re: [sage-combinat-devel] Russian

Below my office mate's term for lattice polytope: lattice polytope is целочисленный многогранник (by the way, both polytope and polyhedron are translated in Russian by this single word). Cheers, Christian -- You received this message because you are subscribed to the Google Groups

Re: [sage-combinat-devel] Russian

Sorry, I don't know Russian either. As a tiny step, I selected links to the appropriate english wikipedia page to at least clear potential ambiguity. Some have translations in other languages which might help. I am sure Sergey Fomin knows all those terms in case they exist in Russian - I

Re: [sage-combinat-devel] Re: About Free Algebras, infinite Words and equality

Yes, but it's associative, so it works... (Except I don't expect it to have much of a use.) can you be more specific? How is the product uv defined? I see that you have a shuffle product defined, but I don't see that you have concatenation... Thanks, Christian -- You received this message

[sage-combinat-devel] Bug in Core

Hi, do you consider the following a bug? sage: A = Core([2],4) sage: B = Core([2],5) sage: hash(A) == hash(B) True The hash of a core only depends on the list and not on the core. Since the same list considered as an x- and as a y-core are fundamentally different objects, I would rather suggest

Re: [sage-combinat-devel] Re: Bug in Core

sage: (Partition([2]).to_core(4)).parent() 5-Cores of length 2 Okay, I get from the documentation of to_core that this returns what it is supposed to. But anyway, let me mention that for me as someone not very familiar with the topic, I would expect that Partition([2]).to_core(k) checks if

Re: [sage-combinat-devel] Re: Bug in Core

I wouldn't necessarily call that a bug, as it is necessary since A == B. four people, two options, five opinions... Let me ask this, is being a k-core a property of a partition or is it a *distinct* combinatorial object? As mathematical concepts, that doesn't make much of a difference, I'd

[sage-devel] Re: Review a ticket with git

Thanks, sage -dev push --ticket 12345 worked like a charm, while - after installing the git-trac module as described there - git trac push 12345 resulted in the import errror No module named xmlrpc.client. For the record, those are the sage-combinat conventions. I think they are quite good

[sage-devel] Review a ticket with git

Hi, I started yesterday to review my first ticket using git (thanks to Nathann and Andrew for help). Reading http://wiki.sagemath.org/TentativeConventions#Review_a_ticket, I get the impression that I can checkout the right branch, do changes, commit them to that branch, and push it. But

[sage-devel] Re: computing a graph diameter

Hi Nathann, So yeah. This stupid problem with the diameter will go away, I swear. A couple of patches, things like that. I thought 65536 would be okay for Sage but even I need to create larger graphs sometimes. Plus it's shameful to have errors like that. I do see that you are

Re: [sage-devel] Re: computing a graph diameter

Hi, - Try networkx : sage: import networkx sage: g=graphs.PetersenGraph().networkx_graph() sage: networkx.diameter(g) 2 - You tell me that you will review the patch, and you have it in a couple of hours at most. Of course the second way out is the only one that actually

Re: [sage-devel] Re: computing a graph diameter

HMm... It's not exactly a yes, nor exactly a no... :-P This is the most certain yes you can hope for from someone who doesn't know how to achieve the task bouded to the yes. timeit repeats many times the same command, and sees gives you an idea of the average time. But given what

[sage-devel] computing a graph diameter

Hi, I wonder if there is a way in Sage to efficiently compute the diameter of a graph. The current example I have has 100.000 vertices and 500.000 edges, and calling diameter on it returns ValueError: The graph backend contains more than 65535 nodes Looking at

[sage-devel] Re: computing a graph diameter

while playing a big with Nathann's implementation http://www.sagemath.org/doc/reference/graphs/sage/graphs/distances_all_pairs.html, I also saw: sage: len(cov) 24024 sage: %time Graph(cov) CPU times: user 3.00 s, sys: 0.04 s, total: 3.04 s Wall time: 2.97 s Graph on 6006 vertices sage: G =

Re: [sage-combinat-devel] Equality of objects

Hi, you find the same question here: https://groups.google.com/d/topic/sage-combinat-devel/1zS_nkfqSSA/discussion I would very much appreciate if we could get this fixed! Cheers, Christian http://www.stump.tv -- You received this message because you are subscribed to the Google Groups

[sage-combinat-devel] Usage of the term Composition

crossposting nbruin's comment from http://trac.sagemath.org/ticket/14862#comment:6 : The thing that mainly surprises me is that sage: a=Hom(ZZ,ZZ)(1) sage: b=Hom(ZZ,ZZ)(1) sage: Composition(a,b) fails. Composition is such an overused term in mathematics that I think it's ill-advised to expose

[sage-combinat-devel] Maximality for PairwiseCompatibleSubsets

Hi, I see that there is already an optional argument maximality=False in the code of PairwiseCompatibleSubsets, but I don't see it used in the code - and I actually vaguely remember Nicolas saying that this was not yet done. I wonder if it would be hard to add the maximality feature to

[sage-devel] Re: Fwd: Re: find_stat in Sage, the combinatorial_map decorator and its consequences

it is however might sound convincing that you basically pollute the codebase with stuff that only you and your collaborators know about. This is not quite right, see https://groups.google.com/d/topic/sage-combinat-devel/a7wq0ksV2fY/discussion the initial discussion on this topic on

  1   2   3   4   5   >