Timeline for Bound on number of nxn grids with lexicographical ordering / poset structure
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 3, 2022 at 11:53 | vote | accept | Skrodde | ||
| Aug 2, 2022 at 9:01 | comment | added | Per Alexandersson | One can ask the same for a general shape $\lambda \vdash n$, and pairs $(1,\sigma_1),\dotsc, (n,\sigma_n)$, where one instead count 'standard' Young tableaux compatible with $\sigma$. I wonder if there is some nice counting-formula here, if the permutation or the shape is chosen in nice ways. | |
| Aug 2, 2022 at 8:56 | answer | added | Skrodde | timeline score: 0 | |
| Apr 24, 2022 at 13:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Dec 25, 2021 at 12:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Nov 25, 2021 at 11:35 | answer | added | Tri | timeline score: 1 | |
| Sep 8, 2017 at 15:36 | comment | added | Skrodde | Artsem, the question arose in the context of orderings of geometrical points in two-dimensional euclidean space. We would like to order $n^2$ points lexicographically in an $n\times n$ grid. To do this, we devised an algorithm. But the optimality of the algorithm depends on the number of possible outcomes, which is exactly the above question. | |
| Sep 7, 2017 at 16:04 | comment | added | Artsem Zhuk | How do you came up with this question? It seems there should be an interesting context in which this task arises. | |
| Sep 5, 2017 at 15:17 | history | asked | Skrodde | CC BY-SA 3.0 |