相关论文: Boson Normal Ordering via Substitutions and Sheffe…
The normal ordering coefficients of strings consisting of $V,U$ which satisfy $UV=qVU+hV^s$ ($s\in\mathbb N$) are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…
Spivey found a recurrence relation for the Bell numbers by using combinatorial method. The aim of this paper is to derive Spivey's type recurrence relations for the degenerate Bell polynomials and the degenerate Dowling polynomials by using…
We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…
The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra $B$) is also known in more general form in terms of expansion in a set $\Phi$ of orthonormal functions. However,…
Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…
We implement the normal ordering technique to study the quantum dissipation of a single mode harmonic oscillator system. The dynamic evolution of the system is investigated for a reasonable initial state by solving the Schr\"{o}dinger…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
We introduce the notion of "generalized bosons" whose exchange statistics resemble those of bosons, but the local bosonic commutator $[a_i,a_i^\dagger]=1$ is replaced by an arbitrary single-mode operator that is diagonal in the generalized…
A classical result due to Bochner characterizes the classical orthogonal polynomial systems as solutions of a second-order eigenvalue equation. We extend Bochner's result by dropping the assumption that the first element of the orthogonal…
The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…
We propose a new generalization of the standard (anti-)commutation relations for creation and annihilation operators of bosons and fermions. These relations preserve the usual symmetry properties of bosons and fermions. Only the standard…
In this paper we develop the generalised Schur theory offered in the recent paper by the second author in dimension one case, and apply it to obtain a new explicit parametrisation of torsion free rank one sheaves on projective irreducible…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
The generalized massive Thirring model (GMT) with $N_{f}(=$number of positive roots of $su(n)$) fermion species is bosonized in the context of the functional integral and operator formulations and shown to be equivalent to a generalized…
We propose an approach for decomposing Boolean satisfiability problems while extending recent results of \cite{sul2} on solving Boolean systems of equations. Developments in \cite{sul2} were aimed at the expansion of functions $f$ in…
Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, often using more memory than is feasible; while CNFs are solved…
A Gelfan'd--Dyson mapping is used to generate a one-boson realization for the non-standard quantum deformation of $sl(2,\R)$ which directly provides its infinite and finite dimensional irreducible representations. Tensor product…