2022-11-30 21:40:54 +0100 | received badge | ● Popular Question (source) |

2022-06-02 01:43:30 +0100 | received badge | ● Famous Question (source) |

2022-06-02 01:43:16 +0100 | received badge | ● Notable Question (source) |

2022-04-26 20:02:49 +0100 | received badge | ● Popular Question (source) |

2022-03-06 19:55:21 +0100 | received badge | ● Famous Question (source) |

2021-11-03 19:00:48 +0100 | received badge | ● Popular Question (source) |

2021-10-27 13:14:32 +0100 | received badge | ● Famous Question (source) |

2021-06-17 05:27:03 +0100 | commented answer | How do you assign (different) LaTex names to elements of a list? I have a bit of a follow-up, lets say I want the latex name to have a bar over it for conjugation, like $\bar{v}$. My n |

2021-06-16 22:22:47 +0100 | commented answer | How do you assign (different) LaTex names to elements of a list? Thank you! |

2021-06-16 22:22:27 +0100 | marked best answer | How do you assign (different) LaTex names to elements of a list? Say I have the following list of variables. How do I make it so that when I use the command, I get $v_{0,0}$ as output? I've tried stuff like and but it only ever give me stuff like $v_{i,j}$ where it's just the literal symbols $i$ and $j$, not the entries of for some $k$ and $m$ I plug in, like 0, 0. |

2021-06-16 21:55:24 +0100 | marked best answer | How to create lists of n-tuples efficiently? The ultimate problem I'm trying to solve, is that given two integers 1) For all 2) For all I have a way of doing this which is very "brute force", where I first construct the list of lists of length 1, then the list of lists of length 2, etc. I suppose I would want to convert x to a list before appending to List1, or many there's some way to iterate over lists instead of tuples. That's not so important, I just want an efficient way to construct these lists. |

2021-06-16 21:52:17 +0100 | asked a question | How do you assign (different) LaTex names to elements of a list? How do you assign (different) LaTex names to elements of a list? Say I have the following list of variables. v = {(i,j) |

2021-04-21 19:18:25 +0100 | edited question | How to create lists of n-tuples efficiently? How to create lists of n-tuples efficiently? The ultimate problem I'm trying to solve, is that given two integers p and |

2021-04-21 19:12:26 +0100 | asked a question | How to create lists of n-tuples efficiently? How to create lists of n-tuples efficiently? The ultimate problem I'm trying to solve, is that given two integers p and |

2021-03-26 14:17:01 +0100 | received badge | ● Notable Question (source) |

2021-03-26 14:17:01 +0100 | received badge | ● Popular Question (source) |

2021-03-01 09:17:33 +0100 | received badge | ● Notable Question (source) |

2021-02-26 09:08:41 +0100 | received badge | ● Popular Question (source) |

2020-12-03 06:12:49 +0100 | received badge | ● Famous Question (source) |

2020-11-23 22:16:18 +0100 | received badge | ● Popular Question (source) |

2020-08-04 18:09:30 +0100 | received badge | ● Notable Question (source) |

2020-07-11 11:58:42 +0100 | received badge | ● Notable Question (source) |

2020-07-10 21:02:22 +0100 | asked a question | Why doesn't '==' or '!=' work for mixed forms? I have the following setup Clearly Form0 and Form1 are distinct mixed forms of M, but when I run I get 'Equal' as the output, what's going wrong? |

2020-06-10 06:36:45 +0100 | asked a question | Can a loop be made to skip an iteration if the run time exceeds a certain amount? I apologize if this is a little abstract, but is it possible to create some sort of "for" or "while" loop that will pass to the next iterate if the computation for that specific iterate takes too long? we have but if for some n in the range, the computation of F(n) takes more than say, 1 minute CPU time, I want it to either just skip to computing F(n+1) and/or print "-1" in place of F(n). UPDATE: I'd also like to be able, if possible, to print out run times. So that the output would be something like etc., where time(n) is the amount of time it took to compute F(n). |

2020-06-03 16:22:54 +0100 | commented question | Are there fast(er) ways to compute inverses of Hermitian matrices? @mwageringel It's a little convoluted, by the symbolic variables I have set up are supposed to represent complex numbers, and part of the indexing reflects conjugation. Under this identification the matrices h[i] can be seen as Hermitian matrices. If you'd really like I can explain the details, but I don't think they're relevant to the question at hand. |

2020-06-03 16:19:49 +0100 | commented question | Are there fast(er) ways to compute inverses of Hermitian matrices? @Frederic are computations in polynomial rings that much faster? I was under the impression they worked the same as symbolic rings. I tried rewriting the code using a polynomial ring, but it seemed to make no difference in the run time when q=4, and certainly q=5 still isn't feasible. |

2020-05-30 07:51:15 +0100 | asked a question | Are there fast(er) ways to compute inverses of Hermitian matrices? I'm dealing with some Hermitian matrices valued in symbolic expressions. I need to be able to compute inverses of these matrices, but they seem to get big pretty fast. That is it would nice to be able to do this in a reasonable amount of time with 10x10 matrices at least, and hopefully larger than that. Are there ways to exploit the fact that these matrices are Hermitian to compute the inverses faster, and/or are there better ways to compute inverses of symbolic matrices than the standard .inverse()?? EDIT: I originally avoided an example, because their construction is somewhat convoluted as you'll see below. First we have two variables which for which I want to run the larger program for various choices thereof. The following creates a list L such that L[i] is the collection of lists of length i whose elements are integers between 0 and q-1 in strictly increasing order. This is used throughout the larger program. Here, a matrix is defined which we be used to construct the matrices I'm interested in. Finally, we come to the inverse matrices I would like to compute. It is absolutely necessary that I have these inverse matrices. |

2020-04-26 11:58:25 +0100 | received badge | ● Popular Question (source) |

2019-12-05 12:30:11 +0100 | marked best answer | How to create/use matrices valued in differential forms? First, for context, I am working with holomorphic Hermitian vector bundles, and I need to compute the connection and curvature matrices, and compute some representatives for Chern classes and the Chern form. Ultimately I want to have a matrix which is valued in differential forms, and when I multiply matrices, I want the component-wise multiplication to be the wedge product of forms. When I naively try to build a matrix of forms 'by hand', or when I pre-define my matrix space to be valued in the module of differential forms, I get an error telling me that the space of differential forms is a not a ring. For example, prints out and raises a type error: |

2019-12-05 12:29:01 +0100 | received badge | ● Popular Question (source) |

2019-08-22 16:13:05 +0100 | asked a question | Setting the components of a differential form systematically. Suppose for some p and q we have a manifold and some differential forms I want to construct and/or inspect components of these differential forms in a systematic way, which is to say I want to be able to iterate over the components. So for example, one way in which I've tried to do this is to create lists. I would want to say but this gives me a syntax error. but again I get a syntax error. |

2019-08-19 18:10:03 +0100 | marked best answer | Defining manifolds in a systematic way. I'm working on writing an algorithm that does some specific computations with manifolds. I would like to be able to simply enter 2 numbers "p" and "q" which determine the manifold's dimension p*q, and have the algorithm run right from there. This requires having Sage set up the manifold right from those two numbers. I'm having trouble at the level of defining the chart. Below I begin a naive attempt. Everything works fine up to this point. Now, I need to define variables for a chart for this manifold. I would like to do something like where I'm using the variables I've defined as my coordinates. However, Sage doesn't allow me to do this. Furthermore, even if I could, I'm not sure how I would set this up so I didn't have to type in the variables by hand, because I want to set it up so I just have to feed Sage p and q, and let it build the manifold on its own. |

2019-08-19 18:10:02 +0100 | commented answer | Defining manifolds in a systematic way. Hey, is there a way to do this in such a way that the coordinates have multiple indices, like x[(i,j,k)]? |

2019-08-19 18:10:02 +0100 | received badge | ● Commentator |

2019-08-06 16:53:48 +0100 | commented answer | Substituting symbolic expressions for mixed differential forms. Thanks, this seems to do the trick. I'm just wondering though, how can I have it so that the c's are indexed by two numbers? |

2019-08-05 17:29:55 +0100 | asked a question | Substituting symbolic expressions for mixed differential forms. I'm doing some computations with matrices differential forms, and the run times are extremely long. So in an attempt to
keep run times down, I'm attempting to do matrix computations with symbolic terms, and then later replacing them with the mixed forms I want. Now, in my actual project I will have many of these variables, so it's not feasible to manually type them into one substitution at once, so I need to do it with a for loop, so I try But this is where I get the coercion error. |

2019-08-05 17:17:05 +0100 | marked best answer | Is there any way to have a cell tell you how long it took to run in the Jupyter notebook? The question is basically all in the title. I'm working on a project in the Jupyter and notebook, and I have some cells that have longer run times. Sometimes I let these run, and come back to check on them later, however it would be nice to know exactly what duration those cells ran for. |

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.