Timeline for The cars problem, again
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 26 at 2:38 | history | bounty ended | AccidentalFourierTransform | ||
| S Nov 26 at 2:38 | history | notice removed | AccidentalFourierTransform | ||
| Nov 21 at 10:29 | answer | added | Anders Martinsson | timeline score: 2 | |
| Nov 20 at 15:11 | comment | added | AccidentalFourierTransform | @HenrikRüping Ah, I see what you mean: indeed, for the simple version of the problem, it does not matter. But for the refined version (i.e., figuring out the average position of all cars $q_k(t)$), it does matter. An answer for the simpler question would already be very interesting to me. Thanks for the input in any case! | |
| Nov 20 at 7:30 | comment | added | HenrikRüping | But that is why it doesnt matter. Once a car has reached its final spot it does not obstruct the next car from reaching its final spot. Thatfor it doesnt matter whether we think of the car staying in its final spot or wandering off somewhere to infinity. | |
| Nov 19 at 16:11 | comment | added | AccidentalFourierTransform | @HenrikRüping It does matter that there are 2n spots: when the first car makes it to the end, it stops moving; when the second car makes it to the second-to-last spot, it stops moving; etc. This is why the graph eventually flattens out. If we had infinitely many parking spots, the lines would keep growing linearly, forever (this problem is also interesting but much more trivial). Just to be clear: when the first car makes it to the end, it stops, but the rest of cars keep going. The game only ends when all cars made it to the right. | |
| Nov 19 at 14:35 | comment | added | HenrikRüping | First it does not matter that there are exactly 2n parking spots, e.g. if we had an infinite parking lot and cars keep moving to the right and we ask whether the first car is in spot n, we get the same process. | |
| S Nov 19 at 14:08 | history | bounty started | AccidentalFourierTransform | ||
| S Nov 19 at 14:08 | history | notice added | AccidentalFourierTransform | Draw attention | |
| Nov 16 at 21:03 | comment | added | AccidentalFourierTransform | @CorentinB Indeed, important clarification, just the right one! Thanks. | |
| Nov 16 at 21:02 | history | edited | AccidentalFourierTransform | CC BY-SA 4.0 |
added 13 characters in body
|
| Nov 16 at 21:02 | comment | added | Corentin B | If two adjacent cars "decide" to move on a given step (with a free spot on the right), do they both move or just the right one? | |
| Nov 16 at 20:58 | comment | added | AccidentalFourierTransform | same problem here: math.stackexchange.com/q/4733006 although no answer. | |
| Nov 16 at 20:57 | history | asked | AccidentalFourierTransform | CC BY-SA 4.0 |