Combinatorial complexity of convex sequences
From MaRDI portal
Recommendations
Cited in
(18)- On asymptotic formulae in some sum-product questions
- Geometric and o-minimal Littlewood-Offord problems
- Additive properties of slowly increasing convex sets
- On sumsets on convex sets
- On sums of Szemerédi-Trotter sets
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Decoupling inequalities for short generalized Dirichlet sequences
- On the number of solutions of a Diophantine equation with symmetric entries
- Higher moments of convolutions
- On discrete values of bilinear forms
- On the number of unit-area triangles spanned by convex grids in the plane
- On some matrix counting problems
- On the number of incidences between points and planes in three dimensions
- Higher convexity and iterated second moment estimates
- Sharpening an estimate of the size of the sumset of a convex set
- Large Weyl sums and Hausdorff dimension
- Some new results on higher energies
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
This page was built for publication: Combinatorial complexity of convex sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818680)