20210119 16:29:07 +0200  commented question  "Affine diagonalization algorithm" in ndimensions? Ok, thank you very much. With the grafical user interface with Maple it worked...but not with the terminal version...sorry...Of course, I am still interested, if SAGE also has something similar implemented. 
20210118 19:59:25 +0200  asked a question  "Affine diagonalization algorithm" in ndimensions? Does Sage have a general implementation of the "affine diagonalization algorithm" for ndimensional vector spaces? I found some pseudocode, see page 15 (in section 3 "affine diagonalization" which begins on page 12) of Searching online led me also to this answer from 2008 where someone does it with Maple: but unfortunately, I cannot open the Thank you very much for the help. 
20210114 18:33:39 +0200  received badge  ● Notable Question (source) 
20201012 19:59:47 +0200  asked a question  Finding MV algebras with Sage I would like to find with Sage in a quick way all finite lattices having a partial operation $x\cdot y$, defined for $x\geq y$, satisfying the following properties: (a) $\forall x\geq y\geq z:\ x\cdot z \leq x\cdot y$ and $(x\cdot y)\cdot (x\cdot z) = y\cdot z$ (b) $\forall x\geq y, z:\ x\cdot (y \wedge z) = x\cdot y \wedge x\cdot z$ (c) $(x \vee y)\cdot y = x\cdot (x \wedge y) $ (d) $\forall x\geq y:\ y\leq x\cdot y$ and $(x\cdot y)\cdot y = x$ This is equivalent to having the structure of an MV algebra (see Prop. 44 on page 34 of https://pnp.mathematik.unistuttgart.de/iaz/iaz1/Rump/3235.pdf). Such lattices are always distributive. I would be grateful for any help. 
20201003 14:29:14 +0200  commented answer  Compute radical and idempotents of a quotient algebra Commutativity is not necessary  sorry that I wrote sth. wrong earlier. 
20200803 23:08:44 +0200  asked a question  Using crypting0.9 and GAP 4.10.2 in Sage 9.1 Hi, I would like to ask the following question: I have recently installed sage 9.1 and wanted to install all the gap packages inside sage. I tried sage i gap_packages (and sage f gap_packages respectively) but I got the following error message which seems to point to a problem with "crypting0.9". A quick search showed me that there has already been a problem with this earlier, so I just wanted to ask here, if anybody could help/show me how to resolve this problem. I work with Kubuntu 20.04, have an VivoBookASUSLaptop and downloaded the precompiled sage files. Thank you very much. 
20200728 19:46:31 +0200  received badge  ● Notable Question (source) 
20200601 10:52:48 +0200  received badge  ● Popular Question (source) 
20191125 14:54:20 +0200  commented question  Is there a command in SAGE which is equivalent to GAP's "ShallowCopy" ? Thank you very much for your comment. For example, G=gap.SymmtricGroup(5) and iso= gap.IsomorphismPermGroup(G) I realized that the problem was inside gap and not inside sage...sorry. I can do it with the ctbllib commands StrDescr = gap.NameOfEquivalentLibraryCharacterTable(CTBL) CTBL_Breuer = gap.CharacterTable(StrDescr) Sorry for the confusion and that I was missing a minimal complete example. It would be ok, if you'd like to delete my question. 
20191121 16:48:15 +0200  commented question  Is there a command in SAGE which is equivalent to GAP's "ShallowCopy" ? By the way: The error message is as follows: RuntimeError: Gap produced error output Error, < G > has already a character table 
20191120 20:09:18 +0200  commented question  Is there a command in SAGE which is equivalent to GAP's "ShallowCopy" ? Thank you very much for your comment. I edited the question. 
20191120 17:19:52 +0200  asked a question  Is there a command in SAGE which is equivalent to GAP's "ShallowCopy" ? Dear SAGE forum, I'd like to ask the following question:
I'd like to associate to two times the same group two different character tables. In GAP it is possible to do it as follows: and to then construct a different character table for H. When I try to do this in SAGE, I always get the error message that G (!) already has a character table, although I wanted to assign a different (as far as the ordering of the rows and columns are concerned) character table to H (!) EDIT (20.11.2019): Here is part of my sage code: After this last line (with CTBL=...) the error occurs. When I delete the lines between "# Hier Einschub..." and "# Hier Ende des Einschubs ", then the code works. I would be grateful for any help. Thanks in advance. 
20191109 21:34:12 +0200  commented question  How to create a subgroup with MAGMA inside SAGE of a group created with MAGMA inside SAGE? Thank you very much for your comment! :) 
20191109 21:33:58 +0200  commented answer  How to create a subgroup with MAGMA inside SAGE of a group created with MAGMA inside SAGE? Thank you very much for your answer! :) 
20191108 19:17:14 +0200  received badge  ● Notable Question (source) 
20191108 19:14:46 +0200  asked a question  How to create a subgroup with MAGMA inside SAGE of a group created with MAGMA inside SAGE? Dear SAGE team, I would like to let MAGMA inside SAGE create a subgroup of a group (which was also created with MAGMA inside SAGE), but an error message was returned. Unfortunately, I don't know ho to resolve this. I would be thankful for any help. Here's the code (only an example):
The error message is as follows: TypeError Traceback (most recent call last) <ipythoninput13da9ee2cf66f9> in <module>() > 1 GG_MAGMA=magma.new('sub<ggg[(1,2)]>')< p=""> /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/interface.pyc in new(self, code) 351 352 def new(self, code): > 353 return self(code) 354 355 ################################################################### /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/magma.pyc in __call__(self, x, gens) 792 pass 793 > 794 A = Expect.__call__(self, x) 795 if has_cache: 796 x._magma_cache[self] = A /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/interface.pyc in __call__(self, x, name) 286 287 if isinstance(x, string_types): > 288 return cls(self, x, name=name) 289 try: 290 return self._coerce_from_special_method(x) /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/expect.pyc in __init__(self, parent, value, is_name, name) 1441 except (RuntimeError, ValueError) as x: 1442 self._session_number = 1 > 1443 raise_(TypeError, TypeError(*x.args), sys.exc_info()[2]) 1444 except BaseException: 1445 self._session_number = 1 /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/expect.pyc in __init__(self, parent, value, is_name, name) 1436 else: 1437 try: > 1438 self._name = parent._create(value, name=name) 1439 # Convert ValueError and RuntimeError to TypeError for 1440 # coercion to work properly. /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/interface.pyc in _create(self, value, name) 482 def _create(self, value, name=None): 483 name = self._next_var_name() if name is None else name > 484 self.set(name, value) 485 return name 486 /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/magma.pyc in set(self, var, value) 627 13/5 628 """ > 629 out = self.eval("%s:=%s" % (var, value)) 630 if out.lower().find("error") != 1: 631 raise TypeError("Error executing Magma code:\n%s" % out) /var/autofs/nfs/scratch/hannes/sage8.8/local/lib/python2.7/sitepackages/sage/interfaces/magma.pyc in eval(self, x, strip, *kwds) 561 ans = Expect.eval(self, x, *kwds).replace('\\n', '') 562 if 'Runtime error' in ans or 'User error' in ans: > 563 raise RuntimeError("Error evaluating Magma code.\nIN:%s\nOUT:%s" % (x, ans)) 564 return ans 565 TypeError: Error evaluating Magma code. IN:_sage_[3]:=sub<ggg[(1,2)]>; out:<="" p="">

20191108 19:01:16 +0200  commented answer  How to connect Magma_free, SAGE and GAP (problem concerning a MAGMA string not readable by GAP)? Thank you very much for your answer! :) To whom it may concern: In the meantime I got to know that the following is also a possible solution (exemplarily done for G=$S_4$): gap.LoadPackage('"ctbllib"') ct=magma_free("G:=Sym(4);ct:=CharacterTable(G);ct;") myfile=file("tbl_MAGMA.txt", 'w') print >> myfile, ct print >> myfile.close() tbl=gap.GAPTableOfMagmaFile('"tbl_MAGMA.txt"', '"MAGMA_TBL"') gap.Display(tbl) G=gap.SymmetricGroup(4) gap.ConnectGroupAndCharacterTable(G,tbl) 
20190929 13:24:12 +0200  received badge  ● Popular Question (source) 
20190201 17:23:52 +0200  asked a question  How to connect Magma_free, SAGE and GAP (problem concerning a MAGMA string not readable by GAP)? Hi, I'd like to ask the following: I'd like to use SAGE in order to compute something with the free magma online calculator and then convert it into a GAP object. Unfortunately, there occurs an error, and I don't know, how to fix this. Any help is very much appreciated. I followed the example on page 91 of http://www.math.rwthaachen.de/~Thoma... Here is what I did: 
20180121 06:31:03 +0200  received badge  ● SelfLearner (source) 
20180121 06:31:03 +0200  received badge  ● Teacher (source) 
20180121 06:31:03 +0200  received badge  ● Necromancer (source) 
20180120 15:47:45 +0200  received badge  ● Commentator 
20180120 15:47:45 +0200  commented answer  Can SAGE calculate with projective (indecomposable) Amodules (A is a finite dimensional Qalgebra)? Thank you very much for your answer. I was thinking of the kdimension of the algebra. I should have written that in the question. Sorry for my late reply. As a comment, I would like to say that in the meantime I have learned that these things can be done with the aid of the GAPpackage QPA. This also works in SAGE via letting GAP be the intermediator. 
20180120 15:44:19 +0200  commented answer  Dotted and dashed lines in directed graphs Thank you for your answer. Maybe the answer to thie following other question of mine is also helpful: https://ask.sagemath.org/question/356... 
20180120 15:42:39 +0200  commented question  Compute radical and idempotents of a quotient algebra In the meantime I have learned that these things can be done for admissible quotients of path algebras with the aid of the GAP package QPA. This also works in Sage via letting GAP be the intermediator. It works as follows: If we let $k$ be a finite field, then the command works, but I don't have a computational solution for the case $k=\mathbb{Q}$. I do not yet have a solution for the noncommutative case. 
20180120 15:18:22 +0200  commented answer  Drawing AuslanderReiten quivers with sage possible? Thank you very much for your answer (and sorry for my very late reply). It works perfectly fine! :) 
20180120 15:17:06 +0200  marked best answer  Drawing AuslanderReiten quivers with sage possible? Hi, I'd like to draw an AuslanderReiten quiver with sage. I tried to do this by viewing the AuslanderReiten quiver as a digraph, but, unfortunately, I was not able to find out how to let sage draw both dashed and solid arrows in one digraph. Is this possible? If not, is there another way to let sage draw AuslanderReiten quivers? Any help would be appreciated. Edit: I used the following code: sage: H=DiGraph() sage: H.add_edges([(2,1),(2,4),(10,4),(1,3),(4,3),(4,11),(11,6),(3,6),(3,5),(5,7),(6,7),(6,12)]) sage: H.add_edges([(7,8),(7,9),(12,9)]) After having typed sage: H.show() a few times I got the following output: Now, I'd like to draw dahed arrows indicating the AuslanderReiten translates (e.g. a dashed arrow from 3 to 2). 
20170918 01:45:59 +0200  received badge  ● Famous Question (source) 
20161118 15:53:11 +0200  received badge  ● Popular Question (source) 
20161118 15:51:08 +0200  commented question  Drawing AuslanderReiten quivers with sage possible? Thank you very much for your comment. I edited the question. 