Related papers: An asymptotic Formula for the iterated exponential…
Recently, several authors have studied the degenerate Bernoulli and Euler polynomials and given some intersting identities of those polynomials. In this paper, we consider the degenerate Bell numbers and polynomials and derive some new…
This paper derives a way to express differentiable complex-valued functions as the sum of powers of $(1-e^{\lambda x})$, where $\lambda\in\mathbb{R}$, with an explicit formula for the remainder. This formulation is then used to associate an…
We recast Byerly's formula for integrals of products of Legendre polynomials. Then we adopt the idea to the case of Jacobi polynomials. After that, we use the formula to derive an asymptotic formula for integrals of products of Jacobi…
We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…
We study the asymptotic behavior of Multiple Meixner polynomials of first and second kind, respectively (see J. Arves\'u et al. J. Comput. Appl. Math., 153, (2003)). We use an algebraic function formulation for the solution of the…
We develop a method for computing all the {\it generalized asymptotes} of a real plane algebraic curve $\cal C$ over $\Bbb C$ implicitly defined by an irreducible polynomial $f(x,y)\in {\Bbb R}[x,y]$. The approach is based on the notion of…
We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the…
We completely solve the problem of enumerating combinatorially inequivalent $d$-dimensional polytopes with $d+3$ vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct,…
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…
In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…
We study exponential sums of the form $\sum_{n=1}^N e^{2\pi i a b^n/m}$ for non-zero integers $a,b,m$. Classically, non-trivial bounds were known for $N\ge \sqrt{m}$ by Korobov, and this range has been extended significantly by Bourgain as…
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…
We develop a class of integrals on a manifold M called exponential iterated integrals, an extension of K. T. Chen's iterated integrals. It is shown that the matrix entries of any upper triangular representation of the fundamental group of M…
We introduce a set of special functions called multiple polyexponential integrals, defined as iterated integrals of the exponential integral $\text{Ei}(z)$. These functions arise in certain perturbative expansions of the local solutions of…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…
We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for…
The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…