A Loopless Implementation of a Gray Code for Signed Permutations
The aim of the paper is to present some initial results about a possible generalization of moment sequences to a so-called q-calculus. A characterization of such a q-analogue in terms of appropriate positivity conditions is also investigated. Using the result due to Maserick and Szafraniec, we adapt a classical description of Hausdorff moment sequences in terms of positive definiteness and complete monotonicity to the q-situation. This makes a link between q-positive definiteness and q-complete...
We give a new and elementary proof of Jackson’s terminating -analogue of Dixon’s identity by using recurrences and induction.