Upper and lower bounds on the size of B_k[g] sets
From MaRDI portal
Publication:5863480
Abstract: A subset of the integers is a set if the number of multisets from that sum to any fixed integer is at most . Let denote the maximum size of a set in . In this paper we improve the best-known upper bounds on for and large. When we match the best upper bound of Green with an improved error term. Additionally, we give a lower bound on that matches a construction of Lindstr"om while removing one of the hypotheses.
Recommendations
Cites work
- \(B_h[g]\) modular sets from \(B_h\) modular sets
- B h [ g ] sequences
- B2[g] Sets and a Conjecture of Schinzel and Schmidt
- $B_h[g]$-sequences from $B_h$-sequences
- A complete annotated bibliography of work related to Sidon sequences
- A Note on the Erdös Distinct Subset Sums Problem
- An improvement of convergence rate estimates in the Lyapunov theorem
- An upper bound for \(B_{2}[g]\) sets
- Constructions of generalized Sidon sets.
- Generalized Sidon sets
- scientific article; zbMATH DE number 5557913 (Why is no real title available?)
- scientific article; zbMATH DE number 1735723 (Why is no real title available?)
- New asymptotics for bipartite Turán numbers
- Norm-graphs: Variations and applications
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On finite Sidon sequences
- On the Size of Finite Sidon Sequences
- Sidon sets and graphs without 4-cycles
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- The density of \(B_ h[g]\) sequences and the minimum of dense cosine sums
- The number of squares and \(B_h[g]\) sets
- The Symmetric Subset Problem in Continuous Ramsey Theory
- The Zarankiewicz problem in 3-partite graphs
- Theorems in the additive theory of numbers
- Upper and lower bounds for finite \(B_h[g]\) sequences.
- Upper bounds for \(B_{h}[g]\)-sets with small \(h\)
Cited in
(12)- The size of Max\((p)\) sets and density bases.
- Upper bounds for \(B_{h}[g]\)-sets with small \(h\)
- An improved upper bound on the maximum size of k-primitive sets
- scientific article; zbMATH DE number 4080714 (Why is no real title available?)
- scientific article; zbMATH DE number 7338626 (Why is no real title available?)
- The sizes of the classes of H(N)-sets
- An Upper Bound for Weak B_k-Sets
- Upper and lower bounds on \(B_k^{+}\)-sets
- On generalized Sidon spaces
- Finding large additive and multiplicative Sidon sets in sets of integers
- An Ehrhart theoretic approach to generalized Golomb rulers
- Cardinalities of g-difference sets
This page was built for publication: Upper and lower bounds on the size of \(B_k[g]\) sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863480)