path: root/Math/Combinatorics/.YoungTableaux.hs.swp

b0VIM 8.0:BMY4%\�
baconoffice~bacon/codes/AlgComb/Math/Combinatorics/YoungTableaux.hsutf-8
3210#"! Utp
_

ad�
9_������TS'�����k'&�
�
�
�
z
y
U
8
7
3

���UML��P9�
�
�
x
[
Z
8
*

�	^		����o]A�����r,����cb@
�qpE(�����kI/��W9reduceWord'' xs ys = xs ++ ys      else reduceWord'' (init xs) (last xs:u:v:w:ys)                    else reduceWord'' (init xs) (last xs:v:u:w:ys)      then if u > w then reduceWord'' (init xs) (last xs:u:w:v:ys)    else if w < v && u <= v     then xs ++ (u:v:w:ys)  if isRowWord $ xs ++ (u:v:w:ys)reduceWord'' xs (u:v:w:ys) =      else u:v:w:ys                    else v:u:w:ys      then if u > w then u:w:v:ys    else if w < v && u <= v    then u:v:w:ys  if isRowWord (u:v:w:ys)reduceWord'' [] (u:v:w:ys) =reduceWord'' :: Ord a => [a] -> [a] -> [a]prop_ReduceWord_RobinsonSchensted xs = (toRowWord $ robinsonSchensted xs) == (reduceWord xs)prop_ReduceWord_RobinsonSchensted :: [Int] -> Boolprop_ReduceWord' xs = (length xs) == (length $ reduceWord xs)prop_ReduceWord' :: [Int] -> Boolprop_ReduceWord = isRowWord . reduceWordprop_ReduceWord :: [Int] -> Bool      else reduceWord' (init xs) (last xs, u, v) (w:ys)                    else reduceWord' (init xs) (last xs, v, u) (w:ys)      then if u > w then reduceWord' (init xs) (last xs, u, w) (v:ys)    else if w < v && u <= v     then xs ++ (u:v:w:ys)  if isRowWord $ xs ++ (u:v:w:ys)reduceWord' xs (u, v, w) ys =      else u:v:w:ys                    else v:u:w:ys      then if u > w then u:w:v:ys    else if w < v && u <= v    then u:v:w:ys  if isRowWord (u:v:w:ys)reduceWord' [] (u, v, w) ys =reduceWord' :: Ord a => [a] -> (a, a, a) -> [a] -> [a]                       reduceWord'' zs (ws ++ [last xs]) --}                     let (zs, ws) = splitAt (length ys - 2) ys in  {-- | otherwise      = let ys = reduceWord $ init xs in   | otherwise      = let ys = reduceWord $ init xs in reduceWord' (init $ init ys) (last $ init ys, last ys, last xs) []  | length xs <= 2 = xsreduceWord xsreduceWord :: Ord a => [a] -> [a]isRowWord = isRowWord' [] []isRowWord :: Ord a => [a] -> Bool    else ys == [] && isRowWord' [] xs zs    then head ys > head zs && (isRowWord' (xs ++ [head zs]) (tail ys) (tail zs))  if xs == [] || last xs <= head zsisRowWord' xs ys zs = isRowWord' xs [] zs = if last xs <= head zs then isRowWord' (xs ++ [head zs]) [] (tail zs) else isRowWord' [] xs zsisRowWord' [] [] zs = isRowWord' [head zs] [] (tail zs)isRowWord' _  ys [] = ys == []isRowWord' :: Ord a => [a] -> [a] -> [a] -> Bool    --}    (r1, r2) -> let S s = rowInsert (S (tail t)) (head r2) in S $ (r1 ++ x:(tail r2)):s    (r, []) -> S $ (r ++ [x]):(tail t)  case break (>x) (head t) ofrowInsert (S t) x = rowInsert :: Ord a => SSYT a -> a -> SSYT a{--toRowWord = concat . reversetoRowWord :: Ord a => SSYT a -> [a]truncInfList = fst . break nulltruncInfList :: [[a]] -> [[a]]robinsonSchensted = truncInfList . foldl rowInsert' (repeat [])robinsonSchensted :: Ord a => [a] -> SSYT a    (r1, r2) -> (r1 ++ x:(tail r2)):(rowInsert' (tail t) (head r2))    (r, []) -> (r ++ [x]):(tail t)  case break (>x) (head t) ofrowInsert' t x = rowInsert' :: Ord a => SSYT a -> a -> SSYT arowInsert t = truncInfList . rowInsert' (t ++ (repeat []))rowInsert :: Ord a => SSYT a -> a -> SSYT a  --where show (S xs) = show $ fst $ break null xs--instance Show a => Show (SSYT a)type GT a = [[a]]type SSYT a = [[a]]--data SSYT a = S [[a]]type Tableau a = [[a]]