Related papers: Linear quantum addition rules
For every positive integer $n$, the quantum integer $[n]_q$ is the polynomial $[n]_q = 1 + q + q^2 + ... + q^{n-1}.$ A quadratic addition rule for quantum integers consists of sequences of polynomials $\mathcal{R}' =…
The $q$-integer is the polynomial $[n]_q = 1 + q + q^2 + \dots + q^{n-1}$. For every sequences of polynomials $\mathcal S = \{s_m(q)\}_{m=1}^\infty$, $\mathcal T = \{t_m(q)\}_{m=1}^\infty$, $\mathcal U = \{u_m(q)\}_{m=1}^\infty$ and…
Let $m$ and $n$ be positive integers. For the quantum integer $[n]_q = 1 + q + ... + q^{n-1}$ there is a natural polynomial addition such that $[m]_q \oplus_q [n]_q = [m+n]_q$ and a natural polynomial multiplication such that $[m]_q…
For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…
The quantum integer [n]_q is the polynomial 1 + q + q^2 + ... + q^{n-1}, and the sequence of polynomials { [n]_q }_{n=1}^{\infty} is a solution of the functional equation f_{mn}(q) = f_m(q)f_n(q^m). In this paper, semidirect products of…
For the quantum integer [n]_q = 1+q+q^2+... + q^{n-1} there is a natural polynomial multiplication such that [mn]_q = [m]_q \otimes_q [n]_q. This multiplication is given by the functional equation f_{mn}(q) = f_m(q) f_n(q^m), defined on a…
A sequence of functions {f_n(q)}_{n=1}^{\infty} satisfies the functional equation for multiplication of quantum integers if f_{mn}(q) = f_m(q)f_n(q^m) for all positive integers m and n. This paper describes the structure of all sequences of…
We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…
We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack…
The $q$-binomial coefficients $\qbinom{n}{m}=\prod_{i=1}^m(1-q^{n-m+i})/(1-q^i)$, for integers $0\le m\le n$, are known to be polynomials with non-negative integer coefficients. This readily follows from the $q$-binomial theorem, or the…
From Koornwinder's interpretation of big $q$-Legendre polynomials as spherical elements on the quantum $SU(2)$ group an addition formula is derived for the big $q$-Legendre polynomial. The formula involves Al-Salam--Carlitz polynomials,…
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element in…
The aim of this sequence of work is to investigate polynomial equations satisfied by additive functions. As a result of this, new characterization theorems for homomorphisms and derivations can be given. More exactly, in this paper the…
We derive explicit expressions for the generating series of the fundamental solutions of the $A_r$ quantum $Q$-system of Ref. [P. Di Francesco and R. Kedem, arXiv:1006.4774 [math-ph]], expressed in terms of any admissible initial data.…
Considering a quench process in which an electric field pulse is applied to the system, "$f$-sum rule" for the conductivity for general quantum many-particle systems is derived. It is furthermore extended to an infinite series of sum rules,…
Let $\mathbb{F}_q$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \geq 2$ be an integer. In this paper, we enumerate all the complementary-dual cyclic $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes of…
A general addition formula for a two-parameter family of Askey-Wilson polynomials is derived from the quantum $SU(2)$ group theoretic interpretation. This formula contains most of the previously known addition formulas for $q$-Legendre…
We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…
The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities:…
In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…