Related papers: Intermediate Sums on Polyhedra: Computation and Re…
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…
In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…
We provide a systematic method to compute arithmetic sums including some previously computed by Alaca, Alaca, Besge, Cheng, Glaisher, Huard, Lahiri, Lemire, Melfi, Ou, Ramanujan, Spearman and Williams. Our method is based on quasimodular…
Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator…
This paper develops an approach to the evaluation of quadratic Euler sums that involve harmonic numbers. The approach is based on simple integral computations of polyloga- rithms. By using the approach, we establish some relations between…
Vlastimil Pt\'ak's method of nondiscrete induction is based on the idea that in the analysis of iterative processes one should aim at rates of convergence as functions rather than just numbers, because functions may give convergence…
In this paper, we consider a discrete version of iterated integrals by the naive (equally divided) Riemann sum. In particular, basic three formulas for usual iterated integrals are discritized. Moreover, we proved cyclic sum formulas for…
The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…
For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…
Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly…
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…
We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin…
A local lattice point counting formula, and more generally a local Euler-Maclaurin formula follow by comparing two natural families of meromorphic functions on the dual of a rational vector space $V$, namely the family of exponential sums…
The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…
Sylvester doubles sums, introduced first by Sylvester are symmetric expressions of the roots of two polynomials. Sylvester's definition of double sums makes no sense in the presence of multiple roots, since the definition involves…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…