Does the endomorphism poset P^P determine whether a finite poset P is connected? An issue Duffus raised in 1978

DOI10.21136/MB.2022.0010-22OpenAlexW4293496630MaRDI QIDQ6137086FDOQ6137086

Authors: Jonathan David Farley 

Publication date: 18 January 2024

Published in: Mathematica Bohemica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/mb.2022.0010-22

zbMATH Keywords

exponentiationconnected poset(partially) ordered set

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cardinal multiplication of structures with a reflexive relation
• Operations with structures
• A Logarithmic Property for Exponents of Partially Ordered Sets
• Automorphisms and products of ordered sets
• Ordered sets. An introduction with connections from combinatorics to topology
• Powers of ordered sets
• Powers of partially ordered sets: Cancellation and reffinement properties.
• The zig-zag property and exponential cancellation of ordered sets
• Another problem of Jónsson and McKenzie from 1982: refinement properties for connected powers of posets
• Poset exponentiation and a counterexample Birkhoff said in 1942 he did not have
• Arithmetic of finite ordered sets: cancellation of exponents. II
• A Theorem on Partially Ordered Sets of Order-Preserving Mappings

This page was built for publication: Does the endomorphism poset $P^P$ determine whether a finite poset $P$ is connected? An issue Duffus raised in 1978

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137086)