Hi Travis,
What I ended up doing was I replaced the negative powers of the y's with
some extra variables (which I can then set in mathematica or elsewhere to
the appropriate negative powers). Turns out we still can't escape
mathematica since we want to fully simplify and factorize coefficients
(th
Hey Dan,
> TypeError: unsupported operand parent(s) for '*': 'Fraction Field of
> Multivariate Laurent Polynomial Ring in y0, y1, y2 over Fraction Field of
> Univariate Polynomial Ring in t over Rational Field' and 'Multivariate
> Polynomial Ring in x0, x1, x2 over Multivariate Laurent Polynom
Hi again,
I finally understand Anne's answer (thank you, btw).
I do get one annoying error coming from the following:
the rings:
R1. = QQ[]
R = LaurentPolynomialRing(R1, n, 'y') # note R.gens() here
S = PowerSeriesRing(R, n, 'x', default_prec=n+1)
Sym = SymmetricFunctions(R)
HLP = Sym.hall_littl
Hey Dan,
Anne's way makes things much more simple/straightforward:
sage: n = 5
sage: R. = QQ[]
sage: S = PowerSeriesRing(R, n, 'x', default_prec=n+1)
sage: Sym = SymmetricFunctions(R)
sage: HLP = Sym.hall_littlewood(t).P()
sage: f = prod( (1 - t*S.gen(i)*S.gen(j)) / (1 - S.gen(i)*S.gen(j)) for
On Thu, Dec 5, 2013 at 8:04 AM, Travis Scrimshaw wrote:
> Hey Dan,
>This is only a part of the way, but I'd start by doing the computations
> by having t in a polynomial ring R (over QQ say), and the basic variables
> x_i coming from a power series ring over R:
>
> sage: R. = QQ[]
> sage: S.
Thank you for your answers !! (though NONE of them was forwarded to
sage-devel :-P)
I just needed a gray code over all subsets of 0,...,n-1 myself, so
sympy's totally works. And I even found a short one on the web [1]. But if
somebody wants to implement some Sage-specific thing, then count
