REVIEW 1 cited by
Demazure product of permutations and hopping
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The Demazure product (also goes by the name of 0-Hecke product or the greedy product) is an associative operation on Coxeter groups with interesting properties and important applications. In this note, we study permutations and present an efficient way to compute the Demazure product of two permutations starting from their usual product and then applying a new operator we call a hopping operator. We also give an analogous result for the group of signed permutations.
Forward citations
Cited by 1 Pith paper
-
Communication-efficient parallel Bruhat decomposition
Two BSP algorithms for Bruhat decomposition achieve O(n^3/p) computation, O(n^2/p^(2/3)) communication, and a tunable synchronization cost, with the strip-recursive variant matching the best known trade-off for LU dec...
Discussion (0). Continue with ORCID to comment.