In [75]:
%display latex
In [76]:
load("../specifier.py")

We consider the class $\mathcal T = \mathrm{Av}(2413,3142, 2143,3412)$. It contains no simple permutation, and the non-simple avoided patterns are $2143$ and $3412$.

In [77]:
S = Specification([],[[2,1,4,3],[3,4,1,2]])
In [78]:
S
Out[78]:
In [79]:
S.solve()
Out[79]:

We can check that critical families are $\mathcal T_0,\mathcal T_3,\mathcal T_6,\mathcal T_7$, with $\mathcal T_3,\mathcal T_6,\mathcal T_7$ forming a strongly connected component, and that we are in the essentially linear case. We see below that the denominator of $T_0$ has two real roots, and $\rho$ is the smallest one.

In [80]:
[ x.n() for x in S.solve()[0].denominator().roots(multiplicities=False)]
Out[80]:
In [81]:
C = S.sampler(0.29)
In [82]:
perm = C.run(10)
In [83]:
list_plot(perm,aspect_ratio=1)
Out[83]:

It seems that the limiting permuton is the symmetric X-permuton. This is indeed the case thanks to our results.

In [ ]:
 
In [ ]:
 
In [ ]: