Related papers: Streamlined WZ method proofs of Van Hamme supercon…
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…
Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Symbolic methods such as the Wilf-Zeilberger (WZ) method can…
Let $p>3$ be a prime, and let $a$ be a rational $p$-adic integer, using WZ method we establish the congruences modulo $p^3$ for $$\sum_{k=0}^{p-1} \binom ak\binom{-1-a}k\binom{2k}k\frac {w(k)}{4^k},$$ where $$w(k)=1,\frac 1{k+1},\frac…
We establish a parametric supercongruence related to Whipple's ${}_5F_4$ formula and Dwork's dash operation. As a typical consequence, we obtain the following result: for any prime $p\equiv3\pmod4$ and odd integer $r\geq1$, $$…
In 1997, van Hamme developed $p-$adic analogs, for primes $p$, of several series which relate hypergeometric series to values of the gamma function, originally studied by Ramanujan. These analogs relate truncated sums of hypergeometric…
Let $N(\Gamma,G)$ be the number of homomorphisms from $\Gamma$ to $G$ up to conjugation by $G$. Physics of four-dimensional $\mathcal{N}=4$ supersymmetric gauge theories predicts that $N(\Gamma,G)=N(\Gamma , \tilde G)$ when $\Gamma$ is a…
In this paper, we prove two supercongruences by the Wilf-Zeilberger method. One of them is, for any prime $p>3$, \begin{align*} \sum_{n=0}^{(p-1)/2}\frac{3n+1}{(-8)^n}\binom{2n}n^3\equiv…
Guo and Zudilin [Adv. Math. 346 (2019), 329--358] introduced a new method called `creative microscoping', to prove many $q$-supercongruences in a unified way. In this paper, we apply this method and Watson's ${}_8\phi_7$ transformation…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…
For an odd prime $p$, we realize the trivial representation of $\mathrm{GL}_2(\mathbb{Z}/p^n\mathbb{Z})$ on the free $\mathbb{Z}/p^n \mathbb{Z}$-module of rank one as a subquotient of a direct sum of symmetric power representations (twisted…
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…
A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
In 2017, He [Proc. Amer. Math. Soc. 145 (2017), 501--508] established two spuercongruences on truncated hypergeometric series and further proposed two related conjectures. Subsequently, Liu [Results Math. 72 (2017), 2057--2066] extended…
We consider a natural generalization of the classical pattern matching problem: given compressed representations of a pattern p[1..M] and a text t[1..N] of sizes m and n, respectively, does p occur in t? We develop an optimal linear time…
A review of the coupled cluster method (CCM) applied to lattice quantum spin systems is presented here. The CCM formalism is explained and an application to the spin-half {\it XXZ} model on the square lattice is presented. Low orders of…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
George Andrews's recent challenge to automated identity-proving and the WZ method is dealt with. It is argued that the rivalry between the classical and automated approaches to hypergeometric sums is beneficial to both.
Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for polytime reasoning. The first algorithm is for testing…