相关论文: Local Euler-Maclaurin expansion of Barvinok valuat…
We propose a formula for finding the horizontal, oblique or curvilinear asymptote of any rational polynomial function of any positive degree, as a sum of matrix determinants formed directly from the coefficients of the terms in the given…
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…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
Let Y be a random variable whose moment generating function exists in a neighborhood of the origin. The aim of this paper is to represent arbitrary polynomials in terms of probabilistic Frobenius-Euler polynomials associated with Y and…
We give a combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices. In a special case, where these polytopes coincide with the base polytope of the panhandle matroid $\textrm{Pan}_{k,n-2,n}$, we…
We show that the Euler-MacLaurin formula for Riemann sums has an n-dimensional analogue in which intervals on the line get replaced by convex polytopes.
With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…
We compare the yields of two methods to obtain Bernstein type pointwise estimates for the derivative of a multivariate polynomial in points of some domain, where the polynomial is assumed to have sup norm at most 1. One method, due to…
This paper introduces an extension of the well-known Morley element for the biharmonic equation, extending its application from triangular elements to general polytopal elements using the weak Galerkin finite element methods. By leveraging…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…
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 develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal error estimates for an averaged Taylor polynomial are…
We propose a new analytical method to solve for nonexactly soluble Schrodinger equation via expansions through some existing quantum numbers. Successfully, it is applied to the rational non-polynomial oscillator potential. Moreover, a…
In this paper, we study the Laurent coefficients of meromorphic modular forms at CM points by giving two approaches of computing them. The first is a generalization of the method of Rodriguez-Villegas and Zagier, which expresses the Laurent…
We prove that non-hyperbolic non-renormalizable quadratic polynomials are expansion inducing. For renormalizable polynomials a counterpart of this statement is that in the case of unbounded combinatorics renormalized mappings become almost…
In this article, a formulation of a point-collocation method in which the unknown function is approximated using global expansion in tensor product Bernstein polynomial basis is presented. Bernstein polynomials used in this study are…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
The first objective of the paper is to estimate logarithmic partial derivative for meromorphic functions in several complex variables. Our estimations for logarithmic partial derivatives extend the results of Gundersen \cite{GG2} to the…
We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…