Existence of smooth Mallows processes with non-total graph structure

From papers

Let n3n\geq 3. A smooth Mallows process is a process

M=(Mt)t[0,){\mathcal{M}}={({\mathcal{M}}_t)_{t\in[0,\infty)}}

for which the associated graph group GM\langle{\mathcal{G}}_{\mathcal{M}}\rangle is defined, and let T\mathcal{T} denote the full graph group. Existence conjecture. For every n3n\geq 3, there exists a smooth Mallows process M{\mathcal{M}} such that

GMT.\langle{\mathcal{G}}_{\mathcal{M}}\rangle\subsetneq{\mathcal{T}}.

This asks whether smooth Mallows processes can have strictly smaller graph structure than the full graph group; the source presents it as a possible direction for future work and gives no resolution.

Progress summary

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

Sources & referencesView supporting material

Primary source

Benoît Corsini, “Continuous-time Mallows processes”, arXiv:2205.04967 (2022).

Solutions 0

No solutions have been posted yet.