Related papers: Explicit Formula for Counting Lattice Points of Po…
We present a randomised algorithm to compute the local zeta function of a fixed smooth, projective surface over $\mathbb{Q}$, at any large prime $p$ of good reduction. The runtime of our algorithm is polynomial in $\log p$, resolving a…
Let $X$ be a rational surface obtained by blowing up at a configuration $\mathcal{C}$ of infinitely near points over a Hirzebruch surface $\mathbb{F}_\delta$. We prove that there exist two positive integers $a \leq b$ such that the cone of…
We compute the asymptotics of the number of integral quadratic forms with prescribed orthogonal decompositions and, more generally, the asymptotics of the number of lattice points lying in sectors of affine symmetric spaces. A new key…
Counting lattice points within a rational polytope is a foundational problem with applications across mathematics and computer science. A key approach is Barvinok's algorithm, which decomposes the lattice point generating function of cones…
We give a local Euler-Maclaurin formula for rational convex polytopes in a rational euclidean space . For every affine rational polyhedral cone C in a rational euclidean space W, we construct a differential operator of infinite order D(C)…
For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…
We count the number of conics through two general points in complete intersections when this number is finite and give an application in terms of quasi-lines.
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…
We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…
We derive an asymptotic formula for the sum $$ H = \sum_{0<\gamma_k\leqslant T,\, 1\leqslant k\leqslant m}h(a_1\gamma_1+a_2\gamma_2+\cdots + a_m\gamma_m), $$ where $a_1, a_2, \ldots, a_m$ are integers whose sum equals zero, $\gamma_1,…
The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…
We prove a variety of explicit formulas relating special values of generalized hypergeometric functions to lattice sums with four indices of summation. These results are related to Boyd's conjectured identities between Mahler measures and…
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…
Given an elliptic curve $E$ defined over $\mathbb{C}$, let $E^{\times}$ be an open subset of $E$ obtained by removing a point. In this paper, we show that the $i$-th Betti number of the unordered configuration space…
A closed convex polytope in n dimensions defined by m linear inequality constraints is considered. If L is a straight line drawn in any direction from any feasible point P, then in general, it intersects every constraint at one point,…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…