Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with permutations
Search options not deleted
user 24563
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
0
votes
Accepted
Removing the symmetry maps from a small category of cubes
The naive idea has to be slightly modified. The point is not to sort out all terms (it is a wrong intuition), but only where the variables $x_i$ are "alone". For example, the map $$(x_1,x_2,x_3,x_4)\m …
- 3,901
3
votes
1
answer
186
views
Removing the symmetry maps from a small category of cubes
I need to find a way to make a choice among all permutations. …
- 3,901
1
vote
Accepted
How to describe this set of maps of posets?
I have found a way published in a recent preprint (https://doi.org/10.48550/arXiv.2209.02667).
Theorem: Let $n\geq 1$. Let $f=(f_1,\dots,f_n):[n]\to [n]$ be a stricly increasing map. Then there is th …
- 3,901
2
votes
1
answer
233
views
How to describe this set of maps of posets?
Let $n\geq 1$. Let $[n]=\{0<1\}^n$ equipped with the product order. Let $f:[n]\to [n]$ be a strictly increasing map. When $f$ is bijective, there exists a permutation $\sigma$ of $\{1,\dots,n\}$ such …
- 3,901