Skip to main content
added 8 characters in body
Source Link

The goal, specifically, is if we were to consider new variables a_ij = y_i-z_j, we want to express the polynomial with nonnegative integer coefficients in terms of these variables. Since the variables are not linearly independent, a change of variables won't necessarily work, and my code uses linear optimization.

The goal, specifically, is if we were to consider new variables a_ij = y_i-z_j, we want to express the polynomial with nonnegative coefficients in terms of these variables. Since the variables are not linearly independent, a change of variables won't necessarily work, and my code uses linear optimization.

The goal, specifically, is if we were to consider new variables a_ij = y_i-z_j, we want to express the polynomial with nonnegative integer coefficients in terms of these variables. Since the variables are not linearly independent, a change of variables won't necessarily work, and my code uses linear optimization.

edited title
Link

Python integer optimization with PuLP involving polynomials that I think can be faster

edited body
Source Link

(y_1 - z_1)*(y_3 - z_2) + (y_2 - z_1)*(y_1 - z_2z_3)

(y_1 - z_1)*(y_3 - z_2) + (y_2 - z_1)*(y_1 - z_2)

(y_1 - z_1)*(y_3 - z_2) + (y_2 - z_1)*(y_1 - z_3)

added 1224 characters in body
Source Link
Loading
added 151 characters in body
Source Link
Loading
deleted 2517 characters in body
Source Link
Loading
added 4680 characters in body
Source Link
Loading
deleted 29 characters in body
Source Link
Loading
Source Link
Loading