Combinatorial complexity of convex sequences

DOI10.1007/s00454-005-1194-yzbMath1116.11011OpenAlexW2075616478MaRDI QIDQ818680

N. E. Zubov

Publication date: 21 March 2006

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-005-1194-y

zbMATH Keywords

number of solutionsstrictly convex sequencesstrictly increasing sequence of differences

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Other combinatorial number theory (11B75) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Combinatorial complexity of geometric structures (52C45)

Related Items (17)

On the number of unit-area triangles spanned by convex grids in the plane ⋮ On sums of Szemerédi-Trotter sets ⋮ Higher convexity and iterated second moment estimates ⋮ Some new results on higher energies ⋮ On the number of solutions of a Diophantine equation with symmetric entries ⋮ Higher moments of convolutions ⋮ Sharpening an estimate of the size of the sumset of a convex set ⋮ On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space ⋮ Decoupling inequalities for short generalized Dirichlet sequences ⋮ Bilinear and quadratic variants on the Littlewood-Offord problem ⋮ Additive properties of slowly increasing convex sets ⋮ On asymptotic formulae in some sum–product questions ⋮ On discrete values of bilinear forms ⋮ On the number of incidences between points and planes in three dimensions ⋮ On Sumsets of Convex Sets ⋮ Large Weyl sums and Hausdorff dimension ⋮ Geometric and o-minimal Littlewood-Offord problems

This page was built for publication: Combinatorial complexity of convex sequences