Growth-bound reconstruction conjecture for relational structures

From papers

Let M\mathcal{M} be a relational structure and let G=Aut(M)G=\operatorname{Aut}(\mathcal{M}). Let Fn(G)F_n(G) denote the relevant orbit-counting sequence, and suppose that Fn(G)F_n(G) is known together with a bound on its growth. Growth-bound reconstruction conjecture. Under these assumptions, M\mathcal{M} is reconstructible. The source presents this as a conjectural link between growth rates and reconstruction, without giving a 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

Sam Tarzi, “Multicoloured Random Graphs: Constructions and Symmetry”, arXiv:1406.7870 (2014).

Solutions 0

No solutions have been posted yet.