Skip to main content
Article thumbnail
Location of Repository

Testing of random matrices

By Antal Iványi and Imre Kátai

Abstract

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n} = \frac{1}{n} \quad (1 \leq i, j \leq n) \koz. $$ A realization $\mathcal{M} = [m_{ij}]$ of $X$ is called \textit{good}, if its each row and each column contains a permutation of the numbers $1, 2,..., n$. We present and analyse four typical algorithms which decide whether a given realization is good

Topics: Computer Science - Discrete Mathematics, 68R15, 68M20, 05B15, G.2.2
Year: 2011
OAI identifier: oai:arXiv.org:1104.4419
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.4419 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.