Related papers: An Euler operator approach to Ehrhart series
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…
In this paper, we introduce the Theta Partial operator $\theta(y\mathbf{D}_{\lambda})$, based on the $\lambda$-derivative operator $\mathbf{D}_{\lambda}$, and use it to define the following generalization of the Lambert series…
Starting from Rodrigues formula we present a general construction of raising and lowering operators for orthogonal polynomials of continuous and discrete variable on uniform lattice. In order to have these operators mutually adjoint we…
We present an operator approach to Rogers-type formulas and Mehler's formulas for the Al-Salam-Carlitz polynomials $U_n(x,y,a;q)$. By using the q-exponential operator, we obtain a Rogers-type formula which leads to a linearization formula.…
The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
Using a ribbon structure of the graph, we construct a dissection of the symmetric edge polytope of a graph into unimodular simplices. Our dissection is shellable, and one can interpret the elements of the resulting $h$-vector via graph…
By the work of J.Huh, one can interpret binomial coefficients as a solution to an intersection problem on a permutohedral variety $X_E$. Applying Hirzebruch-Riemann-Roch, this intersection problem is equivalent to computing Euler…
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…
This paper deals with a Euler type integral operator involving k-Mittag-Leffler function defined by Gupta and Parihar [8]. Furthermore, some special cases are also taken into consideration.
The Euler-Poincar\'e characteristic of a finite-dimensional Lie algebra vanishes. If we want to extend this result to Lie superalgebras, we should deal with infinite sums. We observe that a suitable method of summation, which goes back to…
M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
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 prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…