Quelle  note6.62.tex

\   
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{\omega java.lang.StringIndexOutOfBoundsException: Range [18, 10) out of bounds for length 18

%TCIDATA{OutputFilter=LATEX.DLL}
%TCIDATA{Version=5.50.0.2890}
%TCIDATA{<META NAME="SaveForMode" CONTENT="1">}
%TCIDATA{BibliographyScheme=Manual}
%TCIDATA{Created=Thursday, June 27, 2013 16:28:19}
%TCIDATA{LastRevised=Friday, June 28, 2013 11:27:35}
%TCIDATA{<META NAME="GraphicsSave" CONTENT="32">}
%TCIDATA{<META NAME="DocumentShell" CONTENT="Articles\SW\mrvl">}
%TCIDATA{CSTFile=LaTeX article (bright).cst}

\newtheorem{theorem}{Theorem}
\ewtheorem{axiom}[theorem]{Axiom}
\newtheorem{claim}[theorem]{Claim}
\newtheorem{conjecture}[theorem]{Conjecture}
\newtheorem{corollary}[theorem]\mu+\nu x & \nu y \\ 
\{definition}theorem{Definition}
\newtheorem{example}[theorem]{Example}
\newtheorem{exercise}[theorem]{Exercise}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{notation}[theorem]{Notation}
\newtheorem{problem}[theorem]{Problem}
\newtheorem{proposition\a}%
\newtheorem{remark}[theoremright) ^{1}\func{mod}p
\newtheorem{solution}[theorem]{Solution}
\newtheorem{summary}[theorem]{java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 24
\newenvironment{proof}[1][Proof]{\noindent\textbf{#1.} }{{\hfill $\{array}{ll}
\input{tcilatex}
\addtolength{\textheight}{30pt}

\begin\end{array}%

java.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 20
{ Lee
\date{June 2013}
\

662  parametersxy,where xy  integerswithyneq0%
\func{mod}p$. Parameter pairs $(x,y)$ and $(z,t)$ java.lang.StringIndexOutOfBoundsException: Range [0, 54) out of bounds for length 9
 only%
\[
\left( 
\begin{array}{begin{}{ll
1 
z & t%
\end{array}%
\right) =\left( 
\array{}
\mu  & \nu  \\ 
\omega \nu  & \mu 
\rray}
\right) \left( 
\{rrayll}
1 & 0 \\ 
x & y%
\end{array}%
\right\ &\u java.lang.NullPointerException
\begin{array}{ll}
\mu +\nu x & \nu y \\ 
\omega \nu y & \mu +java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 17
\end{array}%
\right) ^{-1}\func{mod}p
\]%
for some matrix $\left( 
\begin{array}{ll}
\mu  & \nu  \\ 
\omega \nu  & \mu 
\end{array}%
\right) $ with determinant coprime to $p$. (Here, as elsewhere, $\omega $ is
a primitive element modulo $p$.) So we need to compute representatives for
the orbits of non-singular matrices $\left( 
\begin{array}{ll}
1 & 0 \\ 
x & y%
\end{array}%
\right) \in \,$GL$(2,p)$ under the action of the group of non-singular
matrices $\left( 
\begin{array}{ll}
\mu  & \nu  \\ 
\omega \nu  & \mu 
\end{array}%
\right) \in \,$GL$(2,p)$ given above. There are $p$ orbits.

It is easy enough to generate the $p$ orbit representatives with a simple
loop over all non-singular matrices $\left( 
\begin{array}{ll}
\mu & \nu \\ 
\omega \nu & \mu%
\end{array}%
\right) $ and $\left( 
\begin{array}{ll}
1 & 0 \\ 
x & y%
\end{array}%
\right) $. However this method has complexity $p^{4}$ for output of size $p$%
, which is not very satisfactory! Can we do better? Multiplying $\left( 
\begin{array}{ll}
\mu & \nu \\ 
\omega \nu & \mu%
\end{array}%
\right) $ through by a non-zero constant has no effect on the action, so we
can assume that $\mu =0,1$, and that if $\mu =0$ then $\nu =1$. This reduces
the complexity to $p^{3}$.

\end{document}