Related papers: Using the "Freshman's Dream" to Prove Combinatoria…
By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued…
This article, based on joint work with Gabriel Carroll, Andy Itsara, Ian Le, Gregg Musiker, Gregory Price, Dylan Thurston, and Rui Viana, presents a combinatorial model based on perfect matchings that explains the symmetries of the…
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…
During the study of dual sequences, Sun introduced the polynomials \[ D_n(x,y)=\sum_{k=0}^{n}{n\choose k}{x\choose k}y^k\text{ and } S_n(x,y)=\sum_{k=0}^{n}\binom{n}{k}\binom{x}{k}\binom{-1-x}{k} y^k. \] Many related congruences have been…
We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…
In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…
We present two proofs each, all shorter than the original proofs, of two elegant combinatorial identities that came up in the beautiful article arXiv:2010.00077 .
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
In this paper, we prove two recently conjectured supercongruences (modulo $p^3$, where $p$ is any prime greater than $3$) of Zhi-Hong Sun on truncated sums involving the Domb numbers. Our proofs involve a number of ingredients such as…
With the help of a summation of basic hypergeometric series, the creative microscoping method recently introduced by Guo and Zudilin, and the Chinese remainder theorem for coprime polynomials, we find some new $q$-supercongruences.…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
We observe that a sequence satisfies Lucas congruences modulo $p$ if and only if its values modulo $p$ can be described by a linear $p$-scheme, as introduced by Rowland and Zeilberger, with a single state. This simple observation suggests…
Many famous integer sequences including the Catalan numbers and the Motzkin numbers can be expressed in the form $ConstantTermOf\left[P(x)^nQ(x)\right]$ for Laurent polynomials $Q$, and symmetric Laurent trinomials $P$. In this paper we…
Recently, a beautiful paper of Andrews and Sellers has established linear congruences for the Fishburn numbers modulo an infinite set of primes. Since then, a number of authors have proven refined results, for example, extending all of…
In [16], we obtained some congruences for Lucas quotients of two infinite families of Lucas sequences by studying the combinatorial sum $$\sum_{k\equiv r(\mbox{mod}m)}{n\choose k}a^k.$$ In this paper, we show that the sum can be expressed…
In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding the determinant of sum of matrices. Also we find a new…
We give a combinatorial extension of the classical inequalities of Maclaurin about symmetric functions of several variables. We discuss two problems - one analytical and another combinatorial - and show that they are in some sense…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
Let $p$ be a prime. In this short note we study some families of super congruences involving the following alternating sums \begin{equation*} \sum_{\substack{j_1+j_2+\cdots+j_n=2 p^r p\nmid j_1 j_2 \cdots j_n}}…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…