Related papers: A q-product tutorial for a q-series MAPLE package
A suitable piece of software is presented to connect Abaqus, a sophisticated finite element package, with Matlab, the most comprehensive program for mathematical analysis. This interface between these well-known codes not only benefits from…
As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial…
Some q-analogues of classical integral transforms have recently been investigated by many authors in diverse citations. The q-analogues of the Natural transform are not known nor used. In the present paper, we are concerned with definitions…
An extensive table of pairs of functions linked by the Legendre transformation is presented. Many special functions and formulas that are used in the sciences are included in the pairs. Formulations are provided for finding the Legendre…
We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…
The paper is devoted to an approach to solving a problem of the efficiency of parallel computing. The theoretical basis of this approach is the concept of a $Q$-determinant. Any numerical algorithm has a $Q$-determinant. The $Q$-determinant…
While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
We introduce QCLAB, an object-oriented MATLAB toolbox for constructing, representing, and simulating quantum circuits. Designed with an emphasis on numerical stability, efficiency, and performance, QCLAB provides a reliable platform for…
The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…
Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P…
QR factorisation plays an important role in matrix computations. Within the context of optimisation and of automatic differentiation of such computations, we need to compute the derivative of this factorisation. For tall matrices, however,…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
Recent surge of interests in cognitive assessment has led to the developments of novel statistical models for diagnostic classification. Central to many such models is the well-known Q-matrix, which specifies the item-attribute…
We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…
We consider a wide range of matrix models and study them using the Monte Carlo technique in the large $N$ limit. The results we obtain agree with exact analytic expressions and recent numerical bootstrap methods for models with one and two…
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
This paper is about a method for solving infinite series in closed form by using inverse and forward Laplace transforms. The resulting integral is to be solved instead. The method is extended by parametrizing the series. A further Laplace…
We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either…
This tutorial introduces (and provides, via the document source) the Quantikz LaTeX package for typesetting quantum circuit diagrams. This takes advantage of tikz to give greater control over the circuit options. Those familiar with the…