% !TeX spellcheck = en_US
\documentclass[12pt,letter]{amsart}
%\usepackage[french]{babel}
\usepackage[latin1]{inputenc}
\usepackage{amsmath}
\usepackage{multicol}
\usepackage{textcomp}
\usepackage[margin=2cm]{geometry}
\usepackage{graphicx, graphics}
\usepackage{todonotes}
\usepackage{genyoungtabtikz}

\usepackage{pgf,tikz,pgfplots}
\pgfplotsset{compat=1.13}
\usepackage{mathrsfs}
\usetikzlibrary{arrows}
\usepackage{hyperref}

%for the due date to appear at the beggining of the page
\usepackage{etoolbox}
\makeatletter
\patchcmd{\@maketitle}
{\ifx\@empty\@dedicatory}
{\ifx\@empty\@date \else {\vskip3ex \centering\footnotesize\@date\par\vskip1ex}\fi
	\ifx\@empty\@dedicatory}
{}{}
\patchcmd{\@adminfootnotes}
{\ifx\@empty\@date\else \@footnotetext{\@setdate}\fi}
{}{}{}
\makeatother

\linespread{1.2}
\setlength\parindent{0pt}
\sloppy


\title{Homework VII}
\author{Algebraic Combinatorics (Math 68)}
\date{\vspace{-.5em}Due October 30, 2019, at the \textbf{beginning of the class}}

\begin{document}
    \maketitle
    Collaboration among students to find key to the solution is encouraged, but each person must write the homework in his/her own words. You must write the name of the students with whom you work for each problem, as well as any written resource (web, book, etc.) that has been extensively used.
    
    You must write the appropriate justification as part of the solutions.
    
    \begin{enumerate}   
    \item Compute the product of $t = \young(1223,2355,446,56)$ and $u = \young(13,2)$
    by rectifying 
    \newcommand\gr{\Yfillcolour{gray}}
    \newcommand\wh{\Yfillcolour{white}}
	\gyoung(!\gr;;;;!\wh13,!\gr;;;;!\wh2,1223,2355,446,56).\\
	
	\item Use the claims in the handouts from Monday to prove the associativity of the product of tableaux.\\
	
    \item A permutation is said to avoid a \textit{pattern} $p_1p_2\ldots p_n$ if it does not contain a subpermutation whose elements are placed in the same order as $p_1, p_2, \ldots, p_n$. For example, 3412 avoids 213.
    \begin{enumerate}
	    \item Describe the set of shapes for insertion tableaux for 321-avoiding permutations.
	    \item Describe the set of shapes for recording tableaux for 12-avoiding permutations.\\
    \end{enumerate}

    \item What are the $P$- and $Q$-tableaux associated with permutation $328951647$.\\
     
    \item What permutation do you get from the $P$-tableau $\young(126,357,48,9)$ and $Q$-tableau $\young(145,267,38,9)$\ ?\\
    
	\item Verify that the hook formula computes the right number of standard Young tableaux of shape $(l,1, \ldots, 1)$ (there are $m$ rows). What is that number? (Here you should compute it in two different ways, and one of them must be with the hook formula.)\\
	
	\item If $\sigma$ has $n-2$ fixed points, what can be said about $P$ and $Q$? I'm expecting two things.\\
	
	\item If $Q = \young(1,2,3,4,5,6,7)$, what is $P$? What is $\sigma$? How do you know?\\ 
	\end{enumerate}

    \begin{center}
    	\textbf{Good luck!}
    \end{center}
\end{document}