Related papers: Numerical Adjunction Formulas for Weighted Project…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
We describe methods for calculation of polytopes of quasiadjunction for plane curve singularities which are invariants giving a Hodge theoretical refinement of the zero sets of multivariable Alexander polynomials. In particular we identify…
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…
We describe a method for computing the highest degree coefficients of a weighted Ehrhart quasi-polynomial for a rational simple polytope.
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
Fake projective planes are smooth complex surfaces of general type with Betti numbers equal to those of the usual projective plane. They come in complex conjugate pairs and have been classified as quotients of the two-dimensional ball by…
We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…
The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…
As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…
We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
In this note we extend the concept height on projective spaces to that of weighted height on weighted projective spaces and show how such a height can be computed. We prove some of the basic properties of the weighted height and show how it…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
Welschinger invariants of the real projective plane can be computed via the enumeration of enriched graphs, called marked floor diagrams. By a purely combinatorial study of these objects, we prove a Caporaso-Harris type formula which allows…
Let $C$ be a generic complex plane plane curve with a given Newton polygon $P$. We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve $C^\vee$). We also prove…
The curvature estimates of quotient curvature equation do not always exist even for convex setting \cite{GRW}. Thus it is natural question to find other type of elliptic equations possessing curvature estimates. In this paper, we discuss…
In this article we provide another method for obtaining explicit formulas yielding counts of secant planes to a projective curve. We formulate the problem in terms of Segre classes of suitable bundles over the symmetric product of the curve…