Related papers: A Grammatical Calculus for the Ramanujan Polynomia…

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

In this article we present evaluations of continued fractions studied by Ramanujan. More precisely we give the complete polynomial equations of Rogers-Ramanujan and other continued fractions, using tools from the elementary theory of the…

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…

One of the celebrated formulas of Ramanujan is about odd zeta values, which has been studied by many mathematicians over the years. A notable extension was given by Grosswald in 1972. Following Ramanujan's idea, we rediscovered a…

Ma-Ma-Yeh made a beautiful observation that a transformation of the grammar of Dumont instantly leads to the $\gamma$-positivity of the Eulerian polynomials. We notice that the transformed grammar bears a striking resemblance to the grammar…

Motivated by two identities published with Ramanujan's lost notebook and connected, respectively, with the Gauss circle problem and the Dirichlet divisor problem, in an earlier paper, three of the present authors derived representations for…

In this article we prove that for all primes $p\not=2,3$, the Ramanujan vector field has an invariant algebraic curve and then we give a moduli space interpretation of this curve in terms of Cartier operator acting on the de Rham cohomology…

In this paper, we consider a general form of the analogue of Ramanujan's sum in the ring of polynomials over a finite field. We first prove some multiplicative properties of such functions before considering their finite Fourier series and…

We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical…

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

Here we consider the $q$-series coming from the Hall-Littlewood polynomials, \begin{equation*} R_\nu(a,b;q)=\sum_{\substack{\lambda \\[1pt] \lambda_1\leq a}} q^{c|\lambda|} P_{2\lambda}\big(1,q,q^2,\dots;q^{2b+d}\big). \end{equation*} These…

Let $X$ be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If $G$ is a finite graph covered by $X$, it is said to be $X$-Ramanujan if its second-largest eigenvalue $\lambda_2(G)$ is at most…

We investigate the polynomials $\sum_{k=0}^{n-1} c_n(k)x^k$ and $\sum_{k=0}^{n-1} |c_n(k)| x^k$, where $c_n(k)$ denote the Ramanujan sums. We point out connections and analogies to the cyclotomic polynomials.

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

Multiple Hermite polynomials are an extension of the classical Hermite polynomials for which orthogonality conditions are imposed with respect to $r>1$ normal (Gaussian) weights $w_j(x)=e^{-x^2+c_jx}$ with different means $c_j/2$, $1 \leq j…

We present a generalization of the construction of graphs by Lubotzky, Phillips and Sarnak in their celebrated article "Ramanujan graphs". The new approach consists in using octonion algebras rather than quaternions. A key tool is the…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

In this paper, the authors present sharp approximations in terms of sine function and polynomials for the so-called Ramanujan constant (or the Ramanujan $R$-function) $R(a)$, by showing some monotonicity, concavity and convexity properties…

We study some sequences of polynomials that appear when we consider the successive derivatives of the tree function (or Lambert's W function). We show in particular that they are related with a generalization of Cayley trees, called Greg…

We discuss several topics related to polylogarithms with focus on dilogarithms. The topics are: a generating function with harmonic numbers coming from Ramanujan, extending the dilogarithm to complex numbers beyond the unit disk, and…