Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFinding Modular Functions for Ramanujan-Type Identities
74
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radus algorithms, we present an algorithm to find Ramanujan-type identities for $a(mn+t)$. While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for $p(11n+6)$ with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions $overline{p}(5n+2)$ and $overline{p}(5n+3)$ and Andrews--Paules broken $2$-diamond partition functions $triangle_{2}(25n+14)$ and $triangle_{2}(25n+24)$. It can also be extended to derive Ramanujan-type identities on a more general class of partition functions. For example, it yields the Ramanujan-type identities on Andrews singular overpartition functions $overline{Q}_{3,1}(9n+3)$ and $ overline{Q}_{3,1}(9n+6)$ due to Shen, the $2$-dissection formulas of Ramanujan and the $8$-dissection formulas due to Hirschhorn.
rate research
Read More
Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a divergent Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a supercongruence recently proved by Wang: for any prime $p>3$, $$ sum_{k=0}^{p-1} (3k-1)frac{(frac{1}{2})_k (-frac{1}{2})_k^2 }{k!^3}4^kequiv p-2p^3 pmod{p^4}, $$ where $(a)_k=a(a+1)cdots (a+k-1)$ is the Pochhammer symbol.
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 are surveyed. After explaining their connection to the Ramanujan conjecture we will present some old and new results with an emphasis on random walks on these discrete objects and on the Euclidean spheres. The latter lead to golden gates which are of importance in quantum computation.
We prove that amongst all real quadratic fields and all spaces of Hilbert modular forms of full level and of weight $2$ or greater, the product of two Hecke eigenforms is not a Hecke eigenform except for finitely many real quadratic fields and finitely many weights. We show that for $mathbb Q(sqrt 5)$ there are exactly two such identities.
We give unified modular proofs to all of Gospers identities on the $q$-constant $Pi_q$. We also confirm Gospers observation that for any distinct positive integers $n_1,cdots,n_m$ with $mgeq 3$, $Pi_{q^{n_1}}$, $cdots$, $Pi_{q^{n_m}}$ satisfy a nonzero homogeneous polynomial. Our proofs provide a method to rediscover Gospers identities. Meanwhile, several results on $Pi_q$ found by El Bachraoui have been corrected. Furthermore, we illustrate a strategy to construct some of Gospers identities using hauptmoduls for genus zero congruence subgroups.
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of Euclidean lattices. Namely, we use the finite-dimensional representation theory of sl_2 to derive a decomposition theorem for the spaces of discrete homogeneous polynomials in terms of the spaces of discrete harmonic polynomials, and prove a generalized MacWilliams identity for harmonic weight enumerators. We then present several applications of harmonic weight enumerators, corresponding to some uses of weighted theta functions: an equivalent characterization of t-designs, the Assmus-Mattson Theorem in the case of extremal Type II codes, and configuration results for extremal Type II codes of lengths 8, 24, 32, 48, 56, 72, and 96.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
