← All problems

Clay's position-matrix eigenvalue conjectures for the single-shelf shuffle

Less than 1 year old · traced to

Let n≥3n\geq 3, and let MM be the position matrix of a single-shelf shuffle, with

M(i,j)=12i((i−1j−1)+(i−1n−j)),1≤i,j≤n.M(i,j)=\frac{1}{2^i}\left(\binom{i-1}{j-1}+\binom{i-1}{n-j}\right),\quad 1\leq i,j\leq n.

For a vector v∈Rnv\in\mathbb{R}^n, write v(k)v(k) for its kkth coordinate.

Clay's position-matrix eigenvalue conjectures. The following assertions hold:

  1. (1/4,v)(1/4,v) is an eigenvalue-eigenvector pair of MM, with multiplicity at least one, where
v(k)=n2−3nk+32k(k+1)−1.v(k)=n^2-3nk+\frac{3}{2}k(k+1)-1.
  1. The non-zero eigenvalues of MM are 2−i2^{-i}, where 0≤i≤n−10\leq i\leq n-1 is an even integer.

These conjectures concern the spectrum of the position matrix arising from the single-shelf shuffling model. The source attributes them to Clay and provides no evidence here that either conjecture has been resolved.

References
  1. Raghavendra Tripathi, “On the position matrix of single-shelf shuffle and card guessing”, arXiv:2602.07920 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.