Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new user$q$-Supercongruences from the $q$-Saalsch{u}tz identity
69
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In terms of the $q$-Saalsch{u}tz identity and the Chinese remainder theorem for coprime polynomials, we establish some $q$-supercongruences modulo the third power of a cyclotomic polynomial. In particular, we give a $q$-analogue of a formula due to Long and Ramakrishna [Adv. Math. 290 (2016), 773--808].
rate research
Read More
Inspired by the recent work on $q$-congruences and the quadratic summation formula of Rahman, we provide some new $q$-supercongruences. By taking $qto 1$ in one of our results, we obtain a new Ramanujan-type supercongruence, which has the same right-hand side as Van Hammes (G.2) supercongruence for $pequiv 1 pmod 4$. We also formulate some related challenging conjectures on supercongruences and $q$-supercongruences.
Let $E_n$ be the $n$-th Euler number and $(a)_n=a(a+1)cdots (a+n-1)$ the rising factorial. Let $p>3$ be a prime. In 2012, Sun proved the that $$ sum^{(p-1)/2}_{k=0}(-1)^k(4k+1)frac{(frac{1}{2})_k^3}{k!^3} equiv p(-1)^{(p-1)/2}+p^3E_{p-3} pmod{p^4}, $$ which is a refinement of a famous supercongruence of Van Hamme. In 2016, Chen, Xie, and He established the following result: $$ sum_{k=0}^{p-1}(-1)^k (3k+1)frac{(frac{1}{2})_k^3}{k!^3} 2^{3k} equiv p(-1)^{(p-1)/2}+p^3E_{p-3} pmod{p^4}, $$ which was originally conjectured by Sun. In this paper we give $q$-analogues of the above two supercongruences by employing the $q$-WZ method. As a conclusion, we provide a $q$-analogue of the following supercongruence of Sun: $$ sum_{k=0}^{(p-1)/2}frac{(frac{1}{2})_k^2}{k!^2} equiv (-1)^{(p-1)/2}+p^2 E_{p-3} pmod{p^3}. $$
We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the $q$-deformed Pascal identitiy for the Gaussian binomial coefficients, but the Pascal triangle is replaced by the Farey graph. The coefficients of the polynomials defining the $q$-rational count quiver subrepresentations of the maximal indecomposable representation of the graph dual to the triangulation. Several other properties, such as total positivity properties, $q$-deformation of the Farey graph, matrix presentations and $q$-continuants are given, as well as a relation to the Jones polynomial of rational knots.
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids and also from sets to vector spaces. To achieve this, we introduce the characteristic polynomial of a $q$-polymatroid and outline several of its properties.
Two $q$-supercongruences of truncated basic hypergeometric series containing two free parameters are established by employing specific identities for basic hypergeometric series. The results partly extend two $q$-supercongruences that were earlier conjectured by the same authors and involve $q$-supercongruences modulo the square and the cube of a cyclotomic polynomial. One of the newly proved $q$-supercongruences is even conjectured to hold modulo the fourth power of a cyclotomic polynomial.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
