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-22MaRDI QIDQ6137086zbMATH OpenOpenAlexFDO

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

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

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)