Related papers: An Euler-Maclaurin formula for polygonal sums
We use the ordinary Euler operator to compute the Ehrhart series for an arbitrary lattice polytope. The resulting formula involves the coefficients of the Ehrhart polynomial, combined via Eulerian numbers. We use this to compute $h^*_{d-1}$…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
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.…
In this paper, we establish Newton-Maclaurin type inequalities for functions arising from linear combinations of primitively symmetric polynomials. This generalization extends the classical Newton-Maclaurin inequality to a broader class of…
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.
In this paper, we continue to study properties of rational approximations to Euler's constant and values of the Gamma function defined by linear recurrences, which were found recently by A. I. Aptekarev and T. Rivoal. Using multiple…
We study the computation of local approximations of invariant manifolds of parabolic fixed points and parabolic periodic orbits of periodic vector fields. If the dimension of these manifolds is two or greater, in general, it is not possible…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…
In this study, we employ Euler's method and Richardson's extrapolation to solve a triple integral, which is then transformed into a third-order initial value problem. Our objective is to resolve the computational challenges associated with…
We give a new proof of Milne's formulas for the number of representations of an integer as a sum of 4m^2 and 4m(m+1) squares. The proof is based on explicit evaluation of pfaffians with elliptic function entries, and relates Milne's…
Recently, Bordell\'{e}s, Dai, Heyman, Pan and Shparlinski in \cite{Igor} considered a partial sum involving the Euler totient function and the integer parts $\lfloor x/n\rfloor$ function. Among other things, they obtained reasonably tight…
The explicit formulas expressing harmonic sums via alternating Euler sums (colored multiple zeta values) are given, and some explicit evaluations are given as applications.
As an application of universal polynomials for local and multi-singularities of maps, we revisit classical enumerative formulae of Salmon-Cayley-Zeuthen for projective surfaces and analogous formulae of Segre-(B.)Severi-Roth for projective…
The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…
In this paper a new approach is derived in the context of shape theory. The implemented methodology is motivated in an open problem proposed in \citet{GM93} about the construction of certain shape density involving Euler hypergeometric…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
A numerical algorithm (implemented in Matlab) for computing the zeros of the parabolic cylinder function $U(a,z)$ in domains of the complex plane is presented. The algorithm uses accurate approximations to the first zero plus a highly…