text:
# 1 Introduction

## 1 Introduction

The Bäcklund transformation equations play an important role in the study of integrable equations . They generate the Bäcklund transformation which allows one to obtain the exact N soliton solution of the nonlinear equation, and also provide the Lax pair. The integrable equation itself is given as a consistency condition of the Bäcklund transformation equations in these schemes.

On the one hand, the cellular automaton models which have exact N soliton solution were found in the last decade . In many cases, these soliton cellular automaton models are obtained as a special limit, known as the ultradiscrete limit, of the discrete integrable equations. Typically, the limiting procedure simply replace the summation by the Max operator and the product by the summation. Despite of this simple correspondence, this procedure causes some ambiguities concerning to the Max operator. For example, we can remove the variable $`x`$ from the equation $`a+x=b+x`$, however, we can not remove the variable $`x`$ from

$`\text{Max}(a,x)=\text{Max}(b,x).`$
These type of difficulties prevent us to consider the consistency condition of the Bäcklund transformation equations for the soliton cellular automaton model.

In this paper, we consider the ultradiscrete KP equation and its Bäcklund transformation equations, since it reduces to many soliton cellular automaton models. The ultradiscrete KP equation was first proposed in the paper , as the unified equation of a class of generalized Box and Ball systems. It also contains the ultradiscrete Toda equation , etc.

We show the consistency condition of the Bäcklund transformation equations of the ultradiscrete KP equation as follows. First, we propose an extension of the Bäcklund transformation equations of the discrete KP equation . An important aspect of the extended Bäcklund transformation equations is that, it can be expressed as the vanishing of the product of a matrix and a vector. The consistency condition becomes the vanishing of the determinant of the matrix. This will be shown in the next section. Second, in section 3, we show the algorithm to eliminate N variables from N ultradiscrete linear equations, before considering the ultradiscretization of the discrete KP equation. Finally, in section 4, we derive the Bäcklund transformation equations of the ultradiscrete KP equation, starting from the extended Bäcklund transformation equations of section 2. By applying the algorithm of section 3, we derive the consistency condition of the Bäcklund transformation equations. Some examples of soliton solutions are also shown.

## 2 Bäcklund transformation equation for the discrete KP equation

Let us begin with writing down the discrete KP equation for a function $`f`$ of three discrete variables $`p,q,r`$  ,

$`z_pz_{qr}f_pf_{qr}+z_qz_{rp}f_qf_{pr}+z_rz_{pq}f_rf_{pq}=0.`$ (1)
Here, $`z_i`$’s are arbitrary complex constants and $`z_{ij}=z_iz_j`$. The lower subscripts of $`f`$ indicate to increase the corresponding variables by one,

$`f_p=f(p+1,q,r),`$
$`f_{pq}=f(p+1,q+1,r).`$ (2)
Despite of the simplicity, this equation plays an important role in the study of the integrable equations. It reduces to many integrable equations known in the physics and mathematics , and is satisfied by the transfer matrices of a class of solvable lattice models ,, , and is also satisfied by the amplitude of a string model .

The Bäcklund transformation equations for the discrete KP equation are a system of linear equations

$`z_rf_rg_qz_qf_qg_r+z_{qr}f_{qr}g=0,`$
$`z_rf_rg_pz_pf_pg_r+z_{pr}f_{pr}g=0.`$ (3)
If we substitute a solution of the discrete KP equation into the function $`f`$ in this equation, then we can show that there exist nontrivial solutions $`g`$, which satisfy the discrete KP equation. The compatibility condition of these two equations is in the central of this scheme. It guarantees the existence of the solution for these equations, and it also guarantees that the solution, $`g`$ also satisfies the discrete KP equation. See  and  for example. However, the consistency condition does not work for the ultradiscretized system, because of the ambiguity of the Max operator stated above.

In this paper, we extend the Bäcklund transformation equations (3), by considering the additional bilinear equations deduced from the discrete KP equation and its Bäcklund transformation equations (3). The additional bilinear equations provide another expression of the Bäcklund transformation equations.

Let us rewrite the Bäcklund transformation equations, by dividing them by $`g`$ and move the terms other than $`f_{qr}`$ and $`f_{pr}`$ to the right hand side

$`f_{qr}={\displaystyle \frac{z_rf_rg_q+z_qf_qg_r}{z_{qr}g}},`$
$`f_{pr}={\displaystyle \frac{z_rf_rg_p+z_pf_pg_r}{z_{pr}g}}.`$ (4)
Substituting these expressions of $`f_{qr}`$ and $`f_{pr}`$ into the discrete KP equation, we can obtain an additional bilinear equation

$`z_pf_pg_q+z_qf_qg_pz_{pq}f_{pq}g=0.`$ (5)
Similarly, substituting $`f_p`$ and $`f_q`$ appearing in the equations (3) into the discrete KP equation, we obtain another bilinear equation

$`z_{pq}f_{pq}g_r+z_{qr}f_{qr}g_pz_{pr}f_{pr}g_q=0.`$ (6)
Notice that the equations (3), (5) and (6) are linearly independent, unless the function $`f`$ satisfies the discrete KP equation. These four equations are the extension of the Bäcklund transformation equations, which we employ in this paper.

An important aspect of the extended Bäcklund transformation equations is that they can be summarized into the product of a matrix and a vector. Indeed, the extended Bäcklund transformation equations consist of four equations and the number of $`g`$ appearing in the same equations (i.e $`g,g_p,g_q,g_r`$) is four, thus, we can write down the equations by using a 4 $`\times `$ 4 matrix and a 4 component vector

$`\left[\begin{array}{cccc}0& z_rf_r& z_qf_q& z_{rq}f_{rq}\\ z_rf_r& 0& z_pf_p& z_{pr}f_{pr}\\ z_qf_q& z_pf_p& 0& z_{qp}f_{pq}\\ z_{qr}f_{qr}& z_{rp}f_{pr}& z_{pq}f_{pq}& 0\end{array}\right]\left[\begin{array}{cccc}g_p& & & \\ g_q& & & \\ g_r& & & \\ g& & & \end{array}\right]=0.`$ (15)
The consistency condition for these equations is the existence of the nontrivial solution, $`g`$ and it is nothing but the vanishing of the determinant of this matrix. In this case, the matrix is antisymmetric matrix, thus, we can use the fact that the determinant of the antisymmetric matrix becomes the square of a pfaffian. The vanishing of the pfaffian becomes just the discrete KP equation.

Since the consistency condition is very different from the consistency condition for the original Bäcklund transformation equations, there is a chance to avoid the difficulty of the Max operator.

## 3 Ultradiscrete linear equations

Of course, we can remove the Max operator from the ultradiscrete Bäcklund transformation equations, by dividing it into cases. However, it is complicated and requires the individual consideration. Instead to do so, we study the generic consistency condition for the ultradiscrete linear equations. We show an algorithm to eliminate variables, starting from the consideration of two linear equations.

Before proceeding to the generic cases, let us consider the following two examples of two ultradiscrete linear equations. Our first example is the following couple of equations

$`\stackrel{~}{a}+x=\text{Max}(a+x,b+y),`$
$`\stackrel{~}{c}+x=\text{Max}(c+x,d+y).`$ (16)
Here, $`a,b,c,d,\stackrel{~}{a},\stackrel{~}{c}`$ are the constant coefficients, and $`x,y`$ are the variables of these two equations. We can eliminate these variables, by considering the trivial identity

$`\text{Max}(\text{Max}(a+x,b+y)+d,c+b+x)=\text{Max}(a+d+x,\text{Max}(c+x,d+y)+b).`$ (17)
Substituting the first and second equations of (16) into the left hand side and the right hand side of this equation respectively, we obtain the relation

$`\text{Max}(\stackrel{~}{a}+d,c+b)=\text{Max}(a+d,\stackrel{~}{c}+b).`$ (18)
This relation should be satisfied, if there are finite solutions, $`x`$ and $`y`$. Thus, we can eliminate all variables, without dividing Max operators into the cases.

Our second example is the following couple of linear equations

$`\stackrel{~}{a}+x=\text{Max}(a+x,b+y),`$
$`\stackrel{~}{d}+y=\text{Max}(c+x,d+y).`$ (19)
We can also eliminate all variables from these equations without dividing them into cases. Indeed, adding these two equations and applying these two equations to the left hand side once again, we obtain the relations

$`\stackrel{~}{a}+\stackrel{~}{d}+x+y`$
$`=\text{Max}(a+c+2x,a+d+x+y,b+c+x+y,b+d+2y)`$
$`=\text{Max}(a+\stackrel{~}{d}+x+y,\stackrel{~}{a}+d+x+y,b+c+x+y).`$ (20)
We can eliminate all variables, by subtracting the $`x+y`$ from the first part and the third part of these equations,

$`\text{Max}(\stackrel{~}{a}+d,a+\stackrel{~}{d},b+c)=\stackrel{~}{a}+\stackrel{~}{d}.`$ (21)
In the general two linear equations cases, we can not eliminate all variables without dividing them into cases. However, previous two examples make the consideration simple. The most general ultradiscrete two linear equations for two variables $`x`$ and $`y`$ are written as

$`\text{Max}(\stackrel{~}{a}+x,\stackrel{~}{b}+y)=\text{Max}(a+x,b+y),`$
$`\text{Max}(\stackrel{~}{c}+x,\stackrel{~}{d}+y)=\text{Max}(c+x,d+y).`$ (22)
For example, if $`\stackrel{~}{a}+x`$ in the left hand side of the first equation is larger than $`\stackrel{~}{b}+y`$ and $`\stackrel{~}{c}+x`$ in second equation is larger than $`\stackrel{~}{d}+y`$, these equations become as

$`\stackrel{~}{a}+x=\text{Max}(a+x,b+y),`$
$`\stackrel{~}{c}+x=\text{Max}(c+x,d+y).`$ (23)
This is the case of our first example. By applying the result of the first example, we can eliminate all variables from these equations.

$`\text{Max}(\stackrel{~}{a}+d,c+b)=\text{Max}(a+d,\stackrel{~}{c}+b)`$ (24)
Applying the similar argument to the rest of the three cases

$`\stackrel{~}{a}+x\stackrel{~}{b}+y\text{ and }\stackrel{~}{c}+x\stackrel{~}{d}+y\text{Max}(\stackrel{~}{a}+d,c+b)=\text{Max}(a+d,\stackrel{~}{c}+b),`$
$`\stackrel{~}{a}+x\stackrel{~}{b}+y\text{ and }\stackrel{~}{c}+x\stackrel{~}{d}+y\text{Max}(\stackrel{~}{b}+c,d+a)=\text{Max}(b+c,\stackrel{~}{d}+a),`$
$`\stackrel{~}{a}+x\stackrel{~}{b}+y\text{ and }\stackrel{~}{c}+x\stackrel{~}{d}+y\stackrel{~}{a}+\stackrel{~}{d}=\text{Max}(\stackrel{~}{a}+d,a+\stackrel{~}{d},b+c),`$
$`\stackrel{~}{a}+x\stackrel{~}{b}+y\text{ and }\stackrel{~}{c}+x\stackrel{~}{d}+y\stackrel{~}{b}+\stackrel{~}{c}=\text{Max}(\stackrel{~}{b}+c,b+\stackrel{~}{c},a+d),`$ (25)
and summarizing these results in one equation, we can obtain the relation

$`\text{Max}(a+d,\stackrel{~}{a}+\stackrel{~}{d},b+\stackrel{~}{c},\stackrel{~}{b}+c)=\text{Max}(\stackrel{~}{a}+d,a+\stackrel{~}{d},b+c,\stackrel{~}{b}+\stackrel{~}{c}).`$ (26)
One can easily confirm that this relation is satisfied in all four cases. This relation should be satisfied, if there are finite solution, $`x`$ and $`y`$ for the generic two linear equations (22).

On the one hand, we can rewrite the equations (22) as

$`\text{Max}(\stackrel{~}{a}+z,\stackrel{~}{b})=\text{Max}(a+z,b),`$
$`\text{Max}(\stackrel{~}{c}+z,\stackrel{~}{d})=\text{Max}(c+z,d).`$ (27)
Here, we subtract $`y`$ from equations (22), and replace $`xy`$ by $`z`$. Apparently, if there is finite $`z`$ which satisfies these equations, the relation (26) should be satisfied. Since, $`a,b,c,d,\stackrel{~}{a},\stackrel{~}{b},\stackrel{~}{c},\stackrel{~}{d}`$ are arbitrary constants, we can eliminate one variable from two linear equations of any number of variables. Applying this reduction recursively, we can reduce N linear equations for N variables to 2 linear equations for 2 variables, and the rest of 2 variables can be eliminated from two linear equations. So that, we can eliminate N variables from N linear equations.

In the next section, we consider the consistency condition of the Bäcklund transformation equations for the ultradiscrete KP equation by using this algorithm.

## 4 The Bäcklund transformation equations for the ultradiscrete KP equation

Let us write the discrete KP equation, once again. It was the following equation

$`z_pz_{qr}f_pf_{qr}+z_rz_{pq}f_rf_{pq}=z_qz_{pr}f_qf_{pr}.`$ (28)
Here, $`f`$ is a complex valued function in the original discrete KP equation, but we restrict the value to positive real numbers, to take the ultradiscrete limit. We also restrict the values of $`z_i`$’s to real numbers, and assume $`z_p>z_q>z_r`$ since it does not lose the generality. Notice that in this choice of coefficients, both of the left hand side and the right hand side of the equation (28) become positive.

The ultradiscrete limit of the discrete KP equation is taken as follows. First, we transform the dependent variable $`f`$ and the coefficients $`z_i,z_{ij}`$ into $`F`$ and $`Z_i,Z_{ij}`$, as

$`f=\mathrm{exp}({\displaystyle \frac{F}{ϵ}}),z_i=\mathrm{exp}({\displaystyle \frac{Z_i}{ϵ}}),z_{ij}=\mathrm{exp}({\displaystyle \frac{Z_{ij}}{ϵ}}).`$ (29)
Here, $`ϵ`$ is a positive real parameter. Second, we apply the log function to both side of the equation (28) after multiplication of $`ϵ`$, and take the $`ϵ+0`$ limit. By using the following two identities,

$`\underset{ϵ+0}{lim}\mathrm{log}ϵ(\mathrm{exp}({\displaystyle \frac{A}{ϵ}})+\mathrm{exp}({\displaystyle \frac{B}{ϵ}}))=\text{Max}(A,B),`$
$`\underset{ϵ+0}{lim}\mathrm{log}ϵ(\mathrm{exp}({\displaystyle \frac{A}{ϵ}})\times \mathrm{exp}({\displaystyle \frac{B}{ϵ}}))=A+B,`$ (30)
we can obtain the ultradiscrete KP equation from equation (28).

$`Z_q+Z_{pr}+F_q+F_{pr}=\text{Max}(Z_p+Z_{qr}+F_p+F_{qr},Z_r+Z_{pq}+F_r+F_{pq})`$ (31)
As in the case of the discrete KP equation, this equation reduces to many soliton cellular automaton models. See , for example.

The Bäcklund transformation equations for the ultradiscrete KP equation are obtained by applying the similar procedure to the extended Bäcklund transformation equations. Applying the transformation (29) and

$`g=\mathrm{exp}({\displaystyle \frac{G}{ϵ}}),`$ (32)
and taking the $`ϵ+0`$ limit, we obtain the equations

$`Z_q+F_q+G_r=\text{Max}[Z_r+F_r+G_q,Z_{qr}+F_{qr}+G],`$
$`Z_p+F_p+G_r=\text{Max}[Z_r+F_r+G_p,Z_{pr}+F_{pr}+G],`$
$`Z_p+F_p+G_q=\text{Max}[Z_q+F_q+G_p,Z_{pq}+F_{pq}+G],`$
$`Z_{pr}+F_{pr}+G_q=\text{Max}[Z_{qr}+F_{qr}+G_p,Z_{pq}+F_{pq}+G_r].`$ (33)
The consistency condition for these equations is obtained by eliminating the all variables from these equations. Let us notice that we can eliminate $`G_r`$ and $`G_q`$, by substituting second equation and third equation to first equation and fourth equation, respectively. Then, we obtain the following two linear equations for two variables $`G_p`$ and $`G`$

$`\text{Max}(Z_r+Z_q+F_r+F_q+G_p,Z_q+Z_{pr}+F_q+F_{pr}+G)`$
$`=\text{Max}(Z_r+Z_q+F_r+F_q+G_p,\text{Max}(Z_r+Z_{pq}+F_r+F_{pq},Z_{qr}+Z_p+F_{qr}+F_p)+G)),`$
$`\text{Max}(Z_{pr}+Z_q+F_{pr}+F_q+G_p,Z_{pr}+Z_{pq}+F_{pr}+F_{pq}+G)`$
$`=\text{Max}(\text{Max}(Z_{qr}+Z_p+F_{qr}+F_p,Z_{pq}+Z_r+F_{pq}+F_r)+G_p,Z_{pq}+Z_{pr}+F_{pq}+F_{pr}+G).`$
By applying the relation (26), we can eliminate the rest of two variables. After some calculation, we can obtain the equation for $`F`$

$`\text{Max}(Z_q+Z_r+Z_{pq}+Z_{pr}+F_q+F_r+F_{pq}+F_{pr},`$
$`Z_{pr}+Z_q+F_{pr}+F_q+\text{Max}(Z_r+Z_{pq}+F_r+F_{pq},Z_{qr}+Z_p+F_{qr}+F_p),`$
$`Z_q+Z_{pr}+F_q+F_{pr}+\text{Max}(Z_{qr}+Z_p+F_{qr}+F_p,Z_{pq}+Z_r+F_{pq}+F_r))`$
$`=\text{Max}(Z_q+Z_r+Z_{pq}+Z_{pr}+F_q+F_r+F_{pq}+F_{pr},`$
$`2(Z_{pr}+Z_q+F_{pr}+F_q),2\text{Max}(Z_r+Z_{pq}+F_r+F_{pq},Z_{qr}+Z_p+F_{qr}+F_p)).`$ (35)
Notice that we can remove the first terms of the both hand side, since they are smaller than the other terms. Moving the rest of the right hand side to the left hand side, we obtain the equation

$`Z_q+Z_{pr}+F_q+F_{pr}\text{Max}(Z_p+Z_{qr}+F_p+F_{qr},Z_r+Z_{pq}+F_r+F_{pq}=0.`$ (36)
This is nothing but the absolute value of the ultradiscrete KP equation.

Since we can change the roles of $`F`$ and $`G`$, by shifting each of the equations of (33) appropriately, $`G`$ should also satisfy the ultradiscrete KP equation. Thus, we can show that equations (33) really generate the Bäcklund transformation of the ultradiscrete KP equation.

In the rest of this section, we derive the two soliton solution and conjecture the form of the N soliton solution. Let us assume the existence of the trivial solution, $`F=G=0`$, then the conditions for the coefficients of equations (33),

$`Z_q=\text{Max}[Z_r,Z_{qr}],`$
$`Z_p=\text{Max}[Z_r,Z_{qr},Z_{pq}],`$
$`Z_{pr}=\text{Max}[Z_{qr},Z_{pq}],`$ (37)
should be satisfied. Notice that $`Z_r,Z_{qr}`$ and $`Z_{pq}`$ determine the rest of the coefficients. We rewrite these three coefficients as

$`Z_{pq}=Z_1,Z_{qr}=Z_2,Z_r=Z_3,`$ (38)
for simplicity. Furthermore we assume the relations $`Z_1Z_2Z_3`$, then the rest of the coefficients becomes as

$`Z_q=Z_2,Z_p=Z_1,Z_{pr}=Z_1.`$ (39)
Of course we can consider the other relations for $`Z_1,Z_2`$ and $`Z_3`$, however, it does not change the following argument.

The one soliton solution is derived as follows. First, we substitute the trivial solution $`F=0`$ into the Bäcklund transformation equations (33), and assume the form of $`G`$ as

$`G=\stackrel{}{\alpha }\stackrel{}{p}.`$ (40)
Here, $`\stackrel{}{\alpha }`$ is the three dimensional vector of constant coefficients, and $`\stackrel{}{p}`$ is the vector of coordinates $`p,q,r`$

$`\stackrel{}{\alpha }=(\alpha _p,\alpha _q,\alpha _r),\stackrel{}{p}=(p,q,r).`$ (41)
The dot between them represents the vector product. By substituting the $`G`$ of equation (40) into the Bäcklund transformation equations (33), we obtain the following dispersion relations

$`Z_2+\alpha _r=\text{Max}[Z_3+\alpha _q,Z_2],`$
$`Z_1+\alpha _r=\text{Max}[Z_3+\alpha _p,Z_1],`$
$`Z_1+\alpha _q=\text{Max}[Z_2+\alpha _p,Z_1],`$
$`Z_1+\alpha _q=\text{Max}[Z_2+\alpha _p,Z_1+\alpha _r].`$ (42)
We can solve these dispersion relations as

$`\alpha _p=\alpha +Z_1,\alpha _q=\text{Max}(\alpha +Z_2,0),\alpha _r=\text{Max}(\alpha +Z_3,0).`$ (43)
Here, $`\alpha `$ is an arbitrary real parameter. The one soliton solution of the ultradiscrete KP equation becomes the superposition of these representations of $`G`$ which is written in “Max” operator,

$`G=\text{Max}(\stackrel{}{\alpha }\stackrel{}{p},\stackrel{}{\beta }\stackrel{}{p}).`$ (44)
where $`\beta `$ is a three dimensional vector $`(\beta _p,\beta _q,\beta _r)`$ which satisfies the dispersion relations.

Figure 1 shows the time evolution of three soliton solution. We transform the dependent variable $`f`$ and coordinates $`p,q,r`$ into $`U`$ and $`l,m,n`$ as

$`U(p,q,r)=f(p,q,r+1)+f(p+1,q+1,r)f(p+1,q,r)f(p,q+1,r+1),`$
$`l=pr,m=q,n=p+r.`$ (45)
The $`l`$ axis is parallel to the horizontal line and $`m`$ axis is parallel to the vertical line.

We see the propagation of one soliton solution in the large $`l`$ and large $`m`$ region, in Fig. 1.

Similarly, we can obtain the two soliton solution by substituting the one soliton solution (44) to the function $`F`$ in the Bäcklund transformation equations, and solve the equations for $`G`$. Let us assume the form of $`G`$ as

$`G=\text{Max}(c_\alpha +\stackrel{}{\alpha }\stackrel{}{p}+\stackrel{}{\gamma }\stackrel{}{p},c_\beta +\stackrel{}{\beta }\stackrel{}{p}+\stackrel{}{\gamma }\stackrel{}{p}),`$ (46)
where $`c_\alpha `$ and $`c_\beta `$ are the constants which should be determined later, and $`\stackrel{}{\gamma }`$ is also a three dimensional vector which satisfy the dispersion relations. Substituting this expression into the Bäcklund transformation equations, we obtain the following relations of $`c_\alpha `$ and $`c_\beta `$

$`\{\begin{array}{ccc}c_\alpha =c_\beta ,& \text{if}\gamma \alpha ,\beta ,& \\ c_\alpha \alpha =c_\beta \beta ,& \text{if}\alpha ,\beta \gamma ,& \\ \text{There is no solution of }c_\alpha \text{ and }c_\beta & \text{if}\alpha \gamma \beta \text{or}\beta \gamma \alpha .& \end{array}`$ (50)
These results can be summarized into the following forms, without the loss of the generality

$`c_\alpha =\text{Max}(\alpha ,\gamma ),`$
$`c_\beta =\text{Max}(\alpha ,\gamma ),(\alpha ,\beta \gamma \text{ or }\gamma \alpha ,\beta ).`$ (51)
The two soliton solution of the ultradiscrete KP equation becomes the superposition of these solutions,

$`G=\text{Max}(\text{Max}(\alpha ,\gamma )+\stackrel{}{\alpha }\stackrel{}{p}+\stackrel{}{\gamma }\stackrel{}{p},\text{Max}(\alpha ,\delta )+\stackrel{}{\alpha }\stackrel{}{p}+\stackrel{}{\delta }\stackrel{}{p},`$
$`\text{Max}(\beta ,\gamma )+\stackrel{}{\beta }\stackrel{}{p}+\stackrel{}{\gamma }\stackrel{}{p},\text{Max}(\beta ,\gamma )+\stackrel{}{\beta }\stackrel{}{p}+\stackrel{}{\delta }\stackrel{}{p}),`$ (52)
where $`\gamma `$ and $`\delta `$ should satisfy one of the following conditions

$`\gamma ,\delta \alpha ,\beta `$
$`\gamma \alpha ,\beta \delta `$
$`\alpha ,\beta \gamma ,\delta .`$ (53)
These arguments allow one to suppose the form of the N soliton solution. The N soliton solution may have the following form

$`f=\text{Max}_{\{\sigma \}}({\displaystyle \underset{i<j}{}}\text{Max}(\alpha _i^{\sigma _i},\alpha _j^{\sigma _j})+{\displaystyle \underset{i}{}}\stackrel{}{\alpha _i}^{\sigma _i}\stackrel{}{p}).`$ (54)
Here, $`\{\sigma \}=(\sigma _1,\sigma _2,\mathrm{},\sigma _N)`$ and $`\sigma _i`$’s take value of 1 or 0. $`\text{Max}_{\{\sigma \}}`$ means to take the maximal value of all the combination of the $`\sigma `$’s. The vectors $`\stackrel{}{\alpha _i}^0`$ and $`\stackrel{}{\alpha _i}^1`$ are constant coefficients which satisfy the dispersion relations, and we also assume that one of the following conditions is satisfied for all combinations of $`ij`$

$`\alpha _i^0,\alpha _i^1\alpha _j^0,\alpha _j^1,`$
$`\alpha _i^0\alpha _j^0,\alpha _j^1\alpha _j^1,`$
$`\alpha _j^0,\alpha _j^1\alpha _i^0,\alpha _i^1.`$ (55)
We do not have the proof of the expression (54), but we confirm that it really satisfies the Bäcklund transformation equations till $`N`$ = 4. The complete proof will be given in the other paper.

## 5 Conclusion

We consider the consistency condition for the Bäcklund transformation equations of the ultradiscrete KP equation. We extend the Bäcklund transformation equations for the discrete KP equation into the form of the product of a matrix and a vector. The consistency condition becomes the vanishing of the determinant of the matrix. In this case, the matrix becomes an antisymmetric matrix, and we can obtain the discrete KP equation by using the relation between the determinant of an anti symmetric matrix and a pfaffian. We also show the algorithm to eliminate the variables from the ultradiscrete linear equations. By using this algorithm, we obtain the consistency condition of the Bäcklund transformation equations of the ultradiscrete KP equation. The consistency condition becomes the absolute value of the ultradiscrete KP equation, instead of the square of the pfaffian in the discrete KP equation case.


format: text

text:
# An Automatic Image Reduction Pipeline for the Advanced Camera for Surveys

## 1. Introduction and Basic Operation

The ACS science team was apportioned about 550 orbits of GTO time in exchange for its instrument development and calibration work. A robust and flexible astronomical data reduction and analysis pipeline was required for processing these data and other observations for which the science team is responsible. To fill this need, we developed a package called “Apsis” (ACS pipeline science investigation software), written in the Python programming language using a flexible, modular design. Apsis was used for processing the ACS early release observation (ERO) images of the Tadpole and Mice galaxies, the Cone Nebula, and M17 soon after ACS was installed on the Hubble Space Telescope. Since then, it has developed and been used extensively on Linux and Solaris platforms for processing WFC and HRC data from both science and calibration programs.

A given processing run starts with flat-fielded multi-extension FITS images that have been processed through the CALACS software at STScI (Hack 1999). The basic Apsis “observation object” consists of all the images of a given program field (or mosaic of adjacent fields). These are grouped into separate “associations” according to the different imaging/grism filters used or (sometimes) different epochs, and FITS tables are constructed similar to those used in STScI OPUS pipeline. Reading and manipulation of FITS images and tables are done with the aid of the PyFits and Numarray Python modules, and any IRAF/STSDAS routines are called through Pyraf (see Greenfield et al. 2002). Other external programs are accessed via system calls.

The observation object is then passed to the various python modules in succession, which have “methods” (python functions) for performing the following general tasks: image offset measurement corrected for distortion, sky estimation and subtraction, cosmic ray (CR) rejection and “drizzling,” construction of error arrays and a multi-band “detection image,” object detection and measurement, photometric calibration, and photo-$`z`$ estimation. A running log keeps track of progress and records diagnostics. After completion, each module object is written to disk as a byte stream using the Python “pickling” utility; this allows for recovery of information in the event of failure and simplifies debugging. The modules also contain detailed methods for producing XML messages and markup of the data products (images and catalogs) for archiving purposes.

Although Apsis was designed primarily as an automated pipeline, it can be run by users as a standalone program, and provides a suite of command-line options for this purpose. These include switches for turning off various parts of the processing (e.g., sky subtraction, cataloging), specifying a particular input image as reference for the shifts, supplying an alternate distortion model, externally measured shifts, or sky values, lowering the CR rejection thresholds, changing the output image pixels scale, and several other options. The following sections provide a few details on the major processing steps.

## 2. Image Registration and Sky Subtraction

The align module determines the relative $`x,y`$ shifts and rotations, as well as the sky levels, of the input images. SExtractor (Bertin & Arnout 1996) is run with a signal-to-noise threshold of 10 on each science extension of each image (there are two science extensions for WFC; one for HRC and SBC). The resultant catalogs are culled on the basis of object size and shape parameters, thereby rejecting the vast majority of cosmic rays and CCD artifacts as well as overly diffuse objects. If fewer than ten “good” sources remain, then SExtractor is rerun at lower thresholds. The $`x,y`$ coordinates of each “good” source are corrected using the distortion model read from the IDCTAB FITS table specified in the image headers or on the command line. Sources from different extensions (different CCD chips) of the same image are placed on a common rectified frame using the IDCTAB parameters V2REF and V3REF.

We use the “Match” program (Richmond 2002) to derive shifts and rotations with respect to a reference image, by default the one having the most “good” sources. We modified Match to accept an input guessed transformation (derived from the headers) and to report more diagnostics for evaluating the success of the matching. In the event of failure, Match is rerun without an input guess, using the full triangle-matching search algorithm on the $`N`$ brightest sources; this is repeated with larger $`N`$, and an $`N^6`$ hit in processor time, if necessary. All sources are used for tuning up the final transformation once it is found. We also evaluate the median $`x,y`$ shifts for all matched sources, and we revert to these if the derived rotation is negligible.

This automatic, adaptive matching procedure works quite well in practice. Images taken at large offsets and in different visits can have header shift errors of $`\mathrm{\hspace{0.17em}1}^{\prime \prime }`$ ($``$20 WFC pixels), but this is irrelevant for the triangle matching algorithm. Typical WFC GTO fields produce one-to-several hundred matched sources per exposure, and the resulting shift uncertainty is typically $`\mathrm{\hspace{0.17em}0.02}`$ pix. Problems have only occurred for some images of blank fields taken with the HRC, which has an area 1/64 of the WFC. In this case Apsis defaults to the header shifts, although it is also possible to supply external shifts. Grism (G800L) images are by default aligned with direct images according to the headers.

The sky values and sigmas returned by SExtractor for each image extension are used as inputs to the STSDAS dither.sky task, which in turn uses the STSDAS gstatistics routine. However, experimentation indicated that the mean sky levels reported by SExtractor were more robust, although tended to be biased high in more crowded fields. For this reason, we adopt the SExtractor sky value when it is the lower estimate, and the mean of the two otherwise. The sky is then subtracted, with the option of averaging the values for different extensions of the same image. This step removes sky level differences for the image combination and CR rejection routines described in the following section.

## 3. Image Combination

The modules combDither and pyblot combine all exposures within each filter into a single geometrically corrected image while rejecting cosmic rays. This is done through the STSDAS Dither package drizzle-blot-drizzle cycle outlined by Gonzaga et al. (1998), although here coded in Python. First the images are “drizzled” to separate output images using the shifts and rotations supplied by the Apsis align module. These individually drizzled images are then median stacked using exposure time weighting and a ‘minmax’ clipping algorithm. The median image is then “blotted” back to each of the input image positions, rescaled in exposure time, and used as a template for CR rejection with the driz\_cr task. The driz\_cr parameters were optimized to achieve good CR rejection without harming the centers of any stars. In particular, this meant setting the derivative scale parameter to a value near unity.

A cosmic ray mask is produced for each science extension and is multiplied by the bad pixel mask that we produce from the data quality arrays using a call to Pydrizzle with the ‘bits’ parameter set to 8578 to include ‘good’, ‘replaced’, ‘saturated,’ and ‘repaired’ pixels (see Hack 1999). These combined CR/badpix masks are then used for the final drizzling of the input images in each filter to a single output image. We again use the shifts and rotations found by align and produce drizzled images in units of electrons. In so doing, it is necessary to divide the output pixel values by the number of science extensions, since the drizzle task does not recognize the different extensions as being part of the same image. The default drizzle pixfrac and scale parameters are unity but can be reset with flags on the Apsis command line.

After the final images are produced, the image headers are thoroughly updated and corrected. This includes calculating new CD matrices from scratch based on the output pixel scale and image orientation, which is derived through spherical geometry from the PA\_V3 header keyword of the reference image, the declination, and the detector orientation and location in the V2,V3 plane. The code also ensures that all of the output images have identical WCS information, as they should all be well aligned at this stage. At this writing, the WCS zero points are off by roughly 2<sup>′′</sup> due to systematic pointing errors, but this is expected to improve with a recent FGS realignment.

We produce an “RMS image” for each output science image. The RMS images have pixel values equal to the estimated error per pixel, based on the total read noise, signal level, Apsis cosmic ray rejection, and the effects of the multiple bias and dark frame subtractions. The actual root-mean-square pixel variation in the science image is of course lower due to the noise correlation induced by non-integer shifts and geometric correction. However, we verified that the RMS images reflect the pixel variation when images are stacked without shifting or correction. The RMS images are used in estimating photometric errors.

## 4. Object Detection, Photometry, and Redshift Estimation

A series of modules do the object photometry. The combFilter module produces a multi-band “detection image,” which is the variance-weighted average of the science images in the different bandpasses. Images in specific filters (e.g., grism, polarizers) can be omitted from this average. This module also produces a detection weight image, which is a similarly weighted sum of the exposure maps from the drizzling process. The detectionCatalog and filterCatalog modules create parameter files and run SExtractor, first on the detection image alone, and then multiple times in “dual image mode.” In dual mode, the detection image defines the object position and apertures, but the photometric measurements are done on the filter image with its associated RMS image.

The colorCatalog module derives the photometric zero points from the image header catalogs, sorts through the different SExtractor catalogs, and produces a single, calibrated multicolor catalog. It also uses simple logic for flagging apparently bad or anomalous magnitudes. Finally, the photoz module feeds the multicolor catalog to the Bayesian Photometric Redshift package (Benítez 2000), which is itself coded in Python. A final XML “run message” is written in the same format as the individual module messages. The images and XML catalogs can then be ingested into the ACS team data archive.

## 5. Summary and Outlook

We have written a Python package called Apsis which provides a highly robust, efficient, and self-documenting means of reducing ACS GTO data. Apsis was used for processing the ERO datasets released to the press soon after launch. Several improvements are still envisioned, including improved object detection for crowded fields, higher order resolution-preserving drizzle kernels, and on-the-fly calibration of the WCS zero points using online astrometric catalogs.

Apsis development was supported by NASA grant NAG5-7697. We thank our many ACS team colleagues for help, advice, and feedback. We also thank Colin Cox, Warren Hack, and Richard Hook for helpful discussions.

## References

Benítez, N. 2000, ApJ, 536, 571

Bertin, E. & Arnouts, S. 1996, A&AS, 117, 393

Gonzaga, S. et al. 1998, The Drizzling Cookbook, ISR WFPC2-98-04

Greenfield, P. et al., 2002, this volume \[D6\]

Hack, W.J. 1999, CALACS Operation and Implementation, ISR ACS-99-03

Richmond, M. 2002, http://acd188a-005.rit.edu/match/


text:
# Generalizations of pp-wave spacetimes in higher dimensions

## I Introduction

Higher-dimensional pp-wave spacetimes are of current interest in string theory in curved backgrounds, particularly since these Lorentzian spacetimes are exact solutions in string theory and their spectrum can therefore be explicitly determined. In this paper we shall discuss $`D`$-dimensional Lorentzian spacetimes in which all of the scalar invariants constructed from the Riemann tensor and its covariant derivatives are zero. These spacetimes can be regarded as higher-dimensional generalizations of $`D`$-dimensional pp-wave spacetimes.

This research follows on from the recent work of  in four dimensions, in which it was proven that in Lorentzian spacetimes all of the scalar invariants constructed from the Riemann tensor and its covariant derivatives are zero if and only if the spacetime is of Petrov type III, N or O, all eigenvalues of the Ricci tensor are zero and the common multiple null eigenvector $`l^a`$ of the Weyl and Ricci tensors is geodesic, shearfree, non-expanding, and non-twisting  (i.e., the Newman-Penrose (NP) coefficients $`\kappa `$, $`\sigma `$, and $`\rho `$ are zero); we shall refer to these spacetimes as vanishing scalar invariant (VSI) spacetimes. The Ricci tensor has the form

$$R_{ab}=2Al_al_b+4A_il_{(a}m_{b)}^i$$
(1)
($`i=1,2`$). The Plebański-Petrov type (PP-type) is N for $`A_i0`$ or O for $`A_i=0`$. We note that for PP-type N, using a null rotation a boost and a spatial rotation we can transform away the Ricci component $`A`$ and set $`A_i=1`$. For PP-type O it is possible to set $`A=1`$ by performing a boost.

It is known that the energy-momentum tensor for a spacetime corresponding to PP-type N cannot satisfy the weak energy conditions , and hence such spacetimes of are not regarded as physical in classical general relativity (however, see ). Therefore, attention is usually restricted to PP-type O models, in which the energy-momentum tensor corresponds to a pure null radiation field . All of these spacetimes belong to Kundt’s class, and hence the metric of these spacetimes can be expressed in an appropriate form in adapted coordinates . The metrics for all VSI spacetimes are displayed in . The generalized pp-wave solutions are of Petrov-type N, PP-type O (so that the Ricci tensor has the form of null radiation) with $`\tau =0`$, and admit a covariantly constant null vector field . The vacuum spacetimes, which are obtained by setting $`A=0`$, are the well-known pp-wave spacetimes (or plane-fronted gravitational waves with parallel rays).

## II Higher Order Theorem

This theorem can be readily generalized to higher dimensions. We shall study Lorentzian VSI spacetimes in arbitrary $`D`$-dimensions (not necessary even, but $`D=10`$ is of particular importance from string theory) with signature $`D2`$. In principle we could study other signatures; for example, manifolds with signature $`D4`$ with $`D5`$ may also be of physical interest .

Let the tetrad be $`l,n,m^1,m^2,\mathrm{},m^i`$ ($`l,n`$ null with $`l^al_a=n^an_a=0,l^an_a=1`$, $`m^i`$ real and spacelike), so that

$$g_{ab}=2l_{(a}n_{b)}+\delta _{jk}m_a^jm_b^k.$$
(2)
Using the notation

$$\{[w_px_q][y_rz_s]\}w_px_qy_rz_sw_px_qz_ry_sx_pw_qy_rz_s+x_pw_qz_ry_s+y_pz_qw_rx_sy_pz_qx_rw_sz_py_qw_rx_s+z_py_qx_rw_s,$$
(3)
if all zeroth order invariants vanish then there exists a null tetrad (2) $`l,n,m^i(i=1,\mathrm{},N=D2)`$ such that

$$R_{abcd}=A_i\{[l_an_b][l_cm_d^i]\}+B_{[ij]k}\{[m_a^im_b^j][l_cm_d^k]\}+C_{(ij)}\{[l_am_b^i][l_cm_d^j]\}.$$
(4)
We still have the freedom to “choose the frame” and simplify further, using boosts, spins and null rotations, depending on the algebraic structure of the Ricci and Weyl tensors \[a generalization of Petrov and (Petrov-Plebanski) PP classifications\].

From (4) we obtain the Ricci tensor:

$$R_{bd}=[A_i+2B_{[ij]k}\delta ^{jk}](l_bm_d^i+l_dm_b^i)+Al_bl_d,$$
(5)
where $`A2C_{jk}\delta ^{jk}`$. We can further simplify $`R_{bd}`$ depending on its algebraic type. If the energy conditions are satisfied

$$A_i2B_{[ij]k}\delta ^{jk}=0,$$
(6)
we shall refer to this as type $`PP\overline{O}`$. In this case we have that

$$R_{bd}=Al_bl_d.$$
(7)
If this condition is not satisfied, we can use boosts, spins and null rotations to set $`A=0`$, which we shall refer to as type $`PP\overline{N}`$.

From (4) we obtain the Weyl tensor:

$$C_{abcd}=\mathrm{\Psi }_i\{[l_an_b][l_cm_d^i]\}+\mathrm{\Psi }_{\{ijk\}}\{[m_a^im_b^j][l_cm_d^k]\}+\mathrm{\Psi }_{<ij>}\{[l_am_b^i][l_cm_d^j]\},$$
(8)
where

$`\mathrm{\Psi }_i=2\mathrm{\Psi }_{\{ijk\}}\delta ^{jk}`$ $``$ $`C_{abcd}n^al^bn^cm_i^d={\displaystyle \frac{1}{D2}}[(D3)A_i+2B_{[ij]k}\delta ^{jk}],`$ (9)
$`\mathrm{\Psi }_{\{ijk\}}`$ $``$ $`{\displaystyle \frac{1}{2}}C_{abcd}m_i^am_j^bn^cm_k^d=B_{[ij]k}+{\displaystyle \frac{1}{D2}}(A_{[i}\delta _{j]k}2B_{[im|n|}\delta ^{mn}\delta _{j]k})`$ (10)
$`\text{and }\mathrm{\Psi }_{<ij>}`$ $``$ $`{\displaystyle \frac{1}{2}}C_{abcd}n^am_i^bn^cm_j^d=C_{(ij)}{\displaystyle \frac{1}{2(D2)}}A\delta _{ij}.`$ (11)
In analogy with the Petrov classification, we shall say that spacetimes with $`\mathrm{\Psi }_{\{ijk\}}0`$ are of type $`P\overline{III}`$ (in some instances we can use the remaining tetrad freedom in this case to set $`\mathrm{\Psi }_{<ij>}=0`$). Spacetimes with $`\mathrm{\Psi }_{\{ijk\}}=0`$ will be referred to as of type $`P\overline{N}`$, in this case we can set $`\mathrm{\Psi }_i=0`$. Conformally flat spacetimes with $`\mathrm{\Psi }_{\{ijk\}}=0`$ and $`\mathrm{\Psi }_{<ij>}=0`$ will be referred to as type $`P\overline{O}`$. \[$`\mathrm{\Psi }_{\{ijk\}}`$ and $`\mathrm{\Psi }_{<ij>}`$ are higher-dimensional analogues of the complex NP coefficents $`\overline{\mathrm{\Psi }}_3`$ and $`\overline{\mathrm{\Psi }}_4`$ in 4 dimensions. A comprehensive higher-dimensional Petrov classification, which is not necessary here, will be discussed elsewhere.\]

For spacetimes of type $`PP\overline{O}`$ and type $`P\overline{N}`$, the Ricci tensor is given by (7) and the Weyl tensor is given by

$$C_{abcd}=[C_{(ij)}\frac{1}{2(D2)}A\delta _{ij}]\{[l_am_b^i][l_cm_d^j]\}.$$
(12)
## III Generalized Kundt spacetimes

Using the Bianchi and Ricci identities, it is possible to prove  that all curvature invariants of all orders vanish for spacetimes with Riemann tensor of the form of (4) that satisfy the following conditions on the covariant derivative of the uniquely defined null vector $`l_{a;b}`$ namely

$`l^al_a=0,l_{}^{a}{}_{;b}{}^{}l^b=0,l_{}^{a}{}_{;a}{}^{}=0,l_{(a;b)}l^{a;b}=0,l_{[a;b]}l^{a;b}=0.`$In general, the covariant derivative then has the form

$`l_{a;b}=L_{11}l_al_b+L_{1i}l_am_b^i+L_{i1}m_a^il_b.`$

We are consequently led to study spacetimes which admit a geodesic, shear-free, divergence-free, irrotational null congruence $`l=_v`$, and hence belong to the “generalized Kundt” class in which the metric can be written as

$$\mathrm{d}s^2=2\mathrm{d}u[H\mathrm{d}u+\mathrm{d}v+W_i\mathrm{d}x^i]+g_{ij}\mathrm{d}x^i\mathrm{d}x^j,$$
(13)
where $`i,j,k=1,\mathrm{},N`$ and the metric functions

$`H=H(u,v,x^i),W_i=W_i(u,v,x^i),g_{ij}=g_{ij}(u,x^i)`$satisfy the remaining vanishing invariant conditions and the Einstein field equations (see ). We may, without loss of generality, use the remaining coordinate freedom (e.g., transformations of the form $`x^i^{}=x^i^{}(u,x^j)`$) to simplify $`g_{ij}`$. For the spacetimes considered here we shall diagonalize $`g_{ij}`$, and in the particular examples below we shall take $`g_{ij}=\delta _{ij}`$. The null tetrad is then

$$l=_v,n=_u(H+\frac{1}{2}W^2)_v+W_i_{x^i},m^i=_{x^i},$$
(14)
where $`W^2W_iW_j\delta ^{ij}`$. \[Note that in 4D the uniquely defined null vector given by $`l=_v`$ is the repeated Weyl eigenvector.\]

All of the exact higher-dimensional solutions will be discussed in detail in . Let us present a subclass of type $`PP\overline{O}`$ and type $`P\overline{N}`$ exact solutions explicitly here, in which the Ricci tensor is given by (7) and the Weyl tensor is given by (12) in the local coordinates above, and in which

$$g_{ij}=\delta _{ij},W_1=ϵ\frac{v}{x_1},W_i=0(i1),H=ϵ\frac{v^2}{4x_{1}^{}{}_{}{}^{2}}+H_0(u,x^k),$$
(15)
where $`ϵ=1`$ corresponds to the case “$`\tau 0`$” (see ); higher-dimensional pp-wave spacetimes have $`ϵ=0`$ (“$`\tau =0`$”). In these spacetimes all of the scalar invariants constructed from the Riemann tensor and its covariant derivatives are zero. In the case of vacuum the function $`H_0(u,x^k)`$ satisfies a differential equation.

A second example of a higher-dimensional VSI spacetime is given by type $`P\overline{III}`$ (“$`\tau =0`$”) solutions

$$g_{ij}=\delta _{ij},W_i=ϵW_i(u,x^k),H=ϵvH_1(u,x^k)+H_0(u,x^k).$$
(16)
In general these spacetimes are of type $`PP\overline{N}`$ (and the remaining tetrad freedom can be employed to simplify the metric further). In the case of type $`PP\overline{O}`$ (null radiation) the functions $`W_i(u,x^k)`$ and $`H_1(u,x^k)`$ satisfy additional differential equations. The higher-dimensional type $`P\overline{N}`$ pp-wave spacetimes again occur as a subcase with $`ϵ=0`$ ($`W_i(u,x^k)=0`$, $`H_1(u,x^k)`$=0).

## IV Discussion

The VSI spacetimes have a number of important physical applications. In particular, in four dimensions a wide range of VSI spacetimes (in addition to the pp-wave spacetimes) are exact solutions in string theory to all perturbative orders in the string tension (even in of the presence of the RR five-form field strength)  (cf. ). As a result, these models are expected to provide some hints for the study of superstrings on more general backgrounds . String theory in pp-wave backgrounds has been studied by many authors , partly in a search for a connection between quantum gravity and gauge theory dynamics. Solutions of classical field equations for which the counter terms required to regularize quantum fluctuations vanish are also of importance because they offer insights into the behaviour of the full quantum theory. A subclass of Ricci flat VSI 4-metrics, which includes the pp-wave spacetimes and some special Petrov type III or N spacetimes, have vanishing counter terms up to and including two loops and thus VSI suffer no quantum corrections to all loop orders .

Finding new string models with Lorentzian signature which are exact in $`\alpha ^{}`$ and whose spectrum can be explicitly determined is of great interest in the context of string theory in curved backgrounds in higher dimensions and, indeed, higher dimensional generalizations of pp-wave backgrounds have been considered by a number of authors . In particular, it was recently realized  this solvability property applies to string models corresponding not only to the NS-NS but also to certain R-R plane-wave backgrounds. (See also , and a general discussion of pp-waves in $`D=10`$ supergravity appeared in ).

There is also an interesting connection between pp-wave backgrounds and gauge field theories. It is known that any solution of Einstein gravity admits plane-wave backgrounds in the Penrose limit . This was extended to solutions of supergravities in . It was shown that the super-pp-wave background can be derived by the Penrose limit from the $`AdS_p\times S^q`$ backgrounds in . The Penrose limit was recognized to be important in an exploration of the AdS/CFT correspondence beyond massless string modes in . Maximally supersymmetric pp-wave backgrounds of supergravity theories in eleven- and ten-dimensions have also attracted interest .

Recently the idea that our universe is embedded in a higher-dimensional world has received a great deal of renewed attention . Due to the importance of branes in understanding the non-perturbative dynamics of string theories, a number of classical solutions of branes in the background of a pp-wave have been studied; in particular a new brane-world model has been introduced in which the bulk solution consists of outgoing plane waves (only) .

For example, a class of pp-wave string solutions with non-constant NS-NS or R-R field strengths, which are exact type II superstring solutions to all orders in $`\alpha ^{}`$ since all corrections to the leading-order field equations naturally vanish, were discussed recently  (see also ). The metric ansatz and NS-NS 2-form potential in 10-dimensional superstring theory is given by

$$ds^2=dudvK(x^k)du^2+dx_i^2+dy_m^2,B_2=b_m(x^k)dudy_m,H_3=_ib_m(x^k)dx_idudy_m,$$
(17)
where $`i=1,\mathrm{},d`$ and $`m=d+1,..,8`$ (and a dilaton of the form $`\varphi =\rho _ix_i+\stackrel{~}{\varphi }(u)`$ can be included). In particular, it was found  that the only non-zero component of the generalized curvature is

$$R_{uiuj}=\frac{1}{2}_i_jK\frac{1}{2}_ib_m_jb_m.$$
(18)
These solutions are consequently of type $`PP\overline{O}`$ and type $`P\overline{N}`$ (see (7) and (12)). There are several special cases. For $`b_m=0`$ the standard higher-dimensional generalized pp-wave solution is recovered with $`K=K_0(x)`$ being a harmonic function. WZW models  result when the $`b_m`$ are linear, corresponding to homogeneous plane-wave backgrounds with constant $`H_3`$ field. The Laplace equation for $`b_m`$ can also be solved by choosing $`b_m`$ to be the real part of complex holomorphic functions. The R-R counterparts of these string models are direct analogs of the pp-wave solution  supported by a non-constant 5-form background. Note that lifts of the above solutions to 11 dimensions belong to a class of $`D=11`$ pp-wave backgrounds first considered in .

Acknowledgements. This work was supported, in part, by the Natural Sciences and Engineering Research Council of Canada.