% !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{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 VI}
\author{Algebraic Combinatorics (Math 68)}
\date{\vspace{-.5em}Due October 23, 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 Find the number of different 4-bead, r-color necklaces, if necklaces are considered the same
    when one is a rotation or reflection of the other (so under the dihedral group).
    
	\item Ten balls are stacked in a triangular array with 1 atop 2 atop 3 atop 4 (Think of billiards). The triangular array is free to rotate in two dimensions (like on a billiard table).
	\begin{enumerate}
		\item Find the generating function of the number of colorings using the 10 colors $r_1, \ldots, r_{10}$.
		\item How many colorings are there with 6 red balls and 4 blue?
	\end{enumerate}
	\item \begin{enumerate}
		\item How many distinct cubes are there under rotation if the edges are colored from a set with $r$ colors?
		\item How many distinct cubes are there under rotation if the vertices are colored from a set with $r$ colors?
	\end{enumerate}
	\item The \href{https://en.wikipedia.org/wiki/Rubik\%27s_Cube}{Rubik's cube} is a famous puzzle that involves a lot of symmetries. It is made of a big cube divided into 27 smaller cubes (one is inside, with no visible face; 6 faces cubes have one visible face; 12 edges cubes have two visible faces; and 8 vertices cubes have 3 visible faces). The operations on the Rubik's cube always send the 8 vertices cubes on vertices, and the 12 edge cubes on edges. It fixes the other cubes.
	\begin{enumerate}
		\item Consider only the placement of the smaller cubes (and not their orientations). To what group is isomorphic the group that acts on the bigger cube? (If you don't know, tell me what are the possibilities, and what groups are not possible).
		\item It is known that there are $2^{11}$ possible orientations for the 12 edges, and $3^7$ orientations for the 8 vertices. How many possible configurations of the Rubik's Cube are possible? (In other words, how big is the orbit of the Rubik's cube?)
		\item If you accidentally break your Rubik's Cube into the 27 smaller cubes, and you try to rebuild it without really paying attention (but still placing vertices onto vertices, edges onto edges, and so on), what are the odds that the cube you made is equivalent (under the Rubik's cube group action) to the original Rubik's cube?
	\end{enumerate}
	\end{enumerate}

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