Timeline for Combinatorics related plane geometry
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2022 at 12:45 | vote | accept | Janaka Rodrigo | ||
| Mar 31, 2022 at 15:42 | comment | added | Janaka Rodrigo | @ Peter Taylor , I derived general formula using the formula I derived earlier for partitioning the set of vertices of a convex n-gon into nonintersecting polygons. There I used the patterns observed upto 20 - gon case but sometimes there can be much rigorous different approaches using binomials. That's why I thought to share this issue here. | |
| Mar 31, 2022 at 15:25 | comment | added | Peter Taylor | The linked OEIS page gives a formula, dated from two months ago, as a hypergeometric sum which isn't WZ-summable and is therefore as close to a closed form as you can get. What more do you want? | |
| Mar 31, 2022 at 13:47 | history | edited | Timothy Chow | CC BY-SA 4.0 |
Added link to OEIS and integer-sequences tag
|
| Mar 31, 2022 at 1:52 | comment | added | Janaka Rodrigo | @YCor intention is to find how many different ways are there for all to move simultaneously to another vertex without meeting another one. Here you need to form nonintersecting closed loops ( polygons). There are real life applications other than what I have mentioned here. | |
| Mar 30, 2022 at 18:21 | comment | added | YCor | Actually I'm unable to guess the meaning of the question (what is meant by a "way to move"?...). | |
| Mar 27, 2022 at 0:51 | history | became hot network question | |||
| Mar 27, 2022 at 0:08 | answer | added | Richard Stanley | timeline score: 6 | |
| Mar 27, 2022 at 0:07 | comment | added | Richard Stanley | This problem looks okay to me. It is stated a little unclearly, but one can guess what is intended. | |
| Mar 26, 2022 at 23:43 | comment | added | Gerry Myerson | Probably a question better suited for math.stackexchange than mathoverflow, but in its current form it would be closed there in the blink of an eye. You'll want to read up on how to write a good question on that site before posting it there. Meanwhile, can you solve it for, say, $n=3,4,5$ and look for a pattern? | |
| Mar 26, 2022 at 23:37 | comment | added | Richard Stanley | By "not meeting each other," do you mean that their paths may not cross? Is a man allowed to stand still, or does every man move to a new vertex? | |
| Mar 26, 2022 at 18:23 | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| Mar 26, 2022 at 17:06 | review | Close votes | |||
| Apr 1, 2022 at 3:03 | |||||
| S Mar 26, 2022 at 16:36 | review | First questions | |||
| Mar 26, 2022 at 16:49 | |||||
| S Mar 26, 2022 at 16:36 | history | asked | Janaka Rodrigo | CC BY-SA 4.0 |