I've been doing some work with saturated Bruhat paths in a Coxeter group between two elements $u\leq w$. It seems to me that if $\ell(u) =0$, then there are at most $\ell(w)! $. I haven't tried to prove this, it's more of an empirical observation.

Taking this as a given, if $\ell(u)>1$ there should be fewer than $\ell(w)! $ paths, but I've noticed it's possible that there are more than $(\ell(w) - \ell(u))!$. Is there a known (or easily knowable) bound for the number of paths from $u$ to $w$ that involves $\ell(u) $?

Let's restrict to finite groups, because I'm aware short Bruhat intervals can be large in infinite groups. This doesn't preclude the possibility of the kind of bound I'm asking for, but I'm more interested in finite groups anyway and I would guess we can do better in that case.

I've been doing some work with saturated Bruhat paths in a Coxeter group between two elements $u\leq w$. It seems to me that if $\ell(u) =0$, then there are at most $\ell(w)! $. I haven't tried to prove this, it's more of an empirical observation. (Now that I think about it, it's pretty easy to prove, because if you fix a reduced word a downward path is uniquely determined by the deletion order of the letters in the word.)

Taking this as a given, if $\ell(u)>1$ there should be fewer than $\ell(w)! $ paths, but I've noticed it's possible that there are more than $(\ell(w) - \ell(u))!$. Is there a known (or easily knowable) bound for the number of paths from $u$ to $w$ that involves $\ell(u) $?

Let's restrict to finite groups, because I'm aware short Bruhat intervals can be large in infinite groups. This doesn't preclude the possibility of the kind of bound I'm asking for, but I'm more interested in finite groups anyway and I would guess we can do better in that case.