相关论文: Residue formulae for vector partitions and Euler-M…

Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $\varphi\colon V\rightarrow \CC $ be a homogeneous polynomial function of…

We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…

Consider the space $R_{\Delta}$ of rational functions of several variables with poles on a fixed arrangement $\Delta$ of hyperplanes. We obtain a decomposition of $R_{\Delta}$ as a module over the ring of differential operators with…

The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…

We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…

Nice formulae for plane partitions with bounded size of parts (or boxed plane partitions), which generalize the norm-trace generating function by Stanley and the trace generating function by Gansner, are exhibited. The derivation of the…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

In this paper, by using the method of Contour Integral Representations and the Theorem of Residues and integral representations of series, we discuss the analytic representa- tions of parametric Euler sums that involve harmonic numbers…

From the literature it is known that orthogonal polynomials as the Jacobi polynomials can be expressed by hypergeometric series. In this paper, the authors derive several contiguous relations for terminating multivariate hypergeometric…

The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

The Gelfond-Khovanskii residue formula computes the sum of the values of any Laurent polynomial over solutions of a system of Laurent polynomial equations whose Newton polytopes have sufficiently general relative position. We discuss two…

An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…