Related papers: Weighted Ehrhart functions
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…
For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…
Multicurrent correlators associated to KP $\tau$-functions of hypergeometric type are used as generating functions for weighted Hurwitz numbers. These are expressed as formal Taylor series and used to compute generic, simple, rational and…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the…
We study the orthogonal polynomials associated with the equilibrium measure, in logarithmic potential theory, living on the attractor of an Iterated Function System. We construct sequences of discrete measures, that converge weakly to the…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
A generalisation of the odd Bernoulli polynomials related to the quantum Euler top is introduced and investigated. This is applied to compute the coefficients of the spectral polynomials for the classical Lam\'e operator.
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.
The basis elements spanning the Sato Grassmannian element corresponding to the KP $\tau$-function that serves as generating function for rationally weighted Hurwitz numbers are shown to be Meijer $G$-functions. Using their Mellin-Barnes…
We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.
In this paper, we construct the alternating multiple q-zeta function(= Multiple Euler q-zeta function) and investigate their properties. Finally, we give some interesting functional eauations related to q-Euler polynomials.
In this article we consider certain types of weighted generalized functions associated with nondegenerate quadratic forms. Such functions and their derivatives are used for constructing fundamental solutions of iterated ultra-hyperbolic…
Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling, as developed in \cite{LSX}. The main results consist of a new derivation of the Gaussian type cubature for the…
In this paper we study the higher-order Euler numbers and polynomials and we introduce the mutiple zeta functions which interpolate higher-order Euler polynomials and numbers at negative integers
Employing two models, we show that various counting functions of a random variable defined by restriction or contraction of a ranked set with multiplicity (e.g., classical and arithmetic matroids) have expectations given by the…
We give a Fourier-type formula for computing the orthogonal Weingarten formula. The Weingarten calculus was introduced as a systematic method to compute integrals of polynomials with respect to Haar measure over classical groups. Although a…