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 symmetric-groups
Search options not deleted
user 153305
The symmetric group $S_n$ is the group of permutations of the set of integers $\{1,\dots,n\}$. This has $n!$ elements and is generated by the $n-1$ involutions exchanging consecutive integers. The symmetric groups form the simplest family of Coxeter groups.
0
votes
1
answer
73
views
Analog of self-conjugate representation of symmetric group for Hecke algebra
Consider a symmetric group $S_n$. It is generated by generators $\sigma_1\dotsc\sigma_{n-1}$ that satisfy the following relations:
Square relations: $\sigma_k^2=1,\qquad k=1\ldots n-1$.
Braid relatio …
- 61
2
votes
0
answers
131
views
Need for "minimal representation" of a symmetric group
I need to construct a representation of a symmetric group $S_n$, in which a character of the conjugacy class $(n)$ (a class of permutations, which are cycles of a maximal possible length $n$) would be …
- 61