• A
• A
• A
• ABC
• ABC
• ABC
• А
• А
• А
• А
• А
Regular version of the site

## Hodge complexity for weighted complete intersections

We give lower bounds for Hodge numbers of smooth well formed Fano weighted complete intersections. In particular, we compute their Hodge complexity, that is, the maximal distance between non-trivial Hodge numbers. This allows us to classify varieties of such type whose Hodge numbers are like that of a projective space, of a curve, or of a Calabi-Yau variety of low dimension.