Related papers: Highest coefficients of weighted Ehrhart quasi-pol…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…
In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of \emph{non}-integral convex polygons. Define a \emph{pseudo-integral…
The purpose of this paper is to construct q-Euler numbers and polynomials by using p-adic q-integral equations on Zp. Finally, we will give some interesting formulae related to these q-Euler numbers and polynomials.
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.
In 1976, P. R. Scott characterized the Ehrhart polynomials of convex integral polygons. We study the same question for Ehrhart polynomials and quasi-polynomials of *non*-integral convex polygons. Turning to the case in which the Ehrhart…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…
We show how to compute the Ehrhart polynomial of the free sum of two lattice polytopes containing the origin $P$ and $Q$ in terms of the enumerative combinatorics of $P$ and $Q$. This generalizes work of Beck, Jayawant, McAllister, and…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
We propose a combinatorial interpretation of the coefficient of $q$ in Kazhdan- Lusztig polynomials and we prove it for finite simply-laced Weyl groups.
The product formula for evaluating products of skew polynomials is used to construct a class of rings. As an application, we present a method of evaluating quotients of skew polynomials.
We present a formula for the degree of the discriminant of irreducible representations of a Lie group, in terms of the roots of the group and the highest weight of the representation. The proof uses equivariant cohomology techniques,…
We determine the asymptotic behavior of the coefficients of Hecke polynomials. In particular, this allows us to determine signs of these coefficients when the level or the weight is sufficiently large. In all but finitely many cases, this…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…