Related papers: Sharp bounds on fake weighted projective spaces wi…

We give sharp upper bounds on the anticanonical degree of fake weighted projective spaces, only depending on the dimension and the Gorenstein index.

A fake weighted projective space X is a Q-factorial toric variety with Picard number one. As with weighted projective space, X comes equipped with a set of weights (\lambda_0,...,\lambda_n). We see how the singularities of…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

We characterise mutations between fake weighted projective spaces, and give explicit formulas for how the weights and multiplicity change under mutation. In particular, we prove that multiplicity-preserving mutations between fake weighted…

We will give an upper bound for the $k$-normality of very ample lattice simplices, and then give an Eisenbud-Goto-type bound for some special classes of projective toric varieties.

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

We present a classification of all weighted projective spaces with at worst terminal or canonical singularities in dimension four. As a corollary we also classify all four-dimensional one-point lattice simplices up to equivalence. Finally,…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…

We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…

Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Simplex slicing (Webb, 1996) is a sharp upper bound on the volume of central hyperplane sections of the regular simplex. We extend this to sharp bounds in the probabilistic framework of negative moments, and beyond, of centred log-concave…

We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…