The infinite Toeplitz trace conjecture for return probabilities

At least 2 years old · documented by

Consider the Markov chain on N\mathbb{N} in which every vertex ii has an edge of weight rr to i−1i-1 and edges of weight clc_l to i+li+l for 0≤l≤k0\leq l\leq k, with

r+∑i=0kci≤1.r+\sum_{i=0}^{k}c_i\leq 1.

Let plp_l be the probability of starting at ii and returning to ii in exactly ll steps. Infinite Toeplitz Trace Conjecture. For some constant α\alpha, if

pl≤αkfor 1≤l≤k+1,p_l\leq \frac{\alpha}{k}\quad\text{for }1\leq l\leq k+1,

then

pl≤αkfor all l.p_l\leq \frac{\alpha}{k}\quad\text{for all }l.

The paper explicitly describes this infinite version as open and as a relaxation of the finite Toeplitz trace conjecture.

References

Primary source

Jenish C. Mehta, “Combinatorial and Algebraic Properties of Nonnegative Matrices”, arXiv:2301.08181 (2023).

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.