We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of circular orders. These results are then applied to the study of arcs and knots, establishing combinatorial properties and lower bounds (in terms of Borel reducibility) for the complexity of some natural relations between these geometrical objects.
CONVEX EMBEDDABILITY AND KNOT THEORY
Iannella M.;Marcone A.;
2025-01-01
Abstract
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of circular orders. These results are then applied to the study of arcs and knots, establishing combinatorial properties and lower bounds (in terms of Borel reducibility) for the complexity of some natural relations between these geometrical objects.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
