2021-09-13 21:41:47 +0200 | received badge | ● Famous Question (source) |
2021-03-29 21:11:47 +0200 | received badge | ● Popular Question (source) |
2020-06-12 20:15:38 +0200 | received badge | ● Notable Question (source) |
2020-05-07 11:18:11 +0200 | received badge | ● Famous Question (source) |
2020-05-06 01:15:20 +0200 | asked a question | Hochschild cohomology of a matrix subalgebra Let $M_n(R)$ be the $n\times n$ matrix algebra over the polynomial ring $R=K[t]$. It is spanned by ${e_{ij}; i,j\in[n]}$.
So far, I know how to do some basics: However, I don't know how to create my matrix subalgebra $A$ over $R$. Also, I don't think this really computes hochschild cohomology. Is it dualised over $\mathbb{Q}$ or over $A=\Lambda_\mathbb{Q}[x,y]$? |
2020-01-14 15:45:17 +0200 | received badge | ● Commentator |
2020-01-14 15:45:17 +0200 | commented question | finite simplicial complexes, projective spaces, facets, giving strange output @FrédéricC Not even that, since some tuples end in a comma, not an integer. Anyway, how can I get maximal simplices which have integers for vertices? |
2020-01-14 08:34:00 +0200 | asked a question | finite simplicial complexes, projective spaces, facets, giving strange output The code writes a nice result in the file This works for $n=1,\ldots,4$. However, for $n=5$, the file contains What am I doing wrong here? Why don't I get a list of 5-dimensional simplices? I would like to obtain only the facets of the first 10 projective spaces. |
2019-12-09 11:31:16 +0200 | received badge | ● Notable Question (source) |
2019-07-17 10:53:41 +0200 | commented answer | Running Sage from the commad line in Ubuntu 12.04 I installed it to /home/leon/sage-8.8. How do I create a command |
2019-06-26 17:42:34 +0200 | received badge | ● Popular Question (source) |
2019-02-02 11:25:32 +0200 | received badge | ● Enthusiast |
2019-01-23 17:18:07 +0200 | received badge | ● Popular Question (source) |
2019-01-21 14:43:39 +0200 | commented answer | Loading a 5GB dictionary of matrices uses up all of 64GB RAM Now it works, thank you for your help and patience! : ) Using the above code, I've managed to load 7GB of sparse matrices without crashing (but when loaded, they take up 23GB of RAM, a bit strange). |
2019-01-19 17:39:49 +0200 | commented answer | Loading a 5GB dictionary of matrices uses up all of 64GB RAM Hmm, I still haven't been able to import the file, but probably due to my incompetence. Could you give me specific instructions on how (in what form) to export the file from Mathematica and how to import it in Sage? Do I export it to |
2019-01-16 21:25:05 +0200 | commented answer | Loading a 5GB dictionary of matrices uses up all of 64GB RAM Oh, that's disappointing. I thought Sage was supposed to be much more efficient than Mathematica. Even when I try to import just the largest matrix (that takes up less that 800MB), Sage uses up 28GB of RAM and crashes. |
2019-01-16 11:01:05 +0200 | received badge | ● Good Question (source) |
2019-01-16 09:34:09 +0200 | received badge | ● Nice Question (source) |
2019-01-16 00:42:46 +0200 | asked a question | Loading a 5GB dictionary of matrices uses up all of 64GB RAM In a 5GB I tried splitting the file into three smaller ones and load one after another, but already with the first 1.3GB file, the system crashes after using all RAM, but without using swap. I get: |
2019-01-11 18:08:26 +0200 | commented question | max memory used during a process Any ideas? |
2019-01-07 22:00:12 +0200 | asked a question | max memory used during a process In Mathematica, the command |
2018-10-28 15:45:02 +0200 | commented answer | ChainComplex() runs 24 times slower than homology() Surely, |
2018-10-28 15:42:00 +0200 | commented answer | ChainComplex() runs 24 times slower than homology() Aaah, you're right, with |
2018-10-28 12:15:41 +0200 | received badge | ● Nice Question (source) |
2018-10-28 09:55:39 +0200 | asked a question | ChainComplex() runs 24 times slower than homology() I load a list of matrices When I run Is there a faster way to compute the homology of a chain complex (over $\mathbb{Z}$ or $\mathbb{Z}_p$)? |
2018-10-27 10:45:21 +0200 | received badge | ● Scholar (source) |
2018-10-27 10:45:15 +0200 | commented answer | How to read and run commands from a text file? Yes, I'll be computing a lot of homology of chain complexes. Thank you for your answers!! |
2018-10-26 23:14:38 +0200 | received badge | ● Supporter (source) |
2018-10-26 22:54:42 +0200 | commented answer | How to read and run commands from a text file? Great, it works! Could you also please answer the question about RAM, before I accept? |
2018-10-26 22:14:01 +0200 | received badge | ● Student (source) |
2018-10-26 22:10:54 +0200 | asked a question | How to read and run commands from a text file? I have all my commands in a text file, and I would just like to run them in Sage. What is the easiest way to do this? For example, in sage.txt, I have written: The command Also, does Sage have a limit on how much RAM it can use? If yes, how can I increase the available memory? |