\documentclass[12pt]{article}
\usepackage{amsmath,mathrsfs,bbm}
\usepackage{amssymb}
\textwidth=4.825in
\overfullrule=0pt
\thispagestyle{empty}

\begin{document}
\noindent
%
%
{\bf Alan Guo}
%
%

\medskip
\noindent
%
%
{\bf Cyclic Sieving Phenomenon in Non-Crossing Connected Graphs}
%
%

\vskip 5mm
\noindent
%
%
%
%
A non-crossing connected graph is a connected graph on vertices
arranged in a circle such that its edges do not cross. The count for
such graphs can be made naturally into a q-binomial generating
function. We prove that this generating function exhibits the cyclic
sieving phenomenon, as conjectured by S.-P. Eu.

\end{document}

.