About posets of height one as retracts
We investigate connected posets $C$ of height one as retracts of finite posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$ reflecting the network of so-called improper 4-crown bundles contained in the extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Campo, Frank a |
description | We investigate connected posets $C$ of height one as retracts of finite
posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$
reflecting the network of so-called improper 4-crown bundles contained in the
extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but
not on $P$. There exists a close interdependence between $C$ being a retract of
$P$ and the existence of a graph homomorphism of a certain type from
$\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum
of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism
exists. Returning to general connected posets $C$ of height one, we show that
the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff
the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$. |
doi_str_mv | 10.48550/arxiv.2410.22379 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2410_22379</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2410_22379</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2410_223793</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMgEKGBkZm1tyMqg5JuWXligU5BenlhQr5KcpZKRmpmeUKOTnpSokFisUpZYUJSaXFPMwsKYl5hSn8kJpbgZ5N9cQZw9dsInxBUWZuYlFlfEgk-PBJhsTVgEAFg8s2Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>About posets of height one as retracts</title><source>arXiv.org</source><creator>Campo, Frank a</creator><creatorcontrib>Campo, Frank a</creatorcontrib><description>We investigate connected posets $C$ of height one as retracts of finite
posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$
reflecting the network of so-called improper 4-crown bundles contained in the
extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but
not on $P$. There exists a close interdependence between $C$ being a retract of
$P$ and the existence of a graph homomorphism of a certain type from
$\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum
of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism
exists. Returning to general connected posets $C$ of height one, we show that
the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff
the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$.</description><identifier>DOI: 10.48550/arxiv.2410.22379</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-10</creationdate><rights>http://creativecommons.org/licenses/by-nc-sa/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2410.22379$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2410.22379$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Campo, Frank a</creatorcontrib><title>About posets of height one as retracts</title><description>We investigate connected posets $C$ of height one as retracts of finite
posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$
reflecting the network of so-called improper 4-crown bundles contained in the
extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but
not on $P$. There exists a close interdependence between $C$ being a retract of
$P$ and the existence of a graph homomorphism of a certain type from
$\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum
of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism
exists. Returning to general connected posets $C$ of height one, we show that
the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff
the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMgEKGBkZm1tyMqg5JuWXligU5BenlhQr5KcpZKRmpmeUKOTnpSokFisUpZYUJSaXFPMwsKYl5hSn8kJpbgZ5N9cQZw9dsInxBUWZuYlFlfEgk-PBJhsTVgEAFg8s2Q</recordid><startdate>20241029</startdate><enddate>20241029</enddate><creator>Campo, Frank a</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20241029</creationdate><title>About posets of height one as retracts</title><author>Campo, Frank a</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2410_223793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Campo, Frank a</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Campo, Frank a</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>About posets of height one as retracts</atitle><date>2024-10-29</date><risdate>2024</risdate><abstract>We investigate connected posets $C$ of height one as retracts of finite
posets $P$. We define two multigraphs: a multigraph $\mathfrak{F}(P)$
reflecting the network of so-called improper 4-crown bundles contained in the
extremal points of $P$, and a multigraph $\mathfrak{C}(C)$ depending on $C$ but
not on $P$. There exists a close interdependence between $C$ being a retract of
$P$ and the existence of a graph homomorphism of a certain type from
$\mathfrak{F}(P)$ to $\mathfrak{C}(C)$. In particular, if $C$ is an ordinal sum
of two antichains, then $C$ is a retract of $P$ iff such a graph homomorphism
exists. Returning to general connected posets $C$ of height one, we show that
the image of such a graph homomorphism can be a clique in $\mathfrak{C}(C)$ iff
the improper 4-crowns in $P$ contain only a sparse subset of the edges of $C$.</abstract><doi>10.48550/arxiv.2410.22379</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2410.22379 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2410_22379 |
source | arXiv.org |
subjects | Mathematics - Combinatorics |
title | About posets of height one as retracts |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T10%3A57%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=About%20posets%20of%20height%20one%20as%20retracts&rft.au=Campo,%20Frank%20a&rft.date=2024-10-29&rft_id=info:doi/10.48550/arxiv.2410.22379&rft_dat=%3Carxiv_GOX%3E2410_22379%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |