Constructing MSTD sets using bidirectional ballot sequences (Q971849): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60692228 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2111033825 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0908.4442 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some explicit constructions of sets with more sums than differences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: When almost all sets are difference dominated / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4256479 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On A Conjecture of Conway / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5431595 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Explicit constructions of infinite families of MSTD sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5431592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3419029 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083783 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Four Proofs of the Ballot Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A mean value density theorem of additive number theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4163540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Additive completion and disjoint translations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of sums and differences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2859380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting MSTD sets in finite abelian groups / rank | |||
Normal rank |
Latest revision as of 20:36, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing MSTD sets using bidirectional ballot sequences |
scientific article |
Statements
Constructing MSTD sets using bidirectional ballot sequences (English)
0 references
17 May 2010
0 references
An MSTD (More Sums Than Differences) set is finite set \(A\) of integers, such that \(|A+A|>|A-A|\) (in general, because the sum is a commutative operation and difference is not, this type of sets forms a singularity). The first example was found by Conway in the 1960s: \(\{0,2,3,4,7,11,12,14\}\). The author improves another result presented in the same issue of J. Number Theory. In [\textit{S. J. Miller, B. Orosz} and \textit{D. Scheinerman}, J. Number Theory 130, No. 5, 1221--1233 (2010; Zbl 1216.11095)], a construction of an infinite family of MSTD sets, with the density \(\Omega (1/n^4)\) (as subsets of \([1,n]=\{1,2,\dots,n\}\)) was presented. Starting with a similar idea -- a symmetric set augmented by few elements that increase the number of sums more than the number of differences -- the paper makes use of a combinatorial object named \textit{bidirectional ballot sequence} (a 0-1 sequence where every prefix and suffix contain more 1's than 0's). It results an infinite family of MSTD subsets of \([1,n]\) with the density \(\Theta (1/n)\). The paper is very interesting, with many possibilities for sequels. The author suggests some other results, like \(n\Omega(2^n/n)/2^{n-2}\rightarrow 1\), but it claims that ``the proof is rather long and technical'', so it is not presented. Moreover, the last sentence of the paper is ``The asymptotics related to bidirectional ballot sequences are very intriguing, and we hope to generate more interest in these objects''. I agree.
0 references
sum sets
0 references
difference set
0 references
bidirectional ballot sequence
0 references