Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The undecidability o ...
Article

The undecidability of joint embedding for 3-dimensional permutation classes

Samuel Braunfeld ORCID
Download article
Open on arXiv
Submitted on
February 28, 2020
Accepted on
August 10, 2021
Published on
September 14, 2021
Last modified on
March 31, 2025
Special issue 22
vol. 22:2, Permutation Patterns 2019
Special issues
DOI
10.46298/dmtcs.6165
License
Attribution 4.0 International (CC BY 4.0)
Indicators
935
Views
879
Downloads

The undecidability of joint embedding for 3-dimensional permutation classes

Samuel Braunfeld ORCID
Abstract
As a step towards resolving a question of Ru\v{s}kuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2 linear orders, we show the corresponding problem is undecidable for hereditary classes of structures in a language of 3 linear orders. Comment: 20 pages. DMTCS version. arXiv admin note: substantial text overlap with arXiv:1903.11932
Keywords
  • Mathematics - Logic
  • Mathematics - Combinatorics
Preview
Loading PDF preview...