-
PDF
- Split View
-
Views
-
Cite
Cite
Sampei Hirose, Jun-ichi Inoguchi, Kenji Kajiwara, Nozomu Matsuura, Yasuhiro Ohta, Discrete local induction equation, Journal of Integrable Systems, Volume 4, Issue 1, 2019, xyz003, https://doi.org/10.1093/integr/xyz003
Close -
Share
Abstract
The local induction equation, or the binormal flow on space curves is a well-known model of deformation of space curves as it describes the dynamics of vortex filaments, and the complex curvature is governed by the non-linear Schrödinger equation. In this article, we present its discrete analogue, namely, a model of deformation of discrete space curves by the discrete non-linear Schrödinger equation. We also present explicit formulas for both smooth and discrete curves in terms of |$\tau$| functions of the two-component KP hierarchy.
Communicated by: Alexander I. Bobenko
1. Introduction
Nakayama formulated this deformation of discrete space curves as the dynamics of discrete vortex filaments driven by the self-induction caused by the Biot–Savart law with the discrete analogue of the local induction approximation [13].
As to the discrete deformations of discrete curves, the isoperimetric deformation of discrete plane curves described by the discrete mKdV equation (dmKdV) has been studied in [15–17]. For discrete space curves, the deformations by the discrete sine-Gordon equation (dsG) and dmKdV has been studied in [16, 18, 19], and the deformation by dNLS is formulated in [20, 21].
The purpose of this article is to formulate the discrete model of LIE where the complex curvature of the discrete curves is governed by dNLS (1.4). In our formulation, the deformation of discrete curves is expressed in terms of the discrete Frenet frame with the coefficients given by the curvature and torsion of the curves explicitly. dNLS arises as the governing equation of the complex curvature, which is the same as the case of smooth curves. Based on this formulation, we present explicit formulas for the deformations of both smooth and discrete curves in terms of |$\tau$| functions of the two-component KP hierarchy. It is well-known that the matrix of the Frenet–Serret formula gives the Lax matrix of AKNS type by |$\mbox{SO}(3)$|–|$\mbox{SU}(2)$| correspondence [24] and that the AKNS hierarchy arises as a reduction of the two-component KP hierarchy [25, 26]. These formulas are consistent with this fact. For completeness, we also discuss the case of continuous deformation of discrete curves described by sdNLS (1.11).
The article is organized as follows: in Section 2, we study the continuous binormal flow and its discretization which are governed by sdNLS and dNLS, respectively. We recall some basic definitions for discrete space curves in Section 2.1 and the continuous binormal flow for discrete space curves in Section 2.2. The main theorem, that is, the formulation of a discrete LIE is presented together with its properties in Section 2.3. The proofs of the main theorem and its properties are given in Section 2.4. Some numerical results for the discrete LIE are presented in Appendix A. In Section 3, we study explicit formulas for smooth and discrete space curves by the |$\tau$| functions of the two-components KP hierarchy. In particular, we construct regular soliton type solutions for the continuous, semi-discrete and discrete LIE. We present the formulas in terms of the |$\tau$| functions satisfying certain bilinear equations in Section 3.1, which are proved in Section 3.2. We show that the bilinear equations can be solved by the |$\tau$| functions of the two-component KP hierarchy in Section 3.3. The soliton type solutions for the continuous, semi-discrete and discrete LIE are constructed in Section 3.4, and their regularity is established in Section 3.5. The proofs of propositions in Section 3.3 and 3.4 are given in Appendices B and C, respectively. Finally, concluding remarks are given in Section 4.
2. Discrete models of LIE
2.1 Discrete space curves
2.2 Continuous binormal flow
Theorem 2.1 or the equivalent statement is given in [7, 9, 22]. We provide a Proof of Theorem 2.1 for completeness.
Here, |$c(t)$| is an arbitrary function in |$t$| depending on the boundary condition. Then (2.11) and (2.14) can be rewritten as a single equation in terms of |$u_n$|, which is nothing but (2.8). This completes the proof. □
2.3 Discrete LIE
Then one of the main statements of this article is given as follows:
Suppose that |$\Gamma_{\infty}^m$| and |$\Gamma_{-\infty}^m$| are either |$1$| or |$1+\frac{\epsilon^4}{\delta^2}$|. Then, it follows that
(1) |$|\gamma_{n+1}^{m+1}- \gamma_n^{m+1}|=\epsilon$|. Namely, |$\gamma_n^{m+1}$| is an isoperimetric deformation of |$\gamma_n^m$|.
(2) |$u_n^{m+1}$| gives the complex discrete curvature of |$\gamma_n^{m+1}$|.
Equations (2.18) and (2.19) can be regarded as a discrete analogue of LIE (1.1), which will be referred to as the discrete LIE (dLIE). We note that dLIE is an implicit scheme in a sense that |$\gamma_n^{m+1}$| is determined by using |$\kappa_{n-1}^{m+1}$| and |$\Lambda_{n-1}^{m+1}$| which incorporate the information of |$\gamma_{n}^{m+1}$|. This is resolved by using dNLS (1.4) to compute |$\kappa_{n-1}^{m+1}$| and |$\Lambda_{n-1}^{m+1}$|, as described in Theorem 2.2. We will explain the details of how to compute numerically the deformation of curves given by dLIE in Appendix A. We also remark that the deformation given by dLIE is not an equidistant deformation in contrast with the deformation described by dmKdV [19]. In fact, one can show the following proposition:
Equation (2.20) also implies that the solution of dNLS (1.4) should satisfy the condition |$\Gamma_n^{m}\geq \cos^2\frac{\kappa_n^m}{2}$| in order to be consistent with the curve deformation.
Continuous limit with respect to time can be simply taken as |$t=m\delta$| and |$\delta\to 0$|. Then dNLS (1.4) and corresponding deformation equation (2.18) and (2.19) yields the sdNLS (2.8) with |$c(t)=-2$| and the binormal flow (2.7).
The dLIE (2.18) and (2.19) implies the following deformation of discrete Frenet frame:
2.4 Proof
This proves the second statement of Theorem 2.2.
Finally, Proposition 2.3 can be verified by direct computation by using (2.29), (2.31) and (2.38). Therefore, we have proved all the statements in Section 2.3.
3. Explicit formulas
It is well-known that the |$N$|-soliton solution of NLS (1.2) and sdNLS (1.11) can be expressed in terms of double Wronskians or double Casorati determinants which are the (reduced) |$\tau$| functions of the two-component KP (or Toda) hierarchy [28–30]. However, dNLS (1.4) is not studied well compared to NLS (1.2) and sdNLS (1.11). Hirota and Ohta presented (1.4) in [4] and constructed soliton solutions by the perturbational technique. In [6], solutions in terms of double Casorati determinants have been given without complex structure. In this section, we aim at constructing the regular soliton type solutions to those equations in terms of the double Wronski/Casorati determinants.
In order to reconstruct the space curves for given complex curvature, we still need non-trivial steps; we have to solve the system of linear partial differential/difference equations satisfied by the Frenet frame to obtain the tangent vector, from which the position vector the curve is constructed by integration. However, the Sym–Tafel formula [31] enables us to reconstruct the position vector of the curve from the Frenet frame by using the differentiation with respect to the spectral parameter instead of integration. This observation may suggest the possibility of constructing explicit formula for the position vector of the curve in terms of the |$\tau$| functions without integration. Actually such explicit formula was formulated for the plane curves [15], although the relationship to the Sym–Tafel formula has not been established yet.
Based on those backgrounds, in this section, we first establish a parametrization of both smooth and discrete space curves in terms of |$\tau$| functions of two-component KP hierarchy with suitable reduction. Introducing deformation parameters appropriately, we construct explicit formulas of smooth/discrete space curves deformed by NLS, sdNLS and dNLS, together with the regular soliton type solutions to those equations.
3.1 Explicit formulas for space curves
The following proposition can be verified by direct calculation:
Then |$\Phi=[T,N,B]\in{\rm SO}(3)$|.
Then, it is possible to regard |$\Phi$| as the Frenet frame of space curves by introducing appropriate dependence on arc-length parameter of the curves.
Then, we have an explicit formula in terms of the |$\tau$| functions for the position vector of the curve |$\gamma$| as follows:
The curvature |$\kappa$|, the torsion |$\lambda$| and the complex curvature |$u=\kappa e^{\sqrt{-1}\int\lambda~dx}$| also admit the explicit formulas in terms of the |$\tau$| functions.
It is possible to construct the similar formulas for discrete space curves as follows:
Then, we have an explicit formula in terms of the |$\tau$| functions for the position vector of the discrete curve |$\gamma_n$| as follows:
3.2 Proof of explicit formulas
The derivative of the first and second entries of |$\gamma$| can be computed by using (3.10) and its complex conjugate. The third entry is computed by using (3.11). Equation (3.4) is used to rewrite the denominators. □
The third equation follows automatically from the first and second equations. □
The first and second entries of |$\gamma_{n+1}-\gamma_n$| can be computed by using (3.20) and its complex conjugate. The third entry is computed by using (3.21). Equation (3.14) is used to rewrite the denominators. □
3.3 Parametrization by |$\tau$| functions of two-component KP hierarchy
The bilinear equations (3.4)–(3.6), (3.10) and (3.11) are simultaneously solved by the |$\tau$| functions of two-component KP hierarchy. Also, equations (3.14)–(3.16), (3.20) and (3.21) are solved by those of discrete two-component KP hierarchy.
The Proofs of Propositions 3.10 and 3.11 will be given in Appendix.
3.4 Deformations of curves
It is possible to describe the deformations of curves by introducing appropriate time evolutions in the |$\tau$| functions through the explicit formulas.
It is noted that in the above proposition, only the solutions for |$\Gamma_{\infty}^m=\Gamma_{-\infty}^m$| are given and those with the different constant boundary condition, for instance, |$\Gamma_{\infty}^m=1$| and |$\Gamma_{-\infty}^m=1+\frac{\epsilon^4}{\delta^2}$|, are not yet known. Proofs of Proposition 3.12, 3.13 and 3.14 will be given in Appendix.
3.5 Regularity of solutions
The formulas given in Section 3.4 give rise to regular solutions of NLS (1.2), sdNLS (1.11) and dNLS (1.4) so that the corresponding curve deformations are also regular. In this section, we establish the regularity of solutions which is guaranteed by the strict positivity of the |$\tau$| functions |$F$|, |$F_n$| and |$F_n^m$| in Propositions 3.12, 3.13 and 3.14, respectively.
Thus we get (3.51). □
We note that |$\det M$| is non-negative in Lemma 3.15 because |$M$| has the form of
We assume |$p_i\ne p_j$| for |$1\le i\ne j\le N$| and |$\Re p_i>0$| for |$1\le i\le N$|. Then |$F$| in Proposition 3.12 is strictly positive.
Therefore |$\det M$| is strictly positive, i.e., |$\det M>0$|. This completes the proof.□
We assume |$p_i\ne p_j$| for |$1\le i\ne j\le N$| and |$|p_i|>1$| for |$1\le i\le N$|. Then |$F_n$| in Proposition 3.13 and |$F_n^m$| in Proposition 3.14 are strictly positive.
Therefore, |$\det M$| is strictly positive, i.e., |$\det M>0$|. This completes the proof. □
4. Concluding remarks
In this article, we have constructed a discrete analogue of LIE describing the deformation of discrete space curves whose complex curvature is governed by the dNLS equation. We have shown some numerical simulations for both open and closed curves. We have constructed explicit formulas of space curves and related quantities in terms of the |$\tau$| functions of the two-component KP hierarchy. By introducing appropriate time dependence, we have constructed regular soliton type solutions to the NLS, sdNLS and dNLS equations and explicit formulas for the deformation of space curves associated with those solutions.
The relationship to ddIHM [20, 22] is not yet clear in this article. Actually, it can be shown that ddIHM is equivalent to the isotropic version of the discrete Landau–Lifschitz equation presented by Nijhoff et al. [32]. Then the complex curvature of the discrete curves deformed by ddIHM is governed by a variant of dNLS type equation which is closely related to the dNLS (1.4). Since the Landau–Lifschitz equation belongs to the BKP hierarchy [33], it is expected that we have an alternate explicit formulas of space curves in terms of the Pfaffians, namely, |$\tau$| functions of the BKP hierarchy. These results will be reported in the forthcoming paper.
Acknowledgements
The authors would like to thank Prof. Konrad Polthier for encouragement and valuable suggestions.
Funding
JSPS KAKENHI (JP19K03461, JP16H03941, JP16K13763, JP24340029, JP26610029, JP15K04909 and JP15K04862); 2016 IMI Joint Use Research Program Short-term Joint Research ‘Construction of directable discrete models of physical phenomena’.
Appendix A. Numerical computations
Let us describe how to compute numerically the deformation of curves given by dLIE from a given initial curve. We first consider the case of sufficiently long curve with |$n_0\leq n\leq n_1$| for some fixed |$n_0$|, |$n_1$| under the vanishing boundary condition, where the calculation is carried out from small |$n$| to large |$n$|. Then, for a given |$m$|, an algorithm to compute the deformation |$\gamma_n^{m+1}$| from a given initial curve |$\gamma_n^m$| is described as follows:
(1) Give an initial curve |$\gamma_n^m$| for |$n_0\leq n\leq n_1$| for some fixed |$n_0$| and |$n_1$|. At boundaries, give |$B_{n_0}^m$|, |$u_{n_0}^m$|, |$u_{n_0-1}^{m+1}$|, |$\Gamma_{n_0}^m$| and |$T_{n_1}^m$|. |$\Gamma_{n_0}^m$| may be chosen close to either |$1$| or |$1+\epsilon^4/\delta^2$|.
At the left edge (|$n=n_0$|):
(2) Compute |$\Phi_{n_0}^m=[T_{n_0}^m, N_{n_0}^m,B_{n_0}^m]$| from |$\gamma_{n_0}^m$|, |$\gamma_{n_0+1}^m$| and |$B_{n_0}^m$| by using (2.2).
(3) Compute |$\gamma_{n_0}^{m+1}$| from |$u_{n_0}^m$|, |$u_{n_0-1}^{m+1}$|, |$\Gamma_{n_0}^m$| and |$\Phi_{n_0}^m$| by using (2.18) and (2.19).
Repeat from |$n=n_0+1$| to |$n_1-1$|:
(4) Compute |$\Phi_n^m=[T_{n}^m, N_{n}^m,B_{n}^m]$| from |$\gamma_{n+1}^m$|, |$\gamma_{n}^m$|, |$\Phi_{n-1}^m$| by using (2.2).
(5) Compute |$u_n^m$| from |$\Phi_n^m$| and |$\Phi_{n-1}^m$|. More precisely, compute |$\kappa_n^m$| and |$\nu_n^m$| by using (2.5). Then compute |$u_n^m$| by (2.6).
(6) Compute |$u_{n-1}^{m+1}$| and |$\Gamma_{n}^m$| from |$u_{n-1}^m$|, |$u_{n-2}^{m+1}$|, |$u_n^m$| and |$\Gamma_{n-1}^m$| by using dNLS (1.4).
(7) Compute |$\gamma_{n}^{m+1}$| from |$u_n^m$|, |$u_{n-1}^{m+1}$|, |$\Gamma_n^m$| and |$\Phi_n^m$| by using (2.18) and (2.19).
At the right edge (|$n=n_1$|):
(8) Compute |$\Phi_{n_1}^m=[T_{n_1}^m, N_{n_1}^m,B_{n_1}^m]$| from |$T_{n_1}^m$| and |$\Phi_{n_1-1}^m$| by using (2.2).
(9) Compute |$u_{n_1}^m$| from |$\Phi_{n_1}^m$| and |$\Phi_{n_1-1}^m$|.
(10) Compute |$u_{n_1-1}^{m+1}$| and |$\Gamma_{n_1}^m$| from |$u_{n_1-1}^m$|, |$u_{n_1-2}^{m+1}$|, |$u_{n_1}^m$| and |$\Gamma_{n_1-1}^m$| by using dNLS (1.4).
(11) Compute |$\gamma_{n_1}^{m+1}$| from |$u_{n_1}^m$|, |$u_{n_1-1}^{m+1}$|, |$\Gamma_{n_1}^m$| and |$\Phi_{n_1}^m$| by using (2.18) and (2.19).
Figure A1 illustrates a result of numerical computation according to this algorithm.
We next describe how to compute the deformation of a closed curve |$\gamma_n^m$| of period |$l$| in |$n$|, namely |$\gamma_{n+l}^m = \gamma_n^m$|. We note that it is possible to simulate such a periodic case by using dLIE (2.18)–(2.19), although we derived it under the vanishing boundary condition (2.15). Since the computation requires a solution to dNLS which has the same period as |$\gamma_n^m$|, we fix a positive number |$c$| that plays a role of tolerance in constructing |$l$|-periodic numerical solution |$(u^{m+1}_n, \Gamma^m_{n+1})$| to dNLS. An algorithm to compute |$\gamma_n^{m+1}$| is described as follows:
(1) Give an initial closed curve |$\gamma_n^m$| and positive numbers |$\delta$|, |$c$|.
(2) Compute |$\Phi_n^m=[T_{n}^m, N_{n}^m,B_{n}^m]$| from |$\gamma_{n+1}^m$|, |$\gamma_{n}^m$| and |$\gamma_{n-1}^m$| by using (2.2).
(3) Compute |$u_n^m$| from |$\Phi_n^m$| and |$\Phi_{n-1}^m$| by using (2.6) with |$\Lambda_0^m = 0$|.
- (4) Give a pair of numbers |$(u_1^{m+1}, \Gamma_2^m) \in \mathbb{C} \times \mathbb{R}_{>0}$| which satisfies (2.38) with |$n=1$|, that is,(A.1)\begin{align} &\frac{\delta^2}{\epsilon^4} \left[ \left(1-\sqrt{-1}\frac{\epsilon^2}{\delta}\right) - \left(1 + \frac{\epsilon^2}{4} u_2^m u_1^{m+1}{}^*\right) \Gamma_2^m\right] \left[ \left(1+\sqrt{-1}\frac{\epsilon^2}{\delta}\right) - \left(1 + \frac{\epsilon^2}{4} u_2^m{}^* u_1^{m+1}\right) \Gamma_2^m\right]\nonumber\\ &\quad{} + \frac{\delta^2}{4\epsilon^2} \left(u_1^{m+1} - u_2^m\right) \left(u_1^{m+1}{}^* - u_2^m{}^*\right) (\Gamma_2^m)^2 = \Gamma_2^m. \end{align}
This procedure incorporates the isoperimetricity of the deformation.
- (5) Compute an |$l$|-periodic solution |$(u_n^{m+1}, \Gamma_{n+1}^m)$| to dNLS (1.4) as follows: For |$2 \leq n \leq l+1$|, compute |$(u_n^{m+1}, \Gamma_{n+1}^m)$| bywith the initial value |$(u_1^{m+1}, \Gamma_2^m)$|. If |$\big|u_1^{m+1} - u_{l+1}^{m+1}\big| > c$|, we recompute |$(u_n^{m+1}, \Gamma_{n+1}^m)$| for |$2 \leq n \leq l+1$| with the revised initial value |$(u_1^{m+1}, \Gamma_2^m) = (u_{l+1}^{m+1},\Gamma_{l+2}^m)$|.\begin{equation*} \begin{split} &u_{n}^{m+1} = \frac{1}{{\textstyle {\scriptstyle \sqrt{-1}}\frac{\epsilon^2}{\delta} - 1}} \left[{\textstyle \left({\scriptstyle\sqrt{-1}}\frac{\epsilon^2}{\delta} + 1\right)}u_n^m - (u_{n+1}^m+u_{n-1}^{m+1}) \Big({\textstyle 1+\frac{\epsilon^2}{4}|u_n^m|^2}\Big)\Gamma_n^m\right]\!, \\ &\Gamma_{n+1}^m = \frac{1+\frac{\epsilon^2}{4}|u_n^m|^2}{1+\frac{\epsilon^2}{4}|u_n^{m+1}|^2} \Gamma_n^m \end{split} \end{equation*}
(6) Compute |$\gamma_{n}^{m+1}$| from |$u_n^m$|, |$u_{n-1}^{m+1}$|, |$\Gamma_n^m$| and |$\Phi_n^m$| by using (2.18) and (2.19).
Figures A2 and A3 illustrate the result of numerical computations according to this algorithm.
Numerical simulation of dLIE for a closed curve of period |$l = 4$|.
Numerical simulation of dLIE for a closed curve of period |$l = 4$|.
Numerical simulation of dLIE for a closed curve of period |$l = 8$|.
Numerical simulation of dLIE for a closed curve of period |$l = 8$|.
Appendix B. Proofs of Propositions 3.10 and 3.11
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.5) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r\ ;\ -1-s, N-\nu-1-s$| |
| (B.7) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ N-\nu-1-s$| |
| (B.8) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ -s$| |
| (B.9) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu-r\ ;$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.5) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r\ ;\ -1-s, N-\nu-1-s$| |
| (B.7) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ N-\nu-1-s$| |
| (B.8) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ -s$| |
| (B.9) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu-r\ ;$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.5) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r\ ;\ -1-s, N-\nu-1-s$| |
| (B.7) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ N-\nu-1-s$| |
| (B.8) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ -s$| |
| (B.9) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu-r\ ;$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.5) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r\ ;\ -1-s, N-\nu-1-s$| |
| (B.7) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ N-\nu-1-s$| |
| (B.8) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu-r\ ;\ -s$| |
| (B.9) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu-r\ ;$| |
Thus with the help of reduction condition (B.4), the bilinear equations (3.4)–(3.6) and (3.10) are derived from (B.5)–(B.8), respectively, and (3.11) is derived from (B.5) and (B.9). □
The common and distinct columns of each bilinear equation are shown below.
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.23) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1},\ {n'\atop s}$| |
| (B.24) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'\atop s}, {n'+N-\nu\atop s}$| |
| (B.25) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n\atop r}, {n+N+\nu\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'+N-\nu-1\atop s}$| |
| (B.26) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| (B.27) | |${n\atop r-N-\nu+1}, \ldots, {n\atop r-1}; {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n\atop r+1}; {n'\atop s}, {n'+N-\nu\atop s}$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.23) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1},\ {n'\atop s}$| |
| (B.24) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'\atop s}, {n'+N-\nu\atop s}$| |
| (B.25) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n\atop r}, {n+N+\nu\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'+N-\nu-1\atop s}$| |
| (B.26) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| (B.27) | |${n\atop r-N-\nu+1}, \ldots, {n\atop r-1}; {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n\atop r+1}; {n'\atop s}, {n'+N-\nu\atop s}$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.23) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1},\ {n'\atop s}$| |
| (B.24) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'\atop s}, {n'+N-\nu\atop s}$| |
| (B.25) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n\atop r}, {n+N+\nu\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'+N-\nu-1\atop s}$| |
| (B.26) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| (B.27) | |${n\atop r-N-\nu+1}, \ldots, {n\atop r-1}; {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n\atop r+1}; {n'\atop s}, {n'+N-\nu\atop s}$| |
| Equation . | Common columns . | Distinct columns . |
|---|---|---|
| (B.23) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1},\ {n'\atop s}$| |
| (B.24) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'\atop s}, {n'+N-\nu\atop s}$| |
| (B.25) | |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n\atop r}, {n+N+\nu\atop r}, {n+N+\nu\atop r+1}\ ;\ {n'+N-\nu-1\atop s}$| |
| (B.26) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| (B.27) | |${n\atop r-N-\nu+1}, \ldots, {n\atop r-1}; {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r}, {n\atop r+1}; {n'\atop s}, {n'+N-\nu\atop s}$| |
Thus with the help of reduction condition (B.22), the discrete bilinear equations (3.14)–(3.16), (3.20) and (3.21) are derived from (B.23)–(B.27), respectively.□
Appendix C. Proofs of Propositions 3.12, 3.13 and 3.14
The bilinear equations (C.9)–(C.11) and (C.13) are obtained by the technique of Laplace expansion by choosing the common and distinct columns as follows.
| . | Common columns . | Distinct columns . |
|---|---|---|
| (C.9) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu+1-r\ ;\ -s$| |
| (C.10) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu+1-r\ ;$| |
| (C.11) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r, N+\nu+1-r\ ;\ N-\nu-1-s$| |
| (C.13) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r\ ;N-\nu-1-s, N-\nu-s$| |
| . | Common columns . | Distinct columns . |
|---|---|---|
| (C.9) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu+1-r\ ;\ -s$| |
| (C.10) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu+1-r\ ;$| |
| (C.11) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r, N+\nu+1-r\ ;\ N-\nu-1-s$| |
| (C.13) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r\ ;N-\nu-1-s, N-\nu-s$| |
| . | Common columns . | Distinct columns . |
|---|---|---|
| (C.9) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu+1-r\ ;\ -s$| |
| (C.10) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu+1-r\ ;$| |
| (C.11) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r, N+\nu+1-r\ ;\ N-\nu-1-s$| |
| (C.13) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r\ ;N-\nu-1-s, N-\nu-s$| |
| . | Common columns . | Distinct columns . |
|---|---|---|
| (C.9) | |$-r, \ldots, N+\nu-2-r\ ;\ 1-s, \ldots, N-\nu-1-s$| | |$-1-r, N+\nu-1-r, N+\nu+1-r\ ;\ -s$| |
| (C.10) | |$1-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-1-s$| | |$-1-r, -r, N+\nu-1-r, N+\nu+1-r\ ;$| |
| (C.11) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r, N+\nu+1-r\ ;\ N-\nu-1-s$| |
| (C.13) | |$-r, \ldots, N+\nu-2-r\ ;\ -s, \ldots, N-\nu-2-s$| | |$N+\nu-1-r, N+\nu-r\ ;N-\nu-1-s, N-\nu-s$| |
We obtain (C.9) by adding |$x$|-derivative of (B.8) to the above equation. Similarly, (C.10) is obtained from the Laplace expansion and |$x$|-derivative of (B.9). This completes the Proof of Proposition 3.12. □
| Equation . | common columns . | distinct columns . |
|---|---|---|
| (C.14) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n+N+\nu-1\atop r},{n+N+\nu\atop r}\ ,{n+N+\nu-1\atop r+1}\ ;\ {n'\atop s+1}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r},{n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1}$| | |
| (C.15) | |${n\atop r-N-\nu+2}, \ldots, {n\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n\atop r}, {n\atop r+1}\ ;$| |
| |${n+1\atop r-N-\nu+2}, \ldots, {n+N+\nu-2\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r+1}\ ;$| | |
| (C.16) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r}\ ;\ {n'\atop s}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n-1\atop r}, {n\atop r}, {n+N+\nu\atop r}\ ;\ {n'+N-\nu-1\atop s}$| | |
| (C.17) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| Equation . | common columns . | distinct columns . |
|---|---|---|
| (C.14) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n+N+\nu-1\atop r},{n+N+\nu\atop r}\ ,{n+N+\nu-1\atop r+1}\ ;\ {n'\atop s+1}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r},{n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1}$| | |
| (C.15) | |${n\atop r-N-\nu+2}, \ldots, {n\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n\atop r}, {n\atop r+1}\ ;$| |
| |${n+1\atop r-N-\nu+2}, \ldots, {n+N+\nu-2\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r+1}\ ;$| | |
| (C.16) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r}\ ;\ {n'\atop s}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n-1\atop r}, {n\atop r}, {n+N+\nu\atop r}\ ;\ {n'+N-\nu-1\atop s}$| | |
| (C.17) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| Equation . | common columns . | distinct columns . |
|---|---|---|
| (C.14) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n+N+\nu-1\atop r},{n+N+\nu\atop r}\ ,{n+N+\nu-1\atop r+1}\ ;\ {n'\atop s+1}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r},{n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1}$| | |
| (C.15) | |${n\atop r-N-\nu+2}, \ldots, {n\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n\atop r}, {n\atop r+1}\ ;$| |
| |${n+1\atop r-N-\nu+2}, \ldots, {n+N+\nu-2\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r+1}\ ;$| | |
| (C.16) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r}\ ;\ {n'\atop s}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n-1\atop r}, {n\atop r}, {n+N+\nu\atop r}\ ;\ {n'+N-\nu-1\atop s}$| | |
| (C.17) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
| Equation . | common columns . | distinct columns . |
|---|---|---|
| (C.14) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n+N+\nu-1\atop r},{n+N+\nu\atop r}\ ,{n+N+\nu-1\atop r+1}\ ;\ {n'\atop s+1}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r},{n\atop r},{n+N+\nu\atop r+1}\ ;\ {n'\atop s+1}$| | |
| (C.15) | |${n\atop r-N-\nu+2}, \ldots, {n\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n\atop r}, {n\atop r+1}\ ;$| |
| |${n+1\atop r-N-\nu+2}, \ldots, {n+N+\nu-2\atop r-1}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r-N-\nu}, {n\atop r-N-\nu+1}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r+1}\ ;$| | |
| (C.16) | |${n\atop r}, \ldots, {n+N+\nu-2\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-1\atop s}$| | |${n-1\atop r}, {n+N+\nu-1\atop r}, {n+N+\nu\atop r}\ ;\ {n'\atop s}$| |
| |${n+1\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n-1\atop r}, {n\atop r}, {n+N+\nu\atop r}\ ;\ {n'+N-\nu-1\atop s}$| | |
| (C.17) | |${n\atop r}, \ldots, {n+N+\nu-1\atop r}\ ;\ {n'+1\atop s}, \ldots, {n'+N-\nu-2\atop s}$| | |${n+N+\nu\atop r+1}\ ; {n'\atop s+1}, {n'\atop s}, {n'+N-\nu-1\atop s}$| |
Then (C.18) and (C.19) gives (2.7), and (C.20) and (C.21) gives (1.11), respectively. This completes the Proof of Proposition 3.13. □




















