The Hankel-transform relation for Rueppel complements and first differences

About 5 years old · traced to

Let rnr_n be the Rueppel sequence. Let HnH_n be the Hankel transform of the sequence 1−rn1-r_n, and let hnh_n be the Hankel transform of the first-difference sequence rn+1−rnr_{n+1}-r_n. Rueppel complement-difference conjecture. Then

∣hn∣=∣Hn+1∣−∣Hn∣.|h_n|=\sqrt{|H_{n+1}|-|H_n|}.

The paper notes analogous relations for the Catalan and Motzkin numbers, but gives no proof or resolution for the Rueppel relation.

References

Primary source

Paul Barry, “Conjectures and results on some generalized Rueppel sequences”, arXiv:2107.00442 (2021).

Additional references

5 papers in this index state this conjecture (2007–2021). The statement above is taken from the most recent of them; the others are arXiv:2004.04577, arXiv:1910.00875, arXiv:1107.5490, arXiv:math/0701483.

Progress summary

Refreshed
Claimed progress

A reader-submitted calculation claims the conjecture is false, but no independent verification or published resolution was found.

The conjecture, recorded as Conjecture 2222 in a 2021 paper on P. Barry’s conjectures, relates two Hankel transforms associated with the Rueppel sequence. The paper states it without proof or resolution.

Community submission (unverified)

On August 23, 2026, a submitted calculation claims a counterexample at n=2n=2: H2=−1H_2=-1, H3=0H_3=0, and h2=1h_2=1, so the conjectured square-root expression is not real. It further proposes the signed identity

hn2=(−1)(n+12)Hn+(−1)(n+22)Hn+1.h_n^2=(-1)^{\binom{n+1}{2}}H_n+(-1)^{\binom{n+2}{2}}H_{n+1}.

Current status (as of August 2026): The conjecture remains unverified in the literature, while a community submission claims it is false and supplies a proposed replacement identity.

Sources

Solutions 1

CounterexampleThis solution needs a summarySee full solutionHide full solution

Counterexample and the correct signed determinant identity

Let

rm={1,m+1 is a power of 2,0,otherwise,r_m=\begin{cases} 1,&m+1\text{ is a power of }2,\\ 0,&\text{otherwise}, \end{cases}

be the Rueppel sequence. Following Barry, Conjectures and results on some generalized Rueppel sequences, Conjecture 22, define

Hn=det⁡(1−ri+j)0≤i,j≤n,hn=det⁡(ri+j+1−ri+j)0≤i,j≤n.(1)\begin{aligned} H_n&=\det\bigl(1-r_{i+j}\bigr)_{0\leq i,j\leq n},\\ h_n&=\det\bigl(r_{i+j+1}-r_{i+j}\bigr)_{0\leq i,j\leq n}. \end{aligned} \tag{1}

The proposed identity

∣hn∣=∣Hn+1∣−∣Hn∣(2)|h_n|=\sqrt{|H_{n+1}|-|H_n|} \tag{2}

is false. In fact, the correct relationship is the signed identity

hn2=(−1)(n+12)Hn+(−1)(n+22)Hn+1(n≥0).(3)\boxed{ h_n^2 =(-1)^{\binom{n+1}{2}}H_n +(-1)^{\binom{n+2}{2}}H_{n+1} \qquad(n\geq0). } \tag{3}

Explicit counterexample

The relevant initial Rueppel values are

(r0,r1,r2,r3,r4,r5,r6)=(1,1,0,1,0,0,0).(r_0,r_1,r_2,r_3,r_4,r_5,r_6) =(1,1,0,1,0,0,0).

Consequently,

H2=det⁡(001010101)=−1,H3=det⁡(0010010110110111)=0,H_2= \det\begin{pmatrix} 0&0&1\\ 0&1&0\\ 1&0&1 \end{pmatrix} =-1, \qquad H_3= \det\begin{pmatrix} 0&0&1&0\\ 0&1&0&1\\ 1&0&1&1\\ 0&1&1&1 \end{pmatrix} =0,

whereas

h2=det⁡(0−11−11−11−10)=1.h_2= \det\begin{pmatrix} 0&-1&1\\ -1&1&-1\\ 1&-1&0 \end{pmatrix} =1.

Thus

∣H3∣−∣H2∣=−1,∣h2∣=1.|H_3|-|H_2|=-1, \qquad |h_2|=1.

The right-hand side of (2) is therefore not even real. Equivalently, squaring the claimed identity would give the contradiction 1=−11=-1.

A universal determinant identity

The correction (3) follows from a more general identity. Let (aj)j≥0(a_j)_{j\geq0} be any real sequence for which the Hankel determinants

Δn=det⁡(ai+j)0≤i,j≤n\Delta_n=\det(a_{i+j})_{0\leq i,j\leq n}

are nonzero. Define

Bn=det⁡(1−ai+j)0≤i,j≤n,Dn=det⁡(ai+j+1−ai+j)0≤i,j≤n.B_n=\det(1-a_{i+j})_{0\leq i,j\leq n}, \qquad D_n=\det(a_{i+j+1}-a_{i+j})_{0\leq i,j\leq n}.

Then, for every n≥0n\geq0,

Dn2=(−1)n+1(ΔnBn+1+Δn+1Bn).(4)\boxed{ D_n^2=(-1)^{n+1} \bigl(\Delta_n B_{n+1}+\Delta_{n+1}B_n\bigr). } \tag{4}

To prove this, write

A=(ai+j)0≤i,j≤n,u=(1,…,1)T,v=(an+1,…,a2n+1)T,A=(a_{i+j})_{0\leq i,j\leq n}, \qquad u=(1,\ldots,1)^{\mathsf T}, \qquad v=(a_{n+1},\ldots,a_{2n+1})^{\mathsf T},

and put

t=a2n+2−vTA−1v=Δn+1Δn.(5)t=a_{2n+2}-v^{\mathsf T}A^{-1}v =\frac{\Delta_{n+1}}{\Delta_n}. \tag{5}

The matrix-determinant lemma gives

Bn=(−1)n+1Δn(1−Kn),Kn=uTA−1u.(6)B_n=(-1)^{n+1}\Delta_n(1-K_n), \qquad K_n=u^{\mathsf T}A^{-1}u. \tag{6}

The block inverse of

An+1=(AvvTa2n+2)A_{n+1}= \begin{pmatrix} A&v\\ v^{\mathsf T}&a_{2n+2} \end{pmatrix}

yields

Kn+1−Kn=(1−vTA−1u)2t.(7)K_{n+1}-K_n =\frac{(1-v^{\mathsf T}A^{-1}u)^2}{t}. \tag{7}

Finally, subtract consecutive columns, working from right to left, in the bordered determinant

det⁡(AvuT1).\det\begin{pmatrix} A&v\\ u^{\mathsf T}&1 \end{pmatrix}.

Expansion along the last row gives

Δn(1−vTA−1u)=(−1)n+1Dn.(8)\Delta_n(1-v^{\mathsf T}A^{-1}u) =(-1)^{n+1}D_n. \tag{8}

Substituting (5) and (8) into (7),

Kn+1−Kn=Dn2ΔnΔn+1.(9)K_{n+1}-K_n =\frac{D_n^2}{\Delta_n\Delta_{n+1}}. \tag{9}

Applying (6) at nn and n+1n+1 and simplifying proves (4).

For the Rueppel sequence, the known Hankel evaluation recalled in Barry's introduction is

Δn=(−1)(n+12).(10)\Delta_n=(-1)^{\binom{n+1}{2}}. \tag{10}

Since

Δn+1=(−1)n+1Δn,\Delta_{n+1}=(-1)^{n+1}\Delta_n,

specializing (4) to aj=rja_j=r_j gives exactly (3). Hence the original absolute-value conjecture is disproved, and its replacement is an exact signed identity valid for every index.