Theorems in the additive theory of numbers
From MaRDI portal
Publication:1130799
Cited in
(64)- \(B_ s\)-sequences
- Construction techniques for some thin sets in duals of compact abelian groups
- Some remarks on \(B_ h[g]\) sequences
- Hardness results and spectral techniques for combinatorial problems on circulant graphs
- On the uniform distribution in residue classes of dense sets of integers with distinct sums
- Disjoint sets of distinct sum sets
- A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes
- On the Turán number of some ordered even cycles
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Some characterizations of AM- and AL-spaces
- Nonabelian sets with distinct k-sums
- Coloring the cube with rainbow cycles
- Regular Turán numbers of complete bipartite graphs
- Simplicial complexes from finite projective planes and colored configurations
- The spum and sum-diameter of graphs: labelings of sum graphs
- Random and quasi-random designs in group testing
- The Bose-Chowla argument for Sidon sets
- Chromatic numbers of some distance graphs
- On modular \(k\)-free sets
- A new class of near-optimal partial Fourier codebooks from an almost difference set
- Constructions of generalized Sidon sets.
- Dense edge-magic graphs and thin additive bases
- Sidon sets for linear forms
- Good low degree rank-1 lattice rules of high dimension
- Orthogonal polarity graphs and Sidon sets
- The number of B₃-sets of a given cardinality
- Stolarsky’s conjecture and the sum of digits of polynomial values
- Diameters and Eigenvalues
- A note on a theorem of lindstrom
- On Additive Bases and Harmonious Graphs
- On simultaneous digital expansions of polynomial values
- Minimum-weight edge discriminators in hypergraphs
- The Binary Digits of a Power
- On the Size of Finite Sidon Sequences
- Finding finite 𝐵₂-sequences faster
- \(k\)-fold Sidon sets
- B h [ g ] sequences
- The generalized rainbow Turán problem for cycles
- \(B_h[g]\) modular sets from \(B_h\) modular sets
- Difference bases in dihedral groups
- Additive correlation and the inverse problem for the large sieve
- On the number of B_h-sets
- Improved bounds on Sidon sets via lattice packings of simplices
- Difference bases in cyclic groups
- Upper and lower bounds on the size of \(B_k[g]\) sets
- A new upper bound for \(B_2 [2]\) sets
- New upper bounds for finite \(B_h\) sequences
- Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets
- Recovering affine linearity of functions from their restrictions to affine lines
- Constructing thick \(B_h\)-sets
- On the additive complexity of some integer sequences
- On the packing density of Lee spheres
- Finding large additive and multiplicative Sidon sets in sets of integers
- On the rainbow Turán number of paths
- B_h-sets of real and complex numbers
- \textbf{Q}-independence and the construction of \(B_h\)-sets of integers and lattice points
- Cardinalities of g-difference sets
- The m-th element of a Sidon set
- More on codes for combinatorial composite DNA
- Bounds for greedy B_h-sets
- Improved L^p bounds for Bochner-Riesz operators associated with rough convex domains in the plane
- Negativity-preserving transforms of tuples of symmetric matrices
- On the quantum query complexity of local search in two and three dimensions
- On Costas sets and Costas clouds
This page was built for publication: Theorems in the additive theory of numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130799)
