This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
problem:aut-square [2013/08/19 09:28] joshuawiscons |
problem:aut-square [2013/08/22 16:30] (current) bmwoodruff |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ==== Problem ==== | ==== Problem ==== | ||
| Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | ||
| - | Write down all elements of $\aut(\mathcal{G})$; | + | Write down all elements of $\aut(\mathcal{G})$; |
| - There is an $a\in \aut(\mathcal{G})$ such that $a^2$ is the identity but $a$ is not the identity. | - There is an $a\in \aut(\mathcal{G})$ such that $a^2$ is the identity but $a$ is not the identity. | ||
| - There is an $a\in \aut(\mathcal{G})$ such that $a^3$ is the identity but $a$ is not the identity. | - There is an $a\in \aut(\mathcal{G})$ such that $a^3$ is the identity but $a$ is not the identity. | ||
| Line 13: | Line 13: | ||
| ---- | ---- | ||
| ==== Remarks ==== | ==== Remarks ==== | ||
| - | * $\aut(\mathcal{G})$ denotes the [[definition: | + | * $\aut(\mathcal{G})$ denotes the [[definition: |
| * $S_4$ denotes the [[definition: | * $S_4$ denotes the [[definition: | ||
| ---- | ---- | ||
| ==== $\LaTeX$ version ==== | ==== $\LaTeX$ version ==== | ||
| - | <file tex aut-square.tex> | + | <file tex problem.aut-square.tex> |
| - | %%%%%%%%%% | + | %%%%% |
| % DEPENDENCIES | % DEPENDENCIES | ||
| - | % RequiredPackages: \usepackage{tikz} | + | % RequiredPackages \usepackage{tikz} |
| - | % RequiredMacros: | + | % RequiredMacros: |
| - | %%%%%%%%%% | + | %%%%% |
| \begin{problem} | \begin{problem} | ||
| Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | Consider the graph $\mathcal{G} = (V,E)$ drawn below. The vertex set is $V$ and the (symmetric) relation giving adjacency is $E$. Specifically, | ||
| - | Write down all elements of $\aut(\mathcal{G})$; | + | Write down all elements of $\aut(\mathcal{G})$; |
| \begin{enumerate} | \begin{enumerate} | ||
| \item There is an $a\in \aut(\mathcal{G})$ such that $a^2$ is the identity but $a$ is not the identity. | \item There is an $a\in \aut(\mathcal{G})$ such that $a^2$ is the identity but $a$ is not the identity. | ||
| Line 45: | Line 45: | ||
| * [[wp> | * [[wp> | ||
| - | {{tag> | + | {{tag> |