Related papers: Ehrhart-Macdonald reciprocity extended
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
In this paper, we establish some reciprocity formulas for certain generalized Hardy-Berndt sums by using the Fourier series technique and some properties of the periodic zeta function and the Lerch zeta function. It turns out that one of…
In this paper, we study the reciprocal sums of the Jacobsthal numbers. We establish many results on the infinite sum and alternating infinite sum of the reciprocals of Jacobsthal numbers and square Jacobsthal numbers.
An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
Given a vector space with two multiplications, one commutative the other anticommutative, possibly connected by a distributive law, the depolarization principle allows to look at this triplet through a single nonassociative multiplication.…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Various formulas for reciprocals of densely defined weighted composition operators in $L^2$-spaces as well as for their adjoints are provided. The relation between the reciprocal of a weighted composition operator and the product of the…
We compute the equivariant homology and cohomology of projective spaces with integer coefficients. More precisely, in the case of cyclic groups, we show that the cellular filtration of the projective space $P(k\rho )$, of lines inside…
For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
This article is about both approximation theory and the numerical solution of partial differential equations (PDEs). First we introduce the notion of {\em reciprocal-log} or {\em log-lightning approximation} of analytic functions with…
The existence of the limiting pair correlation for angles between reciprocal geodesics on the modular surface is established. An explicit formula is provided, which captures geometric information about the length of reciprocal geodesics, as…
We prove Macdonald-type deformations of a number of well-known classical branching rules by employing identities for elliptic hypergeometric integrals and series. We also propose some conjectural branching rules and allied conjectures…
An outstanding conjecture on roots of Ehrhart polynomials says that all roots $\alpha$ of the Ehrhart polynomial of an integral convex polytope of dimension $d$ satisfy $-d \leq \Re(\alpha) \leq d-1$. In this paper, we suggest some…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
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…