Reconstructing permutations from identification minors

zbMath1323.05009MaRDI QIDQ888635

Erkko Lehtonen

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p20

zbMATH Keywords

permutationreconstruction problemidentification minor

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (3)

A dual Ramsey theorem for permutations ⋮ Ramsey properties of products and pullbacks of categories and the Grothendieck construction ⋮ The minor order of homomorphisms via natural dualities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Totally symmetric functions are reconstructible from identification minors
• A congruence theorem for trees
• Reconstructing permutations from cycle minors
• Galois theory for minors of finite functions
• Boolean minors
• Essential arities of term operations in finite algebras
• Equational characterizations of Boolean function classes
• Set-reconstructibility of Post classes
• Hypomorphic Sperner systems and non-reconstructible functions
• Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
• Permutation reconstruction from minors
• Permutation reconstruction
• On closed sets of relational constraints and classes of functions closed under variable substitutions
• A complete classification of equational classes of threshold functions included in clones
• RECONSTRUCTING MULTISETS OVER COMMUTATIVE GROUPOIDS AND AFFINE FUNCTIONS OVER NONASSOCIATIVE SEMIRINGS

This page was built for publication: Reconstructing permutations from identification minors