[Vegan-commits] r646 - branches/1.15/man

[noreply at r-forge.r-project.org]

Author: jarioksa
Date: 2008-12-19 10:37:01 +0100 (Fri, 19 Dec 2008)
New Revision: 646

Modified:
   branches/1.15/man/permatfull.Rd
Log:
dollar escape fix of r644 hand-made to permatfull.Rd

Modified: branches/1.15/man/permatfull.Rd
===================================================================
--- branches/1.15/man/permatfull.Rd	2008-12-19 09:34:37 UTC (rev 645)
+++ branches/1.15/man/permatfull.Rd	2008-12-19 09:37:01 UTC (rev 646)
@@ -68,7 +68,7 @@
 
 The 'swapcount' algorithm tries to find 2x2 submatrices (identified by 2 random row and 2 random column indices), that
 can be swapped in order to leave column and row totals and fill unchanged. First, the algorithm finds the largest value
-in the submatrix that can be swapped ($d$) and whether in diagonal or antidiagonal way. Submatrices that contain values larger than zero in either diagonal or antidiagonal position can be swapped. Swap means that the values in diagonal or antidiagonal positions are decreased by $d$, while remaining cells are increased by $d$. A swap is made only if fill doesn't change.
+in the submatrix that can be swapped (\eqn{d]) and whether in diagonal or antidiagonal way. Submatrices that contain values larger than zero in either diagonal or antidiagonal position can be swapped. Swap means that the values in diagonal or antidiagonal positions are decreased by \eqn{d}, while remaining cells are increased by \eqn{d}. A swap is made only if fill doesn't change.
 
 Constraints on row/colum sums, matrix fill, total sum and sums within
 strata can be checked by the \code{summary} method. \code{plot} method is for