Geometric root orders and transported edge schedules

For the finite-generator systems used in comparison, the geometric order compares positive roots by a separating linear functional divided by a positive height. Its restriction to a root plane has the convexity properties needed for dihedral arguments. Plane bases and inversion cuts connect this order with signs of roots under the group action.

Reflection-edge reconstruction makes an interval order isomorphism usable on the full directed reflection graph. Each source edge can then receive the geometric score of its target image root. Sorting these scores gives the transported schedule; reversing the list gives chronological order. The exact suffix theorem identifies the remaining endpoint conditions with strictly later scores.

The path-sum expansion first turns the transfer product into a sum of actual directed paths. The increasing Bruhat path polynomial makes that finite sum explicit for a ratio order. The source then proves the path identity for its geometric orders. Rank-two block comparisons and changes of the ordering functional are part of that proof. The resulting path matrix supplies the numerical operator used by the invariance comparison. The route below separates the geometric order, graph transport, schedule conventions and path application.

A chamber order connects geometry with the Hecke recursion. Its least simple descent admits an explicit ratio-order rotation. Rotating paths that avoid that label and splitting off a simple-edge prefix give the path-polynomial recursion. Strong induction then yields the adapted path identification, which is the input for comparing with the fixed geometric order.

Reading sequence

  1. Heights, normalized positive roots, and geometric slopes — Define the geometric score.
  2. Slope betweenness is equivalent to a positive root combination — Relate slope order to positive combinations.
  3. Existence of a generic functional ordering all positive roots — Construct a separating functional.
  4. Geometric reflection orders — Define ratio orders, adapted signs and chamber conditions.
  5. A generic ratio order in every prescribed chamber — Choose a generic numerator in the required chamber.
  6. Rotation of a ratio order through a simple reflection — Define the two turned functionals and calculate their slopes.
  7. Recovering every reflection edge from the interval order — Recover reflection edges.
  8. Transported edge scores, schedules and remaining conditions — Define the two schedule directions.
  9. A chronological suffix gives the strict later conditions at both endpoints — Identify strict later conditions.
  10. Directed edge lists, path weights and selected path sets — Define directed edge lists and their selected path sets.
  11. Ordered transfer products enumerate paths — Expand the transfer entry into weighted paths.
  12. The increasing Bruhat path polynomial of a ratio order — Construct the actual increasing path polynomial.
  13. A chamber order rotates at a least simple descent — Move a least simple root to greatest position at a shorter top.
  14. The two-order descent recursion for increasing path polynomials — Derive the recursion from the two path bijections.
  15. The path polynomial of a chamber order equals the normalized R-polynomial — Identify the adapted path polynomial with the Hecke R-family.
  16. Reversal of the full path product in an induced dihedral interval — Prove the full intrinsic plane-block identity.
  17. The decreasing-path formula for a geometric reflection order — Connect the order to the normalized R-path identity.

Entries for this keyword