Related papers: Accurate Computations of Euler Products over Prime…
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
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…
In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…
The Euler-Maclaurin summation formula is generalized to a modified form by expanding the periodic Bernoulli polynomials as its Fourier series and taking cuts, which includes both the Euler-Maclaurin summation formula and the Poission…
In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…
We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.
We classify singularities of Dirichlet series having Euler products which are rational functions for p and p^{-s} for p a prime number and give examples of natural boundaries from zeta functions of groups and height zeta functions.
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
Given the Fourier-Legendre expansions of $f$ and $g$, and mild conditions on $f$ and $g$, we derive the Fourier-Legendre expansion of their product in terms of their corresponding Fourier-Legendre coefficients. In this way, expansions of…
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.…
This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
In this paper, applying the Fa\`a di Bruno formula and some properties of Bell polynomials, several closed formulas and determinantal expressions involving Stirling numbers of the second kind for higher-order Bernoulli and Euler polynomials…
This is my talk on the Bourbaki seminar, November 1996. It contains an elementary introduction to Borcherds' product formulas.
The unified product was defined in \cite{am3} related to the restricted extending structure problem for Hopf algebras: a Hopf algebra $E$ factorizes through a Hopf subalgebra $A$ and a subcoalgebra $H$ such that $1\in H$ if and only if $E$…
A method, recently advanced as the conformable Euler method, a general method for the finite difference discretization of fractional initial value problems for fractions in (0, 1], is shown to be valid only for the integer derivative. The…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}^{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}^{(p-1)/2}k\binom ak\binom{-1-a}k…
In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…