Files in this item
Atomicity and well quasi-order for consecutive orderings on words and permutations
Item metadata
dc.contributor.author | McDevitt, Matthew | |
dc.contributor.author | Ruskuc, Nik | |
dc.date.accessioned | 2020-12-23T16:30:06Z | |
dc.date.available | 2020-12-23T16:30:06Z | |
dc.date.issued | 2021 | |
dc.identifier | 271788487 | |
dc.identifier | ad0d3d02-7876-410c-9196-fcccd22f735e | |
dc.identifier | 000636039400026 | |
dc.identifier | 85105091979 | |
dc.identifier.citation | McDevitt , M & Ruskuc , N 2021 , ' Atomicity and well quasi-order for consecutive orderings on words and permutations ' , SIAM Journal on Discrete Mathematics , vol. 35 , no. 1 , pp. 495–520 . https://doi.org/10.1137/20M1338411 | en |
dc.identifier.issn | 0895-4801 | |
dc.identifier.other | ORCID: /0000-0003-2415-9334/work/93894967 | |
dc.identifier.uri | https://hdl.handle.net/10023/21195 | |
dc.description.abstract | Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being decomposable as a union of two downward closed proper subsets, or, equivalently, satisfying the joint embedding property; and (b) being well quasi-ordered. The two posets are: (1) words over a finite alphabet under the consecutive subword ordering; and (2) finite permutations under the consecutive subpermutation ordering. Underpinning the four results are characterisations of atomicity and well quasi-order for the subpath ordering on paths of a finite directed graph. | |
dc.format.extent | 384386 | |
dc.language.iso | eng | |
dc.relation.ispartof | SIAM Journal on Discrete Mathematics | en |
dc.subject | Antichain | en |
dc.subject | Digraph | en |
dc.subject | Path | en |
dc.subject | Joint embedding property | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Atomicity and well quasi-order for consecutive orderings on words and permutations | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1137/20M1338411 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://arxiv.org/abs/2003.10743 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.