Benoît Legat

Results 483 comments of Benoît Legat

Ok that would work. We need to dinstinguish 3 things in `PolyJuMP`: * Decision variables (here `λ` and `ρ` (or more precisely, there is one decision variable by moment of...

I don't believe we have anything like that. Probably `transpose` should reverse the order.

Even with the name transpose, that would make sense. PR welcome

What do you mean at the beginning ? I imagine doing the check here: https://github.com/JuliaAlgebra/DynamicPolynomials.jl/blob/a546440ea886873e6b3ccf073984465c62f30e3d/src/subs.jl#L30 with a `BitSet` instead of https://github.com/JuliaAlgebra/DynamicPolynomials.jl/blob/a546440ea886873e6b3ccf073984465c62f30e3d/src/subs.jl#L33-L35 which doesn't work for `Int`, ...

> How would the user set `check`? ```julia MP.subs(MP.Eval(false), p, x => 1) ```

Currently the ordering used is graded lexicographic order by DynamicPolynomials and TypedPolynomials. I agree that it would be nice to query the ordering used and be able to choose the...

Yes, `DynamicPolynomials` compares variables using creation order while `TypedPolynomials` compares them with names. There is the same subtlety with `==` :-P

You can create a new variables of name `u[1]` by doing `DynamicPolynomials.PolyVar{true}("u[1]")`.

> Is there an easier way than manually building and pushing on the gh pages branch? What do you mean ? It is not done manually, it is done automatically...

Ah ok I see your point. then I see no easier way no :/