Related papers: Some mixed character sum identities of Katz II
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…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at…
Recently, Pankaj Jyoti Mahanta and Manjil P. Saikika proved some identities relating certain restricted partitions into distinct odd parts with the partition whose odd parts are distinct combinatorially. They asked for the q-series proofs.…
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…
In this paper, we derive eight basic identities of symmetry in three variables related to $q$-Bernoulli polynomials and the $q$-analogue of power sums. These and most of their corollaries are new, since there have been results only about…
In this paper, we derive eight basic identities of symmetry in three variables related to $q$-Euler polynomials and the $q$-analogue of alternating power sums. These and most of their corollaries are new, since there have been results only…
Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…
In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…
Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…
Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…
In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…
We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
The solvability of the cubic congruence $x^{3}\equiv 2\pmod{p}$ is referred to as the $\textit{cubic character of 2}$. In evaluating the cubic character of 2, we introduce the Eisenstein integers, Gauss and Jacobi sums, and the law of cubic…
In this paper, we explore identities that allow for representation of positive integers raised to positive integral powers as sums of nested sums of smaller positive integral powers. We begin by establishing the base identity involving…
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
We prove that if $q$ is a power of a prime $p$ and $p^k$ divides $a$, with $k\ge 0$, then \[ 1+(q-1)\sum_{0\le b(q-1)<a} \binom{a}{b(q-1)}\equiv 0\pmod{p^{k+1}}. \] The special case of this congruence where $q=p$ was proved by Carlitz in…
We consider the inverse problem for the polynomial map which sends an $m$-tuple of quadratic forms in $n$ variables to the sum of their $d$-th powers. This map captures the moment problem for mixtures of $m$ centered $n$-variate Gaussians.…
In this paper, by constructing some identities, we prove some $q$-analogues of some congruences. For example, for any odd integer $n>1$, we show that \begin{gather*} \sum_{k=0}^{n-1} \frac{(q^{-1};q^2)_k}{(q;q)_k} q^k \equiv (-1)^{(n+1)/2}…