加载中…
Let denote the largest cardinality of a Sidon subset of . We prove The argument uses a vector-valued convolution inequality in which several smoothing kernels cooperate to produce a boundary majorant while their energies are averaged. For fixed kernels and mixing weights, the boundary optimization is a strictly convex quadratic program with an explicit dual. An eight-kernel numerical candidate is converted into a finite rational certificate and verified using exact arithmetic only.

生成讲解博客的中文版本

生成AI智能校验的中文版本