I already have the bivariate decomposition worked out (version 0.1). The
reason I'm interested in the bivariate is because that is the only case
(presently) that I know solve can deal with.
```
bivariate_type(f, x, y, **kwargs)
Given an expression, f, 3 tests will be done to see what type
Are you asking how to implement the algorithm to check for such generators
or how to fix Poly to work with such things?
Aaron Meurer
On Wed, Apr 24, 2013 at 9:40 AM, smichr smi...@gmail.com wrote:
In my bisolve branch I have experimented with recognizing bivariate
generators of polynomials.
How to recognize such things.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy+unsubscr...@googlegroups.com.
To post to this group, send email to
In each case, the monomials in x and y from the powers of u are unique. For
example, for u = a*x*y + y (btw should it really be a*x*y + b*y?), u has
the monomials x*y and y, u**2 has the monomials x**2*y**2, x*y**2, and
y**2, and so on. So all you need to do is pull together the various
monomials
I wonder if there is a general algorithm for multivariate polynomial
decomposition. That would make your life a lot easier. We already have one
for the univariate case (decompose()). You might check the literature.
Aaron Meurer
On Sun, May 12, 2013 at 10:15 PM, Aaron Meurer asmeu...@gmail.com
In my bisolve branch I have experimented with recognizing bivariate
generators of polynomials. Basically, I look for polynomials in x and y
that can be re-written as univariate polynomials in u where u can be a*x*y,
a*x + b*y, a*x*y + x or a*x*y + y. Here is an example where u = a*sqrt(5)*x
+
