English
Related papers

Related papers: An asymptotic Formula for the iterated exponential…

200 papers

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

Number Theory · Mathematics 2007-05-23 Charles W. Neville

An asymptotic expansion for inverse moments of positive binomial and Poisson distributions is derived. The expansion coefficients of the asymptotic series are given by the positive central moments of the distribution. Compared to previous…

Statistics Theory · Mathematics 2009-01-16 Marko Znidaric

We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The…

Computational Complexity · Computer Science 2013-12-11 Cristopher Moore , Leonard J. Schulman

Asymptotic expansions are given for large values of $n$ of the generalized Bernoulli polynomials $B_n^\mu(z)$ and Euler polynomials $E_n^\mu(z)$. In a previous paper L\'opez and Temme (1999) these polynomials have been considered for large…

Classical Analysis and ODEs · Mathematics 2009-09-18 Jose Luis Lopez , Nico M. Temme

We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…

Combinatorics · Mathematics 2025-06-02 Michael Borinsky , Chiara Meroni , Maximilian Wiesmann

I present an asymptotic formula for the Takeuchi numbers $T_n$. In particular, I give compelling numerical evidence and present a heuristic argument showing that $$T_n\sim C_T B_n\exp{1\over2}{W(n)}^2$$as $n$ tends to infinity, where $B_n$…

Combinatorics · Mathematics 2007-05-23 Thomas Prellberg

Applying a theorem of Howard for a formula recently proved by Brassesco and M\'endez, we derive new simple explicit formulas for the coefficients of the asymptotic expansion to the sequence of factorials. To our knowledge no explicit…

Classical Analysis and ODEs · Mathematics 2010-06-23 Gergő Nemes

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Number Theory · Mathematics 2021-06-04 Alessandro Languasco , Alessandro Zaccagnini

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

Combinatorics · Mathematics 2014-01-28 Mark Shattuck

In the present article, we study Bell based Euler polynomial of order {\alpha} and investigate some useful correlation formula, summation formula and derivative formula. Also, we introduce some relation of string number of the second kind.…

Number Theory · Mathematics 2021-04-20 Nabiullah Khan , Saddam Husain

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

The Asymptotic Iteration Method (AIM) is a technique for solving analytically and approximately the linear second-order differential equation, especially the eigenvalue problems that frequently appear in theoretical and mathematical…

Mathematical Physics · Physics 2020-03-17 Mourad E. H. Ismail , Nasser Saad

We show that any language in nondeterministic time $\exp(\exp(\cdots \exp(n)))$, where the number of iterated exponentials is an arbitrary function $R(n)$, can be decided by a multiprover interactive proof system with a classical…

Quantum Physics · Physics 2018-06-01 Joseph Fitzsimons , Zhengfeng Ji , Thomas Vidick , Henry Yuen

The solutions of the perturbed first Painlev\'e equation $y"=6y^2-x^\mu$, $\mu>-4$, are uniquely determined by the free constant $C$ multiplying the exponentially small terms in the complete large $x$ asymptotic expansions. Full details are…

Classical Analysis and ODEs · Mathematics 2022-07-13 Adri B. Olde Daalhuis

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

Let E be an elliptic curve over the number field Q. In 1988, Koblitz conjectured an asymptotic for the number of primes p for which the cardinality of the group of F_p-points of E is prime. However, the constant occurring in his asymptotic…

Number Theory · Mathematics 2009-09-30 David Zywina

An expression for the coefficients of a linear iterative equation in terms of the parameters of the source equation is given both for equations in standard form and for equations in reduced normal form. The operator generating an iterative…

Classical Analysis and ODEs · Mathematics 2012-07-31 J. C. Ndogmo , F. M. Mahomed

Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…

Numerical Analysis · Mathematics 2009-01-08 O. Kounchev , H. Render

We find an enumeration formula for a $(t,q)$-Euler number which is a generalization of the $q$-Euler number introduced by Han, Randrianarivony, and Zeng. We also give a combinatorial expression for the $(t,q)$-Euler number and find another…

Combinatorics · Mathematics 2012-10-22 Jang Soo Kim

Let f be a sum of exponentials of the form exp(2 pi i N x), where the N are distinct integers. We call f an idempotent trigonometric polynomial (because the convolution of f with itself is f) or, simply, an idempotent. We show that for…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruce Anderson , J. Marshall Ash , Roger Jones , Daniel G. Rider , Bahman Saffari
‹ Prev 1 4 5 6 7 8 10 Next ›