Related papers: $q$-Binomial Identities Finder
A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of $q$ elements, where $q$ is a power of a prime $p>3$. His proof required deep algebro-geometric techniques, and…
A $P_q(t,k,n)$ $q$-packing design is a selection of $k$-subspaces of $\F_q^n$ such that each $t$-subspace is contained in at most one element of the collection. A successful approach adopted from the Kramer-Mesner-method of prescribing a…
Several new $q$-supercongruences are obtained using transformation formulas for basic hypergeometric series, together with various techniques such as suitably combining terms, and creative microscoping, a method recently developed by the…
We define the $(q,\bar{\boldsymbol{\alpha}})$-Whitney numbers which are reduced to the $\bar{\boldsymbol{\alpha}}$-Whitney numbers when $q\rightarrow1$. Moreover, we obtain several properties of these numbers such as explicit formulas,…
By applying the derivative operator to the corresponding hypergeometric form of a $q$-series transformation due to Andrews [1,Theorem 4], we establish a general harmonic number identity. As the special cases of it, several interesting…
As the $q$-analog of Chebyshev polynomials, $q$-Hermite polynomials form a cornerstone in the family of $q$-orthogonal polynomials, which play a fundamental role in quantum algebra and mathematical physics. Recently, Andrews obtained a…
We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…
We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…
A Fourier transform technique is introduced for counting the number of solutions of holomorphic moment map equations over a finite field. This in turn gives information on Betti numbers of holomorphic symplectic quotients. As a consequence…
Classical binomial identities are established by giving probabilistic interpretations to the summands. The examples include Vandermonde identity and some generalizations.
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and thus containing the minimum number of…
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…
In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…