Related papers: $\pi$-formulas and Gray code
We introduce the generic Lah polynomials $L_{n,k}(\phi)$, which enumerate unordered forests of increasing ordered trees with a weight $\phi_i$ for each vertex with $i$ children. We show that, if the weight sequence $\phi$ is…
In this note we initiate the probabilistic study of the critical points of polynomials of large degree with a given distribution of roots. Namely, let f be a polynomial of degree n whose zeros are chosen IID from a probability measure mu on…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
Generalized Goppa codes are defined by a code locator set $\mathcal{L}$ of polynomials and a Goppa polynomial $G(x)$. When the degree of all code locator polynomials in $\mathcal{L}$ is one, generalized Goppa codes are classical Goppa…
In the past few years, a successful line of research has lead to lower bounds for several fundamental local graph problems in the distributed setting. These results were obtained via a technique called round elimination. On a high level,…
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
In this article, we present four issues and provide a creative and concise proof for each of them. The four issues are: 1- Inequality $\frac{1}{\sqrt{n\pi+\frac{\pi}{2}}}<\frac{\binom{2n}{n}}{2^{2n}}<\frac{1}{\sqrt{n\pi}}$ 2- A special case…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
In this didactic note, we describe a procedure to derive successive approximations of $\pi$ using Euler Beta functions. It is an interesting exercise for undergraduate students, since it involves polynomial roots, integral calculations,…
The Lee-Yang circle theorem describes complex polynomials of degree $n$ in $z$ with all their zeros on the unit circle $|z|=1$. These polynomials are obtained by taking $z_1=...=z_n=z$ in certain multiaffine polynomials $\Psi(z_1,...,z_n)$…
We derive new matrix representation for higher-order changhee numbers and polynomials. This helps us to obtain simple and short proofs of many previous results on higher-order changhee numbers and polynomials. Moreover, we obtain recurrence…
An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…
The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…
In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The low-energy $\pi\pi$ amplitude is computed explicitly to two-loop accuracy in the chiral expansion. It depends only on six independent (combinations of) low-energy constants which are not fixed by chiral symmetry. Four of these constants…
We investigate multiple Charlier polynomials and in particular we will use the (nearest neighbor) recurrence relation to find the asymptotic behavior of the ratio of two multiple Charlier polynomials. This result is then used to obtain the…
Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…
We show that there is a sequence of zeros of $\mathop{\mathcal R}(s)$ in the fourth quadrant. We show that the $n$-th zero $\rho_{-n}=\beta_{-n}+i\gamma_{-n}$, with $\beta_{-n}\sim 4\pi^2 n/\log^2n$ and $\gamma_{-n}\sim-4\pi n/\log n$. We…
The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to the many well-known numbers, which are the Bernoulli numbers, the Fibonacci numbers, the Lucas…