Distances in domino flip graphs

Two specific families of subword complexes provide relevant illustrations for this algorithm: on the one hand, this work extends the greedy flip algorithm for

We then describe a method for construct- ing highly complex binary graphs and provide two exam- ples which show how to use the set-complexity to analyze information content of a

Another interesting question about the SK-model comes ~om analytical studies of the sequen- tial spin glass dynamics on Cayley trees: during the descent into a metastable state no

The goal of this section is to prove upper and lower bounds on the diameters of modular flip graphs in terms of the topology of the surface (namely Theorem 1.4 from the

The mapping class group of a surface acts naturally on the corresponding curve graph through its action on isotopy classes of curves.. The quotient graph under the action of the

We focus on surfaces of positive genus g with a single boundary curve and n marked points on this curve; we consider triangulations up to home- omorphism with the marked points as

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

(A set of points in the plane is in convex position if it forms the vertex-set of a convex polygon.) We then consider the flip graph on the perfect matchings of a complete graph of