Benoît Legat

Either rely on Base.power_by_squaring or implement it directly to avoid intermediate allocations cc @aaspeel

Use MultivariatePolynomials

2

Now that MultivariatePolynomials is lightweight thanks to https://github.com/blegat/MultivariatePolynomials.jl/pull/41, we could add it to the requirement of Polyhedra and makes the `HRepresentation` and `Polyhedron` types `BasicSemialgebraicSet` subtypes. We could define a...

The fact that a polyhedron is symmetric and/or homogeneous can be determined only with type information if we add the following elements ```julia struct HomHyperPlane{N, T, AT} a::AT # ⟨a,...

polyhedron from intersection of hyperplanes

2

```julia using Polyhedra h = HyperPlane([1, 0], 1) ∩ HyperPlane([-1, 0], 1) p = polyhedron(h); ``` throws ```julia MethodError: no method matching Polyhedra.Intersection{Rational{BigInt},Array{Rational{BigInt},1},Int64}(::Int64, ::Polyhedra.SingleRepIterator{Rational{BigInt},HyperPlane{Rational{BigInt},Array{Rational{BigInt},1}},HyperPlanesIntersection{Rational{BigInt},Array{Rational{BigInt},1},Int64}}) Closest candidates are: Polyhedra.Intersection{Rational{BigInt},Array{Rational{BigInt},1},Int64}(::Union{Int64, Size}, ::Union{AbstractArray{#s18,1},...

free(): invalid pointer

1

EAGO#master is failing with MOI#master with the error `free(): invalid pointer`. See https://github.com/blegat/SolverTests/runs/1934867045

Defining `degree` on constants would be useful so that when you substitute the last variable it still works. cc @SergioCS147

https://github.com/JuliaSymbolics/SymbolicUtils.jl relies on `gcd` to simplify fractions. This is currently the performance bottleneck and while the current implementation was focused on correctness, we should now perform a detailed performance benchmark...

Part of https://github.com/JuliaAlgebra/MultivariatePolynomials.jl/issues/194