Timeline for Nonexistence of short integer program sequence which generates squares
Current License: CC BY-SA 4.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25 at 16:46 | history | edited | Turbo | CC BY-SA 4.0 |
added 380 characters in body
|
| Jul 18 at 18:15 | history | edited | YCor |
edited tags
|
|
| Jul 16 at 14:38 | history | edited | Turbo | CC BY-SA 4.0 |
added 25 characters in body
|
| Jul 16 at 14:30 | comment | added | Turbo | @PeterTaylor Thank you corrected. | |
| Jul 16 at 14:29 | history | edited | Turbo | CC BY-SA 4.0 |
added 11 characters in body
|
| Jul 16 at 14:28 | comment | added | Peter Taylor |
I think you also want to require the variable to take all square values up to $B$, don't you? As things stand, it seems that the program x = 1 answers the question.
|
|
| Jul 16 at 14:27 | history | edited | Turbo | CC BY-SA 4.0 |
edited title
|
| Jul 16 at 14:14 | history | edited | Turbo | CC BY-SA 4.0 |
added 138 characters in body
|
| Jul 16 at 14:06 | history | edited | Turbo | CC BY-SA 4.0 |
added 80 characters in body
|
| Jul 16 at 13:59 | history | edited | Turbo | CC BY-SA 4.0 |
added 60 characters in body
|
| Jul 16 at 5:52 | history | edited | Turbo | CC BY-SA 4.0 |
added 1 character in body; edited title
|
| Jul 15 at 8:39 | answer | added | joro | timeline score: 6 | |
| Jul 15 at 5:25 | comment | added | Turbo | @BillBradley yes if we have $O(1)$ variables and constraints, how many squares can we cover? | |
| Jul 15 at 3:41 | comment | added | RobPratt | or.stackexchange.com/questions/6545/… | |
| Jul 15 at 3:13 | comment | added | Bill Bradley | I'm also a little confused. Here's one interpretation: given an integer program and a variable $X$, consider the set $S$ of values that $X$ takes among the feasible set. (So, we're ignoring the objective function.) Then does there exist an integer program and a variable $X$ such that $S=\{z^2\} =\{0,1,4,9,16,...\}$? Is that what you're getting at? | |
| Jul 15 at 2:34 | review | Close votes | |||
| Jul 19 at 3:07 | |||||
| Jul 14 at 23:37 | comment | added | RobPratt | That is too vague of a description. The conclusion will be true for some integer programs and false for others. | |
| Jul 14 at 23:34 | comment | added | Turbo | Linear constraints and fixed number of integer variables and fixed number of constraints. Those are the details. You are defining a polyhedron in fixed number of variables and sides with one coordinate always a square.. I think this is not possible. | |
| Jul 14 at 23:30 | comment | added | RobPratt | Maybe. Need more details about your integer program. | |
| Jul 14 at 23:07 | history | undeleted | Turbo | ||
| Jul 14 at 23:07 | history | deleted | Turbo | via Vote | |
| Jul 14 at 23:07 | history | asked | Turbo | CC BY-SA 4.0 |