相关论文: Explicit Formula for Counting Lattice Points of Po…

Zeros and poles of $k$-tuple zeta functions, that are defined here implicitly, enable localization onto prime-power $k$-tuples in pair-wise coprime $k$-lattices $\mathfrak{N}_k$. As such, the set of all $\mathfrak{N}_k$ along with their…

The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials (written as sums of monomials). We give recurrence formulae…

This paper addresses the computation of normalized solid angle measure of polyhedral cones. This is well understood in dimensions two and three. For higher dimensions, assuming that a positive-definite criterion is met, the measure can be…

The number of solutions in finite fields of a system of polynomial equations obeys a very strong regularity, reflected for example by the rationality of the zeta function of an algebraic variety defined over a finite field, or the…

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

We present a method using contour integration to derive definite integrals and their associated infinite sums which can be expressed as a special function. We give a proof of the basic equation and some examples of the method. The advantage…

We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…

For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of vertices, m is the number of facets, a is the number of…

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

We consider zeta functions: $Z(f ;P ;s)=\sum_{\m \in \N^{n}} f(m_1,..., m_n) P(m_1,..., m_n)^{-s/d}$ where $P \in \R [X_1,..., X_n]$ has degree $d$ and $f$ is a function arithmetic in origin, e.g. a multiplicative function. In this paper, I…

The Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of…

We define a parametric variant of generalized Euler sums and construct contour integration to give some explicit evaluations of these parametric Euler sums. In particular, we establish several explicit formulas of (Hurwitz) zeta functions,…

We establish an asymptotic formula for counting integer solutions with smooth weights to an equation of the form $xy-zw=r$, where $r$ is a non-zero integer, with an explicit main term and a strong bound on the error term in terms of the…

We extend our previous work on hypergeometric point count formulas by proving that we can express the number of points on families of Dwork hypersurfaces $$X_{\lambda}^d: \hspace{.1in} x_1^d+x_2^d+\ldots+x_d^d=d\lambda x_1x_2\cdots x_d$$…

The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…