A refinement of a result of Andrews and Newman on the sum of minimal excludants
We find an interesting refinement of a result due to Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of distinct parts partitions of $n$ into two colors. In addition, we also study $k^{th}$ moments of minimal excludants by means of...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| 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 | Bhoria, Subhash Chand Eyyunni, Pramod Maji, Bibekananda |
| description | We find an interesting refinement of a result due to Andrews and Newman, that
is, the sum of minimal excludants over all the partitions of a number $n$
equals the number of distinct parts partitions of $n$ into two colors. In
addition, we also study $k^{th}$ moments of minimal excludants by means of
generalizing the aforementioned result. At the end, we also provide an
alternate proof of a beautiful identity due to Hopkins, Sellers and Stanton. |
| doi_str_mv | 10.48550/arxiv.2110.08108 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2110_08108</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2110_08108</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-3ee4c652375c07266dfe391fbc05cb31a74bfe41e8dbcb286ac4607850638e633</originalsourceid><addsrcrecordid>eNotj8tOwzAQRb3pAhU-gFX9Ayl2_GQZVeUhVXTTfTS2xyJS7CInoeXvSQOr-9DVaA4hj5xtpVWKPUG5dt_bms8Fs5zZO3JsaMHYZUyYR3qOFOY8TP3imxwKXgYKOdAPvCTI9Jzp-Il0mNJtkLrcJegpXn0_BcjjcE9WEfoBH_51TU4v-9PurTocX993zaECbWwlEKXXqhZGeWZqrUNE8cyj80x5JzgY6SJKjjY472qrwUvNjFVMC4taiDXZ_J1diNqvMr9RftobWbuQiV9kZkh1</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A refinement of a result of Andrews and Newman on the sum of minimal excludants</title><source>arXiv.org</source><creator>Bhoria, Subhash Chand ; Eyyunni, Pramod ; Maji, Bibekananda</creator><creatorcontrib>Bhoria, Subhash Chand ; Eyyunni, Pramod ; Maji, Bibekananda</creatorcontrib><description>We find an interesting refinement of a result due to Andrews and Newman, that
is, the sum of minimal excludants over all the partitions of a number $n$
equals the number of distinct parts partitions of $n$ into two colors. In
addition, we also study $k^{th}$ moments of minimal excludants by means of
generalizing the aforementioned result. At the end, we also provide an
alternate proof of a beautiful identity due to Hopkins, Sellers and Stanton.</description><identifier>DOI: 10.48550/arxiv.2110.08108</identifier><language>eng</language><subject>Mathematics - Combinatorics ; Mathematics - Number Theory</subject><creationdate>2021-10</creationdate><rights>http://creativecommons.org/licenses/by/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/2110.08108$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2110.08108$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bhoria, Subhash Chand</creatorcontrib><creatorcontrib>Eyyunni, Pramod</creatorcontrib><creatorcontrib>Maji, Bibekananda</creatorcontrib><title>A refinement of a result of Andrews and Newman on the sum of minimal excludants</title><description>We find an interesting refinement of a result due to Andrews and Newman, that
is, the sum of minimal excludants over all the partitions of a number $n$
equals the number of distinct parts partitions of $n$ into two colors. In
addition, we also study $k^{th}$ moments of minimal excludants by means of
generalizing the aforementioned result. At the end, we also provide an
alternate proof of a beautiful identity due to Hopkins, Sellers and Stanton.</description><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Number Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAQRb3pAhU-gFX9Ayl2_GQZVeUhVXTTfTS2xyJS7CInoeXvSQOr-9DVaA4hj5xtpVWKPUG5dt_bms8Fs5zZO3JsaMHYZUyYR3qOFOY8TP3imxwKXgYKOdAPvCTI9Jzp-Il0mNJtkLrcJegpXn0_BcjjcE9WEfoBH_51TU4v-9PurTocX993zaECbWwlEKXXqhZGeWZqrUNE8cyj80x5JzgY6SJKjjY472qrwUvNjFVMC4taiDXZ_J1diNqvMr9RftobWbuQiV9kZkh1</recordid><startdate>20211015</startdate><enddate>20211015</enddate><creator>Bhoria, Subhash Chand</creator><creator>Eyyunni, Pramod</creator><creator>Maji, Bibekananda</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20211015</creationdate><title>A refinement of a result of Andrews and Newman on the sum of minimal excludants</title><author>Bhoria, Subhash Chand ; Eyyunni, Pramod ; Maji, Bibekananda</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-3ee4c652375c07266dfe391fbc05cb31a74bfe41e8dbcb286ac4607850638e633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Number Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Bhoria, Subhash Chand</creatorcontrib><creatorcontrib>Eyyunni, Pramod</creatorcontrib><creatorcontrib>Maji, Bibekananda</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bhoria, Subhash Chand</au><au>Eyyunni, Pramod</au><au>Maji, Bibekananda</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A refinement of a result of Andrews and Newman on the sum of minimal excludants</atitle><date>2021-10-15</date><risdate>2021</risdate><abstract>We find an interesting refinement of a result due to Andrews and Newman, that
is, the sum of minimal excludants over all the partitions of a number $n$
equals the number of distinct parts partitions of $n$ into two colors. In
addition, we also study $k^{th}$ moments of minimal excludants by means of
generalizing the aforementioned result. At the end, we also provide an
alternate proof of a beautiful identity due to Hopkins, Sellers and Stanton.</abstract><doi>10.48550/arxiv.2110.08108</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2110.08108 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2110_08108 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics Mathematics - Number Theory |
| title | A refinement of a result of Andrews and Newman on the sum of minimal excludants |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T19%3A35%3A45IST&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=A%20refinement%20of%20a%20result%20of%20Andrews%20and%20Newman%20on%20the%20sum%20of%20minimal%20excludants&rft.au=Bhoria,%20Subhash%20Chand&rft.date=2021-10-15&rft_id=info:doi/10.48550/arxiv.2110.08108&rft_dat=%3Carxiv_GOX%3E2110_08108%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 |