Explicit constructions of infinite families of MSTD sets

Explicit constructions of infinite families of MSTD sets

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our family is significantly denser than previous constructions (w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2008-11
Hauptverfasser: Miller, Steven J, Orosz, Brooke, Scheinerman, Daniel
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Number Theory
Polynomials
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 Miller, Steven J
Orosz, Brooke
Scheinerman, Daniel
description We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2^{r/2} for some polynomial f(r)). We conclude by generalizing our method to compare linear forms epsilon_1 A + ... + epsilon_n A with epsilon_i in {-1,1}.
doi_str_mv 10.48550/arxiv.0809.4621
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0809_4621</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2087511728</sourcerecordid><originalsourceid>FETCH-LOGICAL-a518-529c32ac6c28ffe015ec86c562f4a05c08a37cc84d68ec38cdef87ca38b10b7d3</originalsourceid><addsrcrecordid>eNotj71rwzAUxEWh0JBm71QMne1KT5b0MpY0_YCUDvVulGcJFBw7teSS_vd1kk53HMdxP8buBC9KVIo_2uEYfgqOfFmUGsQVm4GUIscS4IYtYtxxzkEbUErOGK6PhzZQSBn1XUzDSClMJut9FjofupBc5u0-tMGdw4-v6jmLLsVbdu1tG93iX-esellXq7d88_n6vnra5FYJzBUsSYIlTYDeOy6UI9SkNPjSckUcrTREWDYaHUmkxnk0ZCVuBd-aRs7Z_WX2TFUfhrC3w299oqtPdFPh4VI4DP336GKqd_04dNOlGjgaJYQBlH-XClIC</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2087511728</pqid></control><display><type>article</type><title>Explicit constructions of infinite families of MSTD sets</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Miller, Steven J ; Orosz, Brooke ; Scheinerman, Daniel</creator><creatorcontrib>Miller, Steven J ; Orosz, Brooke ; Scheinerman, Daniel</creatorcontrib><description>We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2^{r/2} for some polynomial f(r)). We conclude by generalizing our method to compare linear forms epsilon_1 A + ... + epsilon_n A with epsilon_i in {-1,1}.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0809.4621</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Mathematics - Number Theory ; Polynomials</subject><ispartof>arXiv.org, 2008-11</ispartof><rights>2008. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.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,784,885,27923</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.jnt.2009.09.003$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.0809.4621$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Miller, Steven J</creatorcontrib><creatorcontrib>Orosz, Brooke</creatorcontrib><creatorcontrib>Scheinerman, Daniel</creatorcontrib><title>Explicit constructions of infinite families of MSTD sets</title><title>arXiv.org</title><description>We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2^{r/2} for some polynomial f(r)). We conclude by generalizing our method to compare linear forms epsilon_1 A + ... + epsilon_n A with epsilon_i in {-1,1}.</description><subject>Mathematics - Number Theory</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj71rwzAUxEWh0JBm71QMne1KT5b0MpY0_YCUDvVulGcJFBw7teSS_vd1kk53HMdxP8buBC9KVIo_2uEYfgqOfFmUGsQVm4GUIscS4IYtYtxxzkEbUErOGK6PhzZQSBn1XUzDSClMJut9FjofupBc5u0-tMGdw4-v6jmLLsVbdu1tG93iX-esellXq7d88_n6vnra5FYJzBUsSYIlTYDeOy6UI9SkNPjSckUcrTREWDYaHUmkxnk0ZCVuBd-aRs7Z_WX2TFUfhrC3w299oqtPdFPh4VI4DP336GKqd_04dNOlGjgaJYQBlH-XClIC</recordid><startdate>20081122</startdate><enddate>20081122</enddate><creator>Miller, Steven J</creator><creator>Orosz, Brooke</creator><creator>Scheinerman, Daniel</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><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20081122</creationdate><title>Explicit constructions of infinite families of MSTD sets</title><author>Miller, Steven J ; Orosz, Brooke ; Scheinerman, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a518-529c32ac6c28ffe015ec86c562f4a05c08a37cc84d68ec38cdef87ca38b10b7d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Mathematics - Number Theory</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Miller, Steven J</creatorcontrib><creatorcontrib>Orosz, Brooke</creatorcontrib><creatorcontrib>Scheinerman, Daniel</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</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>Publicly Available Content Database</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><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Miller, Steven J</au><au>Orosz, Brooke</au><au>Scheinerman, Daniel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Explicit constructions of infinite families of MSTD sets</atitle><jtitle>arXiv.org</jtitle><date>2008-11-22</date><risdate>2008</risdate><eissn>2331-8422</eissn><abstract>We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2^{r/2} for some polynomial f(r)). We conclude by generalizing our method to compare linear forms epsilon_1 A + ... + epsilon_n A with epsilon_i in {-1,1}.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0809.4621</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2008-11
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0809_4621
source arXiv.org; Free E- Journals
subjects Mathematics - Number Theory
Polynomials
title Explicit constructions of infinite families of MSTD sets
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T11%3A25%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Explicit%20constructions%20of%20infinite%20families%20of%20MSTD%20sets&rft.jtitle=arXiv.org&rft.au=Miller,%20Steven%20J&rft.date=2008-11-22&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0809.4621&rft_dat=%3Cproquest_arxiv%3E2087511728%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2087511728&rft_id=info:pmid/&rfr_iscdi=true