Related papers: A Grammatical Calculus for the Ramanujan Polynomia…
In mathematical phylogenetics, the time-consistent galled trees provide a simple class of rooted binary network structures that can be used to represent a variety of different biological phenomena. We study the enumerative combinatorics of…
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…
In the present work, we extend current research in a nearly-forgotten but newly revived topic, initiated by P. A. MacMahon, on a generalized notion which relates the divisor sums to the theory of integer partitions and two infinite families…
Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…
We formulate and prove the analogue of the Ramanujan Conjectures for modular forms of half-integral weight subject to some ramification restriction in the setting of a polynomial ring over a finite field. This is applied to give an…
We study Ramanujan-Fourier series of certain arithmetic functions of two variables. We generalize Delange's theorem to the case of arithmetic functions of two variables and give sufficient conditions for pointwise convergence of…
Ramanujan's Master theorem states that, under suitable conditions, the Mellin transform of an alternating power series provides an interpolation formula for the coefficients of this series. Ramanujan applied this theorem to compute several…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
The question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion…
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
We settle a conjecture proposed by B. Maji and T. Sarkar regarding the location of zeros of a two-parameter family of reciprocal polynomials, $R_{k,\ell}(z)$ for positive integers $k$ and $\ell$. These polynomials are generalizations of…
Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's "Lost" Notebook, there are several formulas involving this function, but they are not as simple as the identities with other similar shape of functions.…
We present the first representation of the general term of the Rayleigh-Schr\"odinger series for quasidegenerate systems. Each term of the series is represented by a tree and there is a straightforward relation between the tree and the…
We generalize Ramanujan method of approximating the smallest root of an equation which is found in Ramanujan Note books, Part-I. We provide simple analytical proof to study convergence of this method. Moreover, we study iterative approach…
In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…
Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…
We conjecture polynomial identities which imply Rogers--Ramanujan type identities for branching functions associated with the cosets $({\cal G}^{(1)})_{\ell-1}\otimes ({\cal G}^{(1)})_{1} / ({\cal G}^{(1)})_{\ell}$, with ${\cal…