Euclidean algorithm for a class of linear orders

DOI10.1016/j.disc.2023.113639arXiv2202.04282MaRDI QIDQ6056733

Esha Gupta, Amit Kuber, Shashwat Agrawal

Publication date: 4 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.04282

zbMATH Keywords

Euclidean algorithmisomorphism problemdiscrete linear orderfinitely presented linear ordersigned trees

Mathematics Subject Classification ID

Total orders (06A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Fraïssé's conjecture for linear orders of finite Hausdorff rank
• On the stable radical of some non-domestic string algebras
• Equivalence between Fraïssé's conjecture and Jullien's theorem
• On Fraissé's order type conjecture
• A Borel reductibility theory for classes of countable structures
• On the elementary theory of linear order

This page was built for publication: Euclidean algorithm for a class of linear orders