FrédéricC's profile - activity

This hangs when trying to compute the rank src/sage/modular/modsym/ambient.py(188)__init__() 186 formula =

This seems to hang inside ModularSymbols(283312, sign=1, base_ring=QQ)

Note that the conductor is rather large : sage: E.conductor() 283312

modular_form() hangs in sage 9.5 but works in older sage version Here is an example a = 16 b = 7 E = EllipticCurve([a,b

something like this ? sage: F = algebras.Free(SR,list('AB')) sage: A, B = F.gens() sage: (sin(x)*A+B)**2 sin(x)^2*A^2 +

I have made https://github.com/sagemath/sage/pull/40249 so please review.

something like this ? sage: F = algebras.Free(SR,list('AB')) sage: A, B = F.gens() sage: (sin(x)*A+B)**2 sin(x)^2*A^2 +

You can change them to planar trees and then use existing methods: sage: a = RootedTrees().an_element() sage: b = Roote

You can change them to planar trees and then use existing methods: sage: a = RootedTrees().an_element() sage: b = Roote

You can change them to planar trees and then use existing methods: sage: a = RootedTrees().an_element() sage: b=RootedT

sage -i gap_packages should do the trick. EDIT: now rather use make gap_packages But on a Mac, I dunno : Macs may have

Which Os, in which version ? How did you install ?

First install the latest version of sage, namely sage 10.6.

Problem installing package I am trying to download the database of reflexive 4d lattice polytopes using the command !sa

Like this def dilworth(P): def lequal(A, B): return all(any(P.is_lequal(a, b) for b in B) for a in A) w

Like this def dilworth(P): def lequal(A, B): return all(any(P.is_lequal(a, b) for b in B) for a in A) d

False and True should take capitals

Catalina n'est plus supporté par Pomme depuis septembre 2022. Il ne faut pas s'etonner que les choses ne marchent plus.

Il faut suivre precisement et avec soin toutes les instructions donnees sur la page https://doc.sagemath.org/html/en/ins

probably using Polyhedra_base

Like this sage: V = [vector(v,immutable=True) for v in U] sage: Poset([V,lambda v,w:bool(w-v in V)]) Finite poset conta

Like this sage: V = [vector(v,immutable=True) for v in U] sage: Poset([V,lambda x,y:bool(x-y in V)]) Finite poset conta

can not run without coceter3. how to deal with it RuntimeError Traceback (most recent call

See https://commons.wikimedia.org/wiki/File:Associaedre_bleu.png

in the completion, maybe you first need to extract the homogeneous component using f[d]

Well, this is expected, but maybe things can be enhanced.

like this A.<a,b> = FreeAlgebra(QQ, 2) f = a + a * b - b * a aa,bb=A.monoid().gens() f.coefficient(aa*bb)

I have edited my answer to explain how to define the generators.

Like this sage: F = algebras.Free(QQ, ['a','b'], degrees=(1,1)) sage: FF = F.completion(); FF Lazy completion of Free A

Note that this is quite recent and probably not much tested.

Like this sage: F = algebras.Free(QQ, ['a','b'], degrees=(1,1)) sage: F.completion() Lazy completion of Free Algebra on

and use PolynomialRing + Groebner bases and not the symbolic ring.

Like this, maybe: sage: x, y = polygens(QQ, 'x,y') sage: R = x.parent() sage: f = x^3*y+2*x^2*y^2+x*y^3+y^7+x^5 sage: P

maybe sage -sh then which python ? On Ubuntu, this tells you the place.

is there a bug in height pairing matrix? Hello all, I tried the following on sagecell online K.<z2> = NumberFiel

it would help if you write the code you have in a concrete small case.

In your case, the elliptic curve el has rank one, so you can define a, = el.gens() and look at the inverse images of the

If you do not say "morphism=False", then you will get the isomorphism and can ask for its inverse map.

like this sage: f.operands()

like this sage: SHV.apply_map(lambda s:s.simplify(algorithm="sympy")) sage: SHV Vector field on the 3-dimensional diffe

What is a Frobenius permutation group ?