2.1. Seat number configuration

Now, we consider a situation in which the seats of the carrier, introduced in the previous section, are indexed by ${\mathbb {N}}$ and the refined update rule of such a carrier is given as follows:

• • If there is a ball at site x, namely $\eta (x)=1$ , then the carrier picks the ball and puts it at the empty seat with the smallest seat number;

• • If the site x is empty, namely $\eta (x)=0$ , and if there is at least one occupied seat, then the carrier puts down the ball at the occupied seat with the smallest seat number;

• • Otherwise, the carrier just passes through.

The above rule can also be summarized by recording in functions $\mathcal {W}=\left (\mathcal {W}_{k}\right )_{k \in {\mathbb {N}}}, \ \mathcal {W}_{k} : {\mathbb {Z}}_{\ge 0} \to \{0,1\}$ whether the seat No. k is occupied at site x, that is, we recursively define $\mathcal {W}$ as $\mathcal {W}_{k}(0) = 0$ for any $k \in {\mathbb {N}}$ and

(2.1) $$ \begin{align} \mathcal{W}_{k}(x) & =\mathcal{W}_{k}(x-1) + \eta(x)(1-\mathcal{W}_{k}(x-1))\prod_{\ell=1}^{k-1}\mathcal{W}_{\ell}(x-1) \\ &\quad -(1-\eta(x))\mathcal{W}_{k}(x-1)\prod_{\ell=1}^{k-1}(1-\mathcal{W}_{\ell}(x-1)). \nonumber \end{align} $$

Then, $\mathcal {W}_{k}(x)=0$ means that the seat No.k of the carrier passing at site x is empty, while $\mathcal {W}_{k}(x)=1$ means that the seat No. k of the carrier is occupied. We call $\mathcal {W}=(\mathcal {W}_{k})_k$ the carrier with seat numbers. It is obvious by definition that for the classical carrier $W_{\ell }$ with capacity $\ell \in {\mathbb {N}} \cup \{\infty \}$ ,

(2.2) $$ \begin{align} W_{\ell}(x)=\sum_{k=1}^{\ell} \mathcal{W}_{k}(x) \end{align} $$

holds, and we see that $\mathcal {W}$ is a refinement of $W_{\ell }$ . Now, we say that a site x is $(k,\uparrow )$ -seat if $\eta (x)=1$ and the ball picked at x sits at the seat No. k. In the same way, we say that a site x is $(k,\downarrow )$ -seat if $\eta (x)=0$ and the ball seated at No. k is put down at x. Then by using this notion, we define the seat number configuration $\eta ^{\sigma }_{k} \in \Omega $ , $k \in {\mathbb {N}}, \sigma \in \left \{ \uparrow ,\downarrow \right \}$ , as

(2.3) $$ \begin{align} \eta^{\uparrow}_{k}(x) &:= \begin{cases} 1 \ & \text{if} \ x \ \text{is a} \ (k,\uparrow)\text{-seat} \\ 0 \ & \text{otherwise} \end{cases}\nonumber \\ &=\mathbf{1}_{\{\mathcal{W}_{k}(x)> \mathcal{W}_{k}(x-1)\}} \nonumber\\ &= \eta(x)(1-\mathcal{W}_{k}(x-1))\prod_{\ell=1}^{k-1}\mathcal{W}_{\ell}(x-1) , \end{align} $$

(2.4) $$ \begin{align} \eta^{\downarrow}_{k}(x) &:= \begin{cases} 1 \ & \text{if} \ x \ \text{is a} \ (k,\downarrow)\text{-seat} \\ 0 \ & \text{otherwise} \end{cases} \nonumber\\ &=\mathbf{1}_{\{\mathcal{W}_{k}(x)< \mathcal{W}_{k}(x-1)\}} \nonumber\\ &= (1-\eta(x))\mathcal{W}_{k}(x-1)\prod_{\ell=1}^{k-1}(1-\mathcal{W}_{\ell}(x-1)) , \end{align} $$

where the third equalities in Equations (2.3) and (2.4) are consequences of Equation (2.1). For later use, we note that

$$ \begin{align*} \eta^{\uparrow}_{k}(x) - \eta^{\downarrow}_{k}(x) &= \mathbf{1}_{\{\mathcal{W}_{k}(x)> \mathcal{W}_{k}(x-1)\}} - \mathbf{1}_{\{\mathcal{W}_{k}(x)< \mathcal{W}_{k}(x-1)\}} \\ &= \mathcal{W}_{k}(x) - \mathcal{W}_{k}(x-1), \end{align*} $$

and thus we obtain

(2.5) $$ \begin{align} \mathcal{W}_{k}(x) = \sum_{y=1}^{x}(\eta^{\uparrow}_{k}(y) -\eta^{\downarrow}_{k}(y)). \end{align} $$

Observe that there is at most one ball getting in and out at each site. Hence, if a ball gets in or out at site x, that is, $W_{\infty }(x - 1) \neq W_{\infty }(x)$ , then the seat number of x, that is the $(k,\sigma )$ satisfying $\eta ^{\sigma }_k(x)=1$ , is uniquely determined. On the other hand, if site x is empty and any seat is vacant at $x-1$ , that is, $W_{\infty }(x - 1) = W_{\infty }(x) = 0$ , then we call such x a record, following [Reference Ferrari, Nguyen, Rolla and WangFNRW]. We note that the operator $T: \Omega \to \Omega $ can be regarded as a flip operator of $0$ s and $1$ s except for records, that is,

(2.6) $$ \begin{align} T\eta(x) = \begin{cases} 1 - \eta(x) \ & \ \text{if } x \text{ is not a record}, \\ \eta(x) \ & \ \text{otherwise}. \end{cases} \end{align} $$

For later use, we define $r(x) \in \{0,1 \}$ as the function such that $r(x) = 1$ if and only if x is a record. From the above observations, we see that any site of given ball configuration can be distinguished either as a $(k,\sigma )$ -seat for some $k, \sigma $ or a record. In formulas, we have

$$ \begin{align*} \sum_{k \in {\mathbb{N}}} \eta^{\uparrow}_{k}(x) = \eta(x), \qquad r(x) + \sum_{k \in {\mathbb{N}}} \eta^{\downarrow}_{k}(x) = 1 - \eta(x) \end{align*} $$

for any x. Hence, it is obvious that $r(x)$ is given by

$$ \begin{align*} r(x) = 1- \sum_{k \in {\mathbb{N}}}(\eta^{\uparrow}_{k}(x)+ \eta^{\downarrow}_{k}(x)). \end{align*} $$

Figure 2 shows the values of $ \mathcal {W}_{k}(\cdot )$ and the seat number configuration for the ball configuration $\eta = 11001110110001100\dots $ . Note that the same specific ball configuration will be repeatedly used throughout this paper to facilitate comparison of multiple methods.

Figure 2 Seat number configurations and records.

Now, we observe the relationship between the seat number configuration and the solitons identified by the TS algorithm. As we will see in Section 3, for any $\eta \in \Omega _{< \infty }$ , the total number of $(k,\uparrow )$ -seats is the same as that of $(k,\downarrow )$ -seats for each $k \in {\mathbb {N}}$ , where $\Omega _{< \infty } \subset \Omega $ is the set of all finite ball configurations

$$ \begin{align*} \Omega_{< \infty} := \left\{ \eta \in \Omega ; \ \sum_{x \in {\mathbb{N}}} \eta(x) < \infty \right\}. \end{align*} $$

Moreover, the total number of $(k,\sigma )$ -seats is conserved in time for each $k \in {\mathbb {N}}$ and $\sigma \in \{\uparrow , \downarrow \}$ , that is, $\sum _{x \in {\mathbb {N}} } \eta ^{\uparrow }_{k}(x) = \sum _{x \in {\mathbb {N}}} \eta ^{\downarrow }_{k}(x) = \sum _{x \in {\mathbb {N}}} T\eta ^{\uparrow }_{k}(x)$ . This relation will be established below in Equation (3.1); see also Remark 3.1. On the other hand, for a configuration where all entries are $`0'$ except for k consecutive ‘ $1$ ”s, that is there is only one soliton and its size is k, we can easily see that such k-soliton is composed by one of each $(\ell ,\sigma )$ -seat for $ 1 \le \ell \le k$ and $\sigma \in \left \{ \uparrow , \downarrow \right \}$ ; see Figure 3 for example. For any configuration in $\Omega _{< \infty }$ , we will show that such a relation between the seat number configuration and solitons is also valid, that is, any k-soliton is composed by one of each $(\ell ,\sigma )$ -seat for $ 1 \le \ell \le k$ and $\sigma \in \left \{ \uparrow , \downarrow \right \}$ ; see Proposition 2.3 and Section 5 for details. Hence, for any $\eta \in \Omega _{<\infty }$ we have the formula

$$ \begin{align*} \left| \left\{ k \text{-solitons in } \eta \right\} \right| = \sum_{x \in {\mathbb{N}}} \left( \eta^{\uparrow}_{k}(x) - \eta^{\uparrow}_{k+1}(x) \right) = \sum_{x \in {\mathbb{N}}} \left( \eta^{\downarrow}_{k}(x) - \eta^{\downarrow}_{k+1}(x) \right). \end{align*} $$

In addition, if x is a record, then by following the TS algorithm, all solitons in $\left ( \eta (y)\right )_{1 \le y \le x}$ can be identified independently of $\left ( \eta (y)\right )_{y \ge x + 1}$ , and we claim that the following equation

(2.7) $$ \begin{align} &\left| \left\{ k \text{-solitons in } \left( \eta(y)\right)_{1 \le y \le x} \right\} \right| = \sum_{y = 1}^{x} \left( \eta^{\uparrow}_{k}(y) - \eta^{\uparrow}_{k+1}(y) \right) = \sum_{y = 1}^{x} \left( \eta^{\downarrow}_{k}(y) - \eta^{\downarrow}_{k+1}(y) \right) \end{align} $$

holds for any $k \in {\mathbb {N}}$ , while for general $x \in {\mathbb {N}}$ Equation (2.7) may not hold. Since any element of $\eta \in \Omega _{< \infty }$ consists of records except for a finite number of sites, $\eta ^{\sigma }_{k}(\cdot ) - \eta ^{\sigma }_{k+1}(\cdot )$ can be considered as the local density of k-solitons for each $\sigma \in \left \{ \uparrow , \downarrow \right \}$ . Note that the above claim will be justified by Proposition 2.3.

Figure 3 For the case where only one $4$ -soliton is included in $\eta $ .

When we consider a general ball configuration $\eta \in \Omega $ , the TS algorithm may not work because there can be infinite number of balls, and thus we may not be able to identify solitons in $\eta $ . However, since the construction of the seat number configuration is sequential, that is, the value of $\eta ^{\sigma }_{k}(x)$ can be determined by $\left (\eta (y)\right )_{1 \le y \le x}$ for any $k \in {\mathbb {N}}$ and $\sigma \in \left \{\uparrow , \downarrow \right \}$ , we can always define $\eta ^{\sigma }_{k}(\cdot )$ for any $\eta \in \Omega $ . Therefore, motivated by the above discussion, to study the dynamical behavior of the BBS for general $\eta \in \Omega $ , we define $m^{\sigma }_{k} : {\mathbb {Z}}_{\ge 0} \to {\mathbb {Z}}_{\ge 0}$ as $m^{\sigma }_{k}(0) := 0$ , and

(2.8) $$ \begin{align} m^{\sigma}_{k}(x) := \sum_{y = 1}^{x} \left( \eta^{\sigma}_{k}(y) - \eta^{\sigma}_{k+1}(y) \right), \end{align} $$

for any $k \in {\mathbb {N}}$ , $x \in {\mathbb {N}}$ and $\sigma \in \left \{\uparrow ,\downarrow \right \}$ . Note that from Equations (2.5) and (2.8), we get

(2.9) $$ \begin{align} m^{\uparrow}_{k}(x) - m^{\downarrow}_{k}(x) &= \mathcal{W}_{k}(x) - \mathcal{W}_{k+1}(x) \in \left\{-1,0,1 \right\} , \end{align} $$

(2.10) $$ \begin{align} m^{\sigma}_{k}(x+1) - m^{\sigma}_{k}(x) &= \eta^{\sigma}_{k}(x+1) - \eta^{\sigma}_{k+1}(x+1) \in \left\{-1,0,1 \right\} , \end{align} $$

for any $k \in {\mathbb {N}}$ , $x \in {\mathbb {Z}}_{\ge 0}$ and $\sigma \in \left \{\uparrow ,\downarrow \right \}$ . We then introduce the j-th leftmost matching point $\tau _{k}(j)$ as

(2.11) $$ \begin{align} \tau_{k}(j)\, &{:=}\, \min\left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ m^{\sigma}_{k}(x) \ge j \ \text{for both} \ \sigma \in \left\{\uparrow,\downarrow \right\} \right\} \nonumber\\ &\kern0.4pt{=}\, \min\left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ m^{\uparrow}_{k}(x) = m^{\downarrow}_{k}(x) = j \right\} , \end{align} $$

for any $k, j \in {\mathbb {N}}$ , where the second equality in Equation (2.11) is a consequence of Equations (2.9) and (2.10). In terms of solitons, $\tau _{k}(j)$ is the site where the j-th k-soliton is identified by the TS algorithm; see Proposition 5.1 for details. For example, in Figure 4, the ball configuration $\eta $ contains one $4$ -soliton colored in brown, two $2$ -solitons colored in red and green and one $1$ -soliton colored in blue, and one can check that the rightmost component of each soliton $x = 4,9,17,18$ are $\tau _{2}(1), \tau _{1}(1), \tau _{2}(2), \tau _{4}(1)$ , respectively. Indeed, the following proposition justifies the above observation and its proof will be presented in Subsection 3.3.

Proposition 2.1. Suppose that $\eta \in \Omega $ and $\tau _{k}(j) < \infty $ for some $k \in {\mathbb {N}}$ and $j \in {\mathbb {N}}$ . Then,

$$ \begin{align*} x \ge \tau_{k}(j) \ \text{if and only if} \ m^{\sigma}_{k}(x) \ge j \ \text{for both} \ \sigma \in \left\{\uparrow,\downarrow \right\}. \end{align*} $$

Now, we introduce a way to determine the effective position of $\tau _{k}(\cdot )$ . First, we introduce the functions $\xi _{k}(x)$ counting the total number of $(\ell ,\uparrow ), (\ell ,\downarrow )$ -seats satisfying $\ell \ge k + 1$ and records up to x as $\xi _{k}(0) := 0$ and

$$ \begin{align*} \xi_{k}(x) \, &{:=}\, \sum_{\ell \ge k + 1} \sum_{y = 1}^{x} \left( \eta^{\uparrow}_{\ell}(y) + \eta^{\downarrow}_{\ell}(y) \right) + \sum_{y = 1}^{x} r(x)\\ &\kern0.4pt{=}\ x - \sum_{\ell = 1}^{k} \sum_{y = 1}^{x} \left( \eta^{\uparrow}_{\ell}(y) + \eta^{\downarrow}_{\ell}(y) \right) \end{align*} $$

for any $k \in {\mathbb {N}}$ , $x \in {\mathbb {Z}}_{\ge 0}$ and $\sigma \in \left \{\uparrow ,\downarrow \right \}$ . Figure 4 also shows an example of $\xi _{k}\left (\cdot \right )$ . Then, the effective position of $\tau _{k}(j)$ is defined as $\xi _{k}\left ( \tau _{k}(j) \right )$ for any $j \in {\mathbb {N}}$ . We explain the reason of the definition of the effective position from the viewpoint of solitons. First, we recall that each $\tau _{k}(j)$ corresponds to a k-soliton as pointed out above. Next, we note that the function $\xi _{k}\left (\cdot \right )$ is a nondecreasing function but constant on sites included in $\ell $ -solitons with $\ell \le k$ . In particular, if $\gamma \subset {\mathbb {N}}$ is a k-soliton, then the rightmost component of $\gamma $ is $\tau _{k}(j)$ for some $j \in {\mathbb {N}}$ , and we have $\xi _{k}\left (x\right ) = \xi _{k}\left (\tau _{k}(j)\right )$ for any $x \in \gamma $ . Thus, by associating $\tau _{k}\left (j\right )$ ’s to each k-soliton, we can consider k-solitons as points via $\xi _{k}\left (\cdot \right )$ , and the function $\xi _{k}\left ( \tau _{k}( \ \cdot \ ) \right )$ can be regarded as measuring certain distances between $\tau _{k}\left (j\right )$ ’s ignoring $\ell $ -seats with $\ell \le k$ between them. Now, we claim that at each time step, $\xi _{k}\left ( \tau _{k}(\cdot ) \right )$ will be shifted by k, that is, $T\xi _{k}\left ( T\tau _{k}(\cdot ) \right ) = \xi _{k}\left ( \tau _{k}(\cdot ) \right ) + k$ , and in this sense we say that $\xi _{k}(\cdot )$ gives the effective positions of k-solitons considering the effect of the interaction between other solitons. In addition, if there are no interactions between solitons, then the effective positions are essentially equivalent to the original positions of the solitons in $\eta $ . In Figure 5, we give an example of $\xi _{k}\left (\cdot \right )$ for the ball configuration $\eta = 111000010010\dots $ , which is the same configuration used in Figure 1, and it can be seen that the effective positions are shifted by k at one step time evolution, while the components of the solitons are not linearly changed in time due to the interaction. Hereafter, we will justify the above claims not from the viewpoint of solitons but rather from the viewpoint of the seat number configuration.

Figure 4 How the value of the functions $m^{\sigma }_{k}$ and $\xi _{k}$ change for the ball configuration ${\eta = 11001110110001100\dots }$ . The solitons identified by the TS algorithm and leftmost matching points of $m^{\sigma }_{k}$ are highlighted in color, and one can see that for each $k \in {\mathbb {N}}$ , the rightmost component of a k-soliton is a leftmost matching point of $m^{\sigma }_{k}$ , respectively. We note that the functions $\xi _{k}(x), k \in {\mathbb {N}}, x \in {\mathbb {Z}}_{\ge 0}$ are defined immediately after Proposition 2.1.

Figure 5 At each time step, the effective positions of k-solitons are shifted by k.

Figure 6 Linearization property of the $(k,\sigma )$ -seats.

From now on, we return to the viewpoint of the seat number configuration. We introduce $\zeta _{k}(i)$ as the total number of $\tau _{k}\kern-2pt$ ’s located at effective position i in the above sense, that is,

(2.12) $$ \begin{align} \zeta_{k}(i) &:= \left| \left\{ j \in {\mathbb{N}} ; \ \tau_{k}(j) \in \left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ \xi_{k}(x) = i \right\} \right\} \right|. \end{align} $$

For the ball configuration in Figure 4, $\zeta $ is given by

$$ \begin{align*} \zeta_{k}(i) = \begin{cases} 1 \quad & (k,i) = (4,0), (2,0), (2,3), (1,4), \\ 0 \quad & \text{otherwise.} \end{cases} \end{align*} $$

Now, we present one of our main theorems, which claims that the effective position of $\tau _{k}(\cdot )$ is shifted by k in one step time evolution, that is, the dynamics of the BBS is linearized in terms of $\zeta $ . Before describing the statement, we will give an example. Observe that Figure 6 shows the seat numbers of $T\eta $ , where $\eta $ is the same configuration as in Figures 2 and 4. From the figure, we see that

$$ \begin{align*} T\zeta_{k}(i) = \begin{cases} 1 \quad & (k,i) = (4,4), (2,2), (2,5), (1,5), \\ 0 \quad & \text{otherwise.} \end{cases} \end{align*} $$

In particular, we have

$$ \begin{align*} T\zeta_{k}(i) = \zeta_{k}(i - k), \end{align*} $$

for any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ , with convention $\zeta _{k}(i) = 0$ for $i < 0$ . Our claim is that this relationship holds true for general configurations as well.

Theorem 2.1. Suppose that $\eta \in \Omega $ and $0 < \left |\left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ \xi _{k}(x) = i \right \}\right | < \infty $ for some $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ . Then we have $0 < \left |\left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ T\xi _{k}(x) = i \right \}\right | < \infty $ and

(2.13) $$ \begin{align} (T\zeta)_{k}(i)= \zeta_{k}(i-k), \end{align} $$

with convention that $\zeta _{k}(i) =0$ for any $i <0$ .

In particular, since the function $\xi _{k}( \cdot )$ strictly increases at each record for any $k \in {\mathbb {N}}$ , we have the following corollary of Theorem 2.1.

Corollary 2.1. Suppose that $\eta \in \Omega _{<\infty }$ . For any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ , we have

$$ \begin{align*} (T\zeta)_{k}(i)= \zeta_{k}(i-k), \end{align*} $$

with convention that $\zeta _{k}(i) =0$ for any $i <0$ .

We give the proof of Theorem 2.1 in Section 3. We emphasize that the proof is self-contained and none of the relations with other linearization methods are used, and the definitions of $\eta ^{\sigma }_{k}, m^{\sigma }_{k}, \tau _{k}, \xi _{k}, \zeta _{k}$ are independent of the notion of solitons. Note that under slightly stronger assumptions than that of Theorem 2.1, one can reconstruct $\eta $ from $\zeta $ via the relation to the slot decomposition; see Remark 5.1 and [Reference Croydon and SasadaCS, Section 2.2] for a constructive proof of this claim. We also note that, in fact, their reconstruction algorithm only depends on the value of $\zeta $ and does not require the notion of solitons. Hence, the above results mean that the seat number configuration gives a new linearization method for the BBS.

Remark 2.1. From the relation with the rigged configuration obtained by KKR bijection shown in Section 4, under the same assumption as Theorem 2.1, the above theorem can be generalized to the BBS with capacity $\ell $ as

$$\begin{align*}(T_{\ell}\zeta)_{k}(i)= \zeta_{k}(i-(k\wedge \ell)). \end{align*}$$

We believe that there should be a direct proof of this linearization without using the relation with KKR bijection but do not pursue it in this paper.

Remark 2.2. The following is one example of a configuration that does not satisfy the assumption of Theorem 2.1 for some k and i.

$$ \begin{align*} \eta\left(x\right) = \begin{cases} 1 \ & \ x = 1,2,3,7,8,11, 4n + 1, 4n + 2 \text{ for some } n \ge 3, \\ 0 \ & \ \text{otherwise}. \end{cases} \end{align*} $$

In other words, $\eta = 111000110010(1100)^{\otimes \infty }$ ; see also Figure 7. In this example, we see that ${0 < \left | \left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ \xi _{1}\left (x\right ) = i \right \} \right | < \infty }$ for any $i \in {\mathbb {Z}}_{\ge 0}$ , and $T\zeta _{1}\left (i\right ) = \zeta _{1}\left (i - 1\right )$ . However, for $k = 2, 3$ , we have

$$ \begin{align*} \left| \left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ \xi_{2}\left(x\right) = i \right\} \right| &= \begin{cases} 3 \ & \ i = 0,1, \\ \infty \ & \ i = 2, \\ 0 \ & \ i \ge 3, \end{cases} \\ \left| \left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ \xi_{3}\left(x\right) = i \right\} \right| &= \begin{cases} \infty \ & \ i = 0, \\ 0 \ & \ i \ge 1. \end{cases} \end{align*} $$

On the other hand, we see that $T\tau _{3}(1) = \infty $ , and thus we get

$$ \begin{align*} T\zeta_{3}\left(3\right) = 0 \neq \zeta_{3}\left(0\right) = 1. \end{align*} $$

From the soliton viewpoint, this is a situation where a 3-soliton overtakes an infinite number of 2-solitons and thus escapes to infinity at once. We note that by direct computation,

$$ \begin{align*} \tau_{2}(j) = T\tau_{2}(j) = \begin{cases} 10 \ & \ j = 1, \\ 16 + 4(j - 1) \ & \ j \ge 2, \end{cases} \end{align*} $$

and thus $\zeta _{2}\left (2\right ) = \infty $ and $T\zeta _{2}\left (4\right ) = \infty $ for this $\eta $ . Hence, Equation (2.13) formally holds for $k = 2$ . We also note that this configuration also violates the condition described in Remark 2.3, discussed later in Section 2.2.

Figure 7 An example of $\eta $ which does not satisfy the assumption of Theorem 2.1 for $k \ge 2$ . $\tau _{k}(j)$ ’s and $T\tau _{k}(j)$ ’s are colored by red.

2.2. Relationships between various linearizations

The seat number configuration has a strong advantage that its relation to known linearization methods is clear, and hence it reveals equivalences between them. In Section 4, we will see the relation to the KKR bijection, which gives a sequential construction of growing sequences of pairs of partitions and riggings, called rigged configurations, from given ball configurations, where a rigging of a partition $\mu $ is a collection of integers assigned to each element of $\mu $ . The term sequential means that starting from $\eta $ , we will sequentially construct rigged configurations $(\mu (x),\mathbf {J}(x))$ for $x=0,1,\dots $ in such a way that $(\mu (x),\mathbf {J}(x))$ is a function of $\eta (1),\dots ,\eta (x)$ and $(\mu ,\mathbf {J}) = \lim _{x\to \infty }(\mu (x),\mathbf {J}(x))$ will be the rigged configuration associated with $\eta $ . For example, the rigged configuration corresponding to the ball configuration $\left ( \eta (x) \right )_{1 \le x \le 19}, \ \eta = 1100111011000110000\dots $ is given by the partition $\mu = (4,2,2,1)$ and the rigging $\mathbf {J} = ( J_{1}, J_{2}, J_{4} ), J_{1} = (3), J_{2} = (-2, 1), J_{4} = (-4)$ , where $J_{k}$ is the sequence of integers assigned to k’s in the partition $\mu $ ordered from the smallest to largest, and it can be represented as follows.

See also Figure 11 to see how $(\mu (x),\mathbf {J}(x))$ grows as x changes.

To state the claim, let $\mu (x)=(\mu _i(x))$ be the partitions obtained by the KKR bijection and ${\lambda (x)=(\lambda _{k}(x))}$ be the conjugate of $\mu (x)$ , that is, $\lambda _{k}(x) := \left | \left \{ i \in {\mathbb {N}} ; \ \mu _{i}(x) \ge k \right \} \right |$ . Also, let $m_{k}(x) :=\lambda _{k}(x) - \lambda _{k+1}(x)$ be the multiplicity of k in $\mu (x)$ , $\mathbf {J}(x)=(J_k(x), k \in {\mathbb {N}})$ be the rigging, and $p_{k}(x) := x - 2E_{k}(x)$ be the vacancy, where $E_{k}(x)$ is the k-th energy defined as

$$ \begin{align*} E_{k}(x) := \sum_{i \in {\mathbb{N}}} \min \left\{\mu_i(x),k \right\}, \end{align*} $$

for any $k \in {\mathbb {N}}$ and $x \in {\mathbb {Z}}_{\ge 0}$ . We note that the number of components in $J_{k}(x)$ is equal to $m_{k}(x)$ . We also recall that the seat number configuration $\eta ^{\sigma }_{k}$ and the function $m^{\sigma }_{k}$ are defined in Equations (2.3),(2.4) and (2.8) for $k \in {\mathbb {N}}$ and $\sigma \in \left \{ \uparrow ,\downarrow \right \}$ . Then, we have the following relation between the quantities from the KKR bijection and those from the seat number configuration.

Proposition 2.2 (Seat-KKR).

Suppose that $\eta \in \Omega $ . For any $k \in {\mathbb {N}}$ and $x \in {\mathbb {Z}}_{\ge 0}$ , we have

(2.14) $$ \begin{align} \lambda_{k}(x) &= \sum_{y=1}^x\eta^{\uparrow}_{k}(y), \nonumber\\ p_{k}(x) &= x-2\sum_{\ell=1}^{k}\sum_{y=1}^x\eta^{\uparrow}_{\ell}(y), \end{align} $$

and

$$ \begin{align*} J_{k}(x) & =(J_{k,j}(x)=p_{k}(t_{k}(x,j)) ; \ j=1,\dots, m^{\uparrow}_{k}(x) ), \end{align*} $$

where

$$ \begin{align*} t_{k}(x,j):=\max\{1 \le y \le x ; \ m^{\uparrow}_{k}(y)=j,\ \eta^{\uparrow}_{k}(y)=1\}. \end{align*} $$

In particular, from Equation (2.14) we see that $\sum _{\ell = 1}^{k}\eta ^{\uparrow }_{\ell }(x)$ is the local k-th energy at $x \in {\mathbb {N}}$ . Obviously, there is a direct relationship between $(k,\uparrow )$ -seats and the local energy function H used in the crystal theory formulation of the BBS [Reference Fukuda, Yamada and OkadoFOY]; see Remark 4.1 for details. We emphasize that since the rigged configuration is constructed sequentially, $\left (\mu (x), \mathbf {J}(x)\right )$ can always be defined for any $x \in {\mathbb {Z}}_{\ge 0}$ and Proposition 2.2 is valid for any $\eta \in \Omega $ , which is not necessarily in $\Omega _{<\infty }$ .

In Section 5, we will establish the relation between the seat number configuration and the slot configuration. Compared to the KKR bijection, the slot configuration defined via the algorithm in [Reference Ferrari, Nguyen, Rolla and WangFNRW], denoted by $\nu (x)$ , needs a parallel construction, that is, to define the value of $\nu (x)$ , we need the entire information of $(\eta (y))_{y \in {\mathbb {N}}}$ (or at least $(\eta (y))_{y \in [1, x']}$ for some $x'>x$ in general). However, in this paper, we will prove that slot configuration can be constructed sequentially. In particular, we show that $\left (\eta ^{\sigma }_{k}(x)\right )_{\sigma \in \{ \uparrow , \downarrow \}, k \in {\mathbb {N}}, x \in {\mathbb {N}}}$ can be considered as a sequential construction of the slot configuration. To describe the statement, let $\tilde {\xi }_{k}(x)$ be the number of k-slots in $[1,x]$ , and $(\tilde {\zeta }_{k})_{k \in {\mathbb {N}}}=(\tilde {\zeta }_{k}(i))_{k \in {\mathbb {N}}, i \in {\mathbb {Z}}_{\ge 0}}$ be the slot configuration. For example, the slot configuration corresponding to the ball configuration $\eta = 1100111011000110000\dots $ is given as follows.

Precise definitions of these quantities are given in Section 5. Then, we have the following relation between the quantities from the slot configuration and those from the seat number configuration.

Proposition 2.3 (Seat-slot).

Suppose that $\eta \in \Omega _{< \infty }$ . Then for any $k \in {\mathbb {N}}$ and $x \in {\mathbb {N}}$ , we have the following equivalence:

(2.15) $$ \begin{align} \eta^{\uparrow}_{k}(x) + \eta^{\downarrow}_{k}(x) = 1 \ \text{if and only if} \ \nu(x) = k - 1. \end{align} $$

In particular, for any $k \in {\mathbb {N}}$ , $i \in {\mathbb {Z}}_{\ge 0}$ and $x \in {\mathbb {Z}}_{\ge 0}$ , we have $\tilde {\xi }_{k}(x) = \xi _{k}(x)$ and $\tilde {\zeta }_{k}(i) = \zeta _{k}(i)$ .

The reader can check the relation (2.15) for the ball configuration $\eta = 1100111011000110000\dots $ from Figure 8. Since the construction of the slot configuration requires the TS algorithm, $\nu (x)$ cannot be defined for general $\eta \in \Omega $ due to the existence of infinitely many balls, and so the above proposition is also restricted to $\Omega _{<\infty }$ . In particular, if the number of records in $\eta \in \Omega $ is finite, then we may not be able to identify solitons in $\eta $ ; see the description of the TS algorithm given in the appendix for details. However, the seat number configuration can be defined for any $\eta \in \Omega $ , and thus it can be considered as a generalization of the slot configuration.

Figure 8 The slot configuration and the seat number configuration.

Using Propositions 2.2 and 2.3, we find for the first time that the relationship between local energy and slots can be understood via the seat number configuration. We highlight that KKR-bijection does not distinguish roles of $0$ ’s in $\eta $ , but the seat number configuration and slot configuration do so via the $(k,\downarrow )$ -seats and k-slots, respectively. In other words, the seat number configuration and slot configuration also give energy to $0$ ’s. On the other hand, the slot configuration does not distinguish $1$ ’s and $0$ ’s if they are both k-slots, while the seat number configuration distinguishes them as $(k,\uparrow )$ and $(k,\downarrow )$ . By introducing such a distinction, we obtain the nontrivial relation between the dynamics of $(k,\uparrow )$ and $(k,\downarrow )$ configurations; see Proposition 3.1. See also [Reference Ferrari, Nguyen, Rolla and WangFNRW, Proposition 1.3] for an equivalent claim as that of Proposition 3.1 via the language of the slots.

From the above propositions, we have an explicit relation between the riggings of KKR-bijection and the slot configuration. In the next theorem, we denote $\mathbf {J}=\displaystyle \lim _{x \to \infty }\mathbf {J}(x)$ the rigging for a configuration $\eta \in \Omega _{< \infty }$ , which is well defined since $\mathbf {J}(x)$ becomes constant in x eventually. The indexes of the rigging $\mathbf {J}$ will be $J_{k,j}$ for $k,j$ in a suitable range.

Theorem 2.2 (KKR-slot).

Suppose that $\eta \in \Omega _{< \infty }$ . Then for any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ , we have

$$\begin{align*}\tilde{\zeta}_{k}(i)=|\{j \in {\mathbb{N}} ; \ J_{k,j}=i-k\}|. \end{align*}$$

Theorem 2.2 means that the elements of $J_{k}$ are the effective positions of $\tau _{k}(\cdot )$ shifted by k, and the slot decomposition counts the total number of $\tau _{k}(\cdot )$ at the same effective position. As a direct consequence of Theorem 2.2 and the result in [Reference Kuniba, Okado, Sakamoto, Takagi and YamadaKOSTY] quoted as Theorem 4.1 in Section 4, we see that the slot configuration linearizes the BBS with finite capacity BBS( $\ell $ ). More precisely, we obtain the following theorem, which is a generalization of [Reference Ferrari, Nguyen, Rolla and WangFNRW, Theorem 1.4] for the case $\ell < \infty $ .

Theorem 2.3. Suppose that $\eta \in \Omega _{< \infty }$ . For any $k \in {\mathbb {N}}$ , $i \in {\mathbb {Z}}_{\ge 0}$ and $l \in {\mathbb {N}} \cup \{ \infty \}$ , we have

$$ \begin{align*} (T_{\ell}\tilde{\zeta})_{k}(i)= \tilde{\zeta}_{k}(i-(k\wedge \ell)). \end{align*} $$

We mention some possible extensions of Proposition 2.2 and Theorem 2.2. In literature, various extensions of the BBS have been defined and studied [Reference Hatayama, Hikami, Inoue, Kuniba, Takagi and TokihiroHHIKTT, Reference Hatayama, Kuniba and TakagiHKT, Reference Inoue, Kuniba and TakagiIKT, Reference Kuniba, Misguich and PasquierKMP2, Reference Kuniba, Okado and YamadaKOY, Reference TakahashiT, Reference Tokihiro, Takahashi and MatsukidairaTTM]. One such generalization is given by the multicolor BBS with finite/infinite carrier capacity, and it is known that such model can also be linearized by the KKR bijection. Nevertheless, in the colored setting such linearization techniques do not allow to study general hydrodynamic properties of the model in a rigorous way. To attack such probabilistic questions, a linearization method more close in spirit to that of slot configurations seems to be required, yet no such result is, at this moment, available. We expect that Proposition 2.2 and Theorem 2.2 might give a blueprint to generalize the idea of the slot/seat number configuration for multicolor BBS and hence to carry out hydrodynamic studies of these generalized models.

Finally, we note an application of Theorem 2.3 to the derivation of the generalized hydrodynamic limit (GHD limit) for the BBS( $\ell $ ), $\ell < \infty $ . In [Reference Croydon and SasadaCS], the GHD limit for the BBS with infinite carrier capacity $(\ell = \infty )$ is rigorously derived, and the use of the slot decomposition is crucial in their strategy of the proof. However, the assumption $\ell = \infty $ is not necessary for most of the proof and is only needed to use [Reference Ferrari, Nguyen, Rolla and WangFNRW, Theorem 1.4], the linearization property of the slot decomposition. Therefore, combining Theorem 2.3 and the strategy in [Reference Croydon and SasadaCS], the GHD limit for the BBS( $\ell $ ) can be also derived in a rigorous way.

Remark 2.3. Since the main purpose of this paper is to investigate the relationships between the KKR bijection and the slot configuration and the KKR bijection is only defined for semi-infinite sequences, we consider the BBS on $\{ 0, 1 \}^{{\mathbb {N}}}$ . On the other hand, the slot configuration and the seat number configuration can be also defined for $\eta \in \left \{ 0 , 1 \right \}^{{\mathbb {Z}}}$ satisfying

$$ \begin{align*} \lim_{x \to \infty} \frac{1}{x} \sum_{y = 1}^{x} \eta(y) < \frac{1}{2}, \ \lim_{x \to \infty} \frac{1}{x} \sum_{y = -x}^{-1} \eta(y) < \frac{1}{2}, \end{align*} $$

and the relation (2.15) also holds. That is, for the whole line case, the seat number configuration is also a generalization of the slot configuration; see [Reference SudaS, Section 4] for the construction of the seat number configuration on the whole line and the proof of an analogue of Proposition 2.3. We note that for the whole line case, since there are seats in both directions, the function $\xi _{k}$ may take values in $(-\infty , \infty )$ , and an ambiguity arises as to where to assign the value of $0$ for $\xi _{k}$ . As a result, to describe an analogue of Theorem 2.1, we need an offset, which is also the case for the slot configuration; see [Reference Ferrari, Nguyen, Rolla and WangFNRW, Theorem 3.1] and [Reference SudaS, Theorem 4.1] for details.

3.1. Basic properties of the seat number configuration

The next proposition is crucial for understanding the dynamics of the BBS.

Proposition 3.1. For any $\eta \in \Omega $ , $x \in {\mathbb {N}}$ and $k \in {\mathbb {N}}$ ,

(3.1) $$ \begin{align} \eta^{\downarrow}_{k}(x) &= T\eta^{\uparrow}_{k}(x). \end{align} $$

In addition, if $\eta ^{\uparrow }_{k}(x) = 1$ , then we have

(3.2) $$ \begin{align} \sum_{\ell \ge k} T\eta^{\downarrow}_{\ell}(x) + Tr(x) = 1. \end{align} $$

The proof of Proposition 3.1 is in the next subsection.

Remark 3.1. By Lemma 3.1 (iii) and Equation (3.1), we see that if $r(x) = 1$ , then we have

$$ \begin{align*} \sum_{y = 1}^{x} \eta^{\uparrow}_{k}(y) = \sum_{y = 1}^{x} \eta^{\downarrow}_{k}(y) = \sum_{y = 1}^{x} T\eta^{\uparrow}_{k}(y), \end{align*} $$

for any $k \in {\mathbb {N}}$ . In particular, under the assumption $\eta \in \Omega _{< \infty }$ , we have

$$ \begin{align*} \sum_{x \in {\mathbb{N}}} \eta^{\uparrow}_{k}(x) = \sum_{x \in {\mathbb{N}}} \eta^{\downarrow}_{k}(x) = \sum_{x \in {\mathbb{N}}} T\eta^{\uparrow}_{k}(x) = \sum_{x \in {\mathbb{N}}} T\eta^{\downarrow}_{k}(x) \end{align*} $$

since x must be a record of $\eta $ and $T\eta $ if x is sufficiently large. Hence, the total number of $(k,\sigma )$ -seats is conserved in time for each $k \in {\mathbb {N}}$ and $\sigma \in \{ \uparrow , \downarrow \}$ . When $\sum _{x \in {\mathbb {N}}} \eta (x) = \infty $ , the above conservation law does not necessarily hold.

3.2. Proof of Proposition 3.1

First, note that if $(\mathcal {W}_k)_k$ is the carrier with seat numbers for the configuration $\eta $ , then $(1-\mathcal {W}_k)_k$ is the carrier with seat numbers for the configuration $1-\eta $ , namely $(1-\mathcal {W}_k)_k$ satisfies Equation (2.1) for $1-\eta $ , but with the boundary condition $(1-\mathcal {W}_k)(0)=1$ for all $k \in {\mathbb {N}}$ . Now, let $\tilde {\eta }=1-T\eta $ and $\tilde {\mathcal {W}}_{k}=1-T\mathcal {W}_{k}$ . Then, $\tilde {\mathcal {W}}= (\tilde {\mathcal {W}}_{k}) $ is the carrier with seat numbers for the configuration $\tilde {\eta }$ with the boundary condition $\tilde {\mathcal {W}}_{k}(0)=1$ for all $k \in {\mathbb {N}}$ . More precisely, $\tilde {\mathcal {W}}= (\tilde {\mathcal {W}}_{k}) $ satisfies Equation (2.1) for $\tilde {\eta }$ . Moreover, from Equation (2.6),

$$ \begin{align*} \tilde{\eta}(x)= \begin{cases} \eta(x) \quad &\text{if} \quad r(x)=0, \\ 1-\eta(x) \quad &\text{if} \quad r(x)=1. \end{cases} \end{align*} $$

Then, Equation (3.1) is equivalent to the claim that

(3.3) $$ \begin{align} \tilde{\mathcal{W}}_{k}(x)-\tilde{\mathcal{W}}_{k}(x-1) =-1 \end{align} $$

if and only if $\eta ^{\downarrow }_{k}(x)=1$ . To prove this, we first prove that $\tilde {\mathcal {W}}_{k}$ dominates $\mathcal {W}_{k}$ .

Lemma 3.2. For any $x \in {\mathbb {Z}}_{\ge 0}$ and $k \in {\mathbb {N}}$ ,

$$\begin{align*}\tilde{\mathcal{W}}_{k}(x) \ge \mathcal{W}_{k}(x). \end{align*}$$

Proof. We prove it by induction on x. For $x=0$ , the inequality holds since $\tilde {\mathcal {W}}_{k}(0)=1$ and $\mathcal {W}_{k}(0)=0$ for $k \in {\mathbb {N}}$ . Suppose

$$\begin{align*}\tilde{\mathcal{W}}_{k}(x-1) \ge \mathcal{W}_{k}(x-1), \end{align*}$$

for all $k \in {\mathbb {N}}$ . If $r(x)=1$ , $\mathcal {W}_{k}(x-1)=\mathcal {W}_{k}(x)=0$ for all $k \in {\mathbb {N}}$ , so

$$\begin{align*}\tilde{\mathcal{W}}_{k}(x) \ge \mathcal{W}_{k}(x) \end{align*}$$

holds for all $k \in {\mathbb {N}}$ . If $r(x)=0$ , then $\eta (x)=\tilde {\eta }(x)$ . If $\eta (x)=\tilde {\eta }(x)=1$ , then $\eta ^{\uparrow }_{k^*}(x)=1$ for some $k^* \in {\mathbb {N}}$ . Therefore, $\mathcal {W}_{k}(x-1)=1$ for all $1 \le k < k^*$ and so $\tilde {\mathcal {W}}_{k}(x-1)=1$ by the induction assumption. This implies that $\tilde {\mathcal {W}}_{k^*}(x)=1$ holds for both cases $\tilde {\mathcal {W}}_{k^*}(x-1)=0$ or $1$ . Hence,

$$\begin{align*}\tilde{\mathcal{W}}_{k^*}(x) =\mathcal{W}_{k^*}(x)=1 \end{align*}$$

and for $k \neq k^*$ ,

$$\begin{align*}\tilde{\mathcal{W}}_{k}(x) \ge \tilde{\mathcal{W}}_{k}(x-1) \ge \mathcal{W}_{k}(x-1)=\mathcal{W}_{k}(x). \end{align*}$$

Similarly, if $\eta (x)=\tilde {\eta }(x)=0$ , then there exists $k^* \in {\mathbb {N}}$ such that $\tilde {\mathcal {W}}_{k^*}(x) -\tilde {\mathcal {W}}_{k^*}(x-1) =-1$ . Then, $\tilde {\mathcal {W}}_{k}(x-1)=0$ for all $1 \le k < k^*$ and so $\mathcal {W}_{k}(x-1)=0$ by the induction assumption. Hence, $\mathcal {W}_{k^*}(x)=0$ holds for both cases $\mathcal {W}_{k^*}(x-1)=0$ or $1$ . Hence,

$$\begin{align*}\tilde{\mathcal{W}}_{k^*}(x) =\mathcal{W}_{k^*}(x)=0 \end{align*}$$

and for $k \neq k^*$ ,

$$\begin{align*}\tilde{\mathcal{W}}_{k}(x) = \tilde{\mathcal{W}}_{k}(x-1) \ge \mathcal{W}_{k}(x-1) \ge \mathcal{W}_{k}(x), \end{align*}$$

which completes the inductive step.

Next, we prove that $\tilde {\mathcal {W}}_{k}$ and $\mathcal {W}_{k}$ coincide on sufficiently large intervals.

Lemma 3.3. Suppose $x' < x $ , $\eta ^{\uparrow }_{k}(x')=1$ and $r(y)=0$ for all $x' < y \le x$ . Then,

$$\begin{align*}\mathcal{W}_{\ell}(y) = \tilde{\mathcal{W}}_{\ell}(y) \end{align*}$$

for any $x' \le y \le x$ and $1 \le \ell \le k$ .

Proof of Proposition 3.1.

We first show that $\eta ^{\downarrow }_{k}(x)=1$ implies Equation (3.3), that is $\tilde {\mathcal {W}}_{k}(x)- \tilde {\mathcal {W}}_{k}(x-1)=-1$ . Then we will prove the opposite implication. Suppose $\eta ^{\downarrow }_{k}(x)=1$ . This means

$$\begin{align*}\mathcal{W}_{k}(x-1)=1, \quad \mathcal{W}_{k}(x)=0. \end{align*}$$

Let

$$\begin{align*}x':=\max\{ y \in {\mathbb{N}} ; \ \eta^{\uparrow}_{k}(y)=1, y <x\}, \end{align*}$$

that is the rightmost site to the left of x where a ball is picked up and seated at No.k seat. We can also characterize $x'$ as

$$\begin{align*}x'=\min\{ y \in {\mathbb{N}} ; \ \mathcal{W}_{k}(z)=1 \ \text{for all} \ y \le z \le x-1\}. \end{align*}$$

Then, it is obvious that $\eta ^{\uparrow }_{k}(x')=1$ , $x' <x$ and $r(y)=0$ for all $x' < y \le x$ since $r(y)=1$ implies $\mathcal {W}_{k}(y)=\mathcal {W}_{k}(y-1)=0$ . Then, by Lemma 3.3,

$$\begin{align*}\mathcal{W}_{k}(x-1)=\tilde{\mathcal{W}}_{k}(x-1)=1 \end{align*}$$

and

$$\begin{align*}\mathcal{W}_{k}(x)=\tilde{\mathcal{W}}_{k}(x)=0 \end{align*}$$

hold. In particular, Equation (3.3) holds. Next, we assume Equation (3.3) holds and prove $\eta ^{\downarrow }_{k}(x)=1$ . Since the relation $\tilde {\mathcal {W}}_{k}(x)-\tilde {\mathcal {W}}_{k}(x-1)=-1$ implies $T\eta (x) = 1$ and $\tilde {\eta }(x)=0$ , we have $r(x)=0$ and $\eta (x)=0$ . Hence, there exists $k^* \ge 1$ such that $\eta ^{\downarrow }_{k^*}(x)=1$ . Then, by the first part of this proof, this implies

$$\begin{align*}\tilde{\mathcal{W}}_{k^*}(x)-\tilde{\mathcal{W}}_{k^*}(x-1)=-1, \end{align*}$$

which means $k=k^*$ , and so $\eta ^{\downarrow }_{k}(x)=1$ .

Finally, we prove Equation (3.2). If $\eta ^{\uparrow }_{k}(x) = 1$ , then $T\eta (x) = 0$ and thus we have

$$ \begin{align*} \sum_{\ell \in {\mathbb{N}}} T\eta^{\downarrow}_{\ell}(x) + Tr(x) = 1. \end{align*} $$

Hence, it is sufficient to show that $\eta ^{\uparrow }_{k}(x) = 1$ implies $T\eta ^{\downarrow }_{\ell }(x) = 0$ for $1 \le \ell \le k - 1$ . We observe that $T\mathcal {W}_{\ell }(x - 1)= T\mathcal {W}_{\ell }(x) = 0$ implies $T\eta ^{\downarrow }_{\ell }(x) = 0$ . Since $T\mathcal {W}_{\ell }(x) = 1 - \tilde {\mathcal {W}}_{\ell }(x)$ , $T\mathcal {W}_{\ell }(x - 1)= T\mathcal {W}_{\ell }(x) = 0$ is equivalent to $\tilde {\mathcal {W}}_{\ell }(x - 1) = \tilde {\mathcal {W}}_{\ell }(x) = 1$ . On the other hand, $\eta ^{\uparrow }_{k}(x) = 1$ implies $\mathcal {W}_{\ell }(x - 1) = \mathcal {W}_{\ell }(x) = 1$ for $1 \le \ell \le k - 1$ , and thus from Lemma 3.2 we have $\tilde {\mathcal {W}}_{\ell }(x - 1) = \tilde {\mathcal {W}}_{\ell }(x) = 1$ . Therefore, $\eta ^{\uparrow }_{k}(x) = 1$ implies $T\eta ^{\downarrow }_{\ell }(x) = 0$ for $1 \le \ell \le k -1$ .

3.3. Proof of Proposition 2.1

In this subsection, we will show Proposition 2.1. First, we define for any $i\in {\mathbb {Z}}_{\ge 0}$ and $k \in {\mathbb {N}}$

$$ \begin{align*} s_{k}(i) := \min \left\{ x \in \mathbb{Z}_{\ge 0} ; \ \xi_{k}(x) = i \right\}, \end{align*} $$

with the convention that $\min \emptyset = \infty $ . Since $\xi _{k}(x+1) -\xi _{k}(x) \in \{0,1\}$ , the equivalence

$$ \begin{align*} \xi_{k}(x) = i \ \text{if and only if} \ s_{k}(i) \le x < s_{k}(i+1) \end{align*} $$

holds, where $s_{k}(i+1)$ can be infinite.

Since $s_{k}(i)$ is a $(\ell ,\sigma )$ -seat for some $\ell> k$ and $\sigma \in \{\uparrow ,\downarrow \}$ or a record, by using Equation (2.9) and Lemma 3.1, the following result is straightforward.

Lemma 3.4. Suppose that $s_{k}(i) < \infty $ for some $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ . Then we have

$$ \begin{align*} m^{\uparrow}_{k}\left( s_{k}(i) \right) = m^{\downarrow}_{k}\left( s_{k}(i) \right). \end{align*} $$

Next, we show that the sequence $ \left (m^{\sigma }_{k}\left ( s_{k}(i) \right )\right )_{i \in {\mathbb {N}}}$ , $\sigma \in \{\uparrow , \downarrow \}$ is nondecreasing.

Lemma 3.5. Suppose that $s_{k}(i+1) < \infty $ for some $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ . Then for each $\sigma \in \{ \uparrow , \downarrow \}$ , we have

(3.4) $$ \begin{align} m^{\sigma}_{k}\left( s_{k}(i+1) \right) - m^{\sigma}_{k}\left( s_{k}(i) \right) \ge 0. \end{align} $$

Proof. From Lemma 3.4, it is sufficient to prove the case $\sigma =\uparrow $ . Observe that

$$ \begin{align*} m^{\uparrow}_{k}\left( s_{k}(i+1) \right) - m^{\uparrow}_{k}\left( s_{k}(i) \right) & = \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} (\eta^{\uparrow}_{k}(y) - \eta^{\uparrow}_{k+1}\left(y\right))\\ & =\sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \eta^{\uparrow}_{k}(y) - \eta^{\uparrow}_{k+1}\left(s_{k}(i+1)\right). \end{align*} $$

From the above expression, Equation (3.4) clearly holds for the case $\eta ^{\uparrow }_{k+1}\left (s_{k}(i+1)\right ) = 0$ . From now on, we will consider the case $\eta ^{\uparrow }_{k+1}\left (s_{k} (i+1)\right ) = 1$ . Then, to show Equation (3.4) it is sufficient to show

$$ \begin{align*} \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \eta^{\uparrow}_{k}(y) \ge 1. \end{align*} $$

From Lemma 3.4, we have

$$ \begin{align*} \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \left( \eta^{\uparrow}_{k}(y) - \eta^{\downarrow}_{k}(y) \right) &= \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \left( \eta^{\uparrow}_{k+1}(y) - \eta^{\downarrow}_{k+1}(y) \right) \\ &= \eta^{\uparrow}_{k+1}\left(s_{k}(i+1)\right) - \eta^{\downarrow}_{k+1}\left(s_{k}(i+1)\right). \end{align*} $$

Hence, we obtain

$$ \begin{align*} \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \eta^{\uparrow}_{k}(y) &\ge \eta^{\uparrow}_{k+1}\left(s_{k}(i+1)\right) - \eta^{\downarrow}_{k+1}\left(s_{k}(i+1)\right) \\ &\ge 1, \end{align*} $$

and this completes the proof.

Proof of Proposition 2.1.

From the definition of $\tau _{k}(\cdot )$ given by Equation (2.11), it is sufficient to show that $x \ge \tau _{k}(j)$ implies $m^{\sigma }_{k}(x) \ge j$ for each $\sigma \in \left \{\uparrow ,\downarrow \right \}$ . Since $m^{\sigma }_{k}$ decreases only at $(k+1,{\sigma })$ -seats, it suffices to prove the following claim: For any $x \ge \tau _{k}(j)$ ,

$$ \begin{align*} \eta^{\uparrow}_{k+1}(x) + \eta^{\downarrow}_{k+1}(x) = 1 \ \text{implies} \ m^{\sigma}_{k}(x) \ge j \ \text{for each} \ \sigma \in \left\{\uparrow,\downarrow \right\}. \end{align*} $$

Define $x' := \min \left \{ y \ge \tau _{k}(j) ; \ y = s_{k}(i) ~ \text {for some} ~ i \in {\mathbb {N}} \right \}$ . Note that $x' <\infty $ and in particular $x' \le x$ since $\eta _{k+1}^{\uparrow }(x)+\eta _{k+1}^{\downarrow }(x)=1$ and so $x=s_k(i')$ for some $i'$ . Then, again by using the fact that $m^{\sigma }_{k}$ decreases only at $(k+1,{\sigma })$ -seats, we see that either $m^{\uparrow }_{k}(x') \ge j$ or $m^{\downarrow }_{k}(x') \ge j$ holds. Thus, by using Lemma 3.4 we have $m^{\uparrow }_{k}(x') = m^{\downarrow }_{k}(x') \ge j$ . Then from Lemma 3.5, we obtain $m^{\sigma }_{k}(x) \ge m^{\sigma }_{k}(x') \ge j$ for $\sigma \in \{\uparrow , \downarrow \}$ . Therefore, Proposition 2.1 is proved.

We conclude this subsection by pointing out that similar argument used above yields other representations of $\zeta _{k}(i)$ defined in Equation (2.12) as follows.

Lemma 3.6. Suppose that $s_{k}(i+1) < \infty $ for some $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ . Then for each $\sigma \in \{ \uparrow , \downarrow \}$ we have

$$ \begin{align*} \zeta_{k}(i) &= m^{\sigma}_{k}\left( s_{k}(i+1) \right) - m^{\sigma}_{k}\left( s_{k}(i) \right) \\ &= \left|\left\{x \in {\mathbb{N}} ; \ \eta^{\sigma}_{k}(x)=1, \xi_{k}(x)=i\right\}\right| - \left|\left\{x \in {\mathbb{N}} ; \ \eta^{\sigma}_{k+1}(x)=1, \xi_{k}(x)=i+1\right\}\right|. \end{align*} $$

Proof of Lemma 3.6.

Let $j^*=\max \{j \in {\mathbb {N}}; \ \tau _k(j) < s_k(i+1)\}$ with the convention that $\max \emptyset =0$ . Then, we have

$$ \begin{align*} j^* &= \sum_{j = 0}^{i} \left| \left\{ h \in {\mathbb{N}} ; \ \tau_k(h) \in \left\{ x \in {\mathbb{Z}}_{\ge 0} ; \ \xi_{k}(x) = j \right\} \right\} \right| = \sum_{j = 0}^{i} \zeta_{k}(j). \end{align*} $$

On the other hand, since $\tau _k(j^*) < s_k(i+1) < \tau _k(j^*+1)$ , from Equation (2.11) and from Proposition 2.1, we get

$$ \begin{align*} \min\left\{ m^{\uparrow}_{k}\left( s_{k}(i+1) \right), m^{\downarrow}_{k}\left( s_{k}(i+1) \right) \right\} = j^*. \end{align*} $$

Hence, from the above and Lemma 3.4, for each $\sigma \in \{\uparrow , \downarrow \}$ we have

$$ \begin{align*} m^{\sigma}_{k}\left( s_{k}(i+1) \right) = \min\left\{ m^{\uparrow}_{k}\left( s_{k}(i+1) \right), m^{\downarrow}_{k}\left( s_{k}(i+1) \right) \right\} = j^* =\sum_{j = 0}^{i} \zeta_{k}(j), \end{align*} $$

and thus we obtain

$$ \begin{align*} \zeta_{k}(i) &= m^{\sigma}_{k}\left( s_{k}(i+1) \right) - m^{\sigma}_{k}\left( s_{k}(i) \right) \\ &= \sum_{x = s_{k}(i) + 1}^{s_{k}(i+1)} \eta^{\sigma}_{k}(x) - \eta^{\sigma}_{k+1}\left(s_{k}(i+1)\right) \\ &= \left|\left\{x \in {\mathbb{N}} ; \ \eta^{\sigma}_{k}(x)=1, \xi_{k}(x)=i\right\}\right| - \left|\left\{x \in {\mathbb{N}} ; \ \eta^{\sigma}_{k+1}(x)=1, \xi_{k}(x)=i+1\right\}\right|.\\[-37pt] \end{align*} $$

3.4. Proof of Theorem 2.1

In this subsection, we give the proof of Theorem 2.1. First, we prove that the difference between $\xi _{k}$ and $T\xi _{k}$ is constant under a certain condition.

Lemma 3.7. For any $k \in {\mathbb {N}}$ and $x \in {\mathbb {Z}}_{\ge 0}$ , we have

(3.5) $$ \begin{align} T\xi_{k}(x) - \xi_{k}(x) \ge 0. \end{align} $$

In addition, if $\eta ^{\downarrow }_{\ell }(x)=1$ and $\ell \ge k$ , then

(3.6) $$ \begin{align} T\xi_{k}(x)-\xi_{k}(x)=k. \end{align} $$

Proof. From Equations (2.2), (2.5) and (3.1), we have

$$ \begin{align*} T\xi_{k}(x) - \xi_{k}(x) &= \sum_{\ell = 1}^{k} \sum_{y = 1}^{x} \left( \eta^{\uparrow}_{\ell}(y) - T\eta^{\uparrow}_{\ell}(y) \right) + \sum_{\ell = 1}^{k} \sum_{y = 1}^{x} \left( \eta^{\downarrow}_{\ell}(y) - T\eta^{\downarrow}_{\ell}(y) \right) \\ &= \sum_{\ell = 1}^{k} \sum_{y = 1}^{x} \left( \eta^{\uparrow}_{\ell}(y) - \eta^{\downarrow}_{\ell}(y) \right) + \sum_{\ell = 1}^{k} \sum_{y = 1}^{x} \left( T\eta^{\uparrow}_{\ell}(y) - T\eta^{\downarrow}_{\ell}(y) \right) \\ &= W_{k}(x) + TW_{k}(x) \ge 0. \end{align*} $$

Suppose $\eta ^{\downarrow }_{\ell }(x)=1$ and $\ell \ge k$ . By Equation (2.2), Equation (2.5) and Lemma 3.1(ii), $ W_{k}(x) = 0$ . Also, by (3.1), $T\eta ^{\uparrow }_{\ell }(x)=1$ and so by Equation (2.2), Equation (2.5) and Lemma 3.1(i), $ TW_{k}(x) = k$ . Hence,

$$ \begin{align*} T\xi_{k}(x)-\xi_{k}(x) = W_{k}(x) + TW_{k}(x) = k.\\[-37pt] \end{align*} $$

Now, we give the proof of Theorem 2.1.

Proof of Theorem 2.1.

First, we note that $0 < \left | \left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ \xi _{k}(x) = i \right \} \right | < \infty $ if and only if $s_{k}(i+1) < \infty $ . In addition, from Equation (3.5), we have $Ts_{k}(i) \le s_{k}(i)$ for any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ . Hence, we see that $ 0 < \left | \left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ \xi _{k}(x) = i \right \} \right | < \infty $ implies $0 < \left | \left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ T\xi _{k}(x) = i \right \} \right | < \infty $ .

Next, by Lemma 3.6 and Equation (3.1),

$$ \begin{align*} (T\zeta)_{k}(i) & = |\{x \in {\mathbb{N}} ; \ T\eta^{\uparrow}_{k}(x)=1, T\xi_{k}(x)=i\}| - |\{x \in {\mathbb{N}} ; \ T\eta^{\uparrow}_{k+1}(x)=1, T\xi_{k}(x)=i+1\}| \\ & = |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k}(x)=1, T\xi_{k}(x)=i\}| - |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k+1}(x)=1, T\xi_{k}(x)=i+1\}|. \end{align*} $$

Then, by Equation (3.6),

$$ \begin{align*} |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k}(x)=1, T\xi_{k}(x)=i\}| &= |\{x \in {\mathbb{N}} \; \ \eta^{\downarrow}_{k}(x)=1, \xi_{k}(x) = i - k\}|, \end{align*} $$

and similarly,

$$ \begin{align*} |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k+1}(x)=1, T\xi_{k}(x)=i+1\}| & = |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k+1}(x)=1, \xi_{k}(x) = i - k + 1\}|. \end{align*} $$

Hence, by Lemma 3.6,

$$ \begin{align*} (T\zeta)_{k}(i) &= |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k}(x)=1, \xi_{k}(x)=i-k\}| \\ & \quad - |\{x \in {\mathbb{N}} ; \ \eta^{\downarrow}_{k+1}(x)=1, \xi_{k}(x)=i - k + 1\}| \\ &=\zeta_{k}(i-k).\\[-38pt] \end{align*} $$

4.1. Definition of the rigged configuration

Let us recall some basic notions. A partition $\mu =(\mu _1\ge \mu _2 \ge \cdots \ge 0)$ is a weakly decreasing sequence of nonnegative integers that eventually becomes zero. Partitions are naturally represented by their Young diagrams and often the two notions are interchanged. The conjugate partition of $\mu $ , denoted by $\lambda $ , is the partition defined by $\lambda _k = |\{i \in {\mathbb {N}} \ : \ \mu _i \ge k \}|$ , for $k \in {\mathbb {N}}$ . For any k, the multiplicity of k in $\mu $ is $m_k(\mu ) := \lambda _k-\lambda _{k+1}$ ; we will often suppress the dependence from $\mu $ to lighten the notation. A rigging of a partition $\mu $ is a collection of arrays $\mathbf {J} = \left \{ J_{k} \ : \ 1 \le k \le \mu _1 \right \}$ such that

$$ \begin{align*} J_{k} = (J_{k,1},\dots, J_{k,m_k}), \qquad \text{with} \qquad -k \le J_{k,1} \le \cdots \le J_{k,m_k} \end{align*} $$

and $J_{k} = \varnothing $ if $m_k=0$ . A pair $(\mu ,\mathbf {J})$ consisting of a partition and its rigging is called a (rank one) rigged configuration and we denote the set of them by $RC$ . See Figure 9 for example of a rigged configuration.

Figure 9 A partition $\mu $ and its conjugate on the left and a rigged configuration $(\mu ,\mathbf {J})$ on the right.

Rigged configurations are in bijections with ball configurations $\eta \in \Omega _{< \infty }$ . In the literature, such a bijection takes the name of the Kerov–Kirillov–Reschetikhin (KKR) bijection [Reference Kerov, Kirillov and ReshetikhinKKR, Reference Kuniba, Okado, Sakamoto, Takagi and YamadaKOSTY] and we recall it below. Starting from $\eta $ , we will sequentially construct rigged configurations $(\mu (x),\mathbf {J}(x))$ for ${x=0,1,\dots }$ in such a way that $(\mu (x),\mathbf {J}(x))$ is a function of $\eta (1),\dots ,\eta (x)$ and $(\mu ,\mathbf {J}) = \lim _{x\to \infty }(\mu (x),\mathbf {J}(x))$ will be the rigged configuration associated with $\eta $ . Abusing notation, we will denote the arrays in rigging $\mathbf {J}(x)$ by $J_{k}(x)$ . For any $k \in {\mathbb {N}}$ and $x\ge 0$ , define the k-th vacancy at x as

$$ \begin{align*} p_k(x) = x - 2 E_{k}(x), \end{align*} $$

where $E_{k}(x)$ is called the k-th energy defined as

$$ \begin{align*} E_{k}(x) := \sum_{i \in {\mathbb{N}}} \min \left\{\mu_i(x),k \right\}.\end{align*} $$

In case $\mu _i(x)=k$ and $p_k(x) = J_{k,{m_{k}}}(x)$ for some i and k, we say that $(\mu _i(x),J_{k,{m_{k}}}(x))$ is a singular row of length k of $(\mu (x),\mathbf {J}(x))$ . For examples of singular rows, see Figure 10. Each partition corresponds to $\mu (x)$ , and the number on the left-hand (resp. right-hand) side of the row with length k is the value of $p_{k}(x)$ (resp. $J_{k}(x)$ ) at some x. The leftmost rigged configuration has two singular rows, and the middle one has one singular row, but the rightmost one has no singular row.

Figure 10 Some examples of partitions with riggings and vacancies. We note that the leftmost rigged configuration corresponds to $\eta = 1110011$ , the middle one to $\eta = 111000011$ and the rightmost one to $\eta = 1110001100$ . We highlighted singular rows writing the corresponding rigging in boldface.

Figure 11 The computation of the KKR bijection corresponding to the configuration $\eta = 110011101100011000\dots $ . Integers at the left of each partition represent the vacancies $p_k(x)$ associated with each group of rows of the same length k, while the integers at the right of each diagram represent the rigging $\mathbf {J}$ . We have highlighted singular rows by writing the corresponding component of the rigging in boldface.

To construct the sequence $(\mu (x),\mathbf {J}(x))$ , we set $\mu (0)= \varnothing $ and $\mathbf {J}(0) = \varnothing $ . Assuming that we have determined $(\mu (x),\mathbf {J}(x))$ , we will construct $(\mu (x+1),\mathbf {J}(x+1))$ as a function of $\eta (x+1)$ . If $\eta (x+1) = 0$ , then we set $(\mu (x+1),\mathbf {J}(x+1)) = (\mu (x),\mathbf {J}(x))$ . On the other hand, if $\eta (x+1)=1$ , we look for the singular row $(\mu (x),J_{k,{m_{k}}}(x))$ of $(\mu (x),\mathbf {J}(x))$ of maximal length k. Then we replace such row with a singular row of length $k+1$ . If there are no singular rows, then we simply create a singular row of length 1. Since we assume that $\eta $ has only finitely many balls, it is clear that from a certain x onward $(\mu (x), \mathbf {J}(x))$ stabilizes and the result is the desired rigged configuration $(\mu , \mathbf {J})$ . Note that even for general $\eta \in \Omega $ , $(\mu (x), \mathbf {J}(x))$ is well defined for any $x \in {\mathbb {Z}}_{\ge 0}$ , but it may not stabilize. One can easily see that, starting from a rigged configuration $(\mu , \mathbf {J})$ , it is possible to compute the algorithm just described in reverse and associate uniquely a ball configuration $\eta \in \Omega _{< \infty }$ .

In Figure 11, we show the computation of the KKR bijection relating the ball configuration $\eta = 11001110110001100000\dots $ with the rigged configuration

For further examples and for generalizations of the KKR bijection, we invite the reader to consult [Reference Inoue, Kuniba and TakagiIKT] and references therein.

The KKR bijection is extremely important in the study of the BBS as in the rigged configuration, the dynamics becomes linear. The following proposition recalls a result from [Reference Kuniba, Okado, Sakamoto, Takagi and YamadaKOSTY].

Theorem 4.1 [Reference Kuniba, Okado, Sakamoto, Takagi and YamadaKOSTY].

Let $\eta \in \Omega _{< \infty }$ be a configuration associated with the rigged configuration $(\mu ,\mathbf {J})$ under the KKR bijection. Then for any $k \in {\mathbb {N}}$ and $\ell \in {\mathbb {N}} \cup \left \{ \infty \right \}$ , we have $T\mu = \mu $ , and

$$ \begin{align*} (T_{\ell}\mathbf{J})_{k} = \left( J_{k,j} + k \wedge \ell; 1 \le j \le m_k \right). \end{align*} $$

Remark 4.1. In [Reference Inoue, Kuniba and TakagiIKT], relations between rigged configurations and BBS were explained through the formalism of the theory of crystals. In this formalism, the energy function $E_k$ can be expressed as a certain sum over a more refined quantity called local energy which is function of a tensor product of two crystals [Reference Fukuda, Yamada and OkadoFOY]. For our model, such local energy can be given in term of the function $\tilde {H} : \{0,1 \} \times B \to \{0,1 \}$ , $B := \{(k,\ell ); k \in {\mathbb {N}}, 0 \le \ell \le k \}$ , given by

$$ \begin{align*} \tilde{H}(a,(k,\ell)) := \min\left\{ a, k - \ell \right\}, \end{align*} $$

using which we can represent $E_k$ as

$$ \begin{align*} E_{k}(x) = \sum_{y = 1}^{x} \tilde{H}\left(\eta(y),(k,W_{k}(y-1)) \right). \end{align*} $$

Here, recall that $W_k$ is the carrier with capacity k. There is a direct relation between $\tilde {H}$ and seat numbers. Actually, from the above representation of $E_{k}$ and Equation (2.14), we obtain

$$ \begin{align*} \tilde{H}\left(\eta(x),(k,W_{k}(x-1)) \right) = \sum_{\ell = 1}^{k} \eta^{\uparrow}_{\ell}(x). \end{align*} $$

From this relation, we can also deduce that values of $\eta ^{\uparrow }_{k}(x)$ , or rather their sums, represent the local energy of the BBS.

4.2. A pair of interlacing Young diagrams with riggings

In this subsection, we introduce a new algorithm to obtain a sequence of pairs of Young diagrams from a ball configuration $\eta \in \Omega $ . Then, we prove that the rigged configuration obtained by the KKR bijection is understood as a projection from the pair of Young diagrams to the first component.

For a pair of Young diagrams $(\mu ^{\uparrow }, \mu ^{\downarrow })$ , we say that the pair is interlacing if

$$\begin{align*}\mu^{\uparrow}_1 \ge \mu^{\downarrow}_1 \ge \mu^{\uparrow}_2 \ge \mu^{\downarrow}_2 \ge \dots \end{align*}$$

holds, where we use the convention that for a given partition $\mu $ , $\mu _{i} = 0$ for any $i> \lambda _{1}$ . The interlacing condition is equivalent to

(4.1) $$ \begin{align} \lambda^{\uparrow}_k - \lambda^{\downarrow}_k \in \{0,1\}, \end{align} $$

for any $k \ge 1$ where $\lambda ^{\sigma }$ is the conjugate of $\mu ^{\sigma }$ for $\sigma \in \{ \uparrow , \downarrow \}$ .

We introduce

$$ \begin{align*} k^{\uparrow}& :=\sup \{ k \ge 1 ; \ \lambda^{\uparrow}_{\ell} - \lambda^{\downarrow}_{\ell}=1, \ 1 \le \forall \ell \le k \} \\ & =\sup \{ k \ge 1 ; \ \sum_{\ell=1}^k(\lambda^{\uparrow}_{\ell} - \lambda^{\downarrow}_{\ell})=k \} \end{align*} $$

and

$$ \begin{align*} k^{\downarrow}& :=\sup \{ k \ge 1 ; \ \lambda^{\uparrow}_{\ell} - \lambda^{\downarrow}_{\ell}=0, \ 1 \le \forall \ell \le k \} \\ & =\sup \{ k \ge 1 ; \ \sum_{\ell=1}^k(\lambda^{\uparrow}_{\ell} - \lambda^{\downarrow}_{\ell})=0 \} \end{align*} $$

with convention $\sup \emptyset = 0$ . Note that $ k^{\uparrow } < \infty $ for any pair of interlacing Young diagrams $(\mu ^{\uparrow }, \mu ^{\downarrow })$ but $k^{\downarrow }=\infty $ if and only if $\mu ^{\uparrow } = \mu ^{\downarrow }$ .

The next lemma is rather straightforward, but we state it for clarity.

Now, for a given $\eta \in \Omega $ , we construct a growing sequence of pairs of interlacing Young diagrams $(\mu ^{\uparrow }(x), \mu ^{\downarrow }(x))_{x \in {\mathbb {Z}}_{\ge 0}}$ .

Set $\mu ^{\sigma }(0)=\emptyset $ for $\sigma =\uparrow , \downarrow $ . For $x \ge 0$ , we construct $\mu ^{\uparrow }(x+1), \mu ^{\downarrow }(x+1) $ as a function of $\mu ^{\uparrow }(x), \mu ^{\downarrow }(x)$ and $\eta (x+1)$ by the algorithm explained below.

1. 1. If $\eta (x+1)=1$ , then $\mu ^{\downarrow }(x+1)=\mu ^{\downarrow }(x)$ and $\mu ^{\uparrow }(x+1)$ is obtained by adding a box to $\mu ^{\uparrow }(x)$ at one of the row(s) satisfying $\mu _i^{\uparrow }(x)=k^{\uparrow }(x)$ . In other words,

   $$\begin{align*}\lambda_k^{\uparrow}(x+1)=\lambda_k^{\uparrow}(x) \end{align*}$$
   for any $k \neq k^{\uparrow }(x)+1$ and
   $$\begin{align*}\lambda_{k^{\uparrow}(x)+1}^{\uparrow}(x+1)=\lambda^{\uparrow}_{k^\uparrow(x)+1}(x)+1. \end{align*}$$
   Then, by Lemma 4.1, $(\mu ^{\uparrow }(x+1), \mu ^{\downarrow }(x+1))$ is also a pair of interlacing Young diagrams.

2. 2. If $\eta (x+1) =0$ and $\mu ^{\uparrow }(x) \neq \mu ^{\downarrow }(x)$ , then $\mu ^{\uparrow }(x+1)=\mu ^{\uparrow }(x)$ and $\mu ^{\downarrow }(x+1)$ is obtained by adding a box to $\mu ^{\downarrow }(x)$ at one of the row(s) satisfying $\mu _i^{\downarrow }(x)=k^{\downarrow }(x)$ as for the first case. Then, by Lemma 4.1 again, $(\mu ^{\uparrow }(x+1), \mu ^{\downarrow }(x+1))$ is also a pair of interlacing Young diagrams.

3. 3. If $\eta (x+1) =0$ and $\mu ^{\uparrow }(x)=\mu ^{\downarrow }(x)$ , then we set $(\mu ^{\uparrow }(x+1), \mu ^{\downarrow }(x+1))= (\mu ^{\uparrow }(x), \mu ^{\downarrow }(x))$ .

In Figure 12, an example of the process of construction of $(\mu ^{\uparrow }(x), \mu ^{\downarrow }(x))$ is shown. Now, we observe that by comparing Figures 2 and 12, the relation $\lambda ^{\uparrow }_{k}(x) - \lambda ^{\downarrow }_{k}(x) = \mathcal {W}_{k}(x)$ holds for our working example. Actually, we can prove the same relation for any ball configuration $\eta \in \Omega $ as follows.

Proposition 4.1. Suppose that $\eta \in \Omega $ . Then, the following relation between the seat-numbers and the pair of interlacing Young diagrams

(4.2) $$ \begin{align} \lambda_k^{\sigma}(x)=\sum_{y=1}^x \eta^{\sigma}_{k}(y), \end{align} $$

holds for any $\sigma =\uparrow , \downarrow $ , $x \ge 0$ and $k \in {\mathbb {N}}$ . In particular, we have

$$ \begin{align*} \mathcal{W}_{\ell}(x) = \lambda^{\uparrow}_{\ell}(x)-\lambda^{\downarrow}_{\ell}(x), \end{align*} $$

and

$$ \begin{align*} m^{\sigma}_{k}(x) = \lambda_k^{\sigma}(x) - \lambda_{k+1}^{\sigma}(x), \end{align*} $$

where $m^{\sigma }_{k}(x)$ is defined in Equation (2.8). In addition,

(4.3) $$ \begin{align} k^{\uparrow}(x) &= \sup \{k \ge 1 ; \ \mathcal{W}_{\ell}(x)=1, \text{ for all} \ 1 \le \ell \le k\}, \\ k^{\downarrow}(x) &= \sup \{k \ge 1 ; \ \mathcal{W}_{\ell}(x)=0, \textrm{ for all} \ 1 \le \ell \le k\}.\nonumber \end{align} $$

Figure 12 Construction of the pair of interlacing Young diagrams from the ball configuration $\eta = 110011101100011000\dots $ . In this figure, $(\mu ^{\uparrow }(x), \mu ^{\downarrow }(x))$ are superimposed. The symbols $\uparrow $ and $\downarrow $ indicate the shape of Young diagram $\mu ^{\uparrow }(x)$ and $\mu ^{\downarrow }(x)$ , respectively, and indicates the overlapped area.

Proof. We prove this by induction on x. The statement clearly holds if $x=0$ . Then, suppose Equation (4.2) holds for some $x \in {\mathbb {Z}}_{\ge 0}$ for any $\sigma =\uparrow , \downarrow $ and $k \in {\mathbb {N}}$ . Then,

$$\begin{align*}\lambda_k^{\uparrow}(x) - \lambda_k^{\downarrow}(x) =\sum_{y=1}^x\eta^{\uparrow}_{k}(y) - \sum_{y=1}^x\eta^{\downarrow}_{k}(y) = \mathcal{W}_k(x). \end{align*}$$

Now, suppose $\eta (x+1)=1$ . Then, by this characterization and the definition of the seat-number configuration, $\eta ^{\uparrow }_{k^{\uparrow }(x)+1}(x+1)=1$ . This implies

$$\begin{align*}\sum_{y=1}^{x+1}\eta^{\sigma}_{k}(y) -\sum_{y=1}^{x}\eta^{\sigma}_{k}(y) = \mathbf{1}_{\{k= k^{\uparrow}(x)+1, \sigma=\uparrow\}}. \end{align*}$$

On the other hand, by construction of the sequence of interlacing Young diagrams,

(4.4) $$ \begin{align} \lambda_k^{\sigma}(x+1) -\lambda_k^{\sigma}(x) = \mathbf{1}_{\{k= k^{\uparrow}(x)+1, \sigma=\uparrow\}}. \end{align} $$

Hence, by combining Equation (4.4) with the induction assumption, the equality

$$\begin{align*}\lambda_k^{\sigma}(x+1) = \sum_{y=1}^{x+1}\eta^{\sigma}_{k}(y) \end{align*}$$

holds for any $\sigma $ and k if $\eta (x+1)=1$ . For the case $\eta (x+1)=0$ , $r(x+1)=1$ if $W_{\infty }(x)=0$ and $\eta ^{\downarrow }_{k^{\downarrow }(x)+1}(x+1)=1$ if $W_{\infty }(x) \neq 0$ . Noting that $\mu ^{\uparrow }(x)=\mu ^{\downarrow }(x)$ is equivalent to $k^{\downarrow }(x)=\infty $ , and so to $W_{\infty }(x)=0$ , we can also prove the result in the same manner.

Next, to reveal the relation with the original KKR bijection, we introduce the k-th $\sigma $ energy $E^{\sigma }_k(x)$ and the k-th $\sigma $ vacancy $p^{\sigma }_k(x)$ as

$$\begin{align*}E^{\sigma}_k(x) := \sum_{i \in {\mathbb{N}}} \min\{ \mu^{\sigma}_{i}(x), k\}, \quad p^{\sigma}_k(x) := x - 2 E^{\sigma}_k(x). \end{align*}$$

Since

$$\begin{align*}\sum_{i \in {\mathbb{N}}} \min\{ \mu^{\sigma}_i(x), k\} = \sum_{i \in {\mathbb{N}}} \sum_{\ell=1}^k \mathbf{1}_{\{\mu^{\sigma}_i(x) \ge \ell\}} = \sum_{\ell=1}^k \lambda_{\ell}^{\sigma}(x), \end{align*}$$

by Proposition 4.1, we can also rewrite

$$\begin{align*}E^{\sigma}_k(x) =\sum_{\ell=1}^k \sum_{y=1}^x\eta^{\sigma}_{k}(y) \end{align*}$$

and

$$ \begin{align*} p^{\sigma}_k(x) & = x - 2 \sum_{\ell=1}^k \sum_{y=1}^x\eta^{\sigma}_{k}(y) = x - \sum_{\ell=1}^k \sum_{y=1}^x(\eta^{\sigma}_{k}(y) + \eta^{\check{\sigma}}_{k}(y)) - \sum_{\ell=1}^k \sum_{y=1}^x(\eta^{\sigma}_{k}(y) - \eta^{\check{\sigma}}_{k}(y))\\ & =\xi_k(x) - \sum_{\ell=1}^k \mathcal{W}^{\sigma}_{\ell}(x), \end{align*} $$

where $\check {\sigma }$ is the opposite arrow to $\sigma $ , $\mathcal {W}^{\uparrow }_k=\mathcal {W}_k$ and $\mathcal {W}^{\downarrow }_k=-\mathcal {W}_k$ .

The following property of the k-th $\sigma $ vacancy is useful for understanding the relation between the seat number configuration and the riggings.

Proof. Let us only show (1); as the proof (2) is completely analogous. Since $\eta ^{\uparrow }_k(x)=1$ implies $\mathcal {W}_{\ell }(x)=1$ for all $1 \le \ell \le k$ , Equation (4.5) holds. Let $x' \ge x$ . Then,

$$\begin{align*}p^{\uparrow}_k(x') - p^{\uparrow}_k(x) = \xi_k(x') -\xi_k(x) + k-\sum_{\ell=1}^k\mathcal{W}_{\ell}(x') \end{align*}$$

and $\xi _k(x') -\xi _k(x) \ge 0$ , $k-\sum _{\ell =1}^k\mathcal {W}_{\ell }(x') \ge 0$ implies the inequality $p^{\uparrow }_k(x) \le p^{\uparrow }_k(x')$ . The last condition in the statement is equivalent to $\xi _k(x') -\xi _k(x)=0$ and $k-\sum _{\ell =1}^k\mathcal {W}_{\ell }(x')=0$ , which is obviously equivalent to $p^{\uparrow }_k(x) = p^{\uparrow }_k(x')$ .

We now introduce refined riggings $\mathbf {J}^{\sigma }(x)=(J_k^{\sigma }(x), \ 1 \le k \le \mu ^{\sigma }_1(x))$ such that $J^{\sigma }_k(x)=(J^{\sigma }_{k,j}(x), \ 1 \le j \le m^{\sigma }_k(x))$ , where $m^{\sigma }_k(x)=\lambda ^{\sigma }_k(x)-\lambda ^{\sigma }_{k+1}(x) =|\{i ; \mu ^{\sigma }_i(x) =k\}|$ from Proposition 4.1. We order them as

$$\begin{align*}J^{\sigma}_{k,1}(x) \le J^{\sigma}_{k,2}(x) \dots \le J^{\sigma}_{k,m^{\sigma}_k(x)}(x) \end{align*}$$

to make the notation simple in the following argument. We define the riggings recursively, although later in the same subsection, we will show that they can be defined more directly in terms of seat numbers.

Let $\mathbf {J}^{\sigma }(0)=\emptyset $ for $\sigma =\uparrow , \downarrow $ . We will construct $\mathbf {J}^{\sigma }(x+1)$ from $\mathbf {J}^{\sigma }(x)$ by considering three cases separately.

Case 1: η _k ^σ (x + 1) = 0 for all k. If $\eta _k^{\sigma }(x+1)=0$ for all k, or equivalently $\mu ^{\sigma }(x+1)=\mu ^{\sigma }(x)$ , then we also keep the rigging as $\mathbf {J}^{\sigma }(x+1)=\mathbf {J}^{\sigma }(x)$ .

Case 2: η ₁ ^σ (x + 1) = 1. If $\eta _1^{\sigma }(x+1)=1$ , or equivalently a row of length $1$ is added to obtain $\mu ^{\sigma }(x+1)$ from $\mu ^{\sigma }(x)$ , we append the value $p^{\sigma }_{1}(x+1)$ to $J^{\sigma }_{1}(x)$ and obtain $J^{\sigma }_{1}(x+1)$ . More precisely,

$$\begin{align*}J^{\sigma}_{\ell}(x+1)=J^{\sigma}_{\ell}(x) \quad \ell \neq 1 \end{align*}$$

and

$$\begin{align*}J^{\sigma}_{1}(x+1) = (J^{\sigma}_{1,1}(x), \dots J^{\sigma}_{1,m^{\sigma}_{1}(x)}(x) , p^{\sigma}_{1}(x+1)). \end{align*}$$

Case 3: η _k+1 ^σ (x + 1) = 1 for some k ≥ 1. If $\eta _{k+1}^{\sigma }(x+1)=1$ for some $k \ge 1$ , or equivalently a row of length k is replaced by one of length $k+1$ to obtain $\mu ^{\sigma }(x+1)$ from $\mu ^{\sigma }(x)$ , we remove the largest entry from $J^{\sigma }_k(x)$ and append $p^{\sigma }_{k+1}(x+1)$ to $J^{\sigma }_{k+1}(x)$ to obtain rigging $\mathbf {J}^{\sigma }(x+1)$ . More precisely,

$$\begin{align*}J^{\sigma}_{\ell}(x+1)=J^{\sigma}_{\ell}(x) \quad \ell \neq k, k+1, \end{align*}$$

$$\begin{align*}J^{\sigma}_{k}(x+1)= (J^{\sigma}_{k,1}(x), \dots, J^{\sigma}_{k,m^{\sigma}_k(x)-1}(x)) \end{align*}$$

and

$$\begin{align*}J^{\sigma}_{k+1}(x+1) =(J^{\sigma}_{k+1,j}(x), \dots, J^{\sigma}_{k+1,m^{\sigma}_{k+1}(x)}(x), p^{\sigma}_{k+1}(x+1)). \end{align*}$$

Now, we analyze properties of this newly defined rigging. By the way of construction, it is clear that for any $J^{\sigma }_{k,j}(x)$ in the rigging $\mathbf {J}^{\sigma }(x)$ , there exists $y \le x$ such that $\eta ^{\sigma }_k(y)=1$ and $J^{\sigma }_{k,j}(x)=p^{\sigma }_k(y)$ , which is not necessarily unique. In the next proposition, we give an explicit expression of one of such $y=y(x,k,j,\sigma )$ . For $1 \le j \le m^{\sigma }_k(x)$ , let

$$\begin{align*}t_k^{\sigma}(x,j):=\max \{ y \le x ; \ m^{\sigma}_k(y)=j, \eta^{\sigma}_k(y)=1\}. \end{align*}$$

Since $|m^{\sigma }_k(y+1)-m^{\sigma }_k(y)| \le 1$ for any y, $m^{\sigma }_k(0)=0$ and $m^{\sigma }_k(y)$ increases only when $\eta ^{\sigma }_k(y)=1$ , the above set is not empty, namely $1 \le t_k^{\sigma }(x,j) \le x$ . Moreover, $t_k^{\sigma }(x,1) < t_k^{\sigma }(x,2 ) < \cdots < t_k^{\sigma }(x,m^{\sigma }_k(x))$ .

Proposition 4.2. For any $x \in {\mathbb {Z}}_{\ge 0}, k \in {\mathbb {N}}$ , $\sigma \in \{\uparrow ,\downarrow \}$ and $1 \le j \le m^{\sigma }_k(x)$ , we have

(4.6) $$ \begin{align} J^{\sigma}_{k,j}(x)=p^{\sigma}_k(t_k^{\sigma}(x,j)). \end{align} $$

Proof. We prove Equation (4.6) by induction on x. For $x=0$ , the equality trivially holds as there is no j satisfying $1 \le j \le m^{\sigma }_k(x)$ . Next, suppose Equation (4.6) holds for some $x \in {\mathbb {Z}}_{\ge 0}$ and for any $k, \sigma $ and $1 \le j \le m^{\sigma }_k(x)$ . We prove that the same holds for $x+1$ by considering three cases separately as above.

Case 1: η _k ^σ (x + 1) = 0 for all k. Then by definition, $m^{\sigma }_k(x+1)=m^{\sigma }_k(x)$ and $t_k^{\sigma }(x+1,j)=t^{\sigma }_k(x,j)$ for any $k, \sigma $ and $1 \le j \le m^{\sigma }_k(x+1)$ . Also, $\mathbf {J}^{\sigma }(x+1)=\mathbf {J}^{\sigma }(x)$ . Hence,

$$\begin{align*}J^{\sigma}_{k,j}(x+1)=J^{\sigma}_{k,j}(x) = p^{\sigma}_k(t_k^{\sigma}(x,j)) = p^{\sigma}_k(t_k^{\sigma}(x+1,j)) \end{align*}$$

holds for any $k, \sigma $ and $1 \le j \le m^{\sigma }_k(x+1)$ .

Case 2: η ₁ ^σ (x + 1) = 1. If $\eta ^{\sigma }_1(x+1)=1$ , then as in Case 1, for any $\ell \neq 1$ and $1 \le j \le m^{\sigma }_\ell (x+1)$ ,

$$\begin{align*}J^{\sigma}_{\ell,j}(x+1)=J^{\sigma}_{\ell,j}(x) =p^{\sigma}_\ell (t_\ell^{\sigma}(x,j)) = p^{\sigma}_\ell (t_\ell^{\sigma}(x+1,j)) \end{align*}$$

holds. On the other hand, for $\ell = 1$ , $m^{\sigma }_{1}(x+1)=m^{\sigma }_1(x)+1$ and $t_1^{\sigma }(x+1,m^{\sigma }_{1}(x+1))=x+1$ . Moreover, by Lemma 4.2, for any $1\le j \le m^{\sigma }_1(x)$ ,

$$\begin{align*}J^{\sigma}_{1,j}(x) = p^{\sigma}_1(t_1^{\sigma}(x,j)) \le p^{\sigma}_1(x+1) \end{align*}$$

since $\eta ^{\sigma }_1(t_1^{\sigma }(x,j))=1$ . Hence, as we order

$$\begin{align*}J^{\sigma}_{k,1}(x+1) \le J^{\sigma}_{k,2}(x+1) \le \dots \le J^{\sigma}_{k,m^{\sigma}_1(x+1)}(x+1), \end{align*}$$

we have $J^{\sigma }_{1,j}(x+1)=J^{\sigma }_{1,j}(x)$ for any $1\le j \le m^{\sigma }_1(x)$ and $J^{\sigma }_{1,m^{\sigma }_{1}(x+1)}=p^{\sigma }_1(x+1)$ . Hence, for $j=m^{\sigma }_{1}(x+1)$ ,

$$\begin{align*}J^{\sigma}_{1,j}(x+1)=p^{\sigma}_1(x+1)= p^{\sigma}_1(t_1^{\sigma}(x+1,m^{\sigma}_{1}(x+1))) = p^{\sigma}_1(t_1^{\sigma}(x+1,j)) \end{align*}$$

holds. Also, for $1 \le j \le m^{\sigma }_1(x)$ , by the definition of $t_1^{\sigma }(x,j)$ , it is obvious that $t_1^{\sigma }(x+1,j)=t_1^{\sigma }(x,j)$ and so

$$\begin{align*}J^{\sigma}_{1,j}(x+1)=p^{\sigma}_1(t_1^{\sigma}(x+1,j)) \end{align*}$$

holds as well.

Case 3: η _k+1 ^σ (x + 1) = 1 for some k ≥ 1. If $\eta ^{\sigma }_{k+1}(x+1)=1$ , then as in Case 1, for any $\ell \neq k, k+1$ and $1 \le j \le m^{\sigma }_\ell (x+1)$ ,

$$\begin{align*}J^{\sigma}_{\ell,j}(x+1)= p^{\sigma}_\ell (t_\ell^{\sigma}(x+1,j)) \end{align*}$$

holds. Also, for $\ell =k+1$ , the same relation holds by exactly the same argument as in Case 2. Finally, for $\ell =k$ , $m^{\sigma }_{k}(x+1)=m^{\sigma }_k(x)-1$ and for any $1 \le j \le m^{\sigma }_{k}(x+1)$ , we have $t_k^{\sigma }(x+1,j)=t_k^{\sigma }(x,j)$ , $J^{\sigma }_{k,j}(x+1)=J^{\sigma }_{k,j}(x)$ by definition. Hence,

$$\begin{align*}J^{\sigma}_{k,j}(x+1)=p^{\sigma}_k(t_k^{\sigma}(x+1,j)) \end{align*}$$

holds for any $1 \le j \le m^{\sigma }_{k}(x+1)$ . This completes the proof.

Finally, we prove that $k^{\uparrow }$ and $k^{\downarrow }$ can be characterized in terms of the rigging and the traditional singular condition. We say $\mu _i^{\sigma }(x)$ is a singular row of $(\mu ^{\sigma }(x), \mathbf {J}^{\sigma }(x))$ if $p^{\sigma }_k(x)=J^{\sigma }_{k,m^{\sigma }_{k}(x)}(x)$ , where $k=\mu _i^{\sigma }(x)$ .

Proposition 4.3. Assume the convention that $\max \emptyset =0$ . Then,

$$\begin{align*}k^{\uparrow}(x)= \max_i \{\mu^{\uparrow}_i(x) ; \ \mu^{\uparrow}_i(x) \text{ is singular} \}. \end{align*}$$

Also, if $\mu ^{\uparrow }(x) \neq \mu ^{\downarrow }(x)$ , then

$$\begin{align*}k^{\downarrow}(x)= \max_i \{\mu^{\downarrow}_i(x) ; \ \mu^{\downarrow}_i(x) \text{ is singular} \}. \end{align*}$$

Proof. If $\mu _i^{\sigma }(x)$ is singular, then for $k=\mu _i^{\sigma }(x)$ , we have

$$\begin{align*}p^{\sigma}_k(x)=J^{\sigma}_{k,m^{\sigma}_{k}(x)}(x) = p^{\sigma}_k\left(t_k^{\sigma}\left(x,m^{\sigma}_{k}(x)\right)\right), \end{align*}$$

where we apply Proposition 4.2 for the second equality. Then, since $x \ge t_k^{\sigma }\left (x,m^{\sigma }_{k}(x)\right )$ and $\eta ^{\sigma }_k\left (t_k^{\sigma }(x,m^{\sigma }_{k}(x)) \right )=1$ , by Lemma 4.2, we have $\sum _{\ell =1}^k \mathcal {W}_{\ell }(x)=k$ if $\sigma =\uparrow $ and $\sum _{\ell =1}^k \mathcal {W}_{\ell }(x)=0$ if $\sigma =\downarrow $ . Thus, from Equation (4.3), we obtain

$$\begin{align*}k^{\sigma}(x) \ge \max_i \{\mu^{\sigma}_i(x) ; \ \mu^{\sigma}_i(x) \text{ is singular} \}. \end{align*}$$

Hence, it is sufficient to prove that if $1 \le k^{\sigma }(x) < \infty $ , then the row satisfying $\mu ^{\sigma }_i(x)=k^{\sigma }(x)$ exists in $\mu ^{\sigma }(x)$ and it is singular. In the rest of the proof, we prove this assertion.

Suppose $1 \le k^{\sigma }(x) < \infty $ . Observe that at least one row with length $k^{\sigma }$ exists in $\mu ^{\sigma }(x)$ . To simplify the notation, denote $k^{\sigma }(x)$ by $k^*$ . Since $\lambda ^{\sigma }_{k^*} (x) \ge 1$ and $\lambda ^{\sigma }_{k^*} (x)=\sum _{y=1}^{x}\eta ^{\sigma }_{k^*}(y)$ , we define $x^*$ as the maximal y satisfying $y \le x$ and $\eta ^{\sigma }_{k^*}(y)=1$ , or in formula

$$\begin{align*}x^* :=\max\{y ; \ y \le x \ , \ \eta^{\sigma}_{k^*}(y)=1 \}. \end{align*}$$

From now on, we consider the case $\sigma =\uparrow $ . Then, from Lemma 3.1 (i), for any $1 \le \ell \le k^*$ , we have $\mathcal {W}_{\ell }(x^*)=1$ . Also, from Equation (4.3), for any $1 \le \ell \le k^*$ , $ \mathcal {W}_{\ell }(x)=1$ and $\mathcal {W}_{k^*+1}(x)=0$ . Hence, we have

$$\begin{align*}\mathcal{W}_{k^*}(x) - \mathcal{W}_{k^*}(x^*) =\sum_{y=x^*+1}^x (\eta_{k^*}^{\uparrow}(y) -\eta_{k^*}^{\downarrow}(y) )=0. \end{align*}$$

On the other hand, by the construction of $x^*$ ,

(4.7) $$ \begin{align} \sum_{y=x^*+1}^x \eta_{k^*}^{\uparrow}(y) =0. \end{align} $$

Hence, $\sum _{y=x^*+1}^x \eta _{k^*}^{\uparrow }(y)= \sum _{y=x^*+1}^x \eta _{k^*}^{\downarrow }(y)=0$ . This implies that the seat $k^*$ is occupied for any $y \in [x^*, x]$ and therefore

(4.8) $$ \begin{align} \sum_{\ell \ge k^*+1}\sum_{y=x^*+1}^x \eta_{\ell}^{\downarrow}(y)=0, \end{align} $$

since if a ball leaves a seat $\ell \ge k^*+1$ , then the ball at seat $k^*$ must have already left. Then, from Equation (2.5), Equation (4.8) and $\mathcal {W}_{k^*+1}(x)=0$ , we also have $\sum _{y=x^*+1}^x \eta _{k^*+1}^{\uparrow }(y)=0$ . Namely, the seat $k^* +1$ is empty for any $y \in [x^*, x]$ . This also implies that

(4.9) $$ \begin{align} \sum_{\ell \ge k^*+1}\sum_{y=x^*+1}^x \eta_{\ell}^{\uparrow}(y)=0. \end{align} $$

Finally, since the seat $k^*$ is occupied for any $y \in [x^*, x]$ , it is obvious that

(4.10) $$ \begin{align} \sum_{y=x^*+1}^x r(y)=0. \end{align} $$

Combining Equations (4.8),(4.9) and (4.10), we have

$$\begin{align*}\sum_{\ell \ge k^*+1}\sum_{y=x^*+1}^x( \eta_{\ell}^{\uparrow}(y) + \eta_{\ell}^{\downarrow}(y)) + \sum_{y=x^*+1}^x r(y)=0. \end{align*}$$

Then, from Equation (4.3) and Lemma 4.2, we have

$$\begin{align*}p_{k^*}^{\uparrow}(x^*)= p_{k^*}^{\uparrow}(x). \end{align*}$$

Finally, we check that $x^*=t^{\uparrow }_{k^*}(x,m_{k^*}^{\uparrow }(x))$ . For this, we only need to prove that $m^{\uparrow }_{k^*}(x^*)=m_{k^*}^{\uparrow }(x)$ and this is equivalent to $\sum _{y=x^*+1}^x \eta ^{\uparrow }_{k^*}(y)= \sum _{y=x^*+1}^x \eta ^{\uparrow }_{k^* +1}(y)$ , which is true as this is $0$ as shown in Equations (4.7) and (4.9). Consequently, we have $J^{\uparrow }_{k^*,m_{k^*}^{\uparrow }(x)}(x)= p_{k^*}^{\uparrow }(t^{\uparrow }_{k^*}(x,m_{k^*}^{\uparrow }(x))) = p_{k^*}^{\uparrow }(x)$ , and so there exists at least one singular row with length $k^{*}$ .

For the case $\sigma =\downarrow $ , by using $\mu ^{\uparrow }(x) \neq \mu ^{\downarrow }(x)$ , the exactly same argument works.

4.3. Proof of Proposition 2.2

In the last subsection, we have constructed the sequence of rigged Young diagrams $(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ satisfying all the properties claimed in Proposition 2.2 if we replace $(\mu (x),\mathbf {J}(x))$ by $(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ . Hence, we only need to prove that $(\mu (x),\mathbf {J}(x))=(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ . By Proposition 4.3, we can construct $(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ by the algorithm without using information from $(\mu ^{\downarrow }(x))_{x}$ to update as follows: Let $\mu ^{\uparrow }(0)=\emptyset $ and $\mathbf {J}^{\uparrow }(0)=\emptyset $ . Once $(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ is given, we construct $(\mu ^{\uparrow }(x+1),\mathbf {J}^{\uparrow }(x+1))$ as follows. If $\eta (x+1)=0$ , we set $(\mu ^{\uparrow }(x+1),\mathbf {J}^{\uparrow }(x+1))= (\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ . If $\eta (x+1)=1$ , then let $k:= \max \{\mu ^{\uparrow }_i(x) \ : \ \mu ^{\uparrow }_i(x) \text { is singular} \ \}$ with convention $\max \emptyset =0$ . If $k=0$ , then add a row of length $1$ to $ \mu ^{\uparrow }(x)$ and also add $p^{\uparrow }_1(x+1)$ to $J^{\uparrow }_{1}(x)$ . If $k \ge 1$ , then replace a row of length k by that of $k+1$ and remove $J^{\uparrow }_{k,m_k^{\uparrow }(x)}(x)=p^{\uparrow }_k(x)$ from $J_{k}(x)$ and add $p^{\uparrow }_{k+1}(x+1)$ to $J^{\uparrow }_{k+1}(x)$ . Note that in the original algorithm for the construction of $(\mu ^{\uparrow }(x+1),\mu ^{\downarrow }(x+1))$ from $\eta (x+1)$ and $(\mu ^{\uparrow }(x),\mu ^{\downarrow }(x))$ , we used information from both Young diagrams, but instead we did not use the rigging. Here, we emphasize that the functions $m^{\uparrow }_k(x)$ and $p^{\uparrow }_k(x)=x-2E^{\uparrow }_k(x)$ can be obtained from $\mu ^{\uparrow }(x)$ alone without information from $\mu ^{\downarrow }(x)$ , and this is also the case for the rigging $\mathbf {J}^{\uparrow }(x)$ . Moreover, the last algorithm is exactly same as the one to construct $(\mu (x),\mathbf {J}(x))$ from $\eta $ by KKR bijection, which confirms that $(\mu (x),\mathbf {J}(x))=(\mu ^{\uparrow }(x),\mathbf {J}^{\uparrow }(x))$ as desired.

5.1. Definition of the slot decomposition

The notion of slots was originally introduced in [Reference Ferrari, Nguyen, Rolla and WangFNRW]. Before defining the slots, we recall the fact that, by the Takahashi–Satsuma algorithm (TS algorithm, see [Reference Takahashi and SatsumaTS] or Appendix of this article), any site of a given ball configuration $\eta \in \Omega _{< \infty }$ is either a record or a component of a soliton. Any k-soliton $\gamma \subset {\mathbb {N}}$ has the form $\gamma = \left \{ z(\gamma )_{1} < \ldots < z(\gamma )_{2k} \right \}$ , where the coordinates are again identified by the TS algorithm. Then, the slot configuration $\nu : {\mathbb {N}} \to {\mathbb {Z}}_{\ge 0} \cup \left \{ \infty \right \} $ is defined as

$$ \begin{align*} \nu(x) := \begin{cases} l - 1 \quad & x = z(\gamma)_{l}, z(\gamma)_{l + k} ~ \text{for some}\ k-\text{soliton}\ \gamma\ \text{in}\ \eta\ \text{with}\ k>\ell, \\ \infty \quad & x ~ \text{is a record},\end{cases} \end{align*} $$

for any $x \in {\mathbb {N}}$ . For $k \in {\mathbb {N}}$ , a site x is called a k-slot if $\nu (x) \ge k$ . Observe that a k-slot is also a j-slot for any $1 \le j \le k$ , and a record is a k-slot for any $k \in {\mathbb {N}}$ . Intuitively, a k-slot is a place where another soliton can be added without modifying the structure of existing solitons in the configuration. To explain this better we define a way to ‘append a soliton to a k-slot’.

Figure 13 Slot configuration of $\eta = 1100111011000110000\ldots $ .

First, we define the function $\tilde {\xi }_{k} : {\mathbb {Z}}_{\ge 0} \to {\mathbb {Z}}_{\ge 0}$ as

(5.1) $$ \begin{align} \tilde{\xi}_{k}(x) &:= \sum_{y = 1}^x \mathbf{1}_{\left\{ \nu(y) \ge k \right\}}, \\ \tilde{\xi}_{k}(0) &:= 0\nonumber \end{align} $$

for any $k \in {\mathbb {N}}$ and $x \in {\mathbb {Z}}_{\ge 0}$ , which counts the number of k-slots in $[1,x]$ . We number k-slots from left to right with the origin $x = 0$ as the $0$ -th k-slot and call $\tilde {s}_{k}(i) := \min \left \{ x \in {\mathbb {Z}}_{\ge 0} ; \ \tilde {\xi }_{k}(x) = i \right \}$ the position of i-th k-slot. We say that a k-soliton $\gamma $ is appended to $\tilde {s}_{k}(i)$ if $\gamma \subset \left [\tilde {s}_{k}(i), \tilde {s}_{k}(i+1) - 1 \right ]$ . Note that several solitons can be appended to the same slot. By using this notion, for any $k \in {\mathbb {N}}$ , we define the slot decomposition $\tilde {\zeta }_{k} : {\mathbb {Z}}_{\ge 0} \to {\mathbb {Z}}_{\ge 0}$ as

(5.2) $$ \begin{align} \tilde{\zeta}_{k}(i) &:= \left| \left\{ \gamma : k\text{-soliton in}\ \eta; \gamma ~ \text{is appended to the}\ i-\text{th}\ k-\text{slot} \right\} \right|. \end{align} $$

In Figure 13, we see an example of a slot configuration. For that particular ball configuration $\eta $ , we have that $x=0$ is a record, $x=2$ is a 1-slot, $x=7$ is a 2-slot, etc. In the same example, solitons are added to slots as follows.

• • A $4$ -soliton is added to the $0$ -th $4$ -slot.

• • Two $2$ -solitons are included. One is added to the $0$ -th $2$ -slot, and the other is added to the $3$ -rd $2$ -slot.

• • A $1$ -soliton is added to the $4$ -th $1$ -slot.

Hence, the slot decomposition of $\eta $ is given by

$$ \begin{align*} \tilde{\zeta}(\eta)_{k}(i) = \begin{cases} 1 \quad &(k,i) = (1,4),(2,0),(2,3), (4,0) \\ 0 \quad &\text{otherwise.}\end{cases} \end{align*} $$

Remark 5.1. Consider the following configuration spaces

$$ \begin{align*} \Omega_{r} &:= \left\{ \eta \in \Omega ; \ \sum_{x \in {\mathbb{N}}} r(x) = \infty \right\}, \\ \tilde{\Omega}_{r} &:= \left\{ \tilde{\zeta} = \left(\tilde{\zeta}_{k}(i)\right)_{k \in {\mathbb{N}}, i \in {\mathbb{Z}}_{\ge 0}} \in {\mathbb{Z}}_{\ge 0}^{{\mathbb{N}} \times {\mathbb{Z}}_{\ge 0}} ; \ \max\left\{ k \in {\mathbb{N}} \ : \ \tilde{\zeta}_{k}(i)> 0 \right\} < \infty \ \text{for any} \ i \right\}. \end{align*} $$

It is known that the map $\eta \mapsto \tilde {\zeta }(\eta )$ is a bijection between $\Omega _{r}$ and $\tilde {\Omega }_{r}$ via the explicit reconstruction algorithm from $\tilde {\zeta }(\eta )$ to $\eta $ [Reference Croydon and SasadaCS, Reference Ferrari, Nguyen, Rolla and WangFNRW]. By combining this fact with Proposition 2.3, one can also reconstruct $\eta $ from $\left (\zeta _{k}(i)\right )_{k,i}$ by using the same algorithm.

The dynamics of the BBS is linearized by the slot decomposition [Reference Ferrari, Nguyen, Rolla and WangFNRW]. Actually, the slot decomposition makes the dynamics a mere spatial shift as described by the following theorem.

Theorem 5.1 Theorem 1.4 in [Reference Ferrari, Nguyen, Rolla and WangFNRW].

Suppose that $\eta \in \Omega _{< \infty }$ . Then we have

$$ \begin{align*} T\tilde{\zeta}_{k}(i) = \tilde{\zeta}_{k}(i - k) \end{align*} $$

for any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ where $\tilde {\zeta }_k (i)=0$ if $i <0$ by convention.

5.2. Proof of Proposition 2.3

In this subsection, we prove Proposition 2.3, which establishes the equivalence between the seat number configuration and the slot configuration. First, we introduce an alternative formula for the slot decomposition:

Lemma 5.1. Suppose that $\eta \in \Omega _{< \infty }$ . Then for any $k \in {\mathbb {N}}$ and $i \in {\mathbb {Z}}_{\ge 0}$ , we have

$$ \begin{align*} \tilde{\zeta}_{k}(i) &= \frac{1}{2} \sum_{y = \tilde{s}_{k}(i) + 1}^{\tilde{s}_{k}(i+1) - 1} \mathbf{1}_{\{\nu(y) = k - 1\}} - \mathbf{1}_{\{\nu\left( \tilde{s}_{k}(i+1)\right) = k\}} \\ &= \frac{1}{2} \sum_{y = \tilde{s}_{k}(i) + 1}^{\tilde{s}_{k}(i+1)} \left(\mathbf{1}_{\{\nu(y) = k - 1\}} - \mathbf{1}_{\{\nu(y) = k\}} \right). \end{align*} $$

Proof of Proposition 2.3.

We will represent ball configurations $\eta \in \Omega _{< \infty }$ using the notation

$$ \begin{align*} \eta = 0^{\otimes \mathsf{m}_0} 1^{\otimes \mathsf{n}_1} \dots 0^{\mathsf{m}_{L}}1^{\otimes \mathsf{n}_{L+1}}0^{\otimes \mathsf{m}_{L+1}}, \end{align*} $$

by which we mean that the first $\mathsf {m}_0$ entries of $\eta $ are 0’s, the following $\mathsf {n}_1$ entries are 1’s and so on. Notice that since the configuration has finitely many balls we have $\mathsf {m}_{L+1}=\infty $ and moreover

$$ \begin{align*} \sum_{i = 1}^{L+1} \mathsf{n}_i = \sum_{x \in {\mathbb{N}}} \eta(x). \end{align*} $$

From the TS algorithm, the first solitons that are identified by the algorithm are of the form

$$ \begin{align*} 0^{\otimes \mathsf{m}_{i}} 1^{\otimes \mathsf{m}_{i} } ~ \text{or} ~ 1^{\otimes \mathsf{n}_{i}} 0^{\otimes \mathsf{n}_{i} }, \end{align*} $$

for some $\mathsf {m}_i, \mathsf {n}_{i}$ such that $\mathsf {m}_i \le \mathsf {n}_{i+1}$ , $i \neq 0$ or $\mathsf {n}_{i} \le \mathsf {m}_i$ , respectively. In the rest of this subsection, we call such solitons connected solitons.

Now, we claim that

1. Claim(A) it is sufficient to show Equation (2.15) for sites that consist of connected solitons.

To verify Claim(A), we will show that after removing a connected soliton, the seat number configuration for the remaining sites is ‘invariant’ in the following sense. Observe that after the removal of a connected soliton of the form $0^{\otimes \mathsf {m}_{i}} 1^{\otimes \mathsf {m}_{i} }$ or $1^{\otimes \mathsf {n}_{i}} 0^{\otimes \mathsf {n}_{i} }$ , following the TS algorithm, we obtain the configuration

$$ \begin{align*} \eta' = 0^{\otimes \mathsf{m}_0} 1^{\otimes \mathsf{n}_1}\ldots 0^{\otimes \mathsf{m}_{i - 1}}1^{\otimes \left( \mathsf{n}_{i} + \mathsf{n}_{i+1} - \mathsf{m}_{i} \right)}0^{\otimes \mathsf{m}_{i + 1}} \ldots 0^{\otimes \mathsf{m}_{L}}1^{\otimes \mathsf{n}_{L+1}}0^{\otimes \mathsf{m}_{L+1}}, \end{align*} $$

or

$$ \begin{align*} \eta" = 0^{\otimes \mathsf{m}_0} 1^{\otimes \mathsf{n}_1}\ldots 1^{\otimes \mathsf{n}_{i-1}}0^{\otimes \left( \mathsf{m}_{i - 1} + \mathsf{m}_{i} - \mathsf{n}_{i} \right)}1^{\otimes \mathsf{n}_{i+1}}0^{\otimes \mathsf{m}_{i + 1}} \ldots 0^{\otimes \mathsf{m}_{L}}1^{\otimes \mathsf{n}_{L+1}}0^{\otimes \mathsf{m}_{L+1}}, \end{align*} $$

respectively. In addition, after the removal of a soliton, the seat numbers given to other sites do not change, that is,

$$ \begin{align*} \begin{cases} \mathcal{W}_{k}\left(x' \right) = \mathcal{W}_{k}\left(x' + 2\mathsf{m}_{i}\right) \ & \text{if} ~ 0^{\otimes \mathsf{m}_{i}} 1^{\otimes \mathsf{m}_{i} } ~ \text{ is removed}, \\ \mathcal{W}_{k}\left(x" \right) = \mathcal{W}_{k}\left(x" + 2\mathsf{n}_{i}\right) \ & \text{if} ~ 1^{\otimes \mathsf{n}_{i}} 0^{\otimes \mathsf{n}_{i} } ~ \text{ is removed}, \end{cases} \end{align*} $$

for any $k \in {\mathbb {N}}$ , where $x', x"$ are defined as

$$ \begin{align*} x' &:= \sum_{j = 1}^{i} \left(\mathsf{m}_{j - 1} + \mathsf{n}_{j} \right) - 1, \\ x" &:= \sum_{j = 1}^{i} \left(\mathsf{m}_{j - 1} + \mathsf{n}_{j - 1} \right) - 1 \end{align*} $$

with convention that $\mathsf {n}_0=0$ , because from the rule of the TS algorithm,

$$ \begin{align*} \begin{cases} W_{\mathsf{m}_{i}}\left(x' \right) = \mathsf{m}_i \ & \text{if} \ 0^{\otimes \mathsf{m}_{i}} 1^{\otimes \mathsf{m}_{i} } ~ \text{ is removed}, \\ W_{n_{i}}\left(x" \right) = 0 \ & \text{if} \ 1^{\otimes \mathsf{n}_{i}} 0^{\otimes \mathsf{n}_{i} } ~ \text{ is removed}. \end{cases} \end{align*} $$

Thus, we see that if a soliton $0^{\otimes \mathsf {m}_{i}} 1^{\otimes \mathsf {m}_{i} }$ is removed, then for any $x \in [1, x'] \cap {\mathbb {N}}$ ,

$$ \begin{align*} x \in [1, x'] \cap {\mathbb{N}} ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} \ \eta \ \text{if and only if} \ x \in [1, x'] \cap {\mathbb{N}} ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta', \end{align*} $$

while for any $y \in [ x' + 2\mathsf {m}_{i} + 1, \infty ) \cap {\mathbb {N}}$ ,

$$ \begin{align*} y \ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta \ \text{if and only if} \ (y - 2\mathsf{m}_{i}) ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta', \end{align*} $$

for any $k \in {\mathbb {N}}$ and $\sigma \in \{\uparrow , \downarrow \}$ . Similarly, if a soliton $1^{\otimes \mathsf {n}_{i}} 0^{\otimes \mathsf {n}_{i} }$ is removed, then for any $x \in [1, x"] \cap {\mathbb {N}}$ ,

$$ \begin{align*} x \in [1, x"] \cap {\mathbb{N}} ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta ~ \text{if and only if} ~ x \in [1, x"] \cap {\mathbb{N}} ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta", \end{align*} $$

while for any $y \in [ x" + 2\mathsf {n}_{i} + 1, \infty ) \cap {\mathbb {N}}$ ,

$$ \begin{align*} y ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta ~ \text{if and only if} ~ (y - 2\mathsf{n}_{i}) ~ \text{is a} ~ (k,\sigma) ~ \text{seat in} ~ \eta", \end{align*} $$

for any $k \in {\mathbb {N}}$ and $\sigma \in \{\uparrow , \downarrow \}$ . Hence, by considering multiple iterations of the TS algorithm and its inverse, we see that if the seat number configuration is determined for each connected soliton, the seat number configuration of the original ball configuration is completely determined. Also, by considering multiple iterations of the TS algorithm and its inverse, the slot configuration of the original ball configuration is also determined. Therefore, Claim(A) is proved.

Now, we show Equation (2.15) for the case when x belongs to a connected soliton. For this purpose, we divide the cases as follows.

• • If a soliton $ 0^{\otimes \mathsf {m}_{i}} 1^{\otimes \mathsf {m}_{i} }$ is detected by the TS algorithm, then we have $\mathsf {n}_{j}> \mathsf {m}_{i}$ for $j = i, i + 1$ . Observing that

  $$ \begin{align*} \mathcal{W}_{\ell}(x') = 1, \end{align*} $$
  for any $l \le \mathsf {n}_{i}$ , we obtain
  $$ \begin{align*} \begin{cases}\eta^{\downarrow}_{\ell}(x' + l) = 1 \\ \eta^{\uparrow}_{\ell}(x' + \mathsf{m}_{i} + l) = 1 \end{cases} \end{align*} $$
  for any $1 \le l \le \mathsf {m}_{i}$ . On the other hand, from the definition of the slot configuration, we get
  $$ \begin{align*} \begin{cases} \nu(x' + l) = l - 1 \\ \nu(x' + \mathsf{m}_{i} + l) = l - 1 \end{cases} \end{align*} $$
  for any $1 \le l \le \mathsf {m}_{i}$ . Therefore, in this case Equation (2.15) holds.

• • If a soliton $ 1^{\otimes \mathsf {n}_{i}} 0^{\otimes \mathsf {n}_{i} }$ is detected by the TS algorithm, then we have $\mathsf {m}_{j}> \mathsf {n}_{i}$ for $j = i - 1, i$ . Observing that

  $$ \begin{align*} \mathcal{W}_{\ell}(x") = 0, \end{align*} $$
  for any $l \le \mathsf {m}_{i - 1}$ , we obtain
  $$ \begin{align*} \begin{cases}\eta^{\uparrow}_{\ell}(x" + l) = 1 \\ \eta^{\downarrow}_{\ell}(x" + \mathsf{n}_{i} + l) = 1 \end{cases} \end{align*} $$
  for any $1 \le l \le \mathsf {n}_{i}$ . On the other hand, from the definition of the slot configuration, we get
  $$ \begin{align*} \begin{cases} \nu(x" + l) = l - 1 \\ \nu(x" + \mathsf{n}_{i} + l) = l - 1 \end{cases} \end{align*} $$
  for any $1 \le l \le \mathsf {n}_{i}$ . Therefore, in this case Equation (2.15) holds.

Hence, by combining the above with Claim(A), Equation (2.15) is shown for any $k \in {\mathbb {N}}$ and $x \in {\mathbb {Z}}_{\ge 0}$ .

We now compute formulas for $\tilde {\xi }(\cdot )$ and $\tilde {\zeta }(\cdot )$ , which were defined in Equations (5.1) and (5.2), in terms of the seat number configuration. By using Equation (2.15), we have

(5.3) $$ \begin{align} \tilde{\xi}_{k}(x) &= x - \sum_{y = 1}^x \mathbf{1}_{\left\{ \nu(y) \le k \right\}} \nonumber\\ &= x - \sum_{\ell = 1}^{k} \sum_{y = 1}^x \left( \eta^{\uparrow}_{\ell}(y) + \eta^{\downarrow}_{\ell}(y) \right) \\ &= \xi_{k}(x). \nonumber \end{align} $$

A direct consequence of Equation (5.3) is $\tilde {s}_{k}(\cdot ) = s_{k}(\cdot )$ . In addition, by using $\tilde {s}_{k}(\cdot ) = s_{k}(\cdot )$ , Lemmas 3.4 and 5.1, $\tilde {\zeta }_{k}(\cdot )$ can be represented as

$$ \begin{align*} \tilde{\zeta}_{k}(i) &= \frac{1}{2} \sum_{\sigma \in \{\uparrow , \downarrow\}} \sum_{y = \tilde{s}_{k}(i) + 1}^{\tilde{s}_{k}(i+1)} \left(\eta^{\sigma}_{k}(y) - \eta^{\sigma}_{k+1}(y) \right) \\ &= \frac{1}{2}\sum_{\sigma \in \{\uparrow , \downarrow\}} \sum_{y = s_{k}(i) + 1}^{s_{k}(i+1)} \left(\eta^{\sigma}_{k}(y) - \eta^{\sigma}_{k+1}(y) \right) \\ &= \zeta_{k}(i). \end{align*} $$

This concludes the proof.

We conclude this subsection by describing the relationship between solitons and $\tau _{k}(\cdot )$ and the characterization of the slots via the carrier processes.

Proof of Proposition 5.1.

From Proposition 2.3, we see that x is a rightmost component of a k-soliton if and only if $\eta ^{\uparrow }_{k}(x) + \eta ^{\downarrow }_{k}(x) = 1$ , $x \in \left ( s_{k}(i), s_{k}(i + 1) \right )$ for some $i \in {\mathbb {Z}}_{\ge 0}$ and

$$ \begin{align*} \sum_{y = s_{k}(i) + 1}^{x} \mathbf{1}_{\{\nu\left(y\right) = k - 1\}} = \sum_{\sigma \in \left\{\uparrow, \downarrow \right\}} \sum_{y = s_{k}(i) + 1}^{x} \eta^{\sigma}_{k}(y) = 2n \end{align*} $$

for some $n \in {\mathbb {N}}$ . On the other hand, from Lemmas 3.1 and 3.4, we also see that $x = \tau _{k}(j)$ for some $j \in {\mathbb {Z}}_{\ge 0}$ if and only if $\eta ^{\uparrow }_{k}(x) + \eta ^{\downarrow }_{k}(x) = 1$ , $x \in \left ( s_{k}(i), s_{k}(i + 1) \right )$ for some $i \in {\mathbb {Z}}_{\ge 0}$ and

$$ \begin{align*} \sum_{\sigma \in \left\{\uparrow, \downarrow \right\}} \sum_{y = s_{k}(i) + 1}^{x} \eta^{\sigma}_{k}(y) = 2n \end{align*} $$

for some $n \in {\mathbb {N}}$ . By comparing the above two equivalences, this proposition is proved.

Proof of Proposition 5.2.

From Equation (2.2), we have

$$ \begin{align*} \eta(x) = 1 ~ \text{and} ~ \min \left\{\ell \in {\mathbb{N}} ; \ \ell - W_{\ell}(x - 1) \ge 1 \right\} = k \ &\text{if and only if} \ \mathcal{W}_{k}(x-1) = 0, ~ \mathcal{W}_{k}(x) = 1, \end{align*} $$

and

$$ \begin{align*} \eta(x) = 0 ~ \text{and} ~ \min \left\{\ell \in {\mathbb{N}} ; \ W_{\ell}(x - 1) \ge 1 \right\} = k \ &\text{if and only if} \ \mathcal{W}_{k}(x-1) = 1, ~ \mathcal{W}_{k}(x) = 0, \end{align*} $$

for any $x \in {\mathbb {N}}$ . Therefore, from Proposition 2.3, the assertion of this proposition holds.

5.3. Proofs of Theorem 2.2 and Theorem 2.3

We finally come to the proof of Theorem 2.2, providing an explicit relation between the KKR bijection and the slot configuration. Then, by using Theorem 2.2, we show Theorem 2.3.

Proof of Theorem 2.2.

First, we note that since $\eta \in \Omega _{\infty }$ , from Proposition 2.2 the rigging $\mathbf {J} = (J_{k})$ associated with $\eta $ is given by

$$ \begin{align*} J_{k} =\left( p_{k}\left( t_{k}(j) \right) ; \ j = 1, \dots, m_{k} \right), \end{align*} $$

where

$$ \begin{align*} m_{k} &:= \lim_{x \to \infty} m_{k}(x), \\ t_{k}(j) &:= \lim_{x \to \infty} t_{k}(x,j) = \max \left\{ y \in {\mathbb{N}} ; \ m_{k}(y) = j, \ \eta^{\uparrow}_{k}(y) = 1 \right\}. \end{align*} $$

In addition, since $t_{k}(j)$ is a $(k,\uparrow )$ -seat, from Lemma 3.1 we obtain

$$ \begin{align*} \xi_{k}\left(t_{k}(j) \right) - p_{k}\left(t_{k}(j) \right) &= \sum_{y = 1}^{t_k(j)} \sum_{\ell = 1}^{k} \left( \eta^{\uparrow}_{\ell}(y) - \eta^{\downarrow}_{\ell}(y) \right) \\ &= k. \end{align*} $$

Thus, we have

$$ \begin{align*} \left| \left\{ j \in {\mathbb{N}} ; \ J_{k,j} = i - k \right\} \right| = \left| \left\{ j \in {\mathbb{N}} \ ;\ s_{k}(i) \le t_{k}(j) < s_{k}(i+1) \right\} \right|. \end{align*} $$

On the other hand, from Proposition 2.1 and the definitions of $t_{k}(\cdot )$ and $\tau _{k}(\cdot )$ , for any $j \in {\mathbb {Z}}_{\ge 0}$ we have

$$ \begin{align*} \tau_{k}(j) < t_{k}(j + 1) \le \tau_{k}(j + 1). \end{align*} $$

In addition, if $\tau _{k}(j), \tau _{k}(j+1)$ satisfies

$$ \begin{align*} \tau_{k}(j) < s_{k}(i+1) < \tau_{k}(j+1), \end{align*} $$

for some i, then from Proposition 2.2 and Lemma 3.4 we obtain $m\left ( s_{k}(i+1) \right ) = m^{\uparrow }\left ( s_{k}(i+1) \right ) = j$ , and thus we have

$$ \begin{align*} s_{k}(i+1) < t_{k}(j+1). \end{align*} $$

From the above, we have

$$\begin{align*}\tau_{k}(j) < s_{k}(i+1) < \tau_{k}(j+1) \ \text{if and only if} \ t_{k}(j) < s_{k}(i+1) < t_{k}(j+1). \end{align*}$$

Since $s_k(i) \neq t_k(j)$ and $ s_k(i) \neq \tau _k(j)$ for any $i,j$ , combining with Proposition 2.3, we have

$$ \begin{align*} \left| \left\{ j \in {\mathbb{N}} ; \ J_{k,j} = i - k \right\} \right| &= \left| \left\{ j \in {\mathbb{N}} ; \ s_{k}(i) \le t_{k}(j) < s_{k}(i+1) \right\} \right| \\ &= \left| \left\{ j \in {\mathbb{N}} ; \ s_{k}(i) \le \tau_{k}(j) < s_{k}(i+1) \right\} \right| \\ &= \zeta_{k}(i) \\ &= \tilde{\zeta}_{k}(i).\\[-39pt] \end{align*} $$