A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers
We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers \(b(5) = 7581\) and \(b(6) = 7828354\). For the calculation of \(b(5)\), we develop two methods of which the first one (without pre-calculations) requires...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2022-06 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Campo, Frank a |
description | We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers \(b(5) = 7581\) and \(b(6) = 7828354\). For the calculation of \(b(5)\), we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of \(b(6)\) (with pre-calculations) is done by evaluating 245 posets. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2679493226</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2679493226</sourcerecordid><originalsourceid>FETCH-proquest_journals_26794932263</originalsourceid><addsrcrecordid>eNqNjssKgkAYhYcgSMp3-KG1YDNquZRUWrWpZSBefnFMZ2wu1OM3ix6g1Vl83-GcFfEoY4fgFFG6Ib7WYxiGNDnSOGYeeWRQTvjhzYSQLYuSdTtALxWYAaEQdkZVGy4FyB5y-RbBDY2GWnTAXbrGxNufICDHDp_csaudG1R6R9Z9PWn0f7kl-7K4ny-B23lZ1KYapVXCocodSqOUUZqw_6wvM7BCjw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2679493226</pqid></control><display><type>article</type><title>A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers</title><source>Free E- Journals</source><creator>Campo, Frank a</creator><creatorcontrib>Campo, Frank a</creatorcontrib><description>We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers \(b(5) = 7581\) and \(b(6) = 7828354\). For the calculation of \(b(5)\), we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of \(b(6)\) (with pre-calculations) is done by evaluating 245 posets.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Enumeration ; Mathematical analysis ; Set theory</subject><ispartof>arXiv.org, 2022-06</ispartof><rights>2022. This work is published under http://creativecommons.org/licenses/by-nc-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Campo, Frank a</creatorcontrib><title>A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers</title><title>arXiv.org</title><description>We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers \(b(5) = 7581\) and \(b(6) = 7828354\). For the calculation of \(b(5)\), we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of \(b(6)\) (with pre-calculations) is done by evaluating 245 posets.</description><subject>Enumeration</subject><subject>Mathematical analysis</subject><subject>Set theory</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNjssKgkAYhYcgSMp3-KG1YDNquZRUWrWpZSBefnFMZ2wu1OM3ix6g1Vl83-GcFfEoY4fgFFG6Ib7WYxiGNDnSOGYeeWRQTvjhzYSQLYuSdTtALxWYAaEQdkZVGy4FyB5y-RbBDY2GWnTAXbrGxNufICDHDp_csaudG1R6R9Z9PWn0f7kl-7K4ny-B23lZ1KYapVXCocodSqOUUZqw_6wvM7BCjw</recordid><startdate>20220627</startdate><enddate>20220627</enddate><creator>Campo, Frank a</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20220627</creationdate><title>A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers</title><author>Campo, Frank a</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26794932263</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Enumeration</topic><topic>Mathematical analysis</topic><topic>Set theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Campo, Frank a</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Campo, Frank a</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers</atitle><jtitle>arXiv.org</jtitle><date>2022-06-27</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers \(b(5) = 7581\) and \(b(6) = 7828354\). For the calculation of \(b(5)\), we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of \(b(6)\) (with pre-calculations) is done by evaluating 245 posets.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2022-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2679493226 |
source | Free E- Journals |
subjects | Enumeration Mathematical analysis Set theory |
title | A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T11%3A45%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=A%20Flexible%20Approach%20for%20the%20Enumeration%20of%20Down-Sets%20and%20its%20Application%20on%20Dedekind%20Numbers&rft.jtitle=arXiv.org&rft.au=Campo,%20Frank%20a&rft.date=2022-06-27&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2679493226%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2679493226&rft_id=info:pmid/&rfr_iscdi=true |