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 |
2
votes
0
answers
74
views
On $\Psi$-generating paths in the Bruhat order of a Weyl group
Let $W$ be a Weyl group with roots $R$ and positive roots $R^+$. Let $v\in W$ of length $r$. We call $\mathbb{m}=(\alpha_1,\ldots,\alpha_r)\in(R^+)^r$ a Bruhat path from $1$ to $v$ if $1\lessdot s_{\a …
4
votes
1
answer
292
views
Number of paths in the Bruhat order in the symmetric group
Let $\mathbb{S}_m$ the symmetric group on $m$ letters. Let $v\in\mathbb{S}_m$, and consider paths in the Bruhat order like this: $1\lessdot v_1\lessdot\cdots\lessdot v$, where $\lessdot$ means the cov …
1
vote
0
answers
147
views
A certain kind of permutations and transport of Bruhat chains under conjugation
Let $(W,S)$ be a finite Coxeter system. Let us consider the following situation:
Let $v_1,v_2,w\in W$ such that $v_1=wv_2w^{-1}$. Let $s_{\beta_r}\ldots s_{\beta_1}$ be a reduced expression of $v_2$. …
2
votes
0
answers
81
views
Characterization of permutations which have at most one successor in the covering relation o...
Let $W$ be the symmetric group on $n+1$ letters. Let $\ell$ be the length function on $W$.
As the title says, can we characterize all $v\in W$ such that there exists a $w\in W$ such that for all simp …