[sage-support] Custom Symbolic Expressions / n-th root of unity

ge: xi**2 TypeError: unsupported operand parent(s) for '*': 'Complex Field with 53 bits of precision' and 'Complex Field with 53 bits of precision' best regards, Johannes -- You received this message because you are subscribed to the Google Groups "sage-support&qu

Re: [sage-support] Re: Custom Symbolic Expressions / n-th root of unity

er, it would be great if i can group all appearances as additional factor, separated from the others. Some more Information about the general setting: I play around with actions of finite groups on a polynomial ring acting by multiplication with a power of the n-th root of unity. bg, Johannes

Re: [sage-support] Re: Custom Symbolic Expressions / n-th root of unity

On 09.12.2015 14:08, Jeroen Demeyer wrote: On 2015-12-09 12:22, Johannes wrote: Some more Information about the general setting: I play around with actions of finite groups on a polynomial ring acting by multiplication with a power of the n-th root of unity. Interesting. But then, why do you

[sage-support] Intersections of polyhedrons with modules / Latticepolytopes and sublattices

tersection method at all. greatz Johannes -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to sage-support@googlegroups.com. To unsubscribe from this group, send email to sage-support+unsubscr...@goo

Re: [sage-support] Re: Intersections of polyhedrons with modules / Latticepolytopes and sublattices

do this? the default 'intersection' if > polyhedrons does not work for modules/lattices, and the > LatticePolytope > does not have a intersection method at all. > > greatz Johannes > > -- > You received this message because you are subscribed to th

[sage-support] uninstall a package

Hi list, I cant build sage 5.7 by sage -upgrade, because it can't download polytopes_db-20120220. How can I delete this package from my local sage installation, or where can i install a valid version? bg, Johannes -- You received this message because you are subscribed to the Google G

Re: [sage-support] uninstall a package

The output is contained in the attachment. Am Mo 25 Feb 2013 19:39:00 CET schrieb Jeroen Demeyer: > On 2013-02-25 13:57, Johannes wrote: >> Hi list, >> I cant build sage 5.7 by sage -upgrade, because it can't download >> polytopes_db-20120220. > Can you post the

Re: [sage-support] uninstall a package

ls spkg/standard/ cephes-2.8.p1.spkg libfplll-3.0.12.p3.spkg README.txt conway_polynomials-0.4.spkg libgap-4.5.7.spkgsage-5.7.spkg cvxopt-1.1.5.p0.spkg linbox-1.3.2.p0.spkg sagenb-0.10.4.spkg cython-0.17.4.spkg maxima-5.29.1.p1.spkgsage_root-5.7.spkg d

Re: [sage-support] uninstall a package

ls spkg/standard/ cephes-2.8.p1.spkg libfplll-3.0.12.p3.spkg README.txt conway_polynomials-0.4.spkg libgap-4.5.7.spkgsage-5.7.spkg cvxopt-1.1.5.p0.spkg linbox-1.3.2.p0.spkg sagenb-0.10.4.spkg cython-0.17.4.spkg maxima-5.29.1.p1.spkgsage_root-5.7.spkg de

Re: [sage-support] uninstall a package

maybe this happened, because the installation failed. Is there a way to force sage using your url below? Am Mi 27 Feb 2013 22:32:39 CET schrieb Jeroen Demeyer: > On 2013-02-27 22:29, Johannes wrote: >> ls spkg/standard/ > Somehow, many of the spkg files are missing. I don

[sage-support] Group action

G and it's representation as quotient. bg, Johannes -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. T

Re: [sage-support] Re: Group action

thnx, this looks nice. I'll have a deeper look at it in the next days. bg, Johannes On 19.04.2013 17:53, Simon King wrote: > Hi Johannes, > > On 2013-04-18, Johannes wrote: >> Hi guys, >> >> I have the following setting: Given a finite subgroup G of GL_\C(n

Re: [sage-support] Re: Group action

yea, that's nearly what I am looking for. Is it possible to consider a weighted group action too? e.g. If \xi is of order n and \xi a n-th root of unity. g (p_1,\dots, p_n) \to (\xi^a_1 p1 , dots, \xi^a_n p_n)? s.t. \sum a_i = n? bg, Johannes On 19.04.2013 17:53, Simon King wrote: > Hi

[sage-support] Submodules of QQ['x,y,z'] as module over itself

tch available, which provides this? bg, Johannes P.S.: I'm using sage 5.9 on Debian Wheezy. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-supp

Re: [sage-support] Re: Submodules of QQ['x,y,z'] as module over itself

On 24.05.2013 16:41, Simon King wrote: Hi Johannes, On 2013-05-22, Johannes wrote: is it implemented to create submodules of QQ['x,y,z'] as module over itself? I know it works for QQ['x'] or ZZ. Perhaps you could show us what you do to make things work for QQ[

Re: [sage-support] Submodules of QQ['x,y,z'] as module over itself

if it's to late, but maybe this could be a project for the gsoc. I'm don't have a a good understanding of the sage category system, but if somebody could give me an introduction or link, I'll have a deeper look at it. bg, Johannes On 24.05.2013 17:16, Charles Bouillague

Re: [sage-support] Quotient of two submodules

i tried the first example in the given link and i get the following error: sage: V0 = span([[1/2,0,0],[3/2,2,1],[0,0,1]],ZZ) --- TypeError Traceback (most recent call last) /home/j_schn14/ in (

Re: [sage-support] Quotient of two submodules

ython --version Python 2.6.4 greatz Am 19.06.2010 16:51, schrieb William Stein: > On Sat, Jun 19, 2010 at 7:33 AM, Johannes wrote: > >> i tried the first example in the given link and i get the following error: >> >> sage: V0 = span([[1

[sage-support] solving equations with constrains

t? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org

[sage-support] Why does LatticePolytope not implement a special __eq__ function?

sentence of ref-equality but in my eyes two polytopes are equal, if they live in the same space (in this case, on the same Lattice) and have the same edges. Is there any reason, why its not implemented that way? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To

[sage-support] Subclass from LatticePolytope

, the type of LatticePolytope(somePoints) is given as: sage.geometry.lattice_polytope.LatticePolytopeClass. How can i extend this? Where can i find informations about this class? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group

Re: [sage-support] Subclass from LatticePolytope

thnx, i did not know all about the sagehelp. but the ?? is a wonderfull feature. I'll look at the code next, and i hope it helps me somehow. gretz Johannes. Am 04.07.2010 23:52, schrieb Justin C. Walker: > Hi, Johannes, > > On Jul 4, 2010, at 07:24 , Johannes wrote: > >> i

[sage-support] more finely lattice

Hi list, is there a way in sage to create some lattice more finely than anotherone, for exampl 1/3ZZ = the localisation of ZZ to the mult. system genrated by 3ZZ. thnx for answers, greatz Johannes. -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this

[sage-support] Bug or feature - questoin about databindings

happens, because the in every step i have to access my orginal p) and after that should be destroyed again. greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options

[sage-support] how to change show() defaults for 2D plots

Is there a way to change default settings of the show() method for 2D plots? According to the reference manual, such a feature does exist for 3D plots through the commands from sage.plot.plot3d.base import SHOW_DEFAULTS SHOW_DEFAULTS['frame']=False They set the default value of frame to False for

[sage-support] Re: how to change show() defaults for 2D plots

Sorry for posting twice. I just noticed that my first message got through all right, though I did not receive it myself! Is this a common behaviour of google groups? Johan On Jul 11, 2:21 pm, Johannes wrote: > Is there a way to change default settings of the show() > method for 2D

[sage-support] types for functions

Hi list, i have a problem defining a function realizing the default scalar: i have m = matrix([[1,0,0,],[0,1,0],[0,0,1]]) and want to define scalar(v,w) = v * m * w but i always get this: (v, w) |--> [v*w 0 0] [ 0 v*w 0] [ 0 0 v*w] otherwise, if i do it this way, directly on the console

Re: [sage-support] Define an action

maybe Y[k] is possible if you create a subclass of matrix and overload the [] operator. but you have to think about Y[1] returns the first row of the matrix so it would be inconsistent. greatz Am 25.07.2010 10:52, schrieb drenwal: > Hello, > > I would like to define an action, let us say: > > def

[sage-support] Recucing equatoins

a way to ensure that the x_i are vectors in k^m? greatz & thnx Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.c

[sage-support] domains for variables

up to here it's ok, but now im lookin for the smalest integer r548 > 0 solving this equatoins. in other words, the smalest r548 such that every wi is in ZZ. How can i do this? Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, s

Re: [sage-support] Re: domains for variables

result = solve(result,variables) return tuple( [ww.right_hand_side() for ww in result[0]][0:-1]) i know that the equations are always solveable in ZZ. greatz Am 30.07.2010 02:03, schrieb kcrisman: > > On Jul 29, 6:01 pm, Johannes wrote: > >> Hi list, >> i try to s

Re: [sage-support] Re: domains for variables

thnx i got it working. Am 30.07.2010 12:00, schrieb Harald Schilly: > On 30 Jul., 00:01, Johannes wrote: > >> Hi list, >> i try to solve a linear equation in ZZ in the variables w_i: >> > Here is a MILP formulation of your problem, I've pasted the input

[sage-support] default browser for notebook

hi list, how can i change the browser, which is started after i started sage notebook by `sage -notebook` I want to use firefox, but i always get a new instance of konquer. greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send

[sage-support] common devisor

r for wich i want to write as produkt of a skalar times an integervektor. how can i do this? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this gro

Re: [sage-support] Re: common devisor

ab]) and with the results: vector_of_nums = (2b,1) common_denom = ab but I've to test if this is possible with you or yanns solution. Johannes Am 27.09.2010 17:53, schrieb luisfe: > On Sep 27, 3:34 pm, Johannes wrote: > >> Hi list, >> is there a way to get a sum of fracti

Re: [sage-support] Re: common devisor

are not in ZZ because they are variables, even if i allow them just to be from ZZ. But i don't know where or how i can add this condition. Father more, I dont know in how far this condition would help greatz Johannes Am 27.09.2010 21:16, schrieb Johannes: > thnx, luis, > thats near

Re: [sage-support] Re: common devisor

on is related to the one of Aidan too ( 'simplifying expressions') greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://gr

[sage-support] creating a test environment

Hi list, is it possible to create in a given environment in sage a new one, which know all in the parent defined variables and values, and i i leave it again, ijust get back to my old values? i'd like to have this, because i have to test and compare different calculations based on the same data (po

Re: [sage-support] Re: creating a test environment

known stat #here I can work with my bindings from the time i createt sshot1 switch_snapshot(ssho2) and once again continue with the last know state from sshot2 this could be done by writing own functions based on load/save_Session, but i wonder if ther exists a build-in solution. greatz Johannes

[sage-support] finite cartesian product

tried [doSomething(a,b,c) for a,b,c in A,B,C] but this leads to the same as [doSomething(a,b,c) for a,b,c in zip(A,B,C)] In my next try I used FiniteEnumeratedSet and cartesian_product, but this is not iterable. Is there any other way to do this? greatz Johannes -- To post to this group, send email to

Re: [sage-support] finite cartesian product

thnx, excatly what i was looking for. Am 04.10.2010 00:32, schrieb Philipp Schneider: > Hi, > >> (...) >> In my next try I used FiniteEnumeratedSet and cartesian_product, but >> this is not iterable. >> Is there any other way to do this? >> > there is a sage function called "cartesian_prod

[sage-support] Map fom ZZ^3 to Hom(ZZ^3,Z)

trixSpace(R, self.domain().rank(), self.codomain().rank()) 153 self.__matrix_space = M 154 return M is this a bug, or something which is just not implemented? It fails if i use QQ instead of ZZ too. greatz Johannes -- To post to this group, send email to sage-support@googlegrou

Re: [sage-support] Re: Map fom ZZ^3 to Hom(ZZ^3,Z)

I just started to play around with "Hom()" and tryed to create a function mapping phi:x -> ; phi(x)(y) = with as element in Hom(ZZ^3,Z) and i was looking for a way to do this without using matrixes. greatz Why precisely do you want to do this? Is it entirely so you can write > f(v), where f i

[sage-support] Labeled Graphs

Hi list, how do i create a graph where i have a label for each vertex and each edge? Precisely I need to labels for each vertex (like a name and a value). greatz & thnx Johanes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sa

Re: [sage-support] Re: Labeled Graphs

thnx, but that's not excatly what I'm looking for, because te label does not appear in the picture created by graph.show() Johannes Am 24.11.2010 18:55, schrieb Nathann Cohen: > Hello !! > > >> how do i create a graph where i have a label for each vertex and each >

Re: [sage-support] Labeled Graphs

e city. Excactly the vertex should have to labels, the name and the population. In the end I dont need to do any calculations with this graph. I want to autocreate latexcode wichc I could use later and i dont want to write my owen function to do this, or all the latexcode by hand. greatz Johannes

Re: [sage-support] Re: Labeled Graphs

would be some sage-libaries to do this. greatz Johannes Am 24.11.2010 18:55, schrieb Nathann Cohen: > Hello !! > > >> how do i create a graph where i have a label for each vertex and each >> edge? Precisely I need to labels for each vertex (like a name and a value). >&g

[sage-support] Solving linear equatoins

x27;d prefer to have just one vectorsolution instead of using v = vecvtor([var("v" + str(i)) for i in range(dimension)]) is there anyway to handle this in a nicer way? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this g

[sage-support] cant explain this behavior - simple aritmethics / extended euclidean algorithm

lts res.extend([v * item for item in ttlist]) print "res: " + str(res) return res I hope somebody can help me. greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsub

Re: [sage-support] cant explain this behavior - simple aritmethics / extended euclidean algorithm

I got it solved. It's a type error: the matrix sing is a matrix over QQ. If its a matrix over ZZ it works fine. but why is gcd(2,0) = 1 for 2,0 as Rationals? in my eyes its not well defined or should be the maximum of those values. greatz Am 28.12.2010 22:08, schrieb Johannes: > Hi list

Re: [sage-support] cant explain this behavior - simple aritmethics / extended euclidean algorithm

Ok, from this point of view see the point. But I dont know if it's documented this way somewhere. greatz Am 28.12.2010 23:00, schrieb Iwao Kimura: > Hi Johannes, > > I'm not sure but if we think gcd(2, 0) is the generator of the ideal > generated by 2 and 0 in the rationals

[sage-support] Latticebasis of a sublattice

U' \subset V, which contains U. Up to now I did this by calculating a basis of U, looking at the vectorfield spanned by this basis and take its basis as basis for U' (after converting the entries back to integers). This works, but it seems not to be the best way to do it. greatz Johan

[sage-support] edges in graphs

Hi list how can i add a new edge (a->b) to a given graph G (n.n. connected), just in the case that there is no path (a -> ... -> b) before? all i found is the all_path(a,b) method wich tooks very long in my case and generates a huge overhead. greatz Johanens -- To post to this group, send email

Re: [sage-support] Re: edges in graphs

ing if it's loopsless. but I need to have it without any loops. greatz Johannes Am 05.02.2011 07:53, schrieb Nathann Cohen: > >> >> how can i add a new edge (a->b) to a given graph G (n.n. connected), >> just in the case that there is no path (a -> ... -> b) befor

Re: [sage-support] edges in graphs

I just checked the shortes_path method and it wents many times faster. thnx. Am 05.02.2011 08:08, schrieb Nathann Cohen: > >> >> Of course finding the shortest path may be (almost) as expensive as >> finding all of them... If you're doing this for a lot of edges you >> might want to break it up in

Re: [sage-support] Re: edges in graphs

nt need to have them sorted, but it would be nice to have as less as possible edges crossing. greatz Johannes Am 05.02.2011 16:02, schrieb Luiz Felipe Martins: > Oh, I was imprecise. If it has no loops, it is a forest. So you have to get > a spanning tree for each component. > > On

Re: [sage-support] Re: edges in graphs

Yea, sure. but my problem is a tree like this: 1 / \ 23 45 and so on. but i don't need it in that order I have a few crossing edes in it and I'd like to have one like 1 / \ 35 24 or 1 / \ 25 34 or someting like that, such that i have just a minimal number of crosssings. even

Re: [sage-support] Re: Checking for convexity of Lattice Polytopes

matter here because they are indexed in by the same number in the facets too) and compare them to the total number of points in foo (and on its boundary) As long as my comment above is correct (and as long as I got the point of your problem) this should work. greatz Johannes -- To post to this grou

[sage-support] Hermite Normalform

if H is optained by row operations or by columnoperations. How is this handled in sage, and is this somehow controlable? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com

[sage-support] Subring of the polynomial ring

opt/sage-4.6/local/lib/python2.6/site-packages/sage/structure/parent_gens.so in sage.structure.parent_gens._certify_names (sage/structure/parent_gens.c:1654)() ValueError: variable names must be alphanumeric, but one is 'x^3' which is not. greatz Johannes. p.s.: in the end, I'm interested

[sage-support] How to calculate the affine coordinats of a point

the default basis. otherwise i tried it with the sage.geometry.triangulation module, but i'm not sure if i used it the right way. greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+uns

Re: [sage-support] How to calculate the affine coordinats of a point

of the simplex, where the points p0,,pn are given as the vertices of the facet. greatz Johannes Am 15.07.2011 03:27, schrieb William Stein: > On Thu, Jul 14, 2011 at 7:39 PM, Johannes wrote: >> Hi list, >> i have given a finite set of points (lets call it V \subset ZZ^n) and

Re: [sage-support] Re: How to calculate the affine coordinats of a point

that sounds comprehensibly. explains some more errormessages i got a few times (like 'bool has no attribute len' when using solve) greatz Am 18.07.2011 16:54, schrieb luisfe: > For me it looks like: > > In solve, when writting a == b you assume that a and b are expressions > involving several v

[sage-support] How to solve congruences?

Hi list I have to solve congruences like a x \equiv b mod n for given a,b,n. how can i do this with sage? greatz Johanens -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For mor

Re: [sage-support] How to solve congruences?

olve_mod(2*x == 1, 7) > [(4,)] > sage: solve_mod(2*x == 1, 7) > [(4,)] > > > Check the help (solve_mod?) for more info/examples of its use. > > Regards, > > David M. Monarres > > > > > On Tue, Jul 26, 2011 at 2:19 PM, Johannes wrote: >> Hi

[sage-support] bug in solve_mod?

aranty that the modulus is always 1. Any ideas or solutions? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google

Re: [sage-support] Re: bug in solve_mod?

1: return 0 > Also - there is only 0 in mod(1), so even if it worked - you would get > 0. (the results are in Z_n not Z). thats even better in my case. i was wondering how sage handles infinite resultsets in this case. greatz Johannes -- To post to this group, send email t

[sage-support] question about creating homomorphisms

Hi list i need to construct two morphisms f:ZZ^n \to Z given by a diagonalmatrix and g: ZZ -> Z/dZ because I have to find the kernel of the compositoin. consturcting g was no problem by g = ZZ.hom(ZZ.quotient(ZZ.ideal(d))) father, getting the kernel of f as matrix worked too. but how to get the ke

[sage-support] unit roots

of this equation? Or whatz the best way to handle unit roots in sage? Even father, if I dont specify $n$ and try this: x,n = var('x,n') assume(n,'integer') assume(x != 1) solve(x**n -1,x) I just get [] as solution. greatz Johannes -- To post to this group, send e

[sage-support] bug in groups.prod?

lex Field with 53 bits of precision;; ^ Variable: 'with' must have a value Variable: 'bits' must have a value Variable: 'precision' must have a value executing $sage8:=Complex Field with 53 bits of precision;; greatz Johannes -- To

Re: [sage-support] bug in groups.prod?

I got my error, i mixed prod and cartesian_product. Am 14.08.2011 16:50, schrieb Johannes: > Hi list, > i tried to compute the product of two matrix groups and run in a gap > parsing error. > Miniexample: > g1 = MatrixGroup([Matrix(CC,[[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, -1, 0]

[sage-support] Invariant Polynomes under group action

ird primitive root of unity, then G must be generated by diagonalmatrix(xi,xi,xi). Is there a easy way to calculate G from I with Sage? greatz Johannes -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsub

Re: [sage-support] Re: Invariant Polynomes under group action

anything. my main problem lays in the number of generators of I. There are up to 39 in one special case and 902 in total. greatz Am 14.08.2011 20:00, schrieb Simon King: > Hi Johannes, > > On 14 Aug., 19:54, Johannes wrote: >> Hi list >> I have given an Ideal I in the polynomial

Re: [sage-support] Re: Invariant Polynomes under group action

olynome is invariant under the action, I can look at the subring C[I] = C[S] \subset R instead of looking at I. But of course you're right, there's a big difference between a ring and an ideal. greatz Johannes Am 15.08.2011 21:10, schrieb Maarten Derickx: > Dear Johannes, >

Re: [sage-support] Re: Invariant Polynomes under group action

Am 16.08.2011 03:06, schrieb Nils Bruin: > On Aug 15, 2:54 pm, Johannes wrote: >> I'm sorry for unclear description of the problem. >> So once again, let R = C[x_1,\dots,x_n]$ be my basering. >> I'm looking for the group G, wich leaves a finite set S of polynomes &g

Re: [sage-support] Invariant Polynomes under group action

The given example was not right at all. this one works: R = C[x1,x2,x3] I = C[x1x2x3,x1^3,x2^3,x3^3] this leads to G given as above: > let G \subset SL_3(CC) act by a e_i -> a x_i. If xi is a third primitive > root of unity, then G must be generated by > diagonalmatrix(xi,xi,xi). gre

Re: [sage-support] GPL and code generation using sage

, not the libraries) you're still free to release every program written in this language, using the license you like to. greatz Johannes On 27.09.2012 01:28, Geoffrey Irving wrote: > Hello, > > I recently used sage to write a code generation script for exact > geometric predicate

Re: [sage-support] GPL and code generation using sage

Am Do 27 Sep 2012 20:58:25 CEST schrieb Geoffrey Irving: > On Thu, Sep 27, 2012 at 11:50 AM, Johannes wrote: >> Hi, >> as far as I understand the GPL, I would say you can release the output >> of your script under every license you want to, as long as Sage is not >>

[sage-support] Intersection a cone with hyperplanes

s not such an function, where would be the best place to place it? Extend/overwrite the existing intersection function of the cone? regards, Johannes -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email

Re: [sage-support] Re: Intersection a cone with hyperplanes

Thank you. that's exactly what I was looking for. bg, Johannes On 25.11.2012 14:56, Volker Braun wrote: > Construct cone and hyperplane: > > sage: C = Cone([(1,0),(0,1)]) > sage: H = Polyhedron(eqns=[(-2,1,1)]) > sage: H.Hrepresentation() > (An equation (1, 1) x - 2

[sage-support] Wrong indefinte integral

Hello, *Problem:* Sage 6.7 returns for integrate(x/(x^2+1),(x,0,infinity)) the result 0. This is obviously wrong, since x/(x^2+1) is positive betwwen 0 and Infinity. *What I found out by now:* I couldn't reproduce the error with any simpler function. The antiderivate of the function is cal

[sage-support] Re: SAGE working with Paraview

Many thanks for your answer Jaap! Unfortunately, building the experimental cmake failed (see error report below), however I have cmake installed on my system "outside" of SAGE. I will give it a try. Best, Johannes g++ -framework Carbon -I/Applications/Science/sage/spkg/build/cmake

[sage-support] Re: SAGE working with Paraview

hint a try and let you know how it went. But it's midnight now and tomorrow I'm off to ski :-) So that will have to wait till thursday. Many thanks, Johannes On 20.01.2009 23:43 Uhr, Mike Hansen wrote: > Hi Johannes, > > On Tue, Jan 20, 2009 at 2:37 PM, Johannes Reichold

[sage-support] Re: SAGE working with Paraview

hint a try and let you know how it went. But it's midnight now and tomorrow I'm off to ski :-) So that will have to wait till thursday. Many thanks, Johannes On 20.01.2009 23:43 Uhr, Mike Hansen wrote: > Hi Johannes, > > On Tue, Jan 20, 2009 at 2:37 PM, Johannes Reichold >

[sage-support] Solving linear equation systems in GF(2)

0]^T How can I do this in sage? Thanks in advance, Johannes -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com.

[sage-support] Bug in symbolic integral

Hi there, I want to compute the integral from 2 to 3 of the funktion f(x)=1/log(x)^2. Sage gives conflicting results for different ways to compute it: *numerical way* (double checked by Wolfram Alpha and Ma

[sage-support] how to change show() defaults for 2D plots

Is there a way to change default settings of the show() method for 2D plots? According to the reference manual, such a feature exists for 3D plots through the commands from sage.plot.plot3d.base import SHOW_DEFAULTS SHOW_DEFAULTS['frame']=False They set the default value of frame to False for th

Re: [sage-support] Re: how to change show() defaults for 2D plots

Mike Hansen wrote: On Sun, Jul 11, 2010 at 5:48 AM, Johannes wrote: Sorry for posting twice. I just noticed that my first message got through all right, though I did not receive it myself! Is this a common behaviour of google groups? Yes, this is a common behavior of Google Groups and Gmail

[sage-support] list_plot libpng error: Image width or height is zero in IHDR

Bonjour, It seems to me that the following code should not give an error, even if it is true that the points to be plotted are very close to the x-axis. Maybe this is a known bug? Johannes -- | Sage Version 4.5.3, Release

Re: [sage-support] Re: list_plot libpng error: Image width or height is zero in IHDR

On 10/21/2010 05:10 PM, Jason Grout wrote: On 10/21/10 9:48 AM, Johannes Huisman wrote: sage: a(n)=(3*n+8)/(5*n-2) sage: list_plot([a(n) for n in range(100,120)],aspect_ratio=1) This works after #2100 has been applied to 4.6.alpha3, which fixes a lot of issues and confusion we've had

[sage-support] polynomial division by increasing powers

Hello, Does sage have a command for polynomial division by increasing powers? I could not find such a command. Of course, one may use power series division in order to compute the quotient, but it would be neat if one could avoid all that. Thanks in advance, Johannes -- http

Re: [sage-support] Re: polynomial division by increasing powers

Hi Simon! On 11/17/2010 08:33 AM, Simon King wrote: On 16 Nov., 23:48, Johannes Huisman wrote: Does sage have a command for polynomial division by increasing powers? I could not find such a command. Of course, one may use power series division in order to compute the quotient, but it would be